The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is very responsive to topological and link-cost changes; however, except under light traffic loads, the delays obtained with this type of routing are far from optimal. Furthermore, if link costs are associated with delays, ...

In many networks, such as mobile ad-hoc networks and friend-to-friend overlay networks, direct communication between nodes is limited to specific neighbors. Often these networks have a small-world topology; while short paths exist between any pair of nodes in small-world networks, it is non-trivial to determine such paths with a distributed algorithm. Recently, Clarke and Sandberg proposed the ...

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

Internet Traffic has grown exponentially over last few years due to provision of multiple class services through Internet backbone. With the explosive use of Internet, contemporary Internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, an analysis is made how forecasting technique, routing algorithm and Genetic...

A routing scheme R in a network G = (V,E) is an algorithm that allows to send messages from one node to another in the network. We are first allowed a preprocessing phase in which we assign a unique label to each node p ∈ V and a routing table with additional information. After this preprocessing, the routing algorithm itself must be local (i.e., we can only use the information from the label o...

In this paper, effects of Fastest Path Routing, Ant-Colony Routing, Associativity Based Routing (ABR) and other novel proposed Associativity Based Long Life Routing algorithms, on novel proposed throughput improvement algorithm Most Congested Access First (MCAF), minimizing the packet loss ratio and improving the throughput of a multi-hop mobile WIMAX network are investigated for various vehicu...

Multicast routing algorithms for mobile ad-hoc networks have been extensively researched in the recent past. In this paper, we present two algorithms for dealing with multicast routing problem using the notion of virtual forces. We look at the effective force exerted on a packet and determine whether a node could be considered as a Steiner node. The nodes' location information is used to genera...

Open Shortest Path First (OSPF) is a popular Interior Gateway Protocol widely used inside large IP routing domains. Recent studies have shown that the time consumed by local SPF computations must be controlled to achieve millisecond convergence time. This paper presents the authors' experience in measuring and improving the performance of the OSPF routing protocol software. First, we propose a ...

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...