Add to ORKGthis paper is to survey fundamental issues and advances in the area of adaptive shortestpath routing for packet-switched networks, and examine them within the context of large, highly-dynamic, and reconfigurable environments. The fundamental question is whether or not the shortest-path paradigm remains desirable or even feasible in such environments
[[abstract]]©2001 IEEE-As the trend of increased reconfigurability emerges in wavelength division mu...
This paper describes the TD-Routing, an adaptive algorithm for packet routing, based on the Temporal...
[[abstract]]©2002 Springer Verlag-As the trend of increased reconfigurability emerges in wavelength ...
In a dynamic network environment under heavy traffic load, shortest-path routing algorithms, particu...
Abstract. The problem of updating shortest paths in networks whose topology dynamically changes over...
Shortest path problems are fundamental network optimization problems arising in many contexts and ha...
Abstract: Routing is an important function to run some important operations in the computer networks...
In modern communication systems, especially those with mobile radio components, the distribution of ...
In this paper we consider a core optical packet-switched network and investigate the effectiveness o...
This thesis gives a general discussion of routing for computer networks, followed by an overview of ...
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on thi...
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on thi...
This thesis addresses the difficulties of both Shortest Path First (SPF) and traditional adaptive ro...
AbstractIn this paper, we survey algorithms for shortest paths in dynamic networks. Although researc...
[[abstract]]In this paper, we investigate adaptive routing in wavelength-routed networks. Exploiting...
[[abstract]]©2001 IEEE-As the trend of increased reconfigurability emerges in wavelength division mu...
This paper describes the TD-Routing, an adaptive algorithm for packet routing, based on the Temporal...
[[abstract]]©2002 Springer Verlag-As the trend of increased reconfigurability emerges in wavelength ...
In a dynamic network environment under heavy traffic load, shortest-path routing algorithms, particu...
Abstract. The problem of updating shortest paths in networks whose topology dynamically changes over...
Shortest path problems are fundamental network optimization problems arising in many contexts and ha...
Abstract: Routing is an important function to run some important operations in the computer networks...
In modern communication systems, especially those with mobile radio components, the distribution of ...
In this paper we consider a core optical packet-switched network and investigate the effectiveness o...
This thesis gives a general discussion of routing for computer networks, followed by an overview of ...
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on thi...
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on thi...
This thesis addresses the difficulties of both Shortest Path First (SPF) and traditional adaptive ro...
AbstractIn this paper, we survey algorithms for shortest paths in dynamic networks. Although researc...
[[abstract]]In this paper, we investigate adaptive routing in wavelength-routed networks. Exploiting...
[[abstract]]©2001 IEEE-As the trend of increased reconfigurability emerges in wavelength division mu...
This paper describes the TD-Routing, an adaptive algorithm for packet routing, based on the Temporal...
[[abstract]]©2002 Springer Verlag-As the trend of increased reconfigurability emerges in wavelength ...