On efficient distribution of data in multicast networks: QoS in scalable networks

Authors:
Francis Lowu;Venansius Baryamureeba
Affiliations:
Faculty of Computing & IT, Makerere University, Uganda;Faculty of Computing & IT, Makerere University, Uganda
Venue:
LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
Year:
2005

Citing 5
Cited 2

Optimal partition of QoS requirements on unicast paths and multicast trees

IEEE/ACM Transactions on Networking (TON)
A Scalable Distributed QoS Multicast Routing Protocol

A Scalable Distributed QoS Multicast Routing Protocol
Efficient data distribution in large-scale multicast networks

Efficient data distribution in large-scale multicast networks
Precomputation schemes for QoS routing

IEEE/ACM Transactions on Networking (TON)
Many-to-many multicast routing with temporal quality of service guarantees

IEEE Transactions on Computers

An ABC supported QoS multicast routing scheme based on beehive algorithm

Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Small-world optimization based QoS multicast routing scheme with ABC supported

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multimedia applications or real-time applications such as audio and video on demand, teleconferencing and whiteboard sharing require Quality of Service (QoS) guarantee assurance. QoS constraints, namely required bandwidth, end-to-end delay and delay jitter are the major parameters that need to be satisfied in order to have quality assurance in a dynamic multicast network. In this paper we investigate the effect of the QoS constraints on multicast network applications and services during the processes of routing. Lastly, we propose linear routing tree algorithms for required bandwidth, end-to-end delay and delay jitter.