Transparent topology is common in many mobile ad hoc networks (MANETs) such as vehicle (VANETs), unmanned aerial (UAV) networks, and wireless sensor due to their decentralization mobility nature. There are existing works on distributed scheduling scheme design for topology-transparent MANETs. Most of them focus delay-unconstrained settings. However, with the proliferation real-time applications...

We consider the fundamental delay bounds for scheduling packets in an N × N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at least O(N). We then prove that O(log(N)) delay is achievable with a simple frame based algorithm that uses queue backlog information. This is the be...

Queueing for service occurs in technical applications as well as in common daily life, and scheduling should manage queues in a satisfactory way. Performance metrics are influenced by the service order, thus, scheduling policies should be designed with respect to the main performance metrics of interest. For human customers psychological effects and performance metrics other than delay play a c...

Most of the IEEE 802.16e Mobile WiMAX scheduling proposals for real-time traffic using Unsolicited Grant Service (UGS) focus on the throughput and guaranteed latency. The delay jitter and the effect of burst overhead have not yet been investigated. This paper introduces a new technique called Swapping Min-Max (SWIM) for UGS scheduling that not only meets the delay constraint with optimal throug...

Packet switched data network like Internet, which has traditionally supported throughput sensitive applications such as email and file transfer, is increasingly supporting delay-sensitive multimedia applications such as interactive video. These delaysensitive applications would often rather sacrifice some throughput for better delay. Unfortunately, the current packet switched network does not o...

In this paper, we propose an asynchronous cluster video server architecture, which is quite different from synchronous video server architecture in various aspects such as striping policy, placement policy, and server scheduling algorithm. This architecture has the benefits that the system scales unlimitedly with the number of disks and videos. We discuss the main design issues and compute the ...

Scheduling algorithms are fundamental components in the process of resource management in mobile communication networks with heterogeneous QoS requirements such as delay, delay jitter, packet loss rate or throughput. The random characteristics of the propagation environment and the use of complex physical layers in order to combat this random behavior does not ease in the design of simple, effi...

To support quality of service guarantees in a scalable manner, aggregate scheduling has attracted a lot of attention in the networking community. However, while there are a large number of results available for flow-based scheduling algorithms, few such results are available for aggregate-based scheduling. In this paper, we study a network implementing Guaranteed Rate (GR) scheduling with First...

Packet delay and bandwidth are two important metrics for measuring quality of service (QoS) of Internet services. Traditionally, packet delay differentiation and fair bandwidth sharing are studied separately. In this paper, we first propose a generalized model for providing fair bandwidth sharing with delay differentiation, namely FBS-DD, at the same time. It essentially aims to provide multi-d...

We seek to provide an analytical answer whether the impact of packet scheduling algorithms on end-to-end delays diminishes on long network paths. The answer is provided through a detailed multi-node delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account for statistical multiplexing. The analysis is enabled by two contributions: (1) We derive a funct...