On the multidensity gateway location problem for a multilevel high speed internetwork

Computer Communications

Volumn 20, Issue 7, 1997, Pages 576-585

  Saha, Debashis ^a,c   Mukherjee, Amitava ^a,b  

^a JADAVPUR UNIVERSITY   (India)

^b PricewaterhouseCoopers Pvt Ltd India   (India)

^c INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Clustering; Computer network; Hierarchical structure; Internetwork; Multidensity gateways; Subgradient heuristic

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; HEURISTIC METHODS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; PERFORMANCE; TELECOMMUNICATION LINKS;

HIERARCHICAL STRUCTURE; MULTIDENSITY GATEWAYS; MULTILEVEL HIGH SPEED INTERNETWORK; SUBGRADIENT HEURISTIC;

INTERCONNECTION NETWORKS;

EID: 0031208165     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(97)00016-9     Document Type: Article

References (19)

1. C.A. Sunshine, Network interconnection and gateways, IEEE Journal Select. Areas Communication 8 (1) (1990) 4-11.
2. P.E. Green (Ed.), Computer Network Interconnection and Protocol Conversion, IEEE Reprint series, IEEE Press, 1988.
3. D. Saha, A. Mukherjee, Design of hierarchical computer communication networks under node/link failure constraints, Computer Communications 18 (1995) 871-875.
4. S. Narasimhan, H. Pirkul, Hierarchical concentrator location problem, Computer Commununications 15 (3) (1992) 185-191.
5. P. McGregor, D. Shen, Network design: An algorithm for access facility location problem, IEEE Trans. Communication 25 (1977).
6. G.M. Schneider, M.N. Zastrow, An algorithm for the design of multilevel concentrator networks, Comput Networks 6 (1982) 1-11.
7. V.K. Konangi, T. Aidja, C.R. Dhas, On the multilevl concentrator location problem for local access networks, in: Proc IEEE Globecom 1984, pp. 912-915.
8. M. Zitterbart, A.N. Tantawy, D.N. Serpanos, A high performance transparent bridge, IEEE/ACM Trans Networking 2 (4) (1994) 352-362.
9. B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, Journal of the ACM 30 (1983) 118-132.
10. H. Pirkul, S. Narasimhan, P. De, Locating concentrators for primary and secondary coverage in a computer communications network, IEEE Trans. Communication 36 (4) (1988) 450-58.
11. S. Sherkar, Fundamental design issues for the future Internet, IEEE Journal Select. Areas Communication 13 (7) (1995) 1176-1188.
12. E.W. Zegura, K.L. Calvert, S. Bhattacharjee, How to model an internetwork, in: Proc of INFOCOM'96, California, USA, 1996.
13. M.L. Fisher, An applications oriented guide to Lagrangean relaxation, Interfaces 15 (1985) 10-21.
14. H. Held, P. Wolfe, H.P. Crowder, Validation of subgradient optimization, Mathematical Programming 5 (1974) 62-68.
15. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
16. D. Saha, A. Mukherjee, S.K. Dutta, Capacity assignment in computer communication networks with reliable links, Computer Communications 17 (1994) 871-875.
17. A. Mirzaian, Lagrangean relaxation for the star-star concentrator location problem: Approximation algorithms and bounds, Networks (1985) 1-20.
18. D. Saha, A. Mukherjee, Some studies on the internetworking problem for connecting high speed local networks, Internal Report, JU, CSE, India, 1994.
19. C.H. Papadimitrian, The complexity of the capacitated tree problem, Networks 8 (1978) 217-230.