The traveling miser problem

Various monitoring and performance evaluation tools generate considerable amount of low priority traffic. This information is not always needed in real time and often can be delayed by the network without hurting functionality. This paper proposes a new framework to handle this low priority, but resource consuming traffic in such a way that it incurs a minimal interference with the higher priority traffic. Consequently, this improves the network goodput. The key idea is allowing the network nodes to delay data by locally storing it. This can be done, for example, in the Active Network paradigm. In this paper we show that such a model can improve the network's goodput dramatically even if a very simple scheduling algorithm for intermediate parking is used. The parking imposes additional load on the intermediate nodes. To obtain minimal cost schedules we define an optimization problem called the traveling miser problem. We concentrate on the on-line version of the problem for a predefined route, and develop a number of enhanced scheduling strategies. We study their characteristics under different assumptions on the environment through a rigorous simulation study. We prove that if only one link can be congested, then our scheduling algorithm is O(log2B) competitive, where B is congestion time, and is 3-competitive, if additional signaling is allowed

[1]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[2]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[3]  Yuval Shavitt,et al.  The travelling miser problem , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Alan F. Blackwell,et al.  Programming , 1973, CSC '73.

[5]  Ariel Orda,et al.  Minimum weight paths in time-dependent networks , 1991, Networks.

[6]  Alon Itai,et al.  Adaptive Source Routing in High-Speed Networks , 1996, J. Algorithms.

[7]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[8]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[9]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, ICALP.

[10]  Michalis Faloutsos,et al.  Quantifying routing asymmetry in the Internet at the AS level , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[11]  Yuval Shavitt,et al.  Active networks for efficient distributed network management , 2000 .

[12]  Baruch Schieber,et al.  The Canadian Traveller Problem , 1991, SODA '91.

[13]  R. Bellman.  Dynamic programming. , 1957, Science.

[14]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[15]  Konstantinos Psounis,et al.  Active networks: Applications, security, safety, and architectures , 1999, IEEE Communications Surveys & Tutorials.

[16]  Yuval Shavitt,et al.  The traveling miser problem , 2006, IEEE/ACM Trans. Netw..