skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension

Abstract

In this work, 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 (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names are independent of the routing scheme. In this article, given any constant ε ϵ (0, 1) and an n-node edge-weighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)-stretch labeled compact routing scheme with Γlog n-bit routing labels, O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node; —a (9 + ε)-stretch name-independent compact routing scheme with O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o(n (ε/60)2) bitsmore » of storage at each node has stretch no less than 9 - ε for any ε ϵ (0, 8). Therefore, our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter Δ of the network. Finally, we also present a simpler nonscale-free (9 + ε)-stretch name-independent compact routing scheme with improved space requirements if Δ is polynomial in n.« less

Authors:
 [1];  [2];  [3]
  1. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
  2. Arizona State Univ., Tempe, AZ (United States)
  3. Google, Kirkland, WA (United States)
Publication Date:
Research Org.:
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1390021
Report Number(s):
LLNL-JRNL-738008
Journal ID: ISSN 1549-6325
Grant/Contract Number:
AC52-07NA27344
Resource Type:
Journal Article: Accepted Manuscript
Journal Name:
ACM Transactions on Algorithms
Additional Journal Information:
Journal Volume: 12; Journal Issue: 3; Journal ID: ISSN 1549-6325
Publisher:
Association for Computing Machinery
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; Scale free; labeled routing; name-independent routing; compact routing; doubling dimension

Citation Formats

Konjevod, Goran, Richa, Andréa W., and Xia, Donglin. Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension. United States: N. p., 2016. Web. doi:10.1145/2876055.
Konjevod, Goran, Richa, Andréa W., & Xia, Donglin. Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension. United States. doi:10.1145/2876055.
Konjevod, Goran, Richa, Andréa W., and Xia, Donglin. 2016. "Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension". United States. doi:10.1145/2876055. https://www.osti.gov/servlets/purl/1390021.
@article{osti_1390021,
title = {Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension},
author = {Konjevod, Goran and Richa, Andréa W. and Xia, Donglin},
abstractNote = {In this work, 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 (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names are independent of the routing scheme. In this article, given any constant ε ϵ (0, 1) and an n-node edge-weighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)-stretch labeled compact routing scheme with Γlog n-bit routing labels, O(log2 n/loglog n)-bit packet headers, and ((1/ε)O(α) log3 n)-bit routing information at each node; —a (9 + ε)-stretch name-independent compact routing scheme with O(log2 n/loglog n)-bit packet headers, and ((1/ε)O(α) log3 n)-bit routing information at each node. In addition, we prove a lower bound: any name-independent 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 name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter Δ of the network. Finally, we also present a simpler nonscale-free (9 + ε)-stretch name-independent compact routing scheme with improved space requirements if Δ is polynomial in n.},
doi = {10.1145/2876055},
journal = {ACM Transactions on Algorithms},
number = 3,
volume = 12,
place = {United States},
year = 2016,
month = 6
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record

Save / Share:
  • In this paper the authors give a generalized solution to the problem of conflict-free access of various templates of data of a matrix, when they are stored in memory units in a parallel processor. The important features of the method are: compact representation of a skewing scheme, simple address computation, use of self- routing schemes to set up the interconnection network, and a general framework for the study of skewing schemes. In the method, each template access of interest will be a linear permutation on the processor address. The linear permutation involved determines the types of templates accessible. For parallelmore » access of the most important templates, namely, row, column, main diagonal, and square blocks, the interconnection network needs to realize only the class of linear-complement permutations. It is known that with Benes or Omega as the interconnection network, one can efficiently self-route these permutations; this compares favorably with the schemes proposed by other researchers who assume that a cross bar is available for processor-memory interconnections. Hence, the approach given in the paper can be used to solve the data alignment problem for the existing parallel machines such as IBM RP3, Cedar multiprocessor, and NYU Ultracomputer. This is a generalized solution to the data skewing problem and encompasses the previous efforts by other researchers as special cases.« less
  • A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into groups of virtual channels. This method is used to develop deadlock-free routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.
  • In this paper, the authors present a conflict-free routing scheme for a class of parallel and distributed computing systems. The core of the proposed routing scheme is a quadtree communication structure. The quadtree structure suggests a general approach to mapping a class of parallel algorithms with intensive communication requirements for selecting data from many different sources and distributing data from a single source. By properly merging messages and efficiently replicating data, the quadtree structure can complete required communications in O(log/sub 4/M) parallel steps, where M is the network size. The authors also consider contraction and stretch of the quadtree structure,more » while retaining its conflict-free property. Contracted and stretched tree structures allow us to adaptively balance off computation and communication requirements for various parallel algorithms.« less
  • There have been many multistage interconnection networks proposed in the literature for interconnecting the processors that comprise large parallel processing systems. In this paper, the use of the augmented data manipulator and inverse augmented data manipulator multistage networks in the MIMD mode of operation is considered. A tag based routing scheme which allows distributed control of either network is proposed. Rerouting schemes that allow a message blocked by a busy or known faulty node in its present path to dynamically make use of a nonbusy node and continue, when possible, are described for both networks. Finally, a tag based broadcastingmore » scheme for the networks is introduced that allows one processor to send messages to a subset of the other processors. 24 references.« less
  • The dynamics of opinion formation in large groups of people is a complex nonlinear phenomenon whose investigation is just beginning. Both collective behavior and personal views play an important role in this mechanism. In the present work we mimic the dynamics of opinion formation of a group of agents, represented by two states 1, as a stochastic response of each agent to the opinion of his/her neighbors in the social network and to feedback from the average opinion of the whole. In the light of recent studies, a scale-free Barabsi-Albert network has been selected to simulate the topology of themore » interactions. A turbulent-like dynamics, characterized by an intermittent behavior, is observed for a certain range of the model parameters. The problem of uncertainty in decision taking is also addressed both from a topological point of view, using random and targeted removal of agents from the network, and by implementing a three-state model, where the third state, zero, is related to the information available to each agent. Finally, the results of the model are tested against the best known network of social interactions: the stock market. A time series of daily closures of the Dow-Jones index has been used as an indicator of the possible applicability of our model in the financial context. Good qualitative agreement is found.« less