Complexity P. FRAIGNIAUD Universit Paris Sud, France C. GAVOILLE Universit...  Home/Search
Context
Related
| lri.fr/~pierre/POSTSCRIP...sirocco98.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lri.fr/~pierre/...biblio_par_date (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper introduces a formal model for studying the complexity of routing in networks. The aim of this model is to capture both time complexity and space complexity. In particular, the model takes into account the input and output facilities of routers. A routing program is a RAM-program with five additional instructions that allow to handle incoming and outgoing headers, and input and output ports. One of these five additional instructions, called release, captures the possible use of... (Update)
Active bibliography (related documents): More All
0.5: Compact Routing Tables for Graphs of Bounded Genus - Gavoille, Hanusse (1999) (Correct)
0.4: Compass Routing on Geometric Networks - Kranakis, Singh, Urrutia (1999) (Correct)
0.3: Compact and Localized Distributed Data Structures - Gavoille, Peleg (2002) (Correct)
Similar documents based on text: More All
0.5: A Theoretical Model for Routing Complexity - Fraigniaud Universit (1998) (Correct)
0.2: The Compactness of Adaptive Routing Tables - Gavoille, Zemmari (Correct)
0.1: Interval Routing in Reliability Networks - Cyril Gavoille Universit (Correct)
BibTeX entry: (Update)
@misc{ universit-theoretical,
author = "Complexity Fraigniaud Universit",
title = "A Theoretical Model for Routing",
url = "citeseer.ist.psu.edu/614480.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - AHO, HOPCROFT et al. - 1974
981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - LEIGHTON - 1992
660 An Introduction to Kolmogorov Complexity and its Application.. - LI, VITNYI - 1993
82 Algorithms for finding patterns in strings (context) - AHO - 1990
66 A trade-off between space and efficiency for routing (context) - PELEG, UPFAL
39 Worst case bounds for shortest path interval routing - GAVOILLE, GUVREMONT - 1998
19 Lower bounds for compact routing (context) - KRANAKIS, KRIZANC - 1996
18 Improved routing strategies with succint tables (context) - AWERBUCH, BAR-NOY et al. - 1990
12 Universal routing schemes - FRAIGNIAUD, GAVOILLE - 1997
7 Space-efficient routing tables for almost all networks and t.. - BUHRMAN, HOEPMAN et al. - 1998
3 Boolean routing on Cayley networks - KRANAKIS, KRIZANC - 1996
1 Problems of graph theory concerning optimal design (context) - ERDS, GERENCSR et al. - 1970
1 Memory requirement for routing in distributed Annual ACMPODC (context) - GAVOILLE, PRENNS - 1996
1 New models and algorithms for future Annual ACM PODC (context) - CIDON, GOPAL et al. - 1988
Documents on the same site (http://www.lri.fr/~pierre/ma_biblio_par_date.html): More
A General Theory for Deadlock Avoidance in Wormhole-Routed.. - Fraigniaud (1998) (Correct)
Strategies for Path-Based Multicasting in Wormhole-Routed.. - Fleury, Fraigniaud (1997) (Correct)
Hierarchical Broadcast Networks - Fraigniaud (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC