Paths with loops, even transient ones ,can pose significant stability problems in networks. Some earlier approaches like Shortest path routing (Dijkstra),Flooding, Flowbased routing, Distance vector routing(OSPF),Link state routing(Bellmen-Ford),Hierarchical routing, Broadcast routing, Multicast routing have problems maintaining the balance between node delays and link delays. We present a new ...

Efficient algorithms for computing routing tables should take advantage of the particular properties arising in large scale networks. There are in fact at least two properties that any routing scheme must consider: low (logarithmic) diameter and high clustering coefficient. High clustering coefficient implies the existence of few large induced cycles. Therefore, we propose a routing scheme that...

We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the FordBellman distributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, Mas...

This paper discusses the problem of interoperability of IP Telephony and Switched Circuit Networks in the area of routing information. We describe and analyze a solution for directory-based routing. We will present an architecture based on a distributed database on the switched circuit network and the IP network. The aim of the solution is to provide efficient service management, close to optim...

This paper applies spectral efciency as a performance measure for routing schemes and considers how to obtain a good route in a wireless network. The objective for this study is to combine different perspectives from networking and information theory in the design of routing schemes. The problem of nding the optimum route with the maximum spectral efciency is difcult to solve in a distribut...

A prominent challenge is improving the efficiency of distributed computation: reducing the cost, load, and resource requirements while still maintaining the same quality of service. Due to the shear amount of information and the size of the network, executing global system-wide operations becomes very expensive. When possible, we wish to minimize the work done by the system and avoid the heavy ...

We describe a system that provides query based associative access to the contents of distributed information servers. In typical distributed information systems there are so many objects that underconstrained queries can produce large result sets and extraordinary processing costs. To deal with this scaling problem we use content labels to permit users to learn about available resources and to ...

Basic P2P routing algorithms require log(n) hops to route a message in a geographically distributed network. High latency of basic P2P routes is often unacceptable for delay-sensitive applications such as interactive browsing. Additional routing information at a node could help to reduce the latency at an expense of larger routing tables. We propose cyclic routing as a new approach to balance t...

Distributed Hash Tables (DHTs) have been used as a common building block in many distributed applications, including Peer-to-Peer (P2P), Cloud and Grid Computing. However, there are still important security vulnerabilities that hinder their adoption in today’s large-scale computing platforms. For instance, routing vulnerabilities have been a subject of intensive research but existing solutions ...

Wireless distributed sensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In the proposed paper, we have focused on communication protocols, which have significant impact on the overall energy dissipation of the sensor networks. If the energy consumption is reduced it can prolongs the lifetime of these network. During recent y...