A two-tier framework for transmission-cost minimization of high-performance communication applications

Concurrency and Computation: Practice and Experience

Volumn 24, Issue 4, 2012, Pages 383-395

  Hu, Chia Cheng ^a   Lai, Chin Feng ^b   Huang, Yueh Min ^b   Chao, Han Chieh ^c,d  

^a Chinese Naval Academy Kaohsiung   (Taiwan)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^c NATIONAL ILAN UNIVERSITY   (Taiwan)

^d NATIONAL DONG HWA UNIVERSITY   (Taiwan)

Author keywords

facility location problem; high performance network; integer programming; two tier

Indexed keywords

COMPUTATION THEORY; HEURISTIC ALGORITHMS; LOCATION; NONLINEAR PROGRAMMING;

BANDWIDTH OVERHEADS; FACILITY LOCATION PROBLEM; HIGH PERFORMANCE COMMUNICATION; HIGH PERFORMANCE NETWORKS; INTEGER LINEAR PROGRAMMING; LARGE-SCALE PROBLEM; TRANSMISSION COSTS; TWO TIERS;

INTEGER PROGRAMMING;

EID: 84863134376     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1610     Document Type: Conference Paper

References (32)

1. Walrand J, Varaiya P,. High-performance Communication Networks. Morgan Kaufmann: Los Altos, CA, 2000.
2. Cronin E, Jamin S, Jin C, Kurc AR, Raz D,. Constrained mirror placement on the internet. IEEE Journal on Selected Areas in Communications 2002; 20 (7): 1369-1382.
3. Choi S, Shavitt Y,. Proxy location problems and their generalizations. Proceedings of the International Conference on Distributed Computing Systems Workshops, Rhode Island, U.S.A., 2003; 898-904.
4. Chen Y, Katz RH, Kubatowicz JD,. Dynamic replica placement for scalable content delivery. Proceedings of the International Workshop on Peer-to-Peer Systems, Cambridge, MA, U.S.A., 2002; 306-318.
5. Cidon I, Kutten S, Soffer R,. Optimal allocation of electronic content. Computer Networks 2002; 20 (7): 1369-1382.
6. Krishnan P, Raz D, Shavitt Y,. The cache location problem. IEEE/ACM Transaction on Networking 2000; 8 (5): 568-582. (Pubitemid 33777796)
7. Byun S-S, Yoo C,. Proxy location for minimizing delivery delay in HRM networks. Computer Communications 2007; 30: 2162-2171. (Pubitemid 47103206)
8. Choi S, Shavitt Y,. Placing servers for session-oriented services. Technical Report, WUCS-01-41, Department of Computer Science, 2001.
9. Krivitski D, Schuster A, Wolff R,. A local facility location algorithm for large-scale distributed systems. Journal of Grid Computing 2007; 5: 361-378. (Pubitemid 47603662)
10. Lin P, Ngo RH, Qiao C-M,. Minimum cost wireless broadband overlay network planning. International Symposium on a World of Wireless, Mobile and Multimedia Networks, New York, U.S.A., 2006.
11. Wang P-C, Chan C-T, Chen R-C, Chang H-Y,. A hierarchical FLP model for broadband networks. IEEE Communications Letters 2005; 9 (3): 282-282.
12. Kozat UC, Kondylis G, Ryu B, Marina MK,. Virtual dynamic backbone for mobile ad-hoc networks. Proceedings of the IEEE International Conference on Communications, Helsinki, Finland, vol. 1, 2001; 250-255. (Pubitemid 32797541)
13. Sinha P, Sivakumar R, Bhanghavan V,. CEDAR: A core-extraction distributed ad-hoc routing algorithm. IEEE Journal on Selected Areas in Communications 1999; 17: 1454-1465.
14. Sivakumar R, Das B, Bharghavan V,. Spine routing in ad-hoc networks. Cluster Computing 1998; 1 (2): 237-248. A special issue on mobile computing.
15. Jaikaeo C, Shen CC,. Adaptive backbone-based multicast for ad hoc networks. Proceedings of the IEEE International Conference on Communications, New York, U.S.A., vol. 5, 2002; 3149-3155. (Pubitemid 34632404)
16. Sinha P, Sivakumar R, Bhanghavan V,. MCEDAR: Multicast core-extraction distributed ad-hoc routing. Proceedings of the IEEE Wireless Communications and Networking Conference, New Orleans, LA, U.S.A., 1999; 1313-1317.
17. Hu C-C, Wu EH-K, Chen G-H,. Mobility-aware On-demand Global Hosts for Ad-hoc Multicast (Lecture Notes in Computer Science, vol. 3619). Springer: Berlin, 2005; 375-384.
18. Hu C-C, Wu EH-K, Chen G-H,. OGHAM: on-demand global hosts for mobile ad-hoc multicast services. Elsevier Ad Hoc Networks 2006; 4: 709-723. (Pubitemid 44224245)
19. McDonald AB, Znati T,. A mobility based framework for adaptive clustering in wireless ad-hoc networks. IEEE Journal on Selected Areas in Communications 1999; 17: 1466-1487.
20. Devarapalli V, Sidhu D,. MZR: A multicast protocol for mobile ad hoc networks. Proceedings of the IEEE International Conference on Communications, Helsinki, Finland, 2001; 3149-3155.
21. Hu C-C, Wu EH-K, Chen G-H,. Stable backbone hosts and stable multicast routes in ad-hoc networks. IEEE Transactions on Vehicular Technology 2009; 58 (9): 5020-5036.
22. Hu C-C,. Bandwidth-satisfied multicast trees in large-scale ad-hoc networks. ACM Wireless Networks 2010; 16 (3): 829-849.
23. Eisenbrand F, Grandoni F, Rothvoÿ T, Schäfer G,. Approximating connected facility location problems via random facility sampling and core detouring. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, U.S.A., 2008; 1174-1183.
24. Hasan MK, Jung H, Chwa K-Y,. Improved Approximation Algorithm for Connected Facility Location Problems (Lecture Notes in Computer Science, vol. 4616). Springer: Berlin, 2007; 311-322.
25. Swamy C, Kunar A,. Primal-dual algorithms for connected facility location problems. Algorithmica 2004; 40 (4): 245-269. (Pubitemid 40871640)
26. Charikar M, Guha S,. Improved combinatorial algorithm for capability location and K-media problems. Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York, U.S.A., 1999; 378-388. (Pubitemid 129306191)
27. Winston WL,. Introduction to Mathematical Programming: Applications and Algorithms. PWS-Kent: Boston, 1991.
28. Wolsey LA,. Integer Programming. Wiley: New York, 1998.
29. Land A, Powell S,. Computer codes for problems of integer programming. Discrete Optimization II, Hammer PL, Johnson EL, Korte BH, (eds.). North-Holland: Amsterdam, 1979; 221-269.
30. Meyerson A,. Profit-earning facility location. Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, 2001; 30-36. (Pubitemid 32865715)
31. Lingo. Available at: [1 May 2009 ].
32. Network Simulator (Version 2). Available at: [1 May 2009 ].