Optimization Problems in High-Speed Networks

Abstract : The main goal of this project is to develop fundamental algorithmic techniques that can be applied to problems that arise in the context of high-speed communication networks. The explosion in the size and complexity of networks, together with QoS requirements needed by some of the new services raises many new challenging problems. In this report we outline our latest accomplishments in the areas of online routing of FTP requests and snapshot scan algorithms.

[1]  Kamesh Munagala,et al.  Designing networks incrementally , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[2]  David R. Karger,et al.  Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows , 1995, STOC '95.

[3]  Kamesh Munagala,et al.  Extending Greedy Multicast Routing to Delay Sensitive Applications , 2002, Algorithmica.

[4]  Sanjeev Khanna,et al.  Page replacement for general caching problems , 1999, SODA '99.

[5]  Edith Cohen,et al.  Exploiting regularities in Web traffic patterns for cache replacement , 1999, STOC '99.

[6]  Danny Raz,et al.  Global optimization using local information with applications to flow control , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[7]  Adam Meyerson.  Profit-earning facility location , 2001, STOC '01.

[8]  Kamesh Munagala,et al.  Web caching using access statistics , 2001, SODA '01.

[9]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

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

[11]  Yishay Mansour,et al.  Phantom: A Simple and Effective Flow Control Scheme , 1996, SIGCOMM.

[12]  Baruch Awerbuch,et al.  Converging to approximated max-min flow fairness in logarithmic time , 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.

[13]  Kamesh Munagala,et al.  Online Algorithms for Caching Multimedia Streams , 2000, ESA.

[14]  Éva Tardos,et al.  Scheduling data transfers in a network and the set scheduling problem , 1999, STOC '99.

[15]  J. Castro,et al.  An implementation of linear and nonlinear multicommodity network flows , 1996 .

[16]  Kamesh Munagala,et al.  Cost-distance: two metric network design , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[17]  Sudipto Guha,et al.  Approximating a finite metric by a small number of tree metrics , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[18]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[19]  Ashish Goel,et al.  Online througput-competitive algorithm for multicast routing and admission control , 1998, SODA '98.

[20]  Yossi Azar,et al.  Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[21]  Lisa Zhang,et al.  Fast, Fair and Frugal Bandwidth Allocation in ATM Networks , 1999, SODA '99.

[22]  Ashish Goel,et al.  Combining Fairness with Throughput: Online Routing with Multiple Objectives , 2001, J. Comput. Syst. Sci..

[23]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[24]  Rajmohan Rajaraman,et al.  Placement Algorithms for Hierarchical Cooperative Caching , 2001, J. Algorithms.

[25]  Amit Kumar,et al.  Fairness measures for resource allocation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[26]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 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).

[27]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[28]  Sudipto Guha,et al.  Improved algorithms for fault tolerant facility location , 2001, SODA '01.

[29]  Andrew V. Goldberg,et al.  An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow , 1998, IPCO.

[30]  Adam Meyerson,et al.  Online facility location , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[31]  Sudipto Guha,et al.  Hierarchical placement and network design problems , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[32]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.