Results 11  20
of
41
Exploring the Tradeoff Between Label Size and Stack Depth in MPLS Routing
 in MPLS Routing. INFOCOM’03
, 2003
"... Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineering and to offer IP services like Virtual Private Networks (VPNs). In MPLS, the analysis of the packet (network layer) header ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineering and to offer IP services like Virtual Private Networks (VPNs). In MPLS, the analysis of the packet (network layer) header is performed just once, and each packet is assigned a stack of labels, which is examined by subsequent routers when making forwarding decisions.
Treedecompositions with bags of small diameter
, 2007
"... This paper deals with the length of a Robertson–Seymour’s treedecomposition. The treelength of a graph is the largest distance between two vertices of a bag of a treedecomposition, minimized over all treedecompositions of the graph. The study of this invariant may be interesting in its own right ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
This paper deals with the length of a Robertson–Seymour’s treedecomposition. The treelength of a graph is the largest distance between two vertices of a bag of a treedecomposition, minimized over all treedecompositions of the graph. The study of this invariant may be interesting in its own right because the class of bounded treelength graphs includes (but is not reduced to) bounded chordality graphs (like interval graphs, permutation graphs, ATfree graphs, etc.). For instance, we show that the treelength of any outerplanar graph is ⌈k/3⌉, where k is the chordality of the graph, and we compute the treelength of meshes. More fundamentally we show that any algorithm computing a treedecomposition approximating the treewidth (or the treelength) of an nvertex graph by a factor α or less does not give an αapproximation of the treelength (resp. the treewidth) unless if α = Ω(n 1/5). We complete these results presenting several polynomial time constant approximate algorithms for the treelength. The introduction of this parameter is motivated by the design of compact distance labeling, compact routing tables with nearoptimal route length, and by the construction of sparse additive spanners.
Abouzeid, “Routing in adhoc networks: A theoretical framework with practical implications
 in Proceedings IEEE Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM
, 2005
"... Abstract — In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a twolevel hierarchical ad hoc network. Several entropy measures are introduced and used to bound the memory size ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
Abstract — In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a twolevel hierarchical ad hoc network. Several entropy measures are introduced and used to bound the memory size necessary for the storage of the routing tables. The entropy rates of the topology sequences are used to bound the communication routing overhead both the interior routing overhead within a cluster and the exterior routing overhead across clusters. A scalability analysis of the routing overheads with regard to the number of nodes and number of clusters is provided under three different network scaling modes. Finally, practical design issues are studied by providing the optimal numbers of clusters that asymptotically minimize (i) the memory requirement for each cluster head; (ii) the total control message routing overhead. I.
Optimal scalefree compact routing schemes in doubling networks
 In ACMSIAM symposium on Discrete algorithms
, 2007
"... We consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 α balls of half radius. There are two variants of routing scheme design: (i) labeled (namedependent) routing, wh ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 α balls of half radius. There are two variants of routing scheme design: (i) labeled (namedependent) routing, where the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, e.g. topological information; and (ii) nameindependent routing, which works on top of the arbitrary original node names in the network, i.e. the node names are independent of the routing scheme. In this paper, given any constant ǫ ∈ (0, 1), and an nnode weighted network of low doubling dimension α ∈ O(loglog n), we present • A (1+ǫ)stretch labeled compact routing scheme with ⌈log n⌉bit routing labels, O(log 2 � n/log log n)bit packet headers, andbit routing information at each node; ( 1 ǫ)O(α) log 3 n • A (9 + ǫ)stretch nameindependent compact routing scheme with O(log 2 � n/log log n)bit packet headers, andbit routing information at each node. ( 1 ǫ)O(α) log 3 n In addition, we also prove a lower bound: any nameindependent routing scheme with o(n (ǫ/60)2) bits of storage at each node has stretch no less than 9 −ǫ, for any ǫ ∈ (0, 8). Therefore our nameindependent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scalefree in the sense that their space requirements do not depend on the normalized diameter ∆ of the network. We also present a simpler nonscalefree (9 + ǫ)stretch nameindependent compact routing scheme with improved space requirements if ∆ is polynomial in n. 1
Compact roundtrip routing with topologyindependent node names
 In Proceedings of the TwentySecond Annual Symposium on Principles of Distributed Computing
