Distributed network protocols for changing topologies: a counterexample
نویسندگان
چکیده
منابع مشابه
Distributed network protocols for changing topologies: a counterexample
A number of distributed network protocols for reliable data transmission, connectivity test, shortest path and topology broadcast have been proposed with claims that they operate correctly in the face of changing topology, without need for unbounded numbers to identify different runs of the algorithms. This paper shows that they do not possess all the claimed properties and that they may not te...
متن کاملA genetic algorithm for designing distributed computer network topologies
The topological design of distributed packet switched networks consists of finding a topology that minimizes the communication costs by taking into account a certain number of constraints such as the delay and the reliability. This paper proposes a genetic algorithm (GA) for generating low-cost feasible computer network topologies subject to these constraints. The implementation of this algorit...
متن کاملDistributed network protocols
A unified approach to the formal description and validation of several distributed protocols is presented. After introducing two basic protocols, a series of known and new protocols for connectivity test, shortest path, and path updating are described and validated. All protocols are extended to networks with changing topology.
متن کاملUML Modeling of Network Topologies for Distributed Computer System
Nowadays, distributed computer systems have become very popular approach of computing as it delivers high end performance at a low cost. In a distributed computing environment, autonomous computers are connected by means of a communication network, arranged in a geometrical shape called network topology. In the present paper a detailed study of network topologies is done for the distributed com...
متن کاملFingerprint for Network Topologies
A network’s topology information can be given as an adjacency matrix. The bitmap of sorted adjacency matrix (BOSAM) is a network visualisation tool which can emphasise different network structures by just looking at reordered adjacent matrixes. A BOSAM picture resembles the shape of a flower and is characterised by a series of ‘leaves’. Here we show and mathematically prove that for most networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 1991
ISSN: 0090-6778
DOI: 10.1109/26.79272