Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
YESSIR: a simple reservation mechanism for the Internet
ACM SIGCOMM Computer Communication Review
PBAC: Probe-Based Admission Control
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
SRP: a Scalable Resource Reservation Protocol for the Internet
Workshop on Wide Area Networks and High Performance Computing
Co-operation and comparison of DiffServ and IntServ: performance measurements
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
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
Providing end-to-end performance guarantees using non-work-conserving disciplines
Computer Communications
Optimal multiplexing on a single link: delay and buffer requirements
IEEE Transactions on Information Theory
SOS: sender oriented signaling for a simplified guaranteed service
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Distributed dynamic resource management for the AF traffic of the differentiated services networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 0.00 |
An expected growth of real-time traffic in the Internet will place stricter requirements on network performance. We are developing a new simplified service architecture that combines the strengths of the integrated and differentiated services architectures. In this paper we focus on the issues related to providing a guaranteed service in a high-speed network. We give a description of the service, which includes a lightweight signaling protocol and a non-work-conserving scheduling algorithm, and describe the system requirements and the performance evaluation. Our implementation of the protocol allows processing of 30 million signaling messages per second.