SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Combinatorial Optimization

Volumn 6, Issue 3, 2002, Pages 299-333

A genetic algorithm for the weight setting problem in OSPF routing

(3) Ericsson, M a Resende, M G C b Pardalos, P M c

a ROYAL INSTITUTE OF TECHNOLOGY (Sweden)

b AT AND T LABS RESEARCH (United States)

c University of Florida (United States)

Author keywords

Genetic algorithm; Interact; Metaheuristics; OSPF routing; Path relinking

Indexed keywords

HEURISTIC METHODS; LINEAR PROGRAMMING; NETWORK PROTOCOLS; OPTIMIZATION; PACKET SWITCHING; PROBLEM SOLVING; TELECOMMUNICATION LINKS;

DATA PACKETS; METAHEURISTICS;

GENETIC ALGORITHMS;

EID: 0036722265 PISSN: 13826905 EISSN: None Source Type: Journal
DOI: 10.1023/A:1014852026591 Document Type: Article

Times cited : (243)

References (29)

1
- 0004115996
- Prentice Hall: Englewood Cliffs, NJ
- (1993) Network Flows
- Ahuja, R.K.¹ Magnanti, T.L.² Orlin, J.B.³

2
- 0004065895
- Requirements for traffic engineering over MPLS
- Network Working Group
- (1999) Technical Report RFC , vol.2702
- Awduche, D.O.¹ Malcolm, J.² Agogbua, J.³ O'Dell, M.⁴ McManus, J.⁵

3
- 0001096735
- Genetic algorithms and random keys for sequencing and optimization
- (1994) ORSA J. on Computing , vol.6 , pp. 154-160
- Bean, J.C.¹

4
- 0003738405
- Prentice Hall: Englewood Cliffs, NJ
- (2000) IP Routing Protocols, RIP, OSPF, BGP, PNNI & Cisco Routing Protocols
- Black, U.¹

5
- 0041594157
- Design of broadband virtual private networks: Model and heuristics for the B-WiN
- N. Dean, D.F. Hsu, and R. Ray (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, New Providence
- (2000) Robust Communication Networks: Interconnection and Survivability , vol.53 , pp. 1-16
- Bley, A.¹ Grötchel, M.² Wessläy, R.³

6
- 0000178416
- Modeling internet topology
- (1997) IEEE Communications Magazine , vol.35 , pp. 160-163
- Calvert, K.¹ Doar, M.² Zegura, E.W.³

7
- 39049137631
- Cisco Press
- (1997) Configuring OSPF

8
- 0001940342
- Internet growth: Is there a "Moore's Law" for data traffic?
- J. Abello, P.M. Pardalos, and M.G.C. Resende (Ed.). Kluwer Academic Publishers: Norwell, MA
- (2001) Handbook of Massive Data Sets , pp. 47-93
- Coffman, K.G.¹ Odlyzko, A.M.²

9
- 34147120474
- A note on two problems in connection of graphs
- (1959) Numerical Mathematics , vol.1 , pp. 269-271
- Dijkstra, E.¹

10
- 0033901740
- NetScope: Traffic engineering for IP networks
- (2000) IEEE Network Magazine , vol.14 , pp. 11-19
- Feldmann, A.¹ Greenberg, A.² Lund, C.³ Reingold, N.⁴ Rexford, J.⁵

11
- 0035360814
- Deriving traffic demands for operational IP networks: Methodology and experience
- (2001) IEEE/ACM Transactions on Networking , vol.9 , pp. 265-279
- Feldmann, A.¹ Greenberg, A.² Lund, C.³ Reingold, N.⁴ Rexford, J.⁵ True, F.⁶

12
- 0009736666
- Increasing internet capacity using local search
- Technical report, AT&T Labs Research, A preliminary short version of this paper published as "Internet Traffic Engineering by Optimizing OSPF weights", The Conference on Computer Communications
- (2000) Proc. IEEE INFOCOM 2000
- Fortz, B.¹ Thorup, M.²

13
- 0003722376
- Addison-Wesley: Reading, MA
- (1989) Genetic Algorithms in Search, Optimization, and Machine Learning
- Goldberg, D.E.¹

14
- 0003463297
- MIT Press: Cambridge, MA
- (1975) Adaptation in Natural and Artificial Systems
- Holland, J.H.¹

15
- 0004013878
- Ph.D. thesis, University of Michigan
- (1971) Artificial genetic adaptation in computer control systems
- Hollstein, R.B.¹

16
- 0004066011
- Ospf version 2
- Internet Engineering Task Force, Network Working Group
- (1994) Technical Report RFC , vol.1583

17
- 51249181779
- A new polynomial-time algorithm for linear programming
- (1984) Combinatorica , vol.4 , pp. 373-395
- Karmarkar, N.K.¹

18
- 0000769618
- A polynomial time algorithm for linear programming
- (1979) Dokl. Akad. Nauk SSSR , vol.244 , pp. 1093-1096
- Khachiyan, L.G.¹

19
- 0004074812
- Morgan Kaufmann: San Mateo, CA
- (1999) Genetic Programming III, Darwinian Invention and Problem Solving
- Koza, J.R.¹ Bennett F.H. III² Andre, D.³ Keane, M.A.⁴

20
- 0027189260
- Minimax open shortest path first routing algorithms in networks supporting the smds services
- (1993) Proc. IEEE International Conference on Communications (ICC) , vol.2 , pp. 666-670
- Lin, F.¹ Wang, J.²

21
- 0038569043
- Memetic algorithms
- P.M. Pardalos and M.G.C. Resende (Eds.), Oxford University Press: Oxford, UK
- (2001) Handbook of Applied Optimization
- Moscato, P.¹

22
- 0008971684
- OSPF protocol analysis
- Network Working Group
- (1991) Technical Report RFC , vol.1245
- Moy, J.T.¹

23
- 0004092955
- Addison-Wesley: Reading, MA
- (1998) OSPF, Anatomy of an Internet Routing Protocol
- Moy, J.T.¹

24
- 4243333278
- presented at International Telecommunication Symposium (ITS)
- (1994) Optimal routing in data networks
- Rodrigues, M.¹ Ramakrishnan, K.G.²

25
- 0003679221
- Prentice Hall: Englewood Cliffs, NJ
- (1998) High-Speed Networks TCP/IP and ATM Design Principles
- Stallings, W.¹

26
- 0009017964
- Cisco Press
- (1998) OSPF Network Design Solutions
- Thomas T.M. II¹

27
- 0024123493
- Routing of multipoint connections
- Special Issue on Broadband Packet Communication
- (1998) IEEE J. Selected Areas in Communications , vol.6 , pp. 1617-1622
- Waxman, B.M.¹

28
- 0009701856
- (1996) GT-ITM: Georgia Tech internetwork topology models (software)
- Zegura, E.W.¹

29
- 0029780013
- How to model an internetwork
- (1996) Proc. 15th IEEE Conf. on Computer Communications (INFOCOM) , pp. 594-602
- Zegura, E.W.¹ Calvert, K.L.² Bhattacharjee, S.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.