The network of delivering commodities has been an important design problem in our daily lives and many transportation applications. The delivery performance is evaluated based on the system reliability of delivering commodities from a source node to a sink node in the network. The system reliability is thus maximized to find the optimal routing. However, the design problem is not simple because...

Today’s Internet routing protocols either provide a single path between each source-destination pair, or multiple paths of equal length. Furthermore, the paths provided by RIP and OSPF are not free of loops during times of network transition. Single-path routing algorithms are inherently slow in responding to congestion and temporary traffic bursts; consequently, the delays experienced by packe...

This paper presents a new routing strategy based on the minimization of the worst-case queuing length. An H∞ optimal control scheme is proposed which can maintain a robust performance of the routing strategy in the presence of multiple and unknown time-varying network delays. First, the routing problem is formulated as an H∞ optimal control problem for a time delayed system. Towards this end, t...

This paper presents a novel routing scheme for wireless mobile networking which is adaptive to the mobile traffic patterns. We propose a concept called ‘‘friend network” to accommodate the need for effective routing information update. Our routing scheme has the advantages of minimizing network bandwidth consumptions, providing optimal routing, and addressing network security concerns at the sa...

Routing is the key functionality for directing communication over large networks. Optimal paths are determined based on routing metrics. In this report, we first develop a taxonomy for categorizing and classifying of routing metrics. Then, we give an extensive overview of routing metrics and apply our classification to them.