Overload control for short message transfer in GPRS/UMTS networks

In the General Packet Radio Service (GPRS)/Universal Mobile Telecommunications System (UMTS) short message service (SMS) network, the serving GPRS support node (SGSN) stores the message in a queue until it is successfully transferred to the mobile device or its maximum waiting time expires. The queued message is forwarded to the new SGSN and is immediately removed from the waiting queue of the old SGSN, if the corresponding mobile device leaves the old SGSN area before the valid queueing time expires. Once the SGSN's buffer is full, all incoming messages must be discarded and retransmitted later. Under this situation, the messages, especially the forwarded messages, suffer from a longer delay before being successfully delivered. To prevent messages from being excessively delayed, this paper proposes an SGSN overload control scheme called the N-overload scheme. According to this scheme, a newly arriving message is discarded if the buffer is full upon its arrival. A forwarded message, however, is queued in an overload space of size N. Taking the forwarding and the expiration effects of queued messages into account, this paper also develops an analytical model to study the performance for the SGSN using the N-overload scheme. On the basis of the analysis, the optimal value of N is numerically determined so that the loss probability for the forwarded messages is minimized.     

基于M/M/1/K排队模型的低功耗无线通信网络TDMA协议延迟评估及仿真

基于M/M/1/K排队模型对低功耗无线通信网络中的TDMA协议延迟特性进行了评估,利用网络仿真软件QualNet在单跳簇状网络拓扑的条件下对不同接口的TDMA延迟特性进行了相应的仿真,并将仿真结果与评估值进行了对比。仿真表明,该评估方案具有较好的近似性,同时,硬件接口的选择对于减少TDMA延迟时间有着较大的影响。     

Analysis of finite-buffer discrete-time batch-service queue with batch-size-dependent service

Over the last two decades there has been considerable growth in digital communication systems which operate on a slotted system. In several applications, transmission of packets over the network takes place in batches of varying size, and transmission time depends upon the size of the batch. Performance modelling of these systems is usually done using discrete-time queues. In view of this, we consider a single-server queue with finite-buffer in a discrete-time domain where the packets are transmitted in batches (of varying size) according to minimum and maximum threshold limit, usually known as general batch service rule. The transmission time (in number of slots) of these batches depends on the number of packets within the batch under transmission, and is arbitrarily distributed. We obtain, in steady-state, distribution of the number of packets waiting in the queue and in service (those being transmitted in batches). In addition, we also obtain average number of packets waiting in queue, in the system, with the server, rejection probabilities, etc. Finally, computational experiences with a variety of numerical results have been discussed by introducing a cost model which gives optimum value of the lower threshold limit.     

改进的VANET分布式自适应时分多址分配机制

在车载自组织网（Vehicular Ad-hoc Network,VANET）环境下,针对多节点同时接入信道时的竞争冲突问题,将分布式时分多址（Time Division Multiple Access,TDMA）和空分多址（Space Division Multiple Access,SDMA）思想相结合,提出改进的分布式自适应时分多址分配机制（Modified Decentralized Adaptive TDMA Scheduling mechanism,MDATS）.MDATS协议的节点通过帧信息（Frame Information,FI）的交互,获取两跳范围内其他节点时隙使用情况,从而筛选出空闲时隙集.竞争区域将根据空闲时隙数在空间上均分成多个逻辑区段,节点则根据所处的逻辑区段与空闲时隙的对应关系确定竞争使用的时隙.该协议通过对空闲时隙在空间上的分散化,降低同时接入节点之间的竞争冲突.仿真结果表明,MDATS协议与其他类似MAC协议相比,能够达到更高的信道接入成功率、更低的接入时延性能以及更高的时隙利用率.     

Applications of machine learning approach on multi-queue message scheduling

