A traffic engineering approach for placement and selection of network services

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1793-1801

  Cohen, Reuven ^a   Nakibly, Gabi ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GATEWAYS (COMPUTER NETWORKS); PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SERVICES;

GATEWAY PLACEMENT; SERVICE GATEWAYS; TRAFFIC FLOW ROUTES;

TELECOMMUNICATION TRAFFIC;

EID: 34548364117     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.209     Document Type: Conference Paper

References (33)

1. S. Choi and Y. Shavitt, "Proxy location problems and their generalizations," in International Workshop on New Advances of Web Server and Proxy Technologies, Providence, RI, USA, May 2003.
2. R. Cohen and D. Raz, "The Internet dark matter - on the missing links in the AS connectivity map," in Proceedings of IEEE INFOCOM, 2006.
3. R. S. H. P. B. Danzig and M. F. Schwartz, "A case for caching file objects inside internetworks," in Proceedings of the ACM SIGCOMM, San Francisco, CA, September 1993, pp. 239-248.
4. S. J. H. Jamjoom and K. Shin, "Self organizing network services," in University Michigan CSE-TR-407-99, 1999.
5. A. Heddaya and A. Mirdad, "Webwave: Globally load balanced fully distributed caching of hot published documents," in Proceedings of IEEE ICDCS, San Francisco, CA, May 1997, pp. 160-168.
6. S. Michel, "Adaptive web caching: Towards a new caching architecture," in Proceedings of 3rd International Caching Workshop, June 1998, pp. 2041-2046.
7. D. R. P. Krishnan and Y. Shavitt, "The cache location problem," in IEEE/ACM Transactions on Networking, vol. 8(5), October 2000, pp. 568-582.
8. R. Prasad and H. Wu, "Minimum-cost gateway deployment in cellular wi-fi networks," in IEEE Consumer Communications and Networking Conference, Las Vegas, 2006.
9. D. A. et. al., "Overview and principles of Internet traffic engineering," IETF RFC 3272, May 2002.
10. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, "Traffic matrix estimation: Existing techniques and new directions," in Proceedings of the ACM SIGCOMM, 2002.
11. Y. Vardi, "Network tomography: Estimating source-destination traffic intensities from link data," J. of the American Statistical Association, pp. 365-377, 1996.
12. B. L. et. al., "On the optimal placement of Web proxies in the Internet," in Proceedings of IEEE INFOCOM, March 1999, pp. 1282-1290.
13. X. J. et. al., "Optimal placement of proxies of replicated web servers in the Internet," in International Conference on Web Information Systems Engineering, 2000.
14. S. J. et. al., "Constrained mirror placement on the Internet," in Proceedings of IEEE INFOCOM, April 2001, pp. 31-40.
15. V. P. Lili Qiu and G. Voelker, "On the placement of web server replicas," in Proceedings of IEEE INFOCOM, vol. 3, 2001, pp. 1587-1596.
16. R. G. P. Radoslavov and D. Estrin, "Topology-informed Internet replicaplacement," in Proceedings of WCW, June 2001.
17. Y. Ahmad and U. Cetintemel, "Network-aware query processing for stream-based applications," in Proceeding of VLDB, 2004.
18. K. M. U. Srivastava and J. Widom, "Operator placement for in-network stream query processing," in Proceeding of PODS, 2005.
19. T. Nakano and T. Suda, "Self-organizing network services with evolutionary adaptation," in IEEE Transactions on Neural Networks, vol. 16(5), September 2005.
20. K. Papagiannaki, N. Taft, Z. Zhang, and C. Diot, "Long-term forecasting of Internet backbone traffic: Observations and initial models," in Proceedings of the IEEE INFOCOM, March 2003.
21. R. Cohen and G. Nakibly, "On the computational complexity and effectiveness of N-hub shortest path routing," in Proceedings of the IEEE INFOCOM, Honk Kong, March 2004.
22. R. M. Karp, "Online algorithms versus offline algorithms: How much is it worth to know the future?" International Computer Science Institute, Technical Report TR-92-044, 1992.
23. J.-H. Lin and J. S. Vitter, "e-approximations with minimum packing constraint violation," in Proceedings of the ACM Symposium on Theory of Computing, 1992, pp. 771-782.
24. Y. Azar and O. Regev, "Strongly polynomial algorithms for the unsplittable flow problem," in Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2001, pp. 15-29.
25. B. Awerbuch, Y. Azar, and S. Plotkin, "Throughput competitive online routing," in Proc. 34th IEEE Symp. on Found, of Comp. Science, 1993, pp. 32-40.
26. K. Kar, M. Kodialam, and T. Lakshman, "Minimum interference routing of bandwidth guaranteed tunnels with mpls traffic engineering applications," in Proceedings of IEEE INFOCOM, 2000.
27. S. Suri, M. Waldvogel, and P. Warkhede, "Profile based routing: A new framework for mpls traffic engineering," in Quality of Future Internet Services, Lecture Notes in Computer Science, vol. 2156, September 2001.
28. B. A.-L., A. R., and H. Jeong, "Scale-free characteristics of random networks: the topology of the world-wide web," in Physica A: Statistical Mechanics and its Applications, vol. 281, June 2006, pp. 69-77.
29. I. M. A. Medina, A. Lakhina and J. Byers, "BRITE: An approach to universal topology generation," in Proceedings of MASCOTS, 2001.
30. R. M. N. Spring and D. Wetherall, "Measuring ISP topologies with rocketfuel," in Proceedings of the ACM SIGCOMM, August 2002.
31. D. W R. Mahajan, N. Spring and T. Anderson, "Inferring link weights using end-to-end measurements," in In ACM SIGCOMM Internet Measurement Workshop (IMW), November 2002.
32. M. Berkelaar, "Lp_solve software," ftp.es.tue.nl/pub/lp.solve.
33. A. Srinivasan, Approximation Algorithms via Randomized Rounding: a Survey. Lectures on Approximation and Randomized Algorithms. PWN, Warszawa: Polish Scientific Publishers, 1999.