Amortized efficiency of list update and paging rules
Communications of the ACM
A stop-and-go queueing framework for congestion management
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
ATM networks (2nd ed.): concepts, protocols, applications
ATM networks (2nd ed.): concepts, protocols, applications
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
Computer networks (3rd ed.)
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Online computation and competitive analysis
Online computation and competitive analysis
Characterizing Traffic Behavior and Providing End-to-End Service Guarantees within ATM Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Performance Issues of Multimedia Applications
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
On the performance of input-queued cell-based switches with two priority classes
ICCC '02 Proceedings of the 15th international conference on Computer communication
A two-level resource management scheme in wireless networks based on user-satisfaction
ACM SIGMOBILE Mobile Computing and Communications Review - Special Issue on Medium Access and Call Admission Control Algorithms for Next Generation Wireless Networks.: The Digital Library version of this issue has a corrected special issue title compared to the one in the print version of the issue.
ACM Transactions on Algorithms (TALG)
Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks
IEEE Transactions on Parallel and Distributed Systems
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
IEEE Transactions on Computers
Jitter regulation for multiple streams
ACM Transactions on Algorithms (TALG)
Transition-aware DVS algorithm for real-time systems using tree structure analysis
Journal of Systems Architecture: the EUROMICRO Journal
Jitter regulation for multiple streams
ESA'05 Proceedings of the 13th annual European conference on Algorithms
NEW2AN'07 Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
| Hi-index | 0.00 |
We study jitter control in networks with guaranteed quality of service (QoS) from the competitive analysis point of view: we propose on-line algorithms that control jitter and compare their performance to the best possible (by an off-line algorithm) for any given arrival sequence. For delay jitter, where the goal is to minimize the difference between delay times of different packets, we show that a simple on-line algorithm using a buffer of B slots guarantees the same delay jitter as the best off-line algorithm using buffer space B/2. We prove that the guarantees made by our on-line algorithm hold, even for simple distributed implementations, where the total buffer space is distributed along the path of the connection, provided that the input stream satisfies a certain simple property. For rate jitter, where the goal is to minimize the difference between inter-arrival times, we develop an on-line algorithm using a buffer of size 2B + h for any h ≥ 1, and compare its jitter to the jitter of an optimal off-line algorithm using buffer size B. We prove that our algorithm guarantees that the difference is bounded by a term proportional to B/h.