Integrated Services Packet Networks (ISPN) are designed to integrate the network service requirements of a wide variety of computer-based applications. Some of these services are delivered primarily through the packet scheduling algorithms used in the network switches. This paper addresses two questions related to these scheduling algorithms. The rst question is: what scheduling services should...

A parallel packet switch (PPS) is a switch in which the memories run slower than the line rate. Arriving packets are spread (or load-balanced) packet-by-packet over multiple slower-speed packet switches. It is already known that with a speedup of , a PPS can theoretically mimic a FCFS output-queued (OQ) switch. However, the theory relies on a centralized packet scheduling algorithm that is esse...

All-optical shared fiber-delay-line (FDL) packet switches have been studied intensively in the literature and with the literature, many scheduling genetic algorithms have been proposed. However, these genetic algorithms suffer from not being able to provide a delay bound, or require complex timing methods to compute scheduling assignments. In this paper, we propose two fast scheduling algorithm...

ATM switches have been proposed as the switching fabric cores of many high-performance IP switches. In this paper, we present an efficient algorithm called IPPIM for scheduling variable-length IP packets on these switches and compare its performance with the original parallel iterative matching (PIM) ATM cell scheduling algorithm. The mean IP packet delays using both the PIM and the IP-PIM sche...

Future generation wireless packet networks will support multimedia applications with diverse quality-of-service (QoS) requirements. There is a need to develop a packet scheduling scheme for wireless channels that provides QoS guarantees for heterogeneous traffic and is also simple to implement and manage. This paper focuses on packet scheduling on a reservation-based on-demand TDMA/TDD wireless...

Wireless sensor network are usually deployed, possibly in extreme conditions such as mountainous region, and left unattended to function for long time. In order to prolong the network lifetime, it is necessary to minimize the consumption of energy by individual nodes. In addition, it is also necessary to ensure that the average rate of consumption of energy by each node is also the same. The ex...

We investigate a scheduling problem in a TDMA environment where packets may be fragmented. Our model of the problem is derived from a scheduling problem present in data over CATV networks, where a slotted TDMA channel is used to carry both real-time and best-effort traffic. Packets of real-time flows have high priority and are allocated in fixed, periodically located slots. Best-effort packets ...

A mobile device may run energy consuming multimedia applications, such as video streaming. Thus, power management is an important issue in mobile devices. In this paper, we propose a QoS-guaranteed energy-efficient packet scheduling algorithm for IEEE 802.16-2009 (WiMax) network interfaces. The integration of packet scheduling and sleep mode operation can make IEEE 802.16-2009-enabled mobile de...

Switches today provide a small set of scheduling algorithms. While we can tweak scheduling parameters, we cannot modify algorithmic logic, or add a completely new algorithm, after the switch has been designed. This paper presents a design for a programmable packet scheduler, which allows scheduling algorithms—potentially algorithms that are unknown today—to be programmed into a switch without r...