, 2003
"... This paper presents compact roundtrip routing schemes with local tables of size Õ( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tables of size Õ(ǫ−1 n 2/k) and stretch min((2 k/2 − 1)(k + ǫ),16k 2 + 8k − 8), for any directed network with polynomiallysized ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
This paper presents compact roundtrip routing schemes with local tables of size Õ( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tables of size Õ(ǫ−1 n 2/k) and stretch min((2 k/2 − 1)(k + ǫ),16k 2 + 8k − 8), for any directed network with polynomiallysized edges, both in the topologyindependent nodename model. 1 These are the first topologyindependent results that apply to routing in directed networks.
Geometric routing without geometry
 in 12th Colloquium on Structural Information and Communication Complexity. MontStMichel
, 2005
"... In this paper we propose a new routing paradigm, called pseudogeometric routing. In pseudogeometric routing, each node u of a network of computing elements is assigned a pseudo coordinate composed of the graph (hop) distances from u to a set of designated nodes (the anchors) in the network. On the ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
In this paper we propose a new routing paradigm, called pseudogeometric routing. In pseudogeometric routing, each node u of a network of computing elements is assigned a pseudo coordinate composed of the graph (hop) distances from u to a set of designated nodes (the anchors) in the network. On theses pseudo coordinates we employ greedy geometric routing. Almost as a side effect, pseudogeometric routing is not restricted to planar unit disk graph networks anymore, but succeeds on general networks. 1
Interval Routing in Reliability Networks
, 2003
"... In this paper we consider routing with compact tables in reliability networks. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In this paper we consider routing with compact tables in reliability networks.
The workshop on Internet topology (WIT) report
 Computer Communication Review
"... Internet topology analysis has recently experienced a surge of interest in computer science, physics, and the mathematical sciences. However, researchers from these different disciplines tend to approach the same problem from different angles. As a result, the field of Internet topology analysis and ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Internet topology analysis has recently experienced a surge of interest in computer science, physics, and the mathematical sciences. However, researchers from these different disciplines tend to approach the same problem from different angles. As a result, the field of Internet topology analysis and modeling must untangle sets of inconsistent findings, conflicting claims, and contradicting statements. On May 1012, 2006, CAIDA hosted the Workshop on Internet topology (WIT). By bringing together a group of researchers spanning the areas of computer science, physics, and the mathematical sciences, the workshop aimed to improve communication across these scientific disciplines, enable interdisciplinary crossfertilization, identify commonalities in the different approaches, promote synergy where it exists, and utilize the richness that results from exploring similar problems from multiple perspectives. This report describes the findings of the workshop, outlines a set of relevant open research problems identified by participants, and concludes with recommendations that can benefit all scientific communities interested in Internet topology research.
Improved Sparse Covers for Graphs Excluding a Fixed Minor
, 2007
"... We consider the construction of sparse covers for planar graphs and other graphs that exclude a fixed minor. We present an algorithm that gives a cover for the γneighborhood of each node. For planar graphs, the cover has radius no more than 24γ − 8 and degree (maximum cluster overlap) no more than ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We consider the construction of sparse covers for planar graphs and other graphs that exclude a fixed minor. We present an algorithm that gives a cover for the γneighborhood of each node. For planar graphs, the cover has radius no more than 24γ − 8 and degree (maximum cluster overlap) no more than 30. The radius and degree are optimal up to constant factors. For every n node graph that excludes a fixed minor, we present an algorithm that yields a cover with radius no more than 4γ and degree O(log n). This is a significant improvement over previous results for planar graphs and for graphs excluding a fixed minor; in order to obtain clusters with radius of O(γ), it was required to have degree polynomial in n. Since sparse covers have many applications in distributed computing, including compact routing, distributed directories and synchronizers, our improved cover construction results in improved algorithms for all these problems, for the class of minorfree graphs.