In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority class arrive in the environment randomly over time and require a random amount of on-site service that is characteristic of the class. To service a demand, one of the vehicles must travel to the demand location and r...

We survey routing problems on xed-connection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, k-relation routing, routing to random destinations , dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We also provide a list of unsolved problems an...

We survey routing problems on xed-connection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, k-relation routing, routing to random destinations , dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We also provide a list of unsolved problems an...

Mobile ad Hoc networks (MANETs) can make dynamic changes in topology. The most realistic characteristic which differentiates MANETs from other networks is that it is capable of changing its location. The result of the surveys over the last 5 years, show that it can overcome the two difficulties such as congestion and communication between nodes. Different routing algorithms are used while maxim...

In this paper we formulate the problem of routing over dynamic networks with finite doubling dimension. This is motivated by communication in mobile wireless networks, where the communication graph topology changes over time, but has some geometric properties, motivating the model for finite doubling dimension. Since wireless network bandwidth is precious, we consider communication cost require...

We present a new routing algorithm to compute paths within a network using dynamic link metrics. Dynamic link metrics are cost metrics that depend on a link’s dynamic state, e.g., the congestion on the link. Our algorithm is destination-initiated: a destination initiates a global path computation to itself using dynamic link metrics. All other destinations that do not initiate this dynamic metr...

Changing trends in backbone transport networks towards dynamic path provisioning and evolving optical technologies have motivated the study of dynamic routing algorithms in the context of Multi Protocol Label Switching (MPLS) based networks. As the network size increases, it is impractical to maintain detailed information regarding every connection that is established in the network. Hence, rou...

Due to the distributed nature, mobile ad-hoc networks (MANETs) are vulnerable to various attacks, resulting in distrusted communications. To achieve trusted communications, it is important to build trusted routes in routing algorithms in a self-organizing and decentralized fashion. This paper proposes a trusted routing to locate and to preserve trusted routes in MANETs. Instead of using a hard ...

In this paper we introduce a theory of policy routing dynamics based on fundamental axioms of routing update mechanisms. We develop a dynamic policy routing model (DPR) that extends the static formalism of the stable paths problem (introduced by Griffin et al.) with discrete synchronous time. DPR captures the propagation of path changes in any dynamic network irrespective of its time-varying to...