IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Two issues in reservation establishment
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The Real-Time Channel Administration Protocol
Proceedings of the Second International Workshop on Network and Operating System Support for Digital Audio and Video
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
Call admission and resource reservation for multicast sessions
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
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
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
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Fault recovery for guaranteed performance communications connections
IEEE/ACM Transactions on Networking (TON)
Effective quality-of-service renegotiating schemes for streaming video
EURASIP Journal on Applied Signal Processing
Robust network dimensioning for realtime services over IP networks with traffic deviation
Computer Communications
Capacity assignment in multiservice packet networks with soft maximum waiting time guarantees
Journal of Network and Computer Applications
| Hi-index | 0.24 |
Many audio and video 'play-back' applications require that all of their packets arrive within their play-back time. Furthermore, the applications with the hard real-time requirements also require guaranteed service from the network. These applications are covered under the 'Guaranteed Quality of Service' specifications by the IETF. It guarantees that the packets will arrive within the guaranteed delivery time and that the packets will not be discarded due to queue overflows, provided the flow traffic stays within its specified traffic parameters. This paper gives an efficient and distributed algorithm based on the cost function to divide the end-to-end guaranteed QoS requirements into local QoS requirements which are then mapped into local resource requirements. The algorithm operates in three phases. In the first phase, the nodes in the selected route give the information about their utilization level and the parameters associated with the scheduling algorithm used by them. The receiving node, based upon the information provided by the nodes in the route and its end-to-end delay requirements, takes the call admission decision. Once the decision to admit the call is taken, the nodes in the route do the resource allocation to meet the delay bound. The sender node now calculates the slack produced if any. The slack is then distributed to the nodes in the third phase. The results obtained are then shown to be applicable to the resource allocation for multicast connection establishment.