A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
IEEE/ACM Transactions on Networking (TON)
Leave-in-Time: a new service discipline for real-time communications in a packet-switching network
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Delay guarantee of virtual clock server
IEEE/ACM Transactions on Networking (TON)
A schedulability condition for deadline-ordered service disciplines
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Rate-proportional servers: a design methodology for fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Time-shift scheduling—fair scheduling of flows in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Packet reordering is not pathological network behavior
IEEE/ACM Transactions on Networking (TON)
Universal timestamp-scheduling for real-time networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fair queuing for aggregated multiple links
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Fast scheduling of periodic tasks on multiple resources
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Determining End-to-End Delay Bounds in Heterogeneous Networks
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
General Methodology for Designing Efficient Traffic Scheduling and Shaping Algorithms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
An In-Depth Look at Flow Aggregation for Efficient Quality of Service
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Fair link striping with FIFO delivery on heterogeneous channels
Computer Communications
Bonded deficit round robin scheduling for multi-channel networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Competitive analysis of scheduling algorithms for aggregated links
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
A computer network consists of a set of computing nodes interconnected via communication channels. It is commonly assumed that, for each pair of network nodes u and v, there is at most one channel from u to v. However, it is often desirable to have multiple channels between nodes. That is, for every pair of network nodes u and v, there may be multiple channels from u to v. In this paper, we consider the problem of providing deterministic quality of service guarantees when there are multiple channels between nodes. We show that any packet scheduling protocol that operate over a single channel can be modified to operate over multiple channels. In addition this transformation increases the packet delay through the node by only a small amount. However, having multiple channels between nodes may cause packet reorder. This reorder significantly increases the upper bound on end-to-end delay. We show how this increase in delay is avoided through the use of efficient sorting techniques.