Shortest path first with emergency exits
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Artificial intelligence (3rd ed.)
Artificial intelligence (3rd ed.)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Load-sensitive routing of long-lived IP flows
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Optimal routing in closed queuing networks
ACM Transactions on Computer Systems (TOCS)
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
A quantitative evaluation of traffic-aware routing strategies
ACM SIGCOMM Computer Communication Review
Advanced Engineering Mathematics: Maple Computer Guide
Advanced Engineering Mathematics: Maple Computer Guide
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Fundamental bounds on the accuracy of network performance measurements
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A distributed traffic control scheme based on edge-centric resource management
ACM SIGCOMM Computer Communication Review
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal scheduling and routing for maximum network throughput
IEEE/ACM Transactions on Networking (TON)
Density-based anycast: a robust routing strategy for wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Performance model and evaluation on geographic-based routing
Computer Communications
Mobility entropy and message routing in community-structured delay tolerant networks
Proceedings of the 4th Asian Conference on Internet Engineering
Message routing on potential-fields in forwarding-based DTNs
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Distributed potential field based routing and autonomous load balancing for wireless mesh networks
IEEE Communications Letters
Service discovery in mobile ad hoc networks: A field theoretic approach
Pervasive and Mobile Computing
PWave: a multi-source multi-sink anycast routing framework for wireless sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Building a potential field to provide real-time transmission in wireless sensor network
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Mutually controlled routing with independent ISPs
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Biologically inspired future service environment
Computer Networks: The International Journal of Computer and Telecommunications Networking
Controlled potential-based routing for large-scale wireless sensor networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Load balancing based on similarity multi-paths routing
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
CATT: potential based routing with content caching for ICN
Proceedings of the second edition of the ICN workshop on Information-centric networking
Real-time routing in wireless sensor networks: A potential field approach
ACM Transactions on Sensor Networks (TOSN)
Controlled and self-organized routing for large-scale wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
We present a routing paradigm called PBR that utilizes steepest gradient search methods to route data packets. More specifically, the PBR paradigm assigns scalar potentials to network elements and forwards packets in the direction of maximum positive force. We show that the family of PBR schemes are loop free and that the standard shortest path routing algorithms are a special case of the PBR paradigm. We then show how to design a potential function that accounts for traffic conditions at a node. The resulting routing algorithm routes around congested areas while preserving the key desirable properties of IP routing mechanisms including hop-by-hop routing, local route computations and statistical multiplexing. Our simulations using the ns simulator indicate that the traffic aware routing algorithm shows significant improvements in end-to-end delay and jitter when compared to standard shortest path routing algorithms. The simulations also indicate that our algorithm does not incur too much control overheads and is fairly stable even when traffic conditions are dynamic.