Decentralized Resource Management for a Distributed Continuous Media Server
IEEE Transactions on Parallel and Distributed Systems
Decentralized Resource Management for a Distributed Continuous Media Server
IEEE Transactions on Parallel and Distributed Systems
AMRST: adaptive multicast routing protocol for satellite-terrestrial networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Two additive-constrained path selection in the presence of inaccurate state information
Computer Communications
Analysis of QoS routing in MPLS network in Kosova using fuzzy logic
ISPRA'08 Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation
WiMAX integration in NGN network, architecture, protocols and services
WSEAS TRANSACTIONS on COMMUNICATIONS
Link utilization of GA-based QoS routing algorithm
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
An efficient distributed scheme for source routing protocol in communication networks
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Exploring routing with multiple Quality of Service parameters in High-Speed Networks
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
| Hi-index | 0.00 |
Multimedia applications such as video-conferencing, telemedicine, HDTV, etc. have very stringent quality-of-service (QoS) demands and require a connection-oriented service. For these applications, a path satisfying their requirements in terms of bandwidth, delay buffer, etc. needs to be found. As conventional IP routing is based only on hop counts, it is not suitable for multimedia applications. It is clear that, to route requests that have QoS requirements, existing routers should be made QoS aware and the packet forwarding should be based on QoS parameters. Also, routing protocols like OSPF and RIP must be extended suitably to facilitate QoS routing. The goal of QoS routing algorithms is to find a loop-less path satisfying a given set of constraints on parameters like bandwidth, delay, etc. The path selection process could return either the entire path to the destination or the best next hop for the request. The first case is called “source routing” and the second is referred to as “distributed routing”. In this paper, we propose a new distributed QoS routing algorithm for unicast flows, which has a very low call establishment overhead. Our algorithm makes use of existing IP routing protocols such as OSPF and RIP with minimal modifications