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

메뉴 건너뛰기

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 11-20

Routing without flow control

(3) Busch, C a Herlihy, M a Wattenhofer, R a

a RENSSELAER POLYTECHNIC INSTITUTE (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA FLOW ANALYSIS; PACKET NETWORKS; TELECOMMUNICATION CONTROL; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

HOT-POTATO ROUTING;

ROUTERS;

EID: 0034824311 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: 10.1145/378580.378582 Document Type: Conference Paper

Times cited : (13)

References (25)

1
- 0025759523
- Multihop lightwave networks: A comparison of store-and-forward and hot-potato routing
- (1991) Proc. IEEE INFOCOM , pp. 10-19
- Acampora, A.S.¹ Shah, S.I.A.²

2
- 0027846495
- Fast deflection routing for packets and worms
- Ithaca, New York, USA, Aug.
- (1993) Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing , pp. 75-86
- Bar-Noy, A.¹ Raghavan, P.² Schieber, B.³ Tamaki, H.⁴

3
- 84939340871
- On distributed communications networks
- (1964) IEEE Transactions on Communications , pp. 1-9
- Baran, P.¹

4
- 0003224550
- Experimental evaluation of hot-potato routing algorithms on 2-dimensional processor arrays
- LNCS
- (2000) EUROPAR: Parallel Processing, 6th International EURO-PAR Conference
- Bartzis¹ Caragiannis² Kaklamanis³ Vergados⁴

5
- 0032351305
- Potential function analysis of greedy hot-potato routing
- Jan./Feb.
- (1998) Theory of Computing Systems , vol.31 , Issue.1 , pp. 41-61
- Ben-Dor, A.¹ Halevi, S.² Schuster, A.³

6
- 0029722958
- Adversarial queueing theory
- Philadelphia, Pennsylvania, 22-24 May
- (1996) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing , pp. 376-385
- Borodin, A.¹ Kleinberg, J.² Raghavan, P.³ Sudan, M.⁴ Williamson, D.P.⁵

7
- 0031166958
- Deterministic many-to-many hot potato routing
- June
- (1997) IEEE Transactions on Parallel and Distributed Systems , vol.8 , Issue.6 , pp. 587-596
- Borodin, A.¹ Rabani, Y.² Schieber, B.³

8
- 0029723164
- Dynamic deflection routing on arrays
- May
- (1996) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing , pp. 348-358
- Broder, A.¹ Upfal, E.²

9
- 0033706883
- Hard-potato routing
- May
- (2000) Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC'00) , pp. 278-285
- Busch, C.¹ Herlihy, M.² Wattenhofer, R.³

10
- 0033874263
- Randomized greedy hot-potato routing
- Jan.
- (2000) Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '00) , pp. 458-466
- Busch, C.¹ Herlihy, M.² Wattenhofer, R.³

11
- 0032687057
- Nonmonotonic phenomena in packet routing
- New York, May 1-4. ACM Press
- (1999) Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing , pp. 583-591
- Feige, U.¹

12
- 85018111393
- Exact analysis of hot-potato routing
- IEEE, editor, Pittsburgh, PN, Oct. IEEE Computer Society Press
- (1992) Proceedings of the 33rd Annual Symposium on Foundations of Computer Science , pp. 553-562
- Feige, U.¹ Raghavan, P.²

13
- 0003487026
- John Wiley and Sons
- (1998) Elements of Network Protocol Design
- Gouda, M.G.¹

14
- 0027283191
- Sharp approximate models of deflection routing
- Jan.
- (1993) IEEE Transactions on Communications , vol.41 , Issue.1 , pp. 210-223
- Greenberg, A.G.¹ Goodman, J.²

15
- 0004171454
- MIT press
- (1985) The Connection Machine
- Hillis, W.D.¹

16
- 0003571709
- Greedy dynamic routing on arrays
- Nov.
- (1998) Journal of Algorithms , vol.29 , Issue.2 , pp. 390-410
- Kahale, N.¹ Leighton, T.²

17
- 0002638581
- Hot-potato routing on processor arrays
- Velen, Germany, June 30-July 2, SIGACT and SIGARCH
- (1993) Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures , pp. 273-282
- Kaklamanis, C.¹ Krizanc, D.² Rao, S.³

18
- 0003706527
- Addison-Wesley, Reading, MA, USA
- (1997) An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
- Keshav, S.¹

19
- 0025623023
- Average case analysis of greedy routing algorithms on arrays
- A.-S. ACM-SIGARCH, editor, Island of Crete, Greece, July, ACM Press
- (1990) Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures , pp. 2-10
- Leighton, F.T.¹

20
- 0024862612
- Comparison of deflection and store and forward techniuques in the Manhattan street and shuffle exchange networks
- (1989) Proc. IEEE INFOCOM , pp. 800-809
- Maxemchuk, N.F.¹

21
- 0030415619
- Bounds on the greedy routing algorithm for array networks
- Dec.
- (1996) Journal of Computer and System Sciences , vol.53 , Issue.3 , pp. 317-327
- Mitzenmacher, M.¹

22
- 0032651224
- From static to dynamic routing: Efficient transformations of store-and-forward protocols
- New York, May 1-4. ACM Press
- (1999) Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing , pp. 215-224
- Scheideler, C.¹ Vöcking, B.²

23
- 0042060180
- The caltech mosaic C: An experimental, fine-grain multicomputer
- June. Keynote Speech
- (1992) 4th symp. on Parallel Algorithms and Architectures
- Seitz, C.L.¹

24
- 0001558043
- Architecture and applications of the HEP multiprocessor computer system
- SPIE
- (1981) Proc. Fourth Symp. Real Time Signal Processing IV , pp. 241-248
- Smith, B.¹

25
- 0028542840
- The efficiency of greedy routing in hypercubes and butterflies
- (1994) IEEETCOMM: IEEE Transactions on Communications , vol.42
- Stamoulis¹ Tsitsiklis²

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