SCOPUS 정보 검색 플랫폼

Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998

Volumn , Issue , 1998, Pages 406-412

Routing through networks with hierarchical topology aggregation

(4) Awerbuch, B a Du, Y a Khan, B a Shavitt, Y b

a Johns Hopkins University (United States)

b LUCENT TECHNOLOGIES (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATION SCHEMES; AVERAGE NUMBERS; COMPUTATIONAL OVERHEADS; HIERARCHICAL TOPOLOGY; INTERNAL STRUCTURE; LINK-COST FUNCTION; MINIMUM SPANNING TREES; NETWORK THROUGHPUT;

COST FUNCTIONS;

EID: 85013308206 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: 10.1109/ISCC.1998.702556 Document Type: Conference Paper

Times cited : (17)

References (10)

1
- 0003645568
- Technical report, The ATM Forum technical committee, Mar. af-pnni-0055.000
- Private network-network interface specification version 1.0 (PNNI). Technical report, The ATM Forum technical committee, Mar. 1996. af-pnni-0055.000
- (1996) Private Network-network Interface Specification Version 1.0 (PNNI)

2
- 0039227987
- On sparse spanners of weighted graphs
- I. Althofer, G. Das, D. Dopkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Dis-crete and Computational Geometry, 9:81-100, 1993
- (1993) Dis-crete and Computational Geometry , vol.9 , pp. 81-100
- Althofer, I.¹ Das, G.² Dopkin, D.³ Joseph, D.⁴ Soares, J.⁵

3
- 0027883370
- Throughputcompetitive on-line routing
- Oct
- B. Awerbuch, Y. Azar, and S. Plotkin. Throughputcompetitive on-line routing. In 34th Annual IEEE Symposium on Foundations of Computer Science, pages 32-40, Oct. 1993
- (1993) 34th Annual IEEE Symposium on Foundations of Computer Science , pp. 32-40
- Awerbuch, B.¹ Azar, Y.² Plotkin, S.³

4
- 0002774548
- Technical Report 98-16, DIMACS, Mar
- B. Awerbuch, Y. Du, B. Khan, and Y. Shavitt. Routing through networks with hierarchical topology aggregation. Technical Report 98-16, DIMACS, Mar. 1998
- (1998) Routing Through Networks with Hierarchical Topology Aggregation
- Awerbuch, B.¹ Du, Y.² Khan, B.³ Shavitt, Y.⁴

5
- 85013621975
- Topology aggregation for directed graphs
- June
- B. Awerbuch and Y. Shavitt. Topology aggregation for directed graphs. In Third IEEE Symposium on Computers and Communications, June 1998
- (1998) Third IEEE Symposium on Computers and Communications
- Awerbuch, B.¹ Shavitt, Y.²

6
- 0030393774
- Probabilistic approximation of metric space and its algorithmic applications
- Oct
- Y. Bartal. Probabilistic approximation of metric space and its algorithmic applications. In 37th Annual IEEE Symposium on Foundations of Computer Science, Oct. 1996
- (1996) 37th Annual IEEE Symposium on Foundations of Computer Science
- Bartal, Y.¹

7
- 0003759638
- Feb. Internet Draft, Nimrod Working Group
- I. Castineyra, J. N. Chiappa, and M. Steenstrup. The nimrod routing architecture, Feb. 1996. Internet Draft, Nimrod Working Group
- (1996) The Nimrod Routing Architecture
- Castineyra, I.¹ Chiappa, J.N.² Steenstrup, M.³

8
- 0002499613
- Graph spanners
- D. Peleg and A. A. Schafer. Graph spanners. Journal of Graph Theory, 13(1):99-116, 1989
- (1989) Journal of Graph Theory , vol.13 , Issue.1 , pp. 99-116
- Peleg, D.¹ Schafer, A.A.²

9
- 33745594334
- A tradeo between space and efficiency for routing tables
- May
- D. Peleg and E. Upfal. A tradeo between space and efficiency for routing tables. In 20th ACM Symposium on the Theory of Computing, pages 43-52, May 1988
- (1988) 20th ACM Symposium on the Theory of Computing , pp. 43-52
- Peleg, D.¹ Upfal, E.²

10
- 0024123493
- Routing of multipoint connections
- B. M. Waxman. Routing of multipoint connections. Journal on Selected Areas in Communications, 6:1617-1622, 1988
- (1988) Journal on Selected Areas in Communications , vol.6 , pp. 1617-1622
- Waxman, B.M.¹

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