VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
On computing per-session performance bounds in high-speed multi-hop computer networks
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Open issues and challenges in providing quality of service guarantees in high-speed networks
ACM SIGCOMM Computer Communication Review
An Admission Control Algorithm for Predictive Real-Time Service (Extended Abstract)
Proceedings of the Third International Workshop on Network and Operating System Support for Digital Audio and Video
Comparison of a Fair Queueing Discipline to Processor Sharing
Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Statistical analysis of generalized processor sharing scheduling discipline
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Performance bounds in communication networks with variable-rate links
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
An upper bound on delay for the VirtualClock service discipline
IEEE/ACM Transactions on Networking (TON)
Device reservation in audio/video editing systems
ACM Transactions on Computer Systems (TOCS)
Parametric Design Synthesis of Distributed Embedded Systems
IEEE Transactions on Computers
Jitter control in QoS networks
IEEE/ACM Transactions on Networking (TON)
Efficient delay computation methods for real-time traffic in an ATM network
Progress in computer research
Efficient delay computation methods for real-time traffic in an ATM network
Progress in computer research
Multimedia Tools and Applications
Best-Effort Scheduling of (m, k)-Firm Real-Time Streams in Multihop Networks
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
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
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
Journal of Algorithms
A calculus for stochastic QoS analysis
Performance Evaluation
Scalability and QoS guarantee for streams with (m,k)-firm deadline
Computer Standards & Interfaces
End-to-end delay approximation in cascades of generalized processor sharing schedulers
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A general preemption-based admission policy using a smart market approach
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
Providing end-to-end performance guarantees using non-work-conserving disciplines
Computer Communications
Using differentiated services to support Internet telephony
Computer Communications
Best-effort scheduling of (m,k)-firm real-time streams in multihop networks
Computer Communications
| Hi-index | 0.00 |
A crucial problem facing the designers and deployers of future high-speed networks is providing applications with quality of service (QOS) guarantees. For soft real-time applications, which are delay sensitive but loss tolerant, delay distribution is an important QOS measure of interest. In this paper we study (through simulation) the end-to-end delay distribution seen by individual sessions under simple first-come first-served (FCFS) multiplexing in a network model with two significant features: (1) all traffic is connection-oriented, (2) cross traffic along routes is representative of that seen by calls in a moderately sized wide area network (i.e., less than 100 switches). We compare these delay distributions with the worst case point-valued analytic delay bounds predicted by three different techniques for providing such bounds (two of which require a more sophisticated link-level scheduling policy). We also consider the per-hop delay distributions seen as a session progresses "deeper" into the network and determine the sensitivity of these delay distributions to the manner in which the interfering traffic is modeled. Finally, we use our delay distribution results to examine the tradeoff between the QOS requested by a call, the manner in which the QOS guarantee is provided, and the number of calls that are admitted at the requested QOS.