Cost-balance overlay multicast routing using dynamic estimation

This paper presents a cost-balance overlay multicast routing scheme (Cost-Balance) to the metrics tradeoff problem between overlay path delay and access bandwidth at Multicast Server Nodes (MSN) for real-time applications over Internet. Besides dynamically estimating these two metrics for better stability and implementing a dynamic priority to MSNs by weighing the size of its service clients for better efficiency, Cost-Balance tradeoffs overlay path delay and MSN access bandwidth by carefully selecting a 'less-MSN-access-bandwidth' path within minimum-delay overlay paths to lessen MSN access bandwidth as much as possible. Simulation experiments demonstrate the scheme achieves better performance in terms of metrics tradeoff and routing stability.

[1]  Yuval Shavitt,et al.  Approximation and heuristic algorithms for minimum delay application-layer multicast trees , 2004, INFOCOM 2004.

[2]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[3]  Sang Lyul Min,et al.  Implementation and performance evaluation of the LRFU replacement policy , 1997, Proceedings 23rd Euromicro Conference New Frontiers of Information Technology - Short Contributions -.

[4]  Prasant Mohapatra,et al.  HostCast: a new overlay multicasting protocol , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[5]  Yannis Smaragdakis,et al.  EELRU: simple and effective adaptive page replacement , 1999, SIGMETRICS '99.

[6]  Samir Khuller,et al.  Construction of an efficient overlay multicast infrastructure for real-time applications , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Sang Lyul Min,et al.  Efficient Replacement of Nonuniform Objects in Web Caches , 2002, Computer.

[8]  Eric Brewer,et al.  Scattercast: an architecture for internet broadcast distribution as an infrastructure service , 2000 .

[9]  G. Manimaran,et al.  Multicasting: an enabling technology , 2003, IEEE Network.

[10]  Ken Christensen,et al.  Performance evaluation of multicast routing algorithms to trade-off path length and bandwidth consumption and of a protocol to reduce messaging overhead , 2001 .

[11]  Sanjeev Kumar,et al.  Exploiting spatial locality in data caches using spatial footprints , 1998, ISCA.

[12]  Jonathan S. Turner,et al.  Multicast routing and bandwidth dimensioning in overlay networks , 2002, IEEE J. Sel. Areas Commun..

[13]  Srinivasan Seshan,et al.  Enabling conferencing applications on the internet using an overlay muilticast architecture , 2001, SIGCOMM 2001.