In the standard Mobile IPv6 (MIPv6), the bidirectional tunnelling through the home agent or the route optimization show inefficiency in per-packet routing, especially when both communicating endpoints are mobile. To be scalable and compatible, mobile devices’ packets should be routed efficiently with minimal changes to the network infrastructure. However, the current solutions do not provide an...

The paper presents a new type of parallel router architecture based on a combinatorial arrangement of routing processing elements. The suggested approach reveals some properties of combinatorial designs, useful for economical implementation of parallel routing. In particular, such an architecture has explicit advantages for packet switching and multicast routing implementation. Key-Words: packe...

In MANET, mobile nodes communicate with each other using the wireless channel where transmission takes place with significant interference. The wireless medium used in MANET is a shared resource used by all the nodes available in MANET. Packet reserving is one important resource management scheme which controls the allocation of bandwidth among multiple flows through node cooperation in MANET. ...

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to d...

In this paper, we have performed a comparative analysis on three different MANET protocols with respect to packet delivery ratio (PDR), throughput, average end-to-end delay, routing overhead, normalized routing load (NRL), packet drop and packet loss metrics. The protocols considered are DSR, AODV and DSDV. The first two protocols fall under reactive whereas the third one is a proactive protoco...

Denial-of-service (DoS) attacks pose an increasing threat to today’s Internet. One major difficulty to defend against Distributed Denial-of-service attack is that attackers often use fake, or spoofed IP addresses as the IP source address. Probabilistic packet marking algorithm (PPM), allows the victim to trace back the appropriate origin of spoofed IP source address to disguise the true origin....

| In this paper, we consider the deeection worm routing problem on n n meshes. In deeection routing a message cannot be queued and it is always moving until it reaches its destination. In worm routing, the message is considered to be a worm; a sequence of k its which, during the routing, follow the head of the worm which knows the destination address. We show how to derive a deeection worm rout...

In this paper we initiate the study of competitive on-line packet routing algorithms. At any time, any network node may initiate sending a packet to another node. Our goal is to route these packets through the network, while simultaneously minimizing link bandwidth, buffer usage, and the average delay of a packet. We give efficient centralized on-line packet routing algorithms in this setting. ...

Minimizing latency and jitter is an important goal for communication in many distributed multimedia and visualization applications. This case study examines the impact of user-level packet routing on performance in a distributed system for controlling and monitoring the acquisition of geophysical data during aerial surveying in Antarctica. The packet routing mechanism employs concurrent process...

| In this paper we present the multistage oo-line method, a new and rather natural way to model oo-line packet routing problems, which reduces the problem of oo-line packet routing to that of nding edge disjoint paths on a multistage graph. The multistage oo-line method can model any kind of routing pattern on any graph and can incorporate the size of the maximum queue allowed in any processor....