Due to limited resource contentions and deadline constraints, messages on the controller area network (CAN) are competing for service from the common resources. This problem can be resolved by assigning priorities to different message classes to satisfy time-critical applications. Actually, because of the fluctuation of network traffic or an inefficient use of resources, these static or dynamic priority policies may not guarantee flexibility for different kinds of messages in real-time scheduling. Consequently, the message transmission which cannot comply with the timing requirements or deadlines may deteriorate system performance significantly. In this paper, we have proposed a controller-plant model, where the plant is analogous to a message queue pool (MQP) and the message scheduling controller (MSC) is responsible to dispatch resources for queued messages according to the feedback information from the MQP. The message scheduling controller, which is realized by the radial basis function (RBF) network, is designed with machine learning algorithm to compensate the variations in plant dynamics. The MSC with the novel hybrid learning schemes can ensure a low and stable message waiting time variance (or a uniform distribution of waiting time) and lower transmission failures. A significant emphasis of the MSC is the variable structure of the RBF model to accommodate to complex scheduling situations. Simulation experiments have shown that several variants of the MSC significantly improve overall system performance over the static scheduling strategies and the dynamic earliest-deadline first (EDF) algorithms under a wide range of workload characteristics and execution environments.     

A discrete-time queueing model with periodically scheduled arrival and departure slots

We consider a time-slotted queueing model where each time slot can either be an arrival slot, in which new packets arrive, or a departure slot, in which packets are transmitted and hence depart from the queue. The slot scheduling strategy we consider describes periodically, and for a fixed number of time slots, which slots are arrival and departure slots. We consider a static and a dynamic strategy. For both strategies, we obtain expressions for the probability generating function of the steady-state queue length and the packet delay. The model is motivated by cable-access networks, which are often regulated by a request–grant procedure in which actual data transmission is preceded by a reservation procedure. Time slots can then either be used for reservation or for data transmission.     

G/M/1 queue study of buffer behavior in the decoding system of computer communication

This paper deals with the buffer behavior at the decoding center of a computer communication system in which the messages are in the Huffman code of English text. It is assumed that the arrival of messages has an arbitrary distribution, with the message lengths having negative exponential distribution. The situation is well described by the G/M/1 model of queue theory. The waiting time model is simulated on the EC-1030 computer, assuming the HP2100A computer is the decoding machine. The simulation results are used for estimation of buffer size in a character-oriented system and block-oriented system for a very low overflow probability.     

基于排队论的数据链系统信息传输时间延迟分析

针对数据链系统信息传输时间延迟问题,分析了数据链系统中两点之间直接信息传输、通过中继站信息传输、跨数据链系统信息传输的一般过程;给出了利用排队论分析数据链系统信息传输时间延迟的一般流程;最后以美军JTIDS为例,分析了预警机在一定的时隙分配方案下的信息传输时间延迟.     

CSMA/CA在CSMA/TDMA混合网络中的性能分析

CSMA/CA机制与TDMA在同频段共存时会存在相互干扰,为评估混合网络中CSMA/CA的性能表现,将TDMA视为周期性的干扰提出改进的二维Markov分析模型,能够计算不同条件下的CSMA/CA饱和吞吐量,并通过仿真实验证明了模型的有效性。同时讨论了TDMA时隙分配方式对系统性能产生的影响,仿真结果表明时隙均匀分配方式能保证较低的时延和时延抖动,而连续分配方式能使CSMA/CA获得较高的吞吐量。提出将基于最低信道需求时间的阈值计算方法与吞吐量分析模型相结合,用于在不同应用场景下进行时隙分配方式的选择。     

基于反向平衡聚合树的无线传感器网络分布式TDMA调度算法*

讨论了已有的TDMA算法在端到端延时上的弊端,在优化时隙数的基础上引入链路的使用顺序与数据流向的相关性,提出了分布式TDMA调度算法,利用反向平衡聚合树的生成过程分配时隙,通过控制链路染色顺序分布式优化延时与避免冲突。仿真结果验证了算法在端到端延迟和通信开销上的性能提升。     

基于通用即插即用协议服务发现的随机服务系统模型

