SCOPUS 정보 검색 플랫폼

IEEE/ACM Transactions on Networking

Volumn 9, Issue 6, 2001, Pages 706-718

New dynamic SPT algorithm based on a ball-and-string model

(3) Narváez, Paolo a,b Siu, Kai Yeung b,c Tzeng, Hong Yi a,d

a IEEE (United States)

b Raza Foundries Inc (United States)

c MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

d NOKIA RESEARCH CENTER (United States)

Author keywords

Algorithms; Communication system routing; Graph theory; Graphs; Trees

Indexed keywords

BALL AND STRING MODEL; COMMUNICATION SYSTEM ROUTING; GATEWAY ROUTING PROTOCOLS; INTERNET SERVICE PROVIDERS; OPEN SHORTEST PATH FIRST PROTOCOL; SHORTEST PATH TREE;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; LINEAR PROGRAMMING; NETWORK PROTOCOLS; ROUTERS; TELECOMMUNICATION LINKS; TREES (MATHEMATICS);

INTERNET;

EID: 0035699585 PISSN: 10636692 EISSN: None Source Type: Journal
DOI: 10.1109/90.974525 Document Type: Article

Times cited : (84)

References (28)

1
- 0029307329
- Routing in multihop packet switching networks: Gb/s challenge
- May/June
- (1995) IEEE Network , vol.9 , pp. 38-61
- Baransel, C.¹ Dobosiewicz, W.² Gburzynski, P.³

2
- 0002610737
- On a routing problem
- (1958) Quarterly Appl. Mathemat. , vol.16 , pp. 87-90
- Bellman, R.¹

3
- 0003644881
- Cambridge, MA: MIT Press
- (1991) Linear Network Optimization: Algorithms and Codes
- Bertsekas, D.¹

4
- 84919181638
- Design of inter-administrative domain routing protocols
- Proc. SIGCOMM, Sept. 1990 , pp. 231-241
- Breslau, L.¹ Estrin, D.²

5
- 0004116989
- Introduction to Algorithms
- Cambridge, MA: The MIT Press
- (2001)
- Cormen, T.¹ Leiserson, C.² Rivest, R.³

6
- 0025430666
- Multicast routing in datagram internetworks and extended LANs
- May
- (1990) ACM Trans. Comput. Syst. , vol.8 , Issue.2 , pp. 85-110
- Deering, S.¹ Cheriton, D.²

7
- 84949673704
- Semi-dynamic shortest paths and breadth-first search in diagraph
- Proc. 14th Annu. Symp. Theoretical Aspects of Computer Science, Mar. 1997 , pp. 33-46
- Franciosa, P.¹ Frigioni, D.² Giaccio, R.³

8
- 84942799271
- Fully dynamic output bounded single source shortest path problem
- Proc. 7th ACM/SIAM Symp. Discrete Algorithms, Jan. 1996 , pp. 212-221
- Frigioni, D.¹ Marchetti-Spaccamela, A.² Nanni, U.³

9
- 85000444119
- Incremental algorithms for single-source shortest path trees
- Proc. Foundations of Software Technology and Theoretical Computer Science, Dec. 1994 , pp. 113-124
- Frigioni, D.¹ Marchetti-Spaccamela, A.² Nanni, U.³

10
- 0004154392
- Englewood Cliffs, NJ: Prentice-Hall
- (1995) Routing in the Internet
- Huitema, C.¹

11
- 38149143729
- Incremental algorithms for minimal length paths
- (1991) J. Algorithms , vol.12 , pp. 615-638
- Italiano, G.¹ Marchetti-Spaccamela, A.² Nanni, U.³

12
- 0019021284
- The new routing algorithm for the ARPANET
- May
- (1980) IEEE Trans. Commun. , vol.28 COM , pp. 711-719
- McQuillan, J.¹ Richer, I.² Rosen, E.³

13
- 0034466560
- New dynamic algorithms for shortest path tree computation
- Dec.
- (2000) IEEE Trans. Networking , vol.8
- Narvaez, P.¹ Siu, K.-Y.² Tzeng, H.-Y.³

14
- 85013974135
- Pitfalls in the design of distributed routing algorithms
- Aug.
- (1988) Proc. SIGCOMM , pp. 43-54
- Perlman, R.¹ Varghese, G.²

15
- 0001861997
- A comparison between two routing protocols: OSPF and IS-IS
- Sept.
- (1991) IEEE Network , vol.5 , pp. 18-24
- Perlman, R.¹

16
- 0030353548
- An incremental algorithm for a generalization of the shortest-path problem
- (1996) J. Algorithms , vol.21 , pp. 267-305
- Ramalingam, G.¹ Reps, T.²

17
- 0001355182
- On finding and updating spanning trees and shortest paths
- Sept.
- (1975) SIAM J. Computing , vol.4 , Issue.3 , pp. 375-380
- Spira, P.¹ Pan, A.²

18
- 0000402933
- Amortized computational complexity
- Apr.
- (1985) SIAM J. Algorithms and Discrete Methods , vol.6 , Issue.2 , pp. 306-318
- Tarjan, R.¹

19
- 0027646545
- Dynamic algorithms for shortest paths in planar graphs
- (1993) Theoretical Comput. Sci. , vol.116 , pp. 359-371
- Feuerstein, E.¹ Marchetti-Spaccamela, A.²

20
- 34147120474
- A note two problems in connection with graphs
- (1959) Numerical Mathemat. , vol.1 , pp. 269-271
- Dijkstra, E.¹

21
- 0030609301
- Internet routing instability
- Proc. SIGCOMM, Sept. 1997 , pp. 115-126
- Labovitz, C.¹ Malan, G.² Jahanian, F.³

22
- 0004066011
- Internet Draft, rfc 2178, July
- (1997) OSPF Version 2
- Moy, J.¹

23
- 0031247411
- End-to-end routing behavior in the internet
- Oct.
- (1997) IEEE/ACM Trans. Networking , vol.5 , pp. 601-615
- Paxson, V.¹

24
- 0008051758
- Applications of the border gateway protocol in the internet
- DDN Network Information Center, Chantilly, VA, RFC 1772, Mar.
- (1995)
- Rekhter, Y.¹ Gross, T.P.²

25
- 0019007260
- Routing techniques used in computer communication networks
- Apr.
- (1980) IEEE Trans. Commun. , vol.28 , pp. 539-552
- Schwartz, M.¹ Stern, T.²

26
- 0004128844
- M. Streenstrup, Ed.; Englewood Cliffs, NJ: Prentice-Hall
- (1995) Routing in Communications Networks

27
- 0003445767
- BGP-4 protocol analysis
- P. Traina, Ed.; DDN Network Information Center, Chantilly, VA, RFC 1774, Mar.
- (1995)

28
- 0008157171
- Random topology generator (RTG)
- Univ. of Southern California, Los Angeles, CA
- Wei, L.¹

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