VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
Aggregation and Scalable QoS: A Performance Study
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
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
Scalable QoS Guaranteed Communication Services for Real-Time Applications
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Preserving Quality of Service Guarantees in Spite of Flow Aggregation
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Hardware-efficient fair queueing architectures for high-speed networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
MPEG-4 and H.263 video traces for network performance evaluation
IEEE Network: The Magazine of Global Internetworking
Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Feasibility of Supporting Real-Time Traffic in DiffServ Architecture
WWIC '07 Proceedings of the 5th international conference on Wired/Wireless Internet Communications
Throughput and QoS optimization in nonuniform multichannel wireless mesh networks
Proceedings of the 4th ACM symposium on QoS and security for wireless and mobile networks
Delay bounds in tree networks with DiffServ architecture
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Quality of Service in mobile ad hoc networks: a survey
International Journal of Ad Hoc and Ubiquitous Computing
Effect of flow aggregation on the maximum end-to-end delay
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
| Hi-index | 0.00 |
This paper evaluates, via both analysis and simulation, the end-to-end (e2e) delay performance of aggregate scheduling with guaranteed-rate (GR) algorithms. Deterministic e2e delay bounds for a single aggregation are derived under the assumption that all incoming flows at an aggregator conform to the token bucket model. An aggregator can use any of three types of GR scheduling algorithms: stand-alone GR, two-level hierarchical GR, and rate-controlled two-level hierarchical GR. E2e delay bounds are also derived for the case of multiple aggregations within an aggregation region when aggregators use the rate-controlled two-level hierarchical GR. By using the GR scheduling algorithms for traffic aggregates, we show not only the existence of delay bounds for each flow, but also the fact that, under certain conditions (e.g., when the aggregate traverses a long path after the aggregation point), the bounds are smaller than that of per-flow scheduling. We then compare the analytic delay bounds numerically and conduct in-depth simulation to: 1) confirm the analytic results and 2) compare the e2e delays of aggregate and per-flow scheduling. The simulation results have shown that aggregate scheduling is very robust and can exploit statistical multiplexing gains. It performs better than per-flow scheduling in most of the simulation scenarios we considered.Overall, aggregate scheduling is shown theoretically to provide bounded e2e delays and practically to provide excellent e2e delay performance. Moreover, it incurs lower scheduling and state-maintenance overheads at routers than per-flow scheduling. All of these salient features make aggregate scheduling very attractive for use in Internet core networks.