在智能家居网络设备自动发现过程中,网络设备端随机独立地选择延时发送服务响应消息,通常出现严重的消息拥塞现象。为解决智能家居网络中服务响应消息拥塞问题,以智能家居标准协议——通用即插即用(UPnP)进行自动发现设备为例,考虑不同应用场景中对服务发现过程的可靠性和实时性有不同要求,提出一种基于UPnP服务发现的随机服务系统模型。设计了集成系统响应指标和等待指标的通信损益函数,推导得到了最佳缓存队列长度与损益系数之间的关系。通过对比不同缓存队列长度中响应消息的到达时间、离开时间、等待时间和停留时间,验证了设计损益指标的必要性和随机服务系统模型的可行性。     

CAN控制系统的时延分析及混合算法

在车载控制器局域网络(CAN)总线的通信中,消息之间的碰撞及低优先级消息的等待时延过长严重影响了通信的稳定性和实时性。通过对CAN控制系统中的消息时延分析,确定排队等待时间是影响通信的关键因素,结合改进的共享时钟算法和动态ID序列算法,提出一种共享ID序列混合算法。将节点消息按ID序列发送,减少消息在同一时刻碰撞,消除消息的排队等待时延,从而提高网络的实时性和稳定性。仿真结果表明,该算法能够避免消息的碰撞,增强消息的确定性,有效改善网络性能。     

适用于飞行自组网的闲置时隙预约TDMA协议

在飞行自组网中,固定时隙分配时分多址接入（TDMA）协议存在闲置时隙无法成功使用的问题。通过对TDMA协议引入闲置时隙预约机制,提出一种支持业务优先级传输机制的闲置时隙预约TDMA协议。采用短帧长的方式满足协同与控制业务的低时延传输需求,并利用闲置时隙预约机制允许节点使用闲置时隙传输感知业务,从而满足感知业务的高吞吐量传输性能要求。仿真结果表明,与CF-MAC和CTMAC协议相比,该协议能够在降低传输时延的同时,有效提高信道利用率和网络吞吐量。     

短波地空网中一种动态TDMA协议设计与仿真*

针对传统TDMA网络节点间业务量不均匀时,会造成信道资源严重浪费的问题,设计了一种基于邻居时隙调动的短波地空网动态TDMA协议(TDMA protocol based on neighbour timeslot remove,NTR-TDMA),以可靠性较高的地面节点作为控制中心,实现时隙分配可控下的动态利用。提出了邻居时隙调动算法(neighbour timeslot remove algorithm,NTR-ALG),地面节点根据时隙估计过程后生成的节点时隙请求数,调动相邻业务时隙节点间的空闲时隙,重新划分节点业务时隙界限。利用OPNET平台进行性能仿真,并与HFTP协议和TDMA协议作了对比分析。仿真结果表明,NTR-TDMA相比HFTP协议和TDMA协议,在消息投递率、平均时延和吞吐量方面具有更优异的性能。     

一种机载网络动态TDMA协议设计

机载网络是一种节点快速移动、拓扑频繁变化的新型Ad Hoc网络。本文提出了一种机载网络动态TDMA的接入协议,能够同时支持单播和广播方式,并通过RTS/CTS控制报文解决隐藏终端问题。协议将每帧分为前面的控制时隙和后面的数据时隙两部分,每个节点通过微控制时隙来竞争对应的数据时隙进行发送。同时,还可申请使用先前的空闲时隙或竞争失败时隙,采用消除报文来解决网络中可能存在的死锁情况,从而实现带宽的有效利用。最后,使用Qual-Net软件进行了仿真,结果显示新协议具有较好的性能。     

A hybrid TDMA/Random-access scheme for multiple-access communication networks

