Directory based composite routing and scheduling policies for dynamic multimedia environments

In this paper, we present and evaluate algorithms to address combined path and server selection (CPSS) problems in highly dynamic multimedia environments. Our goal is to ensure effective utilization of network and server resources while tolerating imprecision in system state information. Components within the framework implement the optimized scheduling policies as well as collect/update the network and server parameters using a directory service. We present and analyze multiple policies to solve the combined path and server selection (CPSS) problem. In addition, we study multiple techniques for updating the directory service with system state information. We further evaluate the performance of the CPSS policies under different update mechanisms and study the implications of the CPSS policies on directory service management.

[1]  A. Prasad Sistla,et al.  View maintenance in mobile computing , 1995, SGMD.

[2]  Nalini Venkatasubramanian,et al.  Load management in distributed video servers , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.

[3]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[4]  Peter A. Dinda,et al.  Performance characteristics of mirror servers on the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[6]  Ouri Wolfson,et al.  Cost and imprecision in modeling the position of moving objects , 1998, Proceedings 14th International Conference on Data Engineering.

[7]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[8]  A. Orda,et al.  QoS routing mechanisms and OSPF extensions , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[9]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[10]  Satish K. Tripathi,et al.  Routing guaranteed quality of service connections in integrated services packet networks , 1997, Proceedings 1997 International Conference on Network Protocols.

[11]  Mor Harchol-Balter,et al.  On Choosing a Task Assignment Policy for a Distributed Server System , 1998, J. Parallel Distributed Comput..

[12]  N. Venkatasubramanian,et al.  An Evaluation of Composite Routing and Scheduling Policies for Dynamic Multimedia Environments , 2001 .

[13]  Ellen W. Zegura,et al.  A novel server selection technique for improving the response time of a replicated service , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[14]  Nalini Venkatasubramanian,et al.  CompOSE|Q-a QoS-enabled customizable middleware framework for distributed computing , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems. Workshops on Electronic Commerce and Web-based Applications. Middleware.

[15]  Scott Shenker,et al.  Best-effort versus reservations: a simple comparative analysis , 1998, SIGCOMM '98.

[16]  Paul Francis,et al.  An architecture for a global Internet host distance estimation service , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[17]  Mark Crovella,et al.  Dynamic Server Selection using Bandwidth Probing in Wide-Area Networks , 1996 .

[18]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[19]  Guangyu Pei,et al.  Measurements On Delay And Hop-Count Of The Internet , 1998 .

[20]  Satish Rao,et al.  Finding near-optimal cuts: an empirical evaluation , 1993, SODA '93.

[21]  Asit Dan,et al.  Buffering and caching in large-scale video servers , 1995, Digest of Papers. COMPCON'95. Technologies for the Information Superhighway.

[22]  Nalini Venkatasubramanian,et al.  Design and implementation of a composable reflective middleware framework , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[23]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[24]  B. M. Fulk.  MATH , 1992 .

[25]  Mor Harchol-Balter,et al.  On Choosing a Task Assignment Policy for a Distributed Server System , 1998, Computer Performance Evaluation.

[26]  Michael F. Schwartz,et al.  Locating nearby copies of replicated Internet servers , 1995, SIGCOMM '95.

[27]  Paul Francis,et al.  IDMaps: a global internet host distance estimation service , 2001, TNET.

[28]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[29]  Peter Steenkiste,et al.  Routing high-bandwidth traffic in max-min fair share networks , 1996, SIGCOMM 1996.

[30]  Brad Cain,et al.  A Model for Content Internetworking (CDI) , 2003, RFC.

[31]  Nalini Venkatasubramanian,et al.  PARM : power aware reconfigurable middleware , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[32]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[33]  Raphael Rom,et al.  Multi-path routing combined with resource reservation , 1997, Proceedings of INFOCOM '97.