A traffic engineering approach for placement and selection of network services

IEEE/ACM Transactions on Networking

Volumn 17, Issue 2, 2009, Pages 487-500

  Cohen, Reuven ^a   Nakibly, Gabi ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b National EW Research Center   (Israel)

Author keywords

Load balancing; Network services; Routing; Traffic engineering

Indexed keywords

EFFECTIVE TOOLS; EFFICIENT ALGORITHMS; LOAD BALANCING; NETWORK SERVICES; PLACEMENT PROBLEMS; ROUTING; SERVICE GATEWAYS; SUB-PROBLEMS; TRAFFIC ENGINEERING; TRAFFIC FLOWS;

ENGINEERING; HIGHWAY ENGINEERING; NETWORK PERFORMANCE; SYSTEMS ENGINEERING; TRAFFIC CONTROL; TRAFFIC SURVEYS;

GATEWAYS (COMPUTER NETWORKS);

EID: 65549098599     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2014652     Document Type: Article

References (42)

1. S. Choi and Y. Shavitt, "Proxy location problems and their generalizations," in Proc. Int. Workshop New Advances of Web Server and Proxy Technologies, Providence, RI, May 2003, pp. 898-904.
2. P. B. Danzig, R. S. Hall, and M. F. Schwartz, "A case for caching file objects inside internetworks," in Proc. ACM SIGCOMM, San Francisco, CA, Sep. 1993, pp. 239-248.
3. H. Jamjoom, S. Jamin, and K. Shin, Self Organizing Network Services, 1999, University Michigan CSE-TR-407-99.
4. A. Heddaya and A. Mirdad, "Webwave: Globally load balanced fully distributed caching of hot published documents," in Proc. IEEE ICDCS San Francisco, CA, May 1997, pp. 160-168.
5. S. Michel, "Adaptive web caching: Towards a new caching architecture," in Proc. 3rd Int. Caching Workshop, Jun. 1998, pp. 2041-2046.
6. P. Krishnan and D. R. Shavitt, "The cache location problem," IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 568-582, Oct. 2000.
7. R. Prasad and H. Wu, "Minimum-cost gateway deployment in cellular WI-FI networks," in Proc. IEEE Consumer Commun. Netw. Conf., Las Vegas, NV, Jan. 2006, vol. 2, pp. 706-710.
8. D. Awduche et al., Overview and principles of Internet traffic engineering, IETF RFC 3272, May 2002.
9. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, "Traffic matrix estimation: Existing techniques and new directions," in Proc. ACM SIGCOMM, Pittsburgh, PA, Aug. 2002, pp. 161-174.
10. Y. Vardi, "Network tomography: Estimating source-destination traffic intensities from link data," J. Amer. Statistical Assoc., pp. 365-377, 1996.
11. B. Li et al., "On the optimal placement of Web proxies in the Internet," in Proc. IEEE INFOCOM, New York, NY, Mar. 1999, pp. 1282-1290.
12. X. Jia et al., "Optimal placement of proxies of replicated web servers in the Internet," in Proc. Int. Conf. Web Inf. Syst. Eng. Hong Kong, China, 2000, vol. 1, pp. 55-59.
13. S. Jamin et al., "Constrained mirror placement on the Internet," in Proc. IEEE INFOCOM, Anchorage, AK, Apr. 2001, pp. 31-40.
14. L. Qiu, V. Padmanabhan, and G. Voelker, "On the placement of web server replicas," in Proc. IEEE INFOCOM, Anchorage, AK, Apr. 2001, vol. 3, pp. 1587-1596.
15. P. Radoslavov, R. Govindan, and D. Estrin, "Topology-informed Internet replica placement," Comput. Commun., pp. 384-392, 2001.
16. Y. Ahmad and U. Cetintemel, "Network-aware query processing for stream-based applications," in Proc. VLDB, Toronto, Canada, Aug.-Sep. 2004, vol. 30, pp. 456-467.
17. U. Srivastava, K. Munagala, and J. Widom, "Operator placement for in-network stream query processing," in Proc. PODS, Baltimore, MD, Jun. 2005, pp. 250-258.
18. T. Nakano and T. Suda, "Self-organizing network services with evolutionary adaptation," IEEE Trans. Neural Netw., vol. 16, no. 5, pp. 1269-1278, Sep. 2005.
19. K. Papagiannaki, N. Taft, Z. Zhang, and C. Diot, "Long-term forecasting of Internet backbone traffic: Observations and initial models," in Proc. IEEE INFOCOM, San Francisco, CA, Mar. 2003.
20. Z. Jianping, L. Keqin, and W. Zhimei, "Selection algorithms for anycast relay routing," in IEEE Int. Conf. Perform., Comput. Commun., Phoenix, AZ, Apr. 2004, pp. 21-27.
21. Z. Fei, S. Bhattacharjee, E. W. Zegura, and M. H. Ammar, "A novel server selection technique for improving the response time of a replicated service," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 1998, pp. 783-791.
22. E. W. Zegura, M. H. Ammar, Z. Fei, and S. Bhattacharjee, "Application-layer anycasting: A server selection architecture and use in a replicated web service," IEEE/ACMTrans. Netw., vol. 8, no. 4, pp. 455-466, Aug. 2000.
23. Y. Hou et al., "On energy provisioning and relay node placement for wireless sensor networks," IEEE Trans. Wireless Commun., vol. 4, no. 5, pp. 2579-2590, Sep. 2005.
24. X. Kenan, H. Hassanein, and G. Takahara, "Relay node deployment strategies in heterogeneous wireless sensor networks: Multiple-hop communication case," in Proc. Sensor Ad Hoc Commun. Netw., Sep. 2005, pp. 575-585.
25. A. Kashyap, S. Fangting, and M. Shayman, "Relay placement for minimizing congestion in wireless backbone networks," in Proc. Wireless Commun. Netw. Conf., Apr. 2006, vol. 1, pp. 159-164.
26. R. Cohen and G. Nakibly, "On the computational complexity and effectiveness of N-hub shortest path routing," in Proc. IEEE INFOCOM Hong Kong, Mar. 2004.
27. R. M. Karp, Online Algorithms Versus Offline Algorithms: How Much is it Worth to Know the Future? International Computer Science Institute, 1992, Technical Report TR-92-044.
28. J. Lin and J. S. Vitter, "∈-approximations with minimum packing constraint violation," in Proc. ACM Symp. Theory Comput., Victoria, Canada, 1992, pp. 771-782.
29. Y. Azar and O. Regev, "Strongly polynomial algorithms for the unsplittable flow problem," in Proc. 8th Conf. IPCO, Utrecht, The Netherlands, 2001, pp. 15-29.
30. 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.
31. K. Kar, M. Kodialam, and T. Lakshman, :♂inimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications," in Proc. IEEE INFOCOM, Tel-Aviv, Israel, Mar. 2000, pp. 884-893.
32. S. Suri, M. Waldvogel, and P. Warkhede, "Profile based routing: A new framework for MPLS traffic engineering," Quality of Future Internet Services, Lecture Notes in Computer Science, vol. 2156, Sep. 2001.
33. A. Barabasi, R. Albert, and H. Jeong, "Scale-free characteristics of random networks: The topology of the world-wide web," Physica A: Statistical Mechanics and Its Applications, vol. 281, pp. 69-77, Jun. 2006.
34. A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: An approach to universal topology generation," in Proc. MASCOTS, Cincinnati, OH, Aug. 2001, pp. 346-356.
35. N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP topologies with rocketfuel," in Proc. ACMSIGCOMM, Pittsburgh, PA, Aug. 2002, pp. 133-145.
36. R. Mahajan, N. Spring, D.Wetherall, and T. Anderson, "Inferring link weights using end-to-end measurements," in Proc. ACM SIGCOMM IMW, Marseille, France, Nov. 2002, pp. 231-236.
37. M. Berkelaar, Lp_solve Software [Online].Available: Ftp.es.tue.nl/pub/ lp_solve
38. J. Kowalski and B.Warfield, "Modeling traffic demand between nodes in a telecommunications network," in Proc. ATNAC, 1995, pp. 95-116.
39. Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg, "Fast accurate computation of large-scale IP traffic matrices from link loads," in Proc. ACM SIGMETRICS, San Diego, CA, Jun. 2003, pp. 206-217.
40. D. Katz et al., Traffic Engineering (TE) Extensions to OSPF Version 2, IETF RFC 3630, Sep. 2003.
41. A. Srinivasan, Approximation Algorithms via Randomized Rounding: A Survey. Lectures on Approximation and Randomized Algorithms. Warszawa, PWN: Polish Scientific, 1999.
42. "Multiprotocol Label Switching Architecture (MPLS)," RFC 3031, Jan. 2001.