Optimal and near optimal web proxy placement algorithms for networks with planar graph topologies

Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003

Volumn , Issue , 2003, Pages 911-914

  Taha, A E M ^a   Kamal, A E ^b  

^a QUEEN S UNIVERSITY   (Canada)

^b Iowa State University   (United States)

Author keywords

Computer networks; Costs; Degradation; Dynamic programming; Internet; Linear programming; Minimax techniques; Network topology; Routing; Tree graphs

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER PROGRAMMING; COMPUTER SYSTEMS PROGRAMMING; COSTS; DEGRADATION; DISTRIBUTED PARAMETER NETWORKS; DYNAMIC PROGRAMMING; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; GRAPHIC METHODS; INTERNET; INTERNET SERVICE PROVIDERS; LINEAR PROGRAMMING; OPTIMIZATION; PROXY CACHES; TOPOLOGY; TREES (MATHEMATICS);

GENERAL TOPOLOGY; MESH TOPOLOGIES; MINIMAX TECHNIQUES; NETWORK TOPOLOGY; OPTIMAL PLACEMENTS; REFINEMENT STRATEGY; ROUTING; TREE GRAPH;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84865641797     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCSW.2003.1203667     Document Type: Conference Paper

References (6)

1. M. Chrobak and T. H. Payne, "A linear-time algorithm for drawing a planar graph on a grid", Info. Proc. Letters, Vol. 54, No. 4, pp. 241-246, 1995.
2. E. Cronin et al., Constrained Mirror Placement on the Internet, IEEE Journal on Selected Areas in Communications, Vol. 20, No. 7., pp. 1369-1382, 2002.
3. P. B. Danzig et al., A case for Caching File Objects Inside Internetworks, ACM Sigcomm, pp. 239-243, Sept. 1993.
4. A. E. Kamal and H. El-Rewini, On the Optimal Selection of Proxy Agents in Mobile Network Backbones, Proc. of Intl. Conf. on Parallel Processing, 2001.
5. P. Krishnan, D. Rax and Y. Shavitt, The Cache Location Problem, IEEE/ACM Transactions on Networking, pp. 568-582, VOL 8, Issue 5, 2000.
6. B. Li et al., On the Optimal Placement of Web Proxies in the Internet., Proc. of INFOCOM'99, March 1999.