Filters








18 Hits in 2.1 sec

Broadcasting in butterfly and deBruijn networks

Ralf Klasing, Burkhard Monien, Regine Peine, Elena A Stöhr
1994 Discrete Applied Mathematics  
In addition, the presented lower bound technique is used to derive non-trivial lower bounds for broadcasting in the deBruijn network of dimension m.  ...  In this paper, we present a new lower bound of 1.7417m for broadcasting in the butterfly network of dimension m. This improves the best known lower bound of 1.5621m.  ...  broadcasting in the butterfly network BF(m) in time 2m -1.  ... 
doi:10.1016/0166-218x(94)90184-8 fatcat:g65jnm6sbbbhbibtgo5a5qqncy

Author index

1994 Discrete Applied Mathematics  
Peine and E. Stiihr, Broadcasting in butterfly and deBruijn networks Konig, J.-C. and E. Lazard, Minimum k-broadcast graphs Kortsarz, G. and D.  ...  Feldmann MahCo, M. and J.-F. Sacli, Some minimum broadcast graphs Maheo, M. and J.-F. Sacle, Note on the problem of gossiping in mutlidimensional grids Michallon, P. and D.  ... 
doi:10.1016/0166-218x(94)90195-3 fatcat:tbqkxb4ey5hmjfu5c3ndqdsewe

An Overview of Structured P2P Overlay Networks [chapter]

Seif Haridi, Sameh El-Ansary
2005 Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks  
Other systems in the same category include the DeBruijn-based and the Butterfly-based DHTs and such systems offer a logarithmic path length.  ...  In that sense, it agrees with the conclusions of Koorde, Distance-Halving and Viceroy and shows a second way of building a Butterfly network.  ... 
doi:10.1201/9780203323687.ch39 fatcat:rz6c6ginb5dflaolyexagmbzvu

Algebraic Models for the Cube Connected Cycles and Shuffle Exchange Graphs

Meghanad D. Wagh, Khadidja Bendjilali
2011 2011 IEEE International Conference on High Performance Computing and Communications  
This paper exploits these techniques to find optimal paths in the CCC and to explore the relationships between the Cube Connected Cycles, the Shuffle Exchange and the deBruijn networks.  ...  Cube Connected Cycles (CCC) is an attractive interconnection network because of its symmetry, small constant node degree and a small diameter.  ...  Similar algebraic models developed previously for the deBruijn network [12] and the Wrapped Butterflies [2] have allowed efficient mappings of cycles and trees on the Butterflies and provided insights  ... 
doi:10.1109/hpcc.2011.17 dblp:conf/hpcc/WaghB11 fatcat:gr4cecztwvf6lauy37ng7dvtta

Architectures and Algorithms for Internet-Scale (p2p) Data Management [chapter]

Joseph M. Hellerstein
2004 Proceedings 2004 VLDB Conference  
It may not display correctly in other versions of PowerPoint. In particular, animations are often a problem.  ...  DHT in action Operation: take key as input; route messages to node holding key DHT in action: put() insert(K 1 ,V 1 ) Operation: take key as input; route messages to node holding key  ...  -Hypercube, Butterfly, DeBruijn, Chord, Pancake, etc  ... 
doi:10.1016/b978-012088469-8.50117-0 dblp:conf/vldb/Hellerstein04 fatcat:crwdutblwvh77i4tbgivwdkmki

Honeycomb networks: Topological properties and communication algorithms

I. Stojmenovic
1997 IEEE Transactions on Parallel and Distributed Systems  
Simple and optimal (in the number of required communication steps) routing, broadcasting, and semigroup computation algorithms are developed.  ...  In addition to honeycomb meshes bounded by a regular hexagon, we consider also honeycomb networks with rhombus and rectangle as the bounding polygons.  ...  ACKNOWLEDGMENTS The author is grateful to the referees whose careful reading has greatly improved the clarity and conciseness of the presentation, and to Professor Michael A.  ... 
doi:10.1109/71.629486 fatcat:thpowr3xnzdlfeacs6eskcnj6i

Towards Optimal Load Balancing Topologies [chapter]

Thomas Decker, Burkhard Monien, Robert Preis
2000 Lecture Notes in Computer Science  
A small flow volume and a small diameter of the graph keeps the time requirement of this phase low. We compare and propose several network topologies based on these measurements.  ...  Its time requirement depends on the maximum node degree and on the number of eigenvalues of the network. The second phase migrates the load according to this flow.  ...  We also considered the ¢ torus, the butterfly graph of dimension 4 and the DeBruijn graph of dimension 6. Several graphs can be expressed as a cartesian product like e. g.  ... 
doi:10.1007/3-540-44520-x_37 fatcat:753nmvt4qvgfhcjtxputwn4oqi

Optimal algorithms for dissemination of information in generalized communication modes

R. Feldmann, J. Hromkovič, S. Madhavapeddy, B. Monien, P. Mysliwietz
1994 Discrete Applied Mathematics  
the accumulation problem and the broadcast problem (i.e. for most networks the optimal algorithm for the gossip problem is simply the concatenation of optimal algorithms for accumulation and broadcasting  ...  For those networks in which a Hamiltonian path exists (hypercubes, cube connected cycles, butterflies, shuffle exchange, etc.) optimal algorithms can be obtained quite easily, but for complete binary trees  ...  all the networks which have a Hamiltonian path such as hypercubes (Q,,), cube connected cycles (CCC,), butterflies (BF,), De-Bruijn networks (DB,), shuffle exchange networks (SX(n)) (see [12] for a  ... 
doi:10.1016/0166-218x(94)90179-1 fatcat:yic5npkmdnbyfir27f3cslumzm

Optimal algorithms for dissemination of information in generalized communication modes [chapter]

R. Feldmann, J. Hromkovic, S. Madhavapeddy, B. Monien, P. Mysliwietz
1992 Lecture Notes in Computer Science  
the accumulation problem and the broadcast problem (i.e. for most networks the optimal algorithm for the gossip problem is simply the concatenation of optimal algorithms for accumulation and broadcasting  ...  For those networks in which a Hamiltonian path exists (hypercubes, cube connected cycles, butterflies, shuffle exchange, etc.) optimal algorithms can be obtained quite easily, but for complete binary trees  ...  all the networks which have a Hamiltonian path such as hypercubes (Q,,), cube connected cycles (CCC,), butterflies (BF,), De-Bruijn networks (DB,), shuffle exchange networks (SX(n)) (see [12] for a  ... 
doi:10.1007/3-540-55599-4_84 fatcat:64zeze37ivaj5d67tzedqqpysu

Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm

Laura Galluccio, Giacomo Morabito, Sergio Palazzo, Marco Pellegrini, M. Elena Renda, Paolo Santi
2007 Computer Networks  
Simulation results show that Georoy enables efficient and scalable search of resources and can be successfully used in wireless mesh community networks.  ...  To support resource exchange in these wireless mesh community networks, algorithms for efficient retrieval of information are required.  ...  For instance, CAN [15] routes along a hypercube, Chord [21] routes along a ring, Viceroy [12] is based on a butterfly network, Tapestry [8] uses a tree, and Koorde a DeBruijn graph [9] .  ... 
doi:10.1016/j.comnet.2006.09.017 fatcat:i2e6fujw35aflhe4akabu4wxim

A Survey on Area Planning for Heterogeneous Networks

V.Ceronmani Sharmila, George A
2013 International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks  
The basic network can be modelled in different structures to overcome the problems in handling the user density patterns, utilizing the available bandwidth effectively and improvising the efficiency.  ...  This paper deals with the survey of basic networks like Spidergon network and Honeycomb Torus network with respect to network cost.  ...  √ 3√ √ Hypercube log n log n log 2 n n/2 Cube Connected Cycles 3 O(log n) O(log n) O(n/log n) Butterfly 4 O(log n) O(log n) O(n/log n) DeBruijn 4 O(log n) O(log n) O(n/log n) In 2009 Woo-seo Ki et al  ... 
doi:10.5121/jgraphoc.2013.5102 fatcat:efov5wvmhbcgtduau7dirxq7q4

Hyper-butterfly network: a scalable optimally fault tolerant architecture

W. Shi, P.K. Srimani
Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing  
Bounded degree networks like deBruijn graphs or wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing nodes in the interconnection  ...  But, hyper-deBruijn networks are not regular, are not optimally fault tolerant and the optimal routing is relatively complex.  ...  The proposed graph seems to be an attractive alternative to the hyper-deBruijn networks [1] for designing multiprocessor networks.  ... 
doi:10.1109/ipps.1998.670008 dblp:conf/ipps/ShiS98 fatcat:kgy3cmn25rbifffj7sivmy5fhu

Always be Two Steps Ahead of Your Enemy [article]

Thorsten Götte, Vipin Ravindran Vijayalakshmi, Christian Scheideler
2021 arXiv   pre-print
We investigate the maintenance of overlay networks under massive churn, i.e. nodes joining and leaving the network.  ...  Other than that, we only have the provably minimal restriction that new nodes can only join the network via nodes that have taken part in the network for at least one round.  ...  Last, the SPARTAN framework presented in [3] probably bears the greatest resemblance with our work. In SPARTAN the nodes maintain a logical overlay resembling a butterfly network.  ... 
arXiv:1810.07077v2 fatcat:bjepdfhbwfhufn3bgi3kud667e

dBBlue

Wen-Zhan Song, Xiang-Yang Li, Yu Wang, Weizhao Wang
2003 Proceedings of the 2003 joint workshop on Foundations of mobile computing - DIALM-POMC '03  
We discuss in detail a vigorous method to locally update the structure dBBlue using at most Ç´ÐÓ Òµ communications when a node joins or leaves the network.  ...  most two piconets, and no node assumes both master and slave roles.  ...  Notice that the MACs of Ú¿ and Ú in the piconet mastered by node Ù are ¿ and respectively, which are used only by nodes in this piconet and not broadcasted to the network.  ... 
doi:10.1145/941079.941083 dblp:conf/dialm/SongLWW03 fatcat:7krqvhxhnvgclpwslm7cm2aj3e

dBBlue: low diameter and self-routing Bluetooth scatternet

Wen-Zhan Song, Xiang-Yang Li, Yu Wang, Weizhao Wang
2005 Journal of Parallel and Distributed Computing  
We discuss in detail a vigorous method to locally update the structure dBBlue using at most Ç´ÐÓ Òµ communications when a node joins or leaves the network.  ...  most two piconets, and no node assumes both master and slave roles.  ...  Notice that the MACs of Ú¿ and Ú in the piconet mastered by node Ù are ¿ and respectively, which are used only by nodes in this piconet and not broadcasted to the network.  ... 
doi:10.1016/j.jpdc.2004.09.013 fatcat:qm6yw3ug6jfmtmgcslu6pu6hh4
« Previous Showing results 1 — 15 out of 18 results