Packet Routing

Photonic packet switches offer high speed, data rate and format transparency, and flexibility required by future computer communications and cell-based telecommunications networks. In this paper, we review experimental progress in state-of-the-art photonic packet switches with an emphasis on all-optical guided-wave systems. The term all-optical implies that the data portion of a packet remains in optical format from the source to

Enabling real time applications in wireless sensor networks requires certain delay and bandwidth which pose more challenges in the design of routing protocols. The algorithm that is used for packet routing in such applications should be able to establish a tradeoff between end to end delay parameter and energy consumption. In this paper, we propose a new multi path routing algorithm for real time applications in wireless sensor networks namely QEMPAR which is QoS aware and can increase the network lifetime. Simulation results show that the proposed algorithm is more efficient than previous algorithms in providing quality of service requirements of real-time applications.

The packet routing problem plays an essential role in communication networks. It involves how to transfer data from some origins to some destinations within a reasonable amount of time. In the (ℓ, k)-routing problem, each node can send at most ℓ packets and receive at most k packets. Permutation routing is the particular case ℓ = k = 1. In the r-central routing problem, all nodes at distance at most r from a fixed node v want to send a packet to v. In this article we study the permutation routing, the r-central routing and the general (ℓ, k)-routing problems on plane grids, that is square grids, triangular grids and hexagonal grids. We use the store-and-forward Δ-port model, and we consider both full and half-duplex networks. We first survey the existing results in the literature about packet routing, with special emphasis on (ℓ, k)-routing on plane grids. Our main contributions are the following: 1. Tight permutation routing algorithms on full-duplex hexagonal grids, and half duple...

A self-routing permutation network with O((n lg n)) switches and O(lg2n) routing time, where lg denotes log2, is presented. More generally, a permutation network with O(kn1+1k/) cost and O(k lg n) routing time for any k, 1⩽k lg n, is described. This improves D. Nassimi and J. Sahni's (1982) routing algorithm that gives O(k lg3 n) routing time for the same cost expression. The only networks capable of permutation switching with O(n lg n) cost and O(lg n) routing time are the AKS sorting network and E. Upfal's (1989) packet routing network, but the constants hidden in the complexities of these networks are so large that they remain impractical until n gets very large

We propose a new routing strategy for controlling packet routing on complex networks. The delivery capability of each node is adopted as a piece of local information to be integrated with the load traffic dynamics to weight the next route. The efficiency of transport on complex network is measured by the network capacity, which is enhanced by distributing the traffic load over the whole network while nodes with high handling ability bear relative heavier traffic burden. By avoiding the packets through hubs and selecting next routes optimally, most travel times become shorter. The simulation results show that the new strategy is not only effective for scale-free networks but also for mixed networks in realistic networks.