A Failsafe Distributed Protocol for Minimum Delay Routing
نویسندگان
چکیده
منابع مشابه
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...
متن کاملSimulation of a Minimum Delay Distributed Routing Algorithm
A quasi-static distributed routing algorithm for computer networks is the starting point for this research. The algorithm seeks to minimize the total expected message delay in the network by successively changing the routing variables (fractions of traffic of a given commodity on a link) until the optimum routing is achieved. A simulation program for this algorithm is developed in several stage...
متن کاملMinimum Expected Delay-Based Routing Protocol (MEDR) for Delay Tolerant Mobile Sensor Networks
It is a challenging work to develop efficient routing protocols for Delay Tolerant Mobile Sensor Networks (DTMSNs), which have several unique characteristics such as sensor mobility, intermittent connectivity, energy limit, and delay tolerability. In this paper, we propose a new routing protocol called Minimum Expected Delay-based Routing (MEDR) tailored for DTMSNs. MEDR achieves a good routing...
متن کاملA practical framework for minimum-delay routing in computer networks
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is very responsive to topological and link-cost changes; however, except under light traffic loads, the delays obtained with this type of routing are far from optimal. Furthermore, if link costs are associated with delays, ...
متن کاملMinimum Average Delay of Routing Trees
The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T . In the case where the vertices of G are mapped into the leaves of the host tree T the underlying tree is called a routing tree and if the internal vertices of T are forced to have degree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 1981
ISSN: 0096-2244
DOI: 10.1109/tcom.1981.1095036