Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complex problems in the domain of communication networks. This paper presents a random algorithm for handling the routing problem in Mobile Ad hoc Networks [MANETS].The performance of most existing routing protocols for MANETS degrades in terms of packet delay and congestion caused as the number of...

Delay Tolerant Networks (DTN) which have sufficient state information include trajectory and contact information, to protect routing efficiency. However, state information is dynamic and hard to obtain without a global and/or long-term collection process. To deal with these problems, the internal social features of each node are introduced in the network to perform the routing process. This typ...

We address the problem of routing packets on multiple, router-disjoint, paths in the Internet using large-scale overlay networks. Multipath routing can improve Internet QoS, by routing around congestions. This can benefit interactive and other real-time applications. One of the main problems with practically achieving router-disjoint multipath routing is the scalability limitation on the number...

the ip lookup process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to ipv6 addresses. the ip address lookup involves computation of the longest prefix matching (lpm), which existing solutions such as bsd radix tries, scale poorly when traıc in the router increases or when employed for ipv6 address lookups. in this paper, we describe a ...

Much of the mystery behind inter-domain routing in the Internet comes from its complexity: A large number of independently administered autonomous systems (ASs), interactions between intraand inter-domain routing protocols, manifold routing policies, diverse peering structures between ASs, etc. The thesis at hand aims to improve the understanding of inter-domain routing in general, presents nov...

This paper studies the effect of simple Traffic Engineering techniques on the size of the Internet’s default free routing table. Current best practises for traffic balancing in the Internet are based in disaggregating prefixes that cause an increase in size of the Internet’s core routing table. An algorithm to show the impact of these techniques on the growth of the routing table is proposed. T...

Optical burst switching architectures without buffering capabilities are sensitive to burst congestion. The existence of a few highly congested links may seriously aggravate the network throughput. Proper network routing may help in congestion reduction. The authors focus on adaptive routing strategies to be applied in labelled OBS networks, that is, with explicit routing paths. In particular, ...