VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
IEEE/ACM Transactions on Networking (TON)
An upper bound on delay for the VirtualClock service discipline
IEEE/ACM Transactions on Networking (TON)
Quality of service: delivering QoS on the Internet and in corporate networks
Quality of service: delivering QoS on the Internet and in corporate networks
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Connection Establishment for Multi-Party Real-Time Communication
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Static priority scheduling for ATM networks
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Efficient Admission Control for EDF Schedulers
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Scalable QoS Guaranteed Communication Services for Real-Time Applications
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
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
Utilization-Based Admission Control for Scalable Real-Time Communication
Real-Time Systems
Endpoint Admission Control: Network Based Approach
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
VoIP: A comprehensive survey on a promising technology
Computer Networks: The International Journal of Computer and Telecommunications Networking
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Jockey: guaranteed job latency in data parallel clusters
Proceedings of the 7th ACM european conference on Computer Systems
Mathematical formalisms for performance evaluation of networks-on-chip
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
In this paper, we present a methodology to use utilization-based admission control in guaranteed real-time communication in a scalable fashion. We make admission control scalable by using a configuration-time test to determine a safe utilization level of servers. Admission control at run-time then is reduced to simple utilization tests on the servers along the path of the new flow. Furthermore, we discuss how appropriate route selection improve utilization levels, design a safe route selection heuristic algorithm to achieve high utilization of resources, and derive two bounds on the maximum utilization level for given traffic in a network. We compare the results of our route selection heuristics with that of a shortest-path based algorithm, and find that our heuristics can achieve a much higher maximum utilization level than that of the shortest-path based algorithm.