Introduction to algorithms
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Routing in the Internet
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 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
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
IEEE MultiMedia
Differentiated Services: A New Approach for Quality of Service in the Internet
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Multi-Path Routing combined with Resource Reservation
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Scalable Resource Reservation for the Internet
MMNET '97 Proceedings of the IEEE Conference on Protocols for Multimedia Systems - Multimedia Networking (PROMSMmNet'97)
MPLS and the evolving Internet architecture
IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Type-of-service routing in datagram delivery systems
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis
IEEE Network: The Magazine of Global Internetworking
Routing subject to quality of service constraints in integrated communication networks
IEEE Network: The Magazine of Global Internetworking
A new class of QoS routing strategies based on network graph reduction
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hop-by-hop routing algorithms for premium traffic
ACM SIGCOMM Computer Communication Review
Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Algorithms for computing QoS paths with restoration
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
An algebraic theory of dynamic network routing
IEEE/ACM Transactions on Networking (TON)
Scalable routing overlay networks
ACM SIGOPS Operating Systems Review
A Local Coefficient Based Load Sensitive Routing Protocol for Providing QoS
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A distributed approach for multi-constrained path selection and routing optimization
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Incremental computation of shortest paths in semi-dynamic graphs using software components
Proceedings of the 44th annual Southeast regional conference
Load-balanced routing for mesh networks
ACM SIGMOBILE Mobile Computing and Communications Review
Loop-free constrained path computation for hop-by-hop QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal scheduling and routing for maximum network throughput
IEEE/ACM Transactions on Networking (TON)
A Load Scattering Algorithm for Dynamic Routing of Automated Material Handling Systems
Computational Intelligence and Security
An agent-based dynamic routing strategy for automated material handling systems
International Journal of Computer Integrated Manufacturing
Distributed media rate allocation in multipath networks
Image Communication
Load-Based Metrics and Flooding in Wireless Mesh Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Survey on Directed Model Checking
Model Checking and Artificial Intelligence
A model of configuration languages for routing protocols
Proceedings of the 2nd ACM SIGCOMM workshop on Programmable routers for extensible services of tomorrow
Journal of Parallel and Distributed Computing
Routing Metric for Interference and Channel Diversity in Multi-Radio Wireless Mesh Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Cost-algebraic heuristic search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Research challenges in QoS routing
Computer Communications
Precomputation for intra-domain QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Increasing bisemigroups and algebraic routing
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
The stratified shortest-paths problem
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
A formal study of trust-based routing in wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Cross-layer routing metrics for mesh networks: Current status and research directions
Computer Communications
Comparative study of two CPU router time management algorithms in cellular IP networks
International Journal of Network Management
Jitter-minimized reliability-maximized management of networks
International Journal of Network Management
Towards an algebra of routing tables
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
On optimal spectrum-efficient routing in TDMA and FDMA multihop wireless networks
Computer Communications
Heuristic search for the analysis of graph transition systems
ICGT'06 Proceedings of the Third international conference on Graph Transformations
A theory for the connectivity discovered by routing protocols
IEEE/ACM Transactions on Networking (TON)
A multi-level approach to link state: ML-OLSR
Proceedings of the 10th ACM international symposium on Mobility management and wireless access
Maximizing the Flow Reliability in Cellular IP Network Using PSO
International Journal of Interdisciplinary Telecommunications and Networking
Hi-index | 0.00 |
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and optimal paths can be computed with a generalized Dijkstra's algorithm. For this purpose, we define an algebra of weights which contains a binary operation, for the composition of link weights into path weights, and an order relation. Isotonicity is the key property of the algebra. It states that the order relation between the weights of any two paths is preserved if both of them are either prefixed or appended by a common, third, path.We show that isotonicity is both necessary and sufficient for a generalized Dijkstra's algorithm to yield optimal paths. Likewise, isotonicity is also both necessary and sufficient for hop-by-hop routing. However, without strict isotonicity, hop-by-hop routing based on optimal paths may produce routing loops. They are prevented if every node computes what we call lexicographic-optimal paths. These paths can be computed with an enhanced Dijkstra's algorithm that has the same complexity as the standard one. Our findings are extended to multipath routing as well.As special cases of the general approach, we conclude that shortest-widest paths can neither be computed with a generalized Dijkstra's algorithm nor can packets be routed hop-by-hop over those paths. In addition, loop-free hop-by-hop routing over widest and widest-shortest paths requires each node to compute lexicographic-optimal paths, in general.