SCOPUS 정보 검색 플랫폼

Algorithmica (New York)

Volumn 43, Issue 1-2, 2005, Pages 113-131

Better alternatives to OSPF routing

(4) Fong, Jessica H a Gilbert, Anna C b Kannan, Sampath c Strauss, Martin J b

a Princeton University (United States)

b UNIVERSITY OF MICHIGAN (United States)

c UNIVERSITY OF PENNSYLVANIA (United States)

Author keywords

Intra domain routing; Network optimization; Shortest path routing

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); NETWORK PROTOCOLS; OPTIMIZATION; PROBLEM SOLVING; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

BROADCAST; INTRA-DOMAIN ROUTING; NETWORK OPTIMIZATION; SHORTEST PATH ROUTING;

ROUTERS;

EID: 23944498170 PISSN: 01784617 EISSN: None Source Type: Journal
DOI: 10.1007/s00453-005-1161-2 Document Type: Article

Times cited : (9)

References (10)

1
- 0031628724
- Adaptive packet routing for bursty adversarial traffic
- New York
- W. Aiello, E. Kushilevitz, R. Ostrovsky, and A. Rosen. Adaptive packet routing for bursty adversarial traffic. In Proceedings of the 30th ACM Symposium on Theory of Computing (STOC), pages 359-368, New York, 1998.
- (1998) Proceedings of the 30th ACM Symposium on Theory of Computing (STOC) , pp. 359-368
- Aiello, W.¹ Kushilevitz, E.² Ostrovsky, R.³ Rosen, A.⁴

2
- 0032665673
- Randomized distance-vector routing protocol
- San Antonio, TX
- S. Bak and J. A. Cobb. Randomized distance-vector routing protocol. In Proceedings of the ACM Symposium on Applied Computing (SAC), pages 78-84, San Antonio, TX, 1999.
- (1999) Proceedings of the ACM Symposium on Applied Computing (SAC) , pp. 78-84
- Bak, S.¹ Cobb, J.A.²

3
- 39049137631
- Cisco. Configuring OSPF. http://www.cisco.com/univercd/cc/td/doc/product/software/ios113ed/113ed_cr/ np1_c/1cospf.htm, 1997.
- (1997) Configuring OSPF

4
- 0033873349
- Internet traffic engineering by optimizing OSPF weights
- Los Alamitos, CA
- B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proceedings of the 19th INFOCOM, volume 2, pages 519-528, Los Alamitos, CA, 2000.
- (2000) Proceedings of the 19th INFOCOM , vol.2 , pp. 519-528
- Fortz, B.¹ Thorup, M.²

5
- 4444278382
- Increasing internet capacity using local search
- B. Fortz and M. Thorup. Increasing internet capacity using local search. Computational Optimization and Applications, 29(1) (2004), 13-48.
- (2004) Computational Optimization and Applications , vol.29 , Issue.1 , pp. 13-48
- Fortz, B.¹ Thorup, M.²

6
- 0039551804
- Fast algorithms for convex quadratic programming and multicommodity flows
- New York
- S. Kapoor and P. Vaidya. Fast algorithms for convex quadratic programming and multicommodity flows. In Proceedings of the 18th ACM Symposium on Theory of Computing (STOC), pages 147-159, New York, 1986.
- (1986) Proceedings of the 18th ACM Symposium on Theory of Computing (STOC) , pp. 147-159
- Kapoor, S.¹ Vaidya, P.²

7
- 0003276078
- OSPF version 2
- April
- J. Moy. OSPF version 2. http://search.ietf.org/rfc/rfc2328.txt, April 1998. IETF RFC 2328.
- (1998) IETF RFC , vol.2328
- Moy, J.¹

8
- 85025263656
- Universal schemes for parallel communication
- Milwaukee, WI
- L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proceedings of the 13th ACM Symposium on Theory of Computing (STOC), pages 263-277, Milwaukee, WI, 1981.
- (1981) Proceedings of the 13th ACM Symposium on Theory of Computing (STOC) , pp. 263-277
- Valiant, L.G.¹ Brebner, G.J.²

9
- 0004121799
- C. Villamizar. OSPF Optimized Multipath. http://fictitious.org/ospf-omp/ospf-omp.html.
- OSPF Optimized Multipath
- Villamizar, C.¹

10
- 84974749577
- Shortest path first with emergency exits
- Z. Wang and J. Crowcroft. Shortest Path First with Emergency Exits. Computer Communication Review, 20(4) (1990), 166-176.
- (1990) Computer Communication Review , vol.20 , Issue.4 , pp. 166-176
- Wang, Z.¹ Crowcroft, J.²

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