A Neural Network Based Approach for Overlay Multicast in Media Streaming Systems

Summary form only given. Application level multicast approaches have attracted interests in both research and industrial communities. Among various approaches, constructing the overlay multicast tree based on mesh network is very promising for a large multicast group size. This approach is efficient in bandwidth utilization but suffer from high computation overhead. We present a new approach for constructing an overlay multicast tree in a large scale media streaming system using neural networks. The media server first constructs an overlay multicast tree for requests arriving in a relatively short time interval. Then the subsequent requests can join the multicast tree in a distributed way. To utilize the interface bandwidth efficiently, we formulate the original tree construction problem as a balanced multicast tree problem and propose a new SOFM-like neural network algorithm to obtain the solution. For the requests arriving at a later time, the proxy servers process the requests and join the multicast tree using a decentralized prediction based on a multilayered neural network. The tree is kept balanced in the tree joining process by having proxy servers predict the traffic load on its neighbors.

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

[2]  Kevin C. Almeroth,et al.  On the topology of multicast trees , 2003, TNET.

[3]  Martin Fürer,et al.  Approximating the Minimum-Degree Steiner Tree to within One of Optimal , 1994, J. Algorithms.

[4]  Norio Shiratori,et al.  A neural network approach to multicast routing in real-time communication networks , 1995, Proceedings of International Conference on Network Protocols.

[5]  Carsten Peterson,et al.  Local routing algorithms based on Potts neural networks , 2000, IEEE Trans. Neural Networks Learn. Syst..

[6]  Laura I. Burke,et al.  The guilty net for the traveling salesman problem , 1992, Comput. Oper. Res..

[7]  Kien A. Hua,et al.  ZIGZAG: an efficient peer-to-peer scheme for media streaming , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Amir F. Atiya,et al.  A comparison between neural-network forecasting techniques-case study: river flow forecasting , 1999, IEEE Trans. Neural Networks.

[9]  Pascal Frossard,et al.  Joint server scheduling and proxy caching for video delivery , 2002, Comput. Commun..

[10]  Bernd Fritzke,et al.  Growing cell structures--A self-organizing network for unsupervised and supervised learning , 1994, Neural Networks.

[11]  Bobby Bhattacharjee,et al.  Scalable application layer multicast , 2002, SIGCOMM 2002.

[12]  Kien A. Hua,et al.  Overlay multicast for video on demand on the Internet , 2003, SAC '03.

[13]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[14]  Anoop Ghanwani,et al.  Improved Neural Heuristics for Multicast Routing , 1997, IEEE J. Sel. Areas Commun..

[15]  Athanasios Kehagias,et al.  A Bayesian Multiple Models Combination Method for Time Series Prediction , 2001, J. Intell. Robotic Syst..

[16]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[17]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[18]  Jonathan S. Turner,et al.  Routing in overlay multicast networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[19]  Teuvo Kohonen,et al.  Self-Organizing Maps , 2010 .

[20]  Bernard Angéniol,et al.  Self-organizing feature maps and the travelling salesman problem , 1988, Neural Networks.

[21]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.