A hybrid TDMA/Random-Access multiple-access (HTRAMA) scheme is introduced for providing an access-control coordination for a multi-access communication channel. Such a scheme is applicable to a large spectrum of computer communication network applications. Under this hybrid scheme, the system sources are divided into groups. Sources in different groups are allocated disjoint time slots for their transmissions. Sources within a group share their allocated time slots by transmitting according to a tree random-access policy. The number of groups (and their sizes) is dynamically adjusted to properly (and optimally) match the underlying channel traffic characteristics. In this fashion the hybrid scheme dynamically adapts to a random-access structure at lower traffic throughput levels and to a TDMA structure at higher throughput levels. We carry out detailed delay throughput analysis for these hybrid schemes under both limited and unlimited source buffer capacities. The hybrid scheme is demonstrated to yield very good delay-throughput performance curves under wide ranges of network traffic statistical fluctuations and spans.     

JTIDS信息传输时间延迟分析

针对JTIDS的信息传输时间延迟问题,分析JTIDS中两点之间的3种信息传输过程(直接信息传输、通过中继站信息传输、高优先级信息传输),将信息传输过程抽象为排队论模型,给出时间延迟的求解方法,分析预警机在一定的时隙分配方案下传输各类信息的传输时间延迟。分析结果表明,JTIDS系统能够依据传输信息的种类,较好地控制信息传输时间延迟,满足作战需求。     

Combining a maintenance center M/M/c/m queue into the economic production quantity model with stochastic machine breakdowns and repair

This article considers a production system in which “m” identical machines produce nonidentical products at production rates. Products made by each machine are on the other hand consumed at a specific demand rate. Machines may be affected by unwanted breakdowns. Machines break down according to a Poisson distribution with equal rates and the failed machines are sent to maintenance center for repair which is consisted of “c” servers or servicemen. However, Number of machines is greater than number of servicemen (m > c). Hence, if the number of failed machines is greater than that of servicemen, the machines have to be put in a queue. Machines are put in one queue with the order of queue being FCFS. The queue has a typical M/M/c/m system. If machines are broken down during production, shortage will occur. This problem has been considered to obtain a single production cycle for the machines and an optimum number of the servers such that costs are minimized. For this purpose, distribution of waiting time for machines in repair center is calculated and a cost function is formed. Steepest descent and direct search methods are applied in this work to obtain optimal production cycle and maintenance servers, respectively. The proposed methods are studied using a comprehensive example.     

Combining a maintenance center M/M/c/m queue into the economic production quantity model with stochastic machine breakdowns and repair

This article considers a production system in which “m” identical machines produce nonidentical products at production rates. Products made by each machine are on the other hand consumed at a specific demand rate. Machines may be affected by unwanted breakdowns. Machines break down according to a Poisson distribution with equal rates and the failed machines are sent to maintenance center for repair which is consisted of “c” servers or servicemen. However, Number of machines is greater than number of servicemen (m > c). Hence, if the number of failed machines is greater than that of servicemen, the machines have to be put in a queue. Machines are put in one queue with the order of queue being FCFS. The queue has a typical M/M/c/m system. If machines are broken down during production, shortage will occur. This problem has been considered to obtain a single production cycle for the machines and an optimum number of the servers such that costs are minimized. For this purpose, distribution of waiting time for machines in repair center is calculated and a cost function is formed. Steepest descent and direct search methods are applied in this work to obtain optimal production cycle and maintenance servers, respectively. The proposed methods are studied using a comprehensive example.     

Topology-transparent reservation time division multiple access in multihop ad hoc networks

In this paper, an optimal topology-transparent reservation time division multiple access (OTTR-TDMA) protocol is proposed for multihop ad hoc networks. Our MAC protocol is based on a slotted TDMA architecture in which every slot is divided into reservation phase and data transmission phase. Every node not only transmits data in its assigned slots that are computed by Chlamtac’s algorithm, but it also utilizes free slots among its non-assigned slots through reservation. Through theoretical analysis, we derive the proper parameter for the best performance. We compare our protocol with other TDMA protocols and find that it gives better performance. Simulation results show that they are consistent with our analytical results.