Routing strategies for maximizing throughput in LEO satellite networks

This paper develops routing and scheduling algorithms for packet transmission in a low Earth orbit satellite network with a limited number of transmitters and buffer space. We consider a packet switching satellite network, where time is slotted and the transmission time of each packet is fixed and equal to one time slot. Packets arrive at each satellite independently with a some probability during each time slot; their destination satellite is uniformly distributed. With a limited number of transmitters and buffer space on-board each satellite, contention for transmission inevitably occurs as multiple packets arrive at a satellite. First, we establish the stability region of the system in terms of the maximum admissible packet arrival rate that can possibly be supported. We then consider three transmission scheduling schemes for resolving these contentions: random packet win, where the winning packet is chosen at random; oldest packet win, where the packet that has traveled the longest distance wins the contention; and shortest hops win (SHW), where the packet closest to its destination wins the contention. We evaluate the performance of each of the schemes in terms of throughput. For a system without a buffer, the SHW scheme attains the highest throughput. However, when even limited buffer space is available, all three schemes achieve about the same throughput performance. Moreover, even with a buffer size of just a few packets the achieved throughput is close to that of the infinite buffer case.     

中继协作无线网络中不完美反馈下基于网络编码的重传方案

无线广播网络传输过程中,目的节点反馈信息丢失或部分丢失导致发送节点不能了解目的节点的真实接收状态.为提高不完美反馈下无线网络的重传效率,本文提出中继协作无线网络中不完美反馈下基于网络编码的重传方案.本方案基于部分可观察马尔科夫决策过程对不完美反馈下的重传过程进行建模.发送节点根据系统观测状态和最大置信度更新系统估计状态,根据数据包发送顺序,优先选择最早丢失且能够恢复最多丢包的编码包重传.目的节点缓存不可解编码包以提升编解码机会.重传过程中源节点关注目的节点请求包需求,相同情况优先选择传输可靠性较高的中继节点,以提升传输有效性.仿真结果表明,在不完美反馈下相对于传统方案,本方案可有效提高重传效率.     

机会网络中消息冗余度动态估计的缓存管理策略

机会网络以存储-携带-转发的方式实现节点间通信,高效的节点缓存管理策略能够充分利用有限的缓存空间。该文提出了一种基于消息冗余度动态估计的自适应缓存管理机制,利用消息携带节点的活跃程度和当前网络状态下消息副本数量,预测给定消息的投递状态,节点以消息冗余程度为参数确定消息的转发以及携带优先级。结果表明,所提出的节点活跃度和消息副本数的估计方法比较准确,同时所提出的缓存管理策略能有效提高消息成功投递率,降低网络平均时延和网络负载率。     

Packet scheduling algorithms and performance of a bufferedshufflenet with deflection routing

In a multihop network, packets go through a number of hops before they are absorbed at their destinations. In routing to its destination using minimum path, a packet at a node may have a preferential output link (the so-called “care” packet) or may not (the so-called “don't care” packet). Since each node in an optical multihop network may have limited buffer, when such buffer runs out, contention among packets for the same output link can be resolved by deflection. In this paper, we study packet scheduling algorithms and their performance in a buffered regular network with deflection routing. Using shufflenet as an example, we show that high performance (in terms of throughput and delay) can he achieved if “care” packets can be scheduled with higher priority than “don't care” packets. We then analyze the performance of a shufflenet with this priority scheduling given the buffer size per node. Traditionally, the deflection probability of a packet at a node is solved from a transcendental equation by numerical methods which quickly becomes very cumbersome when the buffer size is greater than one packet per node. By exploiting the special topological properties of the shufflenet, we are able to simplify the analysis greatly and obtain a simple closed-form approximation of the deflection probability. The expression allows us to extract analytically the performance trend of the shufflenet with respect to its buffer and network sizes. We show that a shufflenet indeed performs very well with only one buffer, and can achieve performance close to the store-and-forward case using a buffer size as small as four packets per node     

多源多中继无线网络中基于随机线性网络编码的调度方案

现有多中继无线网络中传输调度方案主要针对单信源且转发链路状态相同的情况,多采用顺序转发的调度方式,传输效率较低。针对此问题,该文提出一种基于随机线性网络编码的优先级调度方案。该方案在不同的传输阶段,利用信息包接收状态或编码向量之间的线性关系生成反馈信息,计算中继节点的有效信息包数。在转发链路状态不同的情况下,综合考虑各中继节点的有效信息与链路传输可靠性,确定优先级,从而完成调度。该方案实现了多中继对多信源信息的协同转发,在转发链路状态差异较大时,能自适应地选择最优转发节点和路径,提高信息包的传输成功率。仿真结果表明,相比传统基于单信源或顺序调度的方案,该方案能有效提高网络吞吐量,减少重传次数。     

Weight Pick: an efficient packet selection algorithm for network coding based multicast retransmission in mobile communication networks

This paper proposes an efficient packet selection algorithm, called Weight Pick, for improving the efficiency of a network coding based multicast retransmission protocol in mobile communication networks. Unlike existing packet selection algorithms, Weight Pick introduces the concept of a dynamic combination number in performing network coding. Based on this concept, a base station dynamically determines the number of packets combined or encoded in a retransmission packet based on the current packet receiving status of users and the combination number for each retransmission packet can be different. In packet selection, Weight Pick attempts to find an encoding combination whose weight is not less than (C ? 1) for every user, where C is the combination number of that retransmission packet. Simulation results show that Weight Pick can significantly improve the retransmission performance as compared with existing packet selection algorithms in terms of both packet loss ratio and packet transmission delay.     

Wavelength channel minimization-based energy-aware mechanism in a multichannel EPON

We propose an energy-aware mechanism (EAM) applicable to the multichannel Ethernet Passive Optical Network that can minimize the number of wavelength channels used and save energy. Wavelength channel minimization is processed by collecting the information such as request message, allocated grant, and start time of each optical network unit (ONU) transmission in the previously elapsed scheduling cycles and comparing it with the buffer occupancy and packet delay conditions of the ONUs required by the user’s quality-of-service requirement. They are exchanged between the optical line terminal (OLT) and the ONUs via the multipoint control protocol. In this way, at the beginning of each scheduling cycle, the ONU’s buffer occupancy and packet delay conditions can be evaluated, and then, the OLT decides the smallest number of wavelength channels to be used in the current scheduling cycle. By turning off the OLT receivers corresponding to the unused wavelength channels, the OLT can save energy. The performance of the proposed EAM was evaluated through simulations using nonjoint off-line dynamic bandwidth allocation and dynamic wavelength assignment algorithms. The results showed that the OLT receivers’ power consumption could be reduced by 48 % on average.     

Power Efficient Video Multipath Transmission over Wireless Multimedia Sensor Networks

This paper proposes a power efficient multipath video packet scheduling scheme for minimum video distortion transmission (optimised Video QoS) over wireless multimedia sensor networks. The transmission of video packets over multiple paths in a wireless sensor network improves the aggregate data rate of the network and minimizes the traffic load handled by each node. However, due to the lossy behavior of the wireless channel the aggregate transmission rate cannot always support the requested video source data rate. In such cases a packet scheduling algorithm is applied that can selectively drop combinations of video packets prior to transmission to adapt the source requirements to the channel capacity. The scheduling algorithm selects the less important video packets to drop using a recursive distortion prediction model. This model predicts accurately the resulting video distortion in case of isolated errors, burst of errors and errors separated by a lag. Two scheduling algorithms are proposed in this paper. The Baseline scheme is a simplified scheduler that can only decide upon which packet can be dropped prior to transmission based on the packet’s impact on the video distortion. This algorithm is compared against the Power aware packet scheduling that is an extension of the Baseline capable of estimating the power that will be consumed by each node in every available path depending on its traffic load, during the transmission. The proposed Power aware packet scheduling is able to identify the available paths connecting the video source to the receiver and schedule the packet transmission among the selected paths according to the perceived video QoS (Peak Signal to Noise Ratio—PSNR) and the energy efficiency of the participating wireless video sensor nodes, by dropping packets if necessary based on the distortion prediction model. The simulation results indicate that the proposed Power aware video packet scheduling can achieve energy efficiency in the wireless multimedia sensor network by minimizing the power dissipation across all nodes, while the perceived video quality is kept to very high levels even at extreme network conditions (many sensor nodes dropped due to power consumption and high background noise in the channel).     

Power allocation and transmission scheduling for a network with bidirectional relaying links

In this paper, we study packet transmission scheduling for a network with bidirectional relaying links, where the relay station can use network coding to combine packets to multiple receivers and opportunistically decide the number of packets to be combined in each transmission. Two cases are considered, depending on whether nodes are allowed to overhear transmissions of each other. A constrained Markov decision process is first formulated with an objective to minimize the average delay of packet transmissions, subject to the maximum and average transmission power limits of the relay node. The complexity for solving the constrained Markov decision process (MDP) is prohibitively high, although the computational complexity for the no‐overhearing case can be greatly reduced. Heuristic schemes are then proposed, one applies to the general case, and another applies to only the no‐overhearing case. Numerical results demonstrate that the heuristic schemes can achieve close‐to‐optimum average packet transmission delay, and furthermore, the second scheme achieves lower maximum delay while keeping the same average packet transmission delay and relay node power consumption as the first one. Copyright © 2015 John Wiley & Sons, Ltd.     

Scheduling strategy for networked control system based on variable sampling period and deadband feedback

A scheduling strategy of variable sampling period combined with deadband feedback for networked control system is proposed. Variable sampling period algorithm can allocate a reasonable sampling period to each controlled loop according to the network utilization and packet transmission time. Deadband feedback algorithm can alleviate network congestion by appropriately adjusting the packets in the network when the networked control system cannot be scheduled. According to the actual overload and utilization of the network, the designed scheduling strategy dynamically adjusts the sampling period and priority, and improves the performance of the system combined with deadband feedback. Based on the TrueTime platform, the proposed scheduling strategy is verified on a three controlled loops networked control system with interference nodes and limited network resources. The simulation results demonstrate that the designed scheduling strategy can overcome the uncertainty of the upper bound of network resources, improve output control performance, reduce integral absolute error value of the controlled loop, and shorten the packet transmission time. The overall control performance of the system is improved. The designed scheduling strategy is effective.     

Media Synchronization and QoS Packet Scheduling Algorithms for Wireless Systems

Wireless multimedia synchronization is concerned with distributed multimedia packets such as video, audio, text and graphics being played-out onto the mobile clients via a base station (BS) that services the mobile client with the multimedia packets. Our focus is on improving the Quality of Service (QoS) of the mobile client's on-time-arrival of distributed multimedia packets through network multimedia synchronization. We describe a media synchronization scheme for wireless networks, and we investigate the multimedia packet scheduling algorithms at the base station to accomplish our goal. In this paper, we extend the media synchronization algorithm by investigating four packet scheduling algorithms: First-In-First-Out (FIFO), Highest-Priority-First (PQ), Weighted Fair-Queuing (WFQ) and Round-Robin (RR). We analyze the effect of the four packet scheduling algorithms in terms of multimedia packet delivery time and the delay between concurrent multimedia data streams. We show that the play-out of multimedia units on the mobile clients by the base station plays an important role in enhancing the mobile client's quality of service in terms of intra-stream synchronization and inter-stream synchronization. Our results show that the Round-Robin (RR) packet scheduling algorithm is, by far, the best of the four packet scheduling algorithms in terms of mobile client buffer usage. We analyze the four packet scheduling algorithms and make a correlation between play-out of multimedia packets, by the base station, onto the mobile clients and wireless network multimedia synchronization. We clarify the meaning of buffer usage, buffer overflow, buffer underflow, message complexity and multimedia packet delay in terms of synchronization between distributed multimedia servers, base stations and mobile clients.     

Link stability‐aware reliable packet transmitting mechanism in mobile ad hoc network

To guarantee the QoS of multimedia applications in a mobile ad hoc network (MANET), a reliable packet transmitting mechanism in MANET is proposed. In this paper, we introduce an effective link lifetime estimation scheme. According to the current network topology and corresponding estimated link lifetime, the end‐to‐end connection is established adaptively in the best effort manner. Consequently, utilizing the network coding method the relay node combines and forwards the packets on the working path. Furthermore, to keep the balance between the gain in reliability and the amount of redundant packets, the time for sending the redundant packets on the backup path is determined for the link stability intelligently. Simulations show that our mechanisms can provide reliable transmissions for data packets and enhance the performance of the entire network, such as the packet delivery ratio, the end‐to‐end delay and the number of control messages. Copyright © 2011 John Wiley & Sons, Ltd.     

Scheduling variable-length messages in a single-hop multichannellocal lightwave network

The design of a medium access control scheme for a single-hop, wavelength-division-multiplexing-(WDM) multichannel local lightwave network poses two major difficulties: relatively large transmitter/receiver tuning overhead and large ratio of propagation delay to packet transmission time. Most schemes proposed so far have ignored the tuning overhead, and they can only schedule fixed-length packet transmissions. To overcome these two difficulties, the authors propose several scheduling algorithms which can reduce the negative impact of tuning overhead and schedule variable-length messages. A separate channel (control channel) is employed for transmission of control packets, and a distributed scheduling algorithm is invoked at each node every time it receives a control packet. By allowing the length of messages to be variable, a long message can be scheduled with a single control packet transmission, instead of fragmenting it into many fixed-length packets, thereby significantly reducing the overhead of control packet transmissions and improving the overall system performance. Three novel scheduling algorithms are proposed, varying in the amount of global information and processing time they need. Two approximate analytical models are formulated to study the effect of tuning time and the effect of having a limited number of data channels. Extensive simulations are conducted. Average message delays are compared for all of the algorithms     

Real-Time Traffic Scheduling and Routing in Packet-Switched Networks Using a Least-Laxity-First Strategy

In this paper, we address the problem of transmission scheduling and buffer management at a switch in a high-speed packet-switched network. Future computer networks are expected to carry bursty real-time multimedia traffic with specific time-delay requirements. We propose a technique to schedule competing packets at a switch in a packet-switched network with two objectives—(i) maximizing the number of packets that would reach their destination before their deadline has been reached (ii) minimizing the number of packets dropped in transit in the network. The method is broadly based on the popular least-laxity heuristic in real-time process scheduling and is combined with buffer management at the switch.     

High-speed buffer management for 40 gb/s-based photonic packet switches

We develop a method of high-speed buffer management for output-buffered photonic packet switches. The use of optical fiber delay lines is a promising solution to constructing optical buffers. The buffer manager determines packet delays in the fiber delay line buffer before the packets arrive at the buffer. We propose a buffer management method based on a parallel and pipeline processing architecture consisting of (log/sub 2/N+1) pipeline stages, where N is the number of ports of the packet switch. This is an expansion of a simple sequential scheduling used to determine the delays of arriving packets. Since the time complexity of each processor in the pipeline stages is O(1), the throughput of this buffer management is N times larger than that of the sequential scheduling method. This method can be used for buffer management of asynchronously arriving variable-length packets. We show the feasibility of a buffer manager supporting 128 /spl times/ 40 Gb/s photonic packet switches, which provide at least eight times as much throughput as the latest electronic IP routers. The proposed method for asynchronous packets overestimates the buffer occupancy to enable parallel processing. We show through simulation experiments that the degradation in the performance of the method resulting from this overestimation is quite acceptable.     

An analytical model for input-buffered optical packet switches with reconfiguration overhead

The overhead associated with reconfiguring a switch fabric in optical packet switches is an important issue in relation to the packet transmission time and can adversely affect switch performance. The reconfiguration overhead increases the mean waiting time of packets and reduces throughput. The scheduling of packets must take into account the reconfiguration frequency. This work proposes an analytical model for input-buffered optical packet switches with the reconfiguration overhead and analytically finds the optimal reconfiguration frequency that minimizes the mean waiting time of packets. The analytical model is suitable for several round-robin (RR) scheduling schemes in which only non-empty virtual output queues (VOQs) are served or all VOQs are served and is used to examine the effects of the RR scheduling schemes and various network parameters on the mean waiting time of packets. Quantitative examples demonstrate that properly balancing the reconfiguration frequency can effectively reduce the mean waiting time of packets.     

Opportunistic Scheduling for Wireless Network Coding

This letter addresses a scheduling problem for wireless network coding (WNC). In our previous work, we have theoretically shown that the optimum number of nodes to be included into a network?coded packet as well as its transmission rate depends on time?varying link condition between a transmitting node and receiving nodes [1]. Based on this observation, this letter designs practical scheme which opportunistically selects scheduled nodes, packets to be coded and an employed modulation level according to time?varying channel conditions and packet length. The numerical results show that the proposed opportunistic scheduling can improve the overall throughput as compared with non?opportunistic approach.     

Performance Analysis of a Quasi-M/D/1 Cut-Through Switching Network with Noisy Channels

Cut-through switching is advantageous in that it can reduce the transmission delay compared with the conventional message or packet switching. In this paper, when the channel is noisy, we investigate various properties ofM/D/1quasi-cut-through switching including actual traffic intensity and overall network delay. In the analysis of delay resulting from retransmission of erroneous packets, we have included the average transmission time of negative acknowledgment signal and queueing time for the retransmitted packet so that the overall network delay can be obtained accurately. In addition, we have obtained distributions of the number of nodes to be traversed and the number of nodes through which packets pass by cut. According to the analysis results, the performance of cut-through switching is superior to that of conventional packet switching in most practical ranges of parameter values.     

QoS-guaranteed packet scheduling in wireless networks

To guarantee the quality of service (QoS) of a wireless network, a new packet scheduling algorithm using cross-layer design technique is proposed in this article. First, the demand of packet scheduling for multimedia transmission in wireless networks and the deficiency of the existing packet scheduling algorithms are analyzed. Then the model of the QoS-guaranteed packet scheduling (QPS) algorithm of high speed downlink packet access (HSDPA) and the cost function of packet transmission are designed. The calculation method of packet delay time for wireless channels is expounded in detail, and complete steps to realize the QPS algorithm are also given. The simulation results show that the QPS algorithm that provides the scheduling sequence of packets with calculated values can effectively improve the performance of delay and throughput.     

Probabilistic Analysis of Cyclic Packet Transmission Scheduling in WDM Optical Networks

We study the packet transmission scheduling problem with tuning delay in wavelength-division multiplexed (WDM) optical communication networks with tunable transmitters and fixed-tuned receivers. By treating the numbers of packets as random variables, we conduct probabilistic analysis of the average-case performance ratio for the cyclic packet transmission scheduling algorithm. Our numerical data as well as simulation results demonstrate that the average-case performance ratio of cyclic schedules is very close to one for reasonable system configurations and probability distributions of the numbers of packets. In particular, when the number of receivers that share a channel and/or the granularity of packet transmission are large, the average-case performance ratio approaches one. Better performance can be achieved by overlapping tuning delays with packet transmission. We derive a bound for the normalized tuning delay Δ such that tuning delay can be completely masked with high probability. Our study implies that by using currently available tunable optical transceivers, it is possible to build single-hop WDM networks that efficiently utilize all the wavelengths.