Results 1  10
of
105
Dissemination Of Information In Interconnection Networks (Broadcasting & Gossiping)
, 1996
"... this article follows the aims stated above. The first section introduces this research area. The basic definitions are given and the fundamental, simple observations concerning the relations among the complexity measures defined are carefully explained. This section is ..."
Abstract

Cited by 99 (7 self)
 Add to MetaCart
this article follows the aims stated above. The first section introduces this research area. The basic definitions are given and the fundamental, simple observations concerning the relations among the complexity measures defined are carefully explained. This section is
Efficient Algorithms for AlltoAll Communications in MultiPort MessagePassing Systems
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 1997
"... We present efficient algorithms for two alltoall communication operations in messagepassing systems: index (or alltoall personalized communication) and concatenation (or alltoall broadcast). We assume a model of a fully connected messagepassing system, in which the performance of any pointto ..."
Abstract

Cited by 85 (0 self)
 Add to MetaCart
We present efficient algorithms for two alltoall communication operations in messagepassing systems: index (or alltoall personalized communication) and concatenation (or alltoall broadcast). We assume a model of a fully connected messagepassing system, in which the performance of any pointtopoint communication is independent of the senderreceiver pair. We also assume that each processor has k ≥ 1 ports, through which it can send and receive k messages in every communication round. The complexity measures we use are independent of the particular system topology and are based on the communication startup time, and on the communication bandwidth. In the index operation among n processors, initially, each processor has n blocks of data, and the goal is to exchange the i th block of processor j with the j th block of processor i. We present a class of index algorithms that is designed for all values of n and that features a tradeoff between the communication startup time and the data transfer time. This class of algorithms includes two special cases: an algorithm that is optimal with respect to the measure of the startup time, and an algorithm that is optimal with respect to the measure of the data transfer time. We also present experimental results featuring the performance tuneability of our index algorithms on the IBM SP1 parallel system. In the concatenation operation, among n processors, initially, each processor has one block of data, and the goal is to concatenate the n blocks of data from the n processors, and to make the concatenation result known to all the processors. We present a concatenation algorithm that is optimal, for most values of n, in the number of communication rounds and in the amount of data transferred.
Efficient Collective Communication in Optical Networks
 In Proc. of ICALP 96
"... This paper studies the problems of broadcasting and gossiping in optical networks. In such networks the vast bandwidth available is utilized through wavelength division multiplexing: a single physical optical link can carry several logical signals, provided that they are transmitted on different wav ..."
Abstract

Cited by 50 (9 self)
 Add to MetaCart
This paper studies the problems of broadcasting and gossiping in optical networks. In such networks the vast bandwidth available is utilized through wavelength division multiplexing: a single physical optical link can carry several logical signals, provided that they are transmitted on different wavelengths. In this paper we consider both singlehop and multihop optical networks. In singlehop networks the information, once transmitted as light, reaches its destination without being converted to electronic form in between, thus reaching high speed communication. In multi hop networks a packet may have to be routed through a few intermediate nodes before reaching its final destination. In both models, we give efficient broadcasting and gossiping algorithms, in terms of time and number of wavelengths. We consider both networks with arbitrary topologies and particular networks of practical interest. Several of our algorithms exhibit optimal performances. 1 Introduction Motivations. Op...
Packet Routing In FixedConnection Networks: A Survey
, 1998
"... We survey routing problems on fixedconnection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, krelation routing, routing to random destinations, dynamic routing, isotonic routing ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
We survey routing problems on fixedconnection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, krelation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We also provide a list of unsolved problems and numerous references.
An approximation algorithm for the wireless gathering problem
 In Proc. 10th Scandinavian Workshop on Algorithm Theory
, 2006
"... Abstract. The Wireless Gathering Problem is to find a schedule for data gathering in a wireless static network. The problem is to gather a set of messages from the nodes in the network at which they originate to a central node, representing a powerful base station. The objective is to minimize the t ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
Abstract. The Wireless Gathering Problem is to find a schedule for data gathering in a wireless static network. The problem is to gather a set of messages from the nodes in the network at which they originate to a central node, representing a powerful base station. The objective is to minimize the time to gather all messages. The sending pattern or schedule should avoid interference of radio signals, which distinguishes the problem from wired networks. We study the Wireless Gathering Problem from a combinatorial optimization point of view in a centralized setting. This problem is known to be NPhard when messages have no release time. We consider the more general case in which messages may be released over time. For this problem we present a polynomialtime online algorithm which gives a 4approximation. We also show that within the class of shortest path following algorithms no algorithm can have approximation ratio better than 4. We also formulate some challenging open problems concerning complexity and approximability for variations of the problem. 1
Interval Routing Schemes
, 1998
"... Interval routing was introduced to reduce the size of routing tables: a router finds the direction where to forward a message by determining which interval contains the destination address of the message, each interval being associated to one particular direction. This way of implementing a routin ..."
Abstract

Cited by 29 (6 self)
 Add to MetaCart
Interval routing was introduced to reduce the size of routing tables: a router finds the direction where to forward a message by determining which interval contains the destination address of the message, each interval being associated to one particular direction. This way of implementing a routing function is quite attractive but very little is known about the topological properties that must satisfy a network to support an interval routing function with particular constraints (shortest paths, limited number of intervals associated to each direction, etc.). In this paper we investigate the study of the interval routing functions. In particular, we characterize the set of networks which support a linear or a linear strict interval routing function with only one interval per direction. We also derive practical tools to measure the efficiency of an interval routing function (number of intervals, length of the paths, etc.), and we describe large classes of networks which support optimal (linear) interval routing functions. Finally, we derive the main properties satisfied by the popular networks used to interconnect processors in a distributed memory parallel computer.
Memory Requirement for Universal Routing Schemes
 In 14 th Annual ACM Symposium on Principles of Distributed Computing (PODC
, 1995
"... In this paper, we deal with the compact routing problem, that is implementing routing schemes that use a minimum memory size on each router. In [20], Peleg and Upfal showed that there is no hope to do that with less than a total \Omega\Gamma n 1+1=(2s+4) ) memory bits for any stretch factor s 1. ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
In this paper, we deal with the compact routing problem, that is implementing routing schemes that use a minimum memory size on each router. In [20], Peleg and Upfal showed that there is no hope to do that with less than a total \Omega\Gamma n 1+1=(2s+4) ) memory bits for any stretch factor s 1. We improve this bound for stretch factors s ! 2 by proving that any nearshortest path routing scheme uses a total of \Omega\Gamma n 2 ) memory bits. 1 Introduction The general routing problem in a network (as opposed to the permutation routing problem [18] or the broadcasting problem [8]) consists of finding a routing protocol or routing function such that, for any sourcedestination pair, any message from the source can be routed to the destination. XY routing [2] or ecube routing [3] are such protocols. The efficiency of a protocol is measured in terms of latency (related to the length of the paths) and/or throughput (related to link or node congestion). Finding shortest paths in a n...
Adaptive Broadcasting With Faulty Nodes
, 1996
"... We consider broadcasting from a faultfree source to all nodes of a completely connected nnode network in the presence of k faulty nodes. Every node can communicate with at most one other node in a unit of time and during this period every pair of communicating nodes can exchange information packe ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
We consider broadcasting from a faultfree source to all nodes of a completely connected nnode network in the presence of k faulty nodes. Every node can communicate with at most one other node in a unit of time and during this period every pair of communicating nodes can exchange information packets. Faulty nodes can receive information but cannot send it. Broadcasting is adaptive, i.e. a node schedules its next communication on the basis of information currently available to it. We study worst case running time of faulttolerant broadcasting algorithms in two models: in the wakeup model only nodes already having the source message can call other nodes and in the unrestricted model all faultfree nodes can call. In the first model we give an optimal algorithm working in time k +dlog(n \Gamma k)e. In the second model we give an algorithm working in time O(log 2 n), whenever the fraction of faulty nodes is bounded by a constant smaller than 1. Key words: adaptive, algorithm, broadc...
Topological Constraints For Sense Of Direction
, 1995
"... In a distributed system, each entity has a label (port number) associated to each of its neighbors. It is well known that if the labeling satisfies a global consistency property called Sense of Direction, the communication complexity of many distributed problem can be greatly reduced. This property ..."
Abstract

Cited by 15 (12 self)
 Add to MetaCart
In a distributed system, each entity has a label (port number) associated to each of its neighbors. It is well known that if the labeling satisfies a global consistency property called Sense of Direction, the communication complexity of many distributed problem can be greatly reduced. This property is assumed to be present and it is implicitly used in most interconnection networks. In this paper we investigate the nature of the relationship between Sense of Direction and network topology. We first consider the class of labelings which only satisfy the requirement of local orientation; that is, at each node, the outgoing edges have distinct labels. We then consider the class of labelings which also satisfy edge symmetry; that is, there exists a correlation between the labels neighbors give to their connecting edge. This class includes most of used labelings. We completely characterize the interplay between topological constraints and consistency constraints for these two classes of labe...
Minimum Linear Gossip Graphs and Maximal Linear (\Delta; k)Gossip Graphs
, 1994
"... Gossiping is an information dissemination problem in which each node of a communication network has a unique piece of information that must be transmitted to all other nodes using twoway communications between pairs of nodes along the communication links of the network. In this paper, we study goss ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
Gossiping is an information dissemination problem in which each node of a communication network has a unique piece of information that must be transmitted to all other nodes using twoway communications between pairs of nodes along the communication links of the network. In this paper, we study gossiping using a linear cost model of communication which includes a startup time and a propagation time which is proportional to the amount of information transmitted. A minimum linear gossip graph is a graph (modelling a network), with the minimum possible number of links, in which gossiping can be completed in minimum time under the linear cost model. For networks with an even number of nodes, we prove that the structure of minimum linear gossip graphs is independent of the relative values of the startup and unit propagation times. We prove that this is not true when the number of nodes is odd. We present four infinite families of minimum linear gossip graphs. We also present minimum linea...