Finding Service Paths in an Overlay Media Service Proxy Network

An overlay media service proxy network is formed by a set of multimedia service proxies deployed at strategic locations in the underlying network. Proxies in this overlay network are able to provide applicationlevel media services, such as media data transcoding and analysis. End points of multimedia communication can then connect to this network, and request a combination of media services delivered by one or more proxies in it. In this paper, we study the problem of finding multimedia service paths in a media service proxy network. A service path connects a pair of communicating end points via a chain of media service proxies. We show that service path finding is different from both network-level QoS routing and application-level multicast; and that existing solutions are not readily applicable. Our solution includes a cost-effective mesh augmentation method and a resource-aware service path finding algorithm. The mesh augmentation method creates a highly connected mesh within the overlay network, without increasing bandwidth probing overhead. Based on the mesh, the service path finding algorithm computes the ‘safest’ service paths with respect to end-to-end resource availability, thus achieving high overall service path success rate. Both simulation and analytical results demonstrate the soundness of our solution.

[1]  Ben Y. Zhao,et al.  The Ninja architecture for robust Internet-scale systems and services , 2001, Comput. Networks.

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

[3]  Akihiro Nakao,et al.  Constructing end-to-end paths for playing media objects , 2002, Comput. Networks.

[4]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[5]  Xingming Liu,et al.  Heuristic algorithms for multi-constrained quality of service routing , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Marcel Waldvogel,et al.  Dimensioning server access bandwidth and multicast routing in overlay networks , 2001, NOSSDAV '01.

[7]  Jon Crowcroft,et al.  Bandwidth-delay based routing algorithms , 1995, Proceedings of GLOBECOM '95.

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

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

[10]  Dinesh C. Verma,et al.  ALMI: An Application Level Multicast Infrastructure , 2001, USITS.

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

[12]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Jennifer Rexfordz,et al.  Eecient Precomputation of Quality-of-service Routes , 1998 .

[14]  Weisong Shi,et al.  CANS: Composable, Adaptive Network Services Infrastructure , 2001, USITS.

[15]  Nalini Venkatasubramanian,et al.  Combined path and server selection in dynamic multimedia environments , 1999, MULTIMEDIA '99.