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

메뉴 건너뛰기

Distributed Computing

Volumn 14, Issue 4, 2001, Pages 217-229

Interval routing schemes allow broadcasting with linear message-complexity

(3) Fraigniaud, Pierre a Gavoille, Cyril b Mans, Bernard c

a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur (France)

b UNIVERSITÉ BORDEAUX 1 (France)

c MACQUARIE UNIVERSITY (Australia)

Author keywords

Broadcasting; Compact routing; Distributed computing; Interval routing

Indexed keywords

BROADCASTING; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; THEOREM PROVING;

INTERVAL ROUTING SCHEMES;

ROUTERS;

EID: 0035661980 PISSN: 01782770 EISSN: None Source Type: Journal
DOI: 10.1007/s004460100058 Document Type: Article

Times cited : (6)

References (28)

1
- 0032108019
- Optimal broadcast with partial knowledge
- (1998) SIAM J Comput , vol.28 , Issue.2 , pp. 511-524
- Awerbuch, B.¹ Cidon, I.² Kutten, S.³ Mansour, Y.⁴ Peleg, D.⁵

2
- 0025419377
- A tradeoff between information and communication in broadcast protocols
- (1990) Journal of the ACM , vol.37 , Issue.2 , pp. 238-256
- Awerbuch, B.¹ Goldreich, O.² Peleg, D.³ Vainish, R.⁴

3
- 0031645386
- Multicasting in heterogeneous networks
- (1998) 30th ACM Symposium on Theory of Computing (STOC '98) , pp. 448-453
- Bar-Noy, A.¹ Guha, S.² Naor, J.³ Schieber, B.⁴

4
- 0007515148
- Thy neighbor's interval is greener: A proposal for exploiting interval routing schemes
- Carleton Scientific
- (1998) 5th International Colloquium on Structural Information and Communication Complexity (SIROCCO '98) , pp. 214-228
- De la Torre, P.¹ Naranayan, L.² Peleg, D.³

5
- 84958063061
- The impact of knowledge on broadcasting time in radio networks
- th Annual European Symposium on Algorithms (ESA), Berlin Heidelberg New York: Springer
- (1999) Lectures Notes in Computer Science , vol.1643 , pp. 41-52
- Diks, K.¹ Kranakis, E.² Krizanc, D.³ Pelc, A.⁴

6
- 0007556188
- Manuscript
- (1997) Broadcast in linear messages in 1RS representing all shortest paths
- Eilam, T.¹ Peleg, D.² Tan, R.³ Zaks, S.⁴

7
- 84947920559
- The complexity of interval routing on random graphs
- th International Symposium on Mathematical Foundations of Computer Sciences (MFCS), Berlin Heidelberg New York: Springer
- (1995) Lecture Notes in Computer Science , vol.969 , pp. 37-49
- Flammini, M.¹ Van Leeuwen, J.² Marchetti-Spaccamela, A.³

8
- 0039394291
- Sense of direction: Definitions, properties and classes
- (1998) Networks , vol.32 , pp. 165-180
- Flocchini, P.¹ Mans, B.² Santoro, N.³

9
- 0002613919
- On the impact of sense of direction on message complexity
- (1997) Inform Process Letters , vol.63 , Issue.1 , pp. 23-31
- Flocchini, P.¹ Mans, B.² Santoro, N.³

10
- 84947916547
- Sense of direction in distributed computing
- 12th International Symposium on Distributed Computing (DISC), Berlin Heidelberg New York: Springer
- (1998) Lecture Notes in Computer Science , vol.1499 , pp. 1-15
- Flocchini, P.¹ Mans, B.² Santoro, N.³

11
- 0001635205
- Interval routing schemes
- (1998) Algorithmica , vol.21 , pp. 155-182
- Fraigniaud, P.¹ Gavoille, C.²

12
- 0002675271
- Methods and problems of communication in usual networks
- (1994) Discrete Applied Mathematics , vol.53 , pp. 9-133
- Fraigniaud, P.¹ Lazard, E.²

13
- 0009108514
- Searching among intervals and compact routing tables
- th International Colloquium on Automata, Languages and Programming (ICALP), Berlin Heidelberg New York: Springer
- (1993) Lecture Notes in Computer Science , vol.700 , pp. 28-39
- Frederickson, G.¹

14
- 0022877554
- Seperator-based strategies for efficient message routing
- (1986) th Symposium on Foundations of Computer Science (FOCS) , pp. 428-437
- Frederickson, G.¹ Janardan, R.²

15
- 3743052727
- Designing networks with compact routing tables
- (1988) Algorithmica , vol.3 , pp. 171-190
- Frederickson, G.¹ Janardan, R.²

16
- 84976831429
- A distributed algorithm for minimal spanning tree
- (1983) ACM Trans Program Lang Syst , vol.5 , Issue.1 , pp. 66-77
- Gallager, G.¹ Humblet, P.² Spira, P.³

17
- 0000783882
- A survey on interval routing
- (2000) Theor Comput Sci , vol.245 , Issue.2 , pp. 217-253
- Gavoille, C.¹

18
- 0002845131
- Worst case bounds for shortest path interval routing
- (1998) J Algorithms , vol.27 , pp. 1-25
- Gavoille, C.¹ Guévremont, E.²

19
- 84862478303
- Compact routing tables for graphs of bounded genus
- th International Colloquium on Automata, Languages and Programming (ICALP), Berlin Heidelberg New York: Springer
- (1999) Lecture Notes in Computer Science , vol.1644 , pp. 351-360
- Gavoille, C.¹ Hanusse, N.²

20
- 0001538805
- The compactness of interval routing
- (1999) SIAM J Discrete Math , vol.12 , Issue.4 , pp. 459-473
- Gavoille, C.¹ Peleg, D.²

21
- 0029712671
- Memory requirement for routing in distributed networks
- (1996) th Annual ACM Symposium on Principles of Distributed Computing (PODC) , pp. 125-133
- Gavoille, C.¹ Pérennès, S.²

22
- 84986959281
- A survey of gossiping and broadcasting in communication networks
- (1986) Networks , vol.18 , pp. 319-349
- Hedetniemi, S.M.¹ Hedetniemi, S.T.² Liestman, A.³

23
- 84948130147
- Lower bounds for compact routing
- th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Berlin Heidelberg New York: Springer
- (1996) Lecture Notes in Computer Science , vol.1046 , pp. 529-540
- Kranakis, E.¹ Krizanc, D.²

24
- 84948131046
- On multi-label linear interval routing schemes
- th International Workshop on Graph Theoretic Concepts in Computer Science (WG), Berlin Heidelberg New York: Springer
- (1993) Lecture Notes in Computer Science , vol.790 , pp. 338-349
- Kranakis, E.¹ Krizanc, D.² Ravi, S.³

25
- 0025209115
- A modular technique for the design of efficient distributed leader finding algorithms
- (1990) ACM Trans on Program Lang Syst , vol.12 , Issue.1 , pp. 84-101
- Korach, E.¹ Kutten, S.² Moran, S.³

26
- 0024701852
- A trade-off between space and efficiency for routing tables
- (1989) J ACM , vol.36 , Issue.3 , pp. 510-530
- Peleg, D.¹ Upfal, E.²

27
- 0022013653
- Labelling and implicit routing in networks
- (1985) The Computer Journal , vol.28 , Issue.1 , pp. 5-8
- Santoro, N.¹ Khatib, R.²

28
- 0023400167
- Interval routing
- (1987) The Computer Journal , vol.30 , Issue.4 , pp. 298-307
- Van Leeuwen, J.¹ Tan, R.²

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