Data networks
Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
IEEE Transactions on Computers
A protocol to maintain a minimum spanning tree in a dynamic topology
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A minimum-hop routing algorithm bases on distributed information
Computer Networks and ISDN Systems
A unified approach to loop-free routing using distance vectors or link states
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
An algorithm for distributed computation of a spanningtree in an extended LAN
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Communications of the ACM
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Shortest paths and loop-free routing in dynamic networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Dynamics of distributed shortest-path routing algorithms
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Performance comparison of routing protocols using MaRS: distance-vector versus link-state
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Performance comparison of routing protocols under dynamic and static file transfer connections
ACM SIGCOMM Computer Communication Review
Reliability and scaling issues in multicast communication
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Distributed, scalable routing based on link-state vectors
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A routing protocol for packet radio networks
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Computers - Special issue on mobile computing
The Request Reply Family of Group Routing Protocols
IEEE Transactions on Computers
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
The performance of query control schemes for the zone routing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
IEEE/ACM Transactions on Networking (TON)
A distributed algorithm for delay-constrained unicast routing
IEEE/ACM Transactions on Networking (TON)
Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Simulation-based performance evaluation of routing protocols for mobile ad hoc networks
Mobile Networks and Applications
Delayed Internet routing convergence
IEEE/ACM Transactions on Networking (TON)
The performance of query control schemes for the zone routing protocol
IEEE/ACM Transactions on Networking (TON)
Network abstractions for context-aware mobile computing
Proceedings of the 24th International Conference on Software Engineering
Journal of VLSI Signal Processing Systems
Avoiding Counting to Infinity in Distance Vector Routing
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Dynamic agent population in agent-based distance vector routing
Second international workshop on Intelligent systems design and application
Phoenix: a parallel programming model for accommodating dynamically joining/leaving resources
Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming
Design and performance of a loop free routing algorithm
ICCC '02 Proceedings of the 15th international conference on Computer communication
Loop-Free Internet Routing Using Hierarchical Routing Trees
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Dynamic agent population in agent-based distance vector routing
Neural, Parallel & Scientific Computations - Special issue: Advances in intelligent systems and applications
Scattercast: an adaptable broadcast distribution framework
Multimedia Systems
Alternate path routing for multicast
IEEE/ACM Transactions on Networking (TON)
Unicast routing techniques for mobile ad hoc networks
The handbook of ad hoc wireless networks
Hybrid routing: the pursuit of an adaptable and scalable routing framework for ad hoc networks
The handbook of ad hoc wireless networks
Journal of Systems and Software - Special issue: Computer systems
Scenario-based comparison of source-tracing and dynamic source routing protocols for ad hoc networks
ACM SIGCOMM Computer Communication Review - Special issue on wireless extensions to the internet
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
BGP-RCN: improving BGP convergence through root cause notification
Computer Networks and ISDN Systems
Localization and Navigation Assisted by Networked Cooperating Sensors and Robots
International Journal of Robotics Research
A distributed multicast routing algorithm for real-time applications in wide area networks
Journal of Parallel and Distributed Computing
Multicast algorithms in service overlay networks
Computer Communications
BRA: a bidirectional routing abstraction for asymmetric mobile ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Xl: an efficient network routing algorithm
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Improved algorithms for Internet routing in Low Earth Orbit satellite networks
Space Communications - Satellite Network Protocols
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
BGP-RCN: improving BGP convergence through root cause notification
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hansel: distributed localization in passive wireless environments
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
A cross-layer route discovery strategy for virtual currency systems in mobile ad hoc networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Group routing without group routing tables: an exercise in protocol design
Computer Communications
Research: A loop-free routing protocol for large-scale internets using distance vectors
Computer Communications
ViSim: A user-friendly graphical simulation tool for performance analysis of MANET routing protocols
Mathematical and Computer Modelling: An International Journal
Dissemination of reconfiguration policies on mesh networks
DAIS'12 Proceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Hi-index | 0.00 |
Distributed algorithms for shortest-path problems are important in the context of routing in computer communication networks. We present a protocol that maintains the shortest-path routes in a dynamic topology, that is, in an environment where links and nodes can fail and recover at arbitrary times. The novelty of this protocol is that it avoids the bouncing effect and the looping problem that occur in the previous approaches of the distributed implementation of Bellman-Ford algorithm. The bouncing effect refers to the very long duration for convergence when failures happen or weights increase, and the nonterminating exchanges of messages, or counting-to-infinity behavior, in disconnected components of the network resulting from failures. The looping problems cause data packets to circulate and, thus, waste bandwidth. These undesirable effects are avoided without any increase in the overall message complexity of previous approaches required in the connected part of the network. The time complexity is better than the distributed Bellman-Ford algorithm encountering failures. The key idea in the implementation is to maintain only loop-free paths, and search for the shortest path only from this set.