Browse > Article

Survivable Network Design with Hop Limit Using Longest Shortcut Method  

Kwack, Sun-Jung (College of Electronics & Information, Kyunghee University)
Han, Chi-Geun (College of Electronics & Information, Kyunghee University)
Publication Information
IE interfaces / v.15, no.3, 2002 , pp. 247-255 More about this Journal
Abstract
For the recent multimedia service, the network should be fast, stable, and reliable. In order to provide reliability of the network, certain survivability of the network, which guarantees it's functions even though there is some failure on the network, should be satisfied. Also, for a pair of nodes on the network, there must be paths of which numbers of hops are within a certain limit for realtime service between them. In this paper, we propose a longest shortcut method for solving the survivable network design problems with hop limit. Through the computational results, we compare the efficiency of the method with an existing shortest shortcut method and find that the proposed method is more efficient than the shortest shortcut method.
Keywords
survivable Network; Hop; local search;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Herzberg, M. and Bye, S.J.(1994), An Optimal Spare-Capacity Assignment Model for Survivable Networks with Hop limits, GLOBECOM94, 1601-1606
2 Garey, M.R. and Johnson, D.S.(1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H.Freeman and Company New York, 214-218
3 Cardwell, R. H., Monma, C.L. and Wu,T. H. (1989), Computer-Aided Design Procedures for Survivable Fiber Communications, IEEE Journal on Selected Areas in Communication, 7(8),1188-1197
4 Modiano, E.and Narula-Tam, A. (2001), Designing Survivable Networks Using Effective Routing and Wavelength Assignment(RWA), Optical Fiber Communication Conference and Exhibit, 2001,2, TuG5-I-TuG5-3
5 Goemans, M. X. and Bertsimas, D. J.(1993), Survivable Networks, Linear Programming Relaxations and the Parsimonious Property, Mathematical Programming, 60(2),145-166
6 Chan, K S., Chan, S. and Ko, K T. (1998), Hop-limited handoff scheme for ATM-based broadband cellular networks, Electronics Letters, 34(1), 26-27
7 Jun, B. H, Han, C. G. (1999), A Heuristic Method for Design Problem of Survivable Network with Hop limits, Proceeding of The Fall conference, KICS, 20(2), 671-674
8 Lee, J. K (1996), Learning Algorithm by C(II), Sehwa Publishing Company
9 Sreiglirz, K, Weiner, P. and Kleitrnan, D.J. (1969), The Design of Minimum Cost Survivable Networks, IEEE Transaction on Circuit Theory, et-I6(4), 455-460
10 Perraju, T. S.(1999), An Agent Framework for Survivable Network Systems, Performance, Computing and Communications Conference, 1999 IEEE International, 469-475
11 Monma, C.I. and Shallcross, D. F.(1989), Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints, Operations Research, 37(4), 531-541
12 Oki, E. and Yamanka, N. (1995), A Recursive Matrix-Calculation Method for Disjoint Path Search with Hop Link Number Constraints, IEICE Transactions on Communication, E78-B(5), 769-774
13 Herzberg, M., Bye, S.J. and Utano, A.(1995), The Hop-limit Approach for Spare-Capacity Assignment in Survivable Networks, IEEE Transaction on Networking, 3(5), 775-784
14 Grorschel, M.and Monma, C. I. (1990), Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints, SIAM J. Disc. Math., 3(4),502-523