MPEG: a video compression standard for multimedia applications
Communications of the ACM - Special issue on digital multimedia systems
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Comparison of rate-based service disciplines
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
Delay guarantee of virtual clock server
IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Computer networks (3rd ed.)
Generalized guaranteed rate scheduling algorithms: a framework
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Elements of network protocol design
Elements of network protocol design
Time-shift scheduling—fair scheduling of flows in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
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
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)
An In-Depth Look at Flow Aggregation for Efficient Quality of Service
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Preserving Quality of Service Guarantees in Spite of Flow Aggregation
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
A service-curve approach to performance guarantees in integrated-service networks
A service-curve approach to performance guarantees in integrated-service networks
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
On deterministic traffic regulation and service guarantees: a systematic approach by filtering
IEEE Transactions on Information Theory
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
Relationship between guaranteed rate server and latency rate server
Computer Networks: The International Journal of Computer and Telecommunications Networking
End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Per-domain packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking (TON)
On the fairness of flow aggregation for denial-of-service resistant QoS in MANETs
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
End-to-end QoS guarantees for a network based on Latency-Rate Max-Min service curve
Computer Communications
End-to-end delay bounds in FIFO-multiplexing tandems
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
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
A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems
Performance Evaluation
Scalable quality of service across multiple domains
Computer Communications
Intra-flow fairness in work-conserving flow aggregation
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Delay bounds in tree networks with DiffServ architecture
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Per-domain packet scale rate guarantee for expedited forwarding
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Flow aggregation using dynamic packet state
EUNICE'10 Proceedings of the 16th EUNICE/IFIP WG 6.6 conference on Networked services and applications: engineering, control and management
Proceedings of the 6th International Conference on Future Internet Technologies
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
Backpressure scheduling in IEEE 802.11 wireless mesh networks: Gap between theory and practice
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We investigate how quality of service may be guaranteed to a flow of packets in the presence of flow aggregation. For efficiency, multiple flows, known as the constituent flows, are merged together resulting in a single aggregate flow. After the network node where the aggregation occurs, packet schedulers are aware of the aggregate flow, but are unaware of its constituent flows. In spite of this, we show that quality of service may be guaranteed to the constituent flows, provided the aggregation is performed fairly. When the delay bound of a flow is de-coupled from the flow's reserved rate, flow aggregation preserves the delay bound. When the delay bound of a flow is coupled to the flow's reserved rate, flow aggregation preserves, and in some cases improves, the delay bound.