Distributed distance computation and routing with small messages
نویسندگان
چکیده
منابع مشابه
Fast Routing Table Construction Using Small Messages
We describe a distributed randomized algorithm to construct routing tables. Given 0 < ε ≤ 1/2, the algorithm runs in time Õ(n + HD), where n is the number of nodes and HD denotes the diameter of the network in hops (i.e., as if the network is unweighted). The weighted length of the produced routes is at most O(ε−1 log ε−1) times the optimal weighted length. This is the first algorithm to break ...
متن کاملRouting by distributed recursive computation and information reuse
In a networking environment, Quality-of-Service (QoS) routing plays an important role in the provision of real-time services with guaranteed throughput and bounded end-to-end delay. Its task is to nd a routing path which has su cient resources to support the requirements imposed by the applications. We propose several distributed algorithms for bandwidth-constrained routing and delay-constraine...
متن کاملDistributed Routing in Small-World Networks
So called small-world networks – clustered networks with small diameters – are thought to be prevalent in nature, especially appearing in people’s social interactions. Many models exist for this phenomenon, with some of the most recent explaining how it is possible to find short routes between nodes in such networks. Searching for such routes, however, always depends on nodes knowing what their...
متن کاملA Minimum Delay Routing Algorithm Using Distributed Computation
generalized vertex median of a weighted graph,” Operations Res., pp. 955-961, July 1967. R. R. Trippi, “The warehouse location formulation as a special type of inspection problem,”Managemenr Sei., vol. 21, pp. 986988, May 1975. L. S. Woo and D. T. Tang, “Optimization of teleprocessing networks with concentrators,” in Conf. Rec., Nat. Telecommun. Con$, Atlanta, GA, Nov. 26-28, 1973, pp. 37C1-3...
متن کاملOutdoor Distributed Computing with Split Smart Messages
In this paper, we exemplify outdoor distributed computing and point out the key challenges. We present Split Smart Messages, a lightweight, portable, network failure resilient and relatively secure middleware that enables a large subset of outdoor distributed computing applications. We also present a Service Discovery, Interaction and Payment Protocol (SDIPP) tailored for mobile phones. We eval...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2018
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-018-0326-6