We present a framework for the modeling of multipath routing in connectionless networks that dynamically adapt to network congestion. The basic routing protocol uses a short-term ...
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Design of practical routing protocols is complex and dificult due to complicated requirements of faulttolerance and flexibility. The protocol is defined to be fault-tolerant if me...
Abstract-- The emergence of nomadic applications have recently generated much interest in wireless network infrastructures that support real-time communications. In this paper, we ...
The JiNao project at MCNC/NCSU focuses on detecting intrusions, especially insider attacks, against OSPF (Open Shortest Path First) routing protocol. This paper presents the imple...
D. Qu, Brain Vetter, Feiyi Wang, R. Narayan, Shyht...
Routing protocol faults cause problems ranging from an inability to communicate to excessive routing overhead. This paper proposes a system for detecting a wide range of routing p...
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...
Recently, audio and video delivery services are widely spread in the Internet. In order to deliver these data to multiple receivers at the same time, the multicast technologies ar...
—We introduce WRP-Lite, which is a table-driven routing protocol that uses non-optimal routes, and compare its performance with the performance of the dynamic source routing (DSR...
—Owing to the absence of any static support structure, Ad-hoc networks are prone to link failures. The ‘shortest path seeking’ routing protocols may not lead to stable routes...
Sulabh Agarwal, Ashish Ahuja, Jatinder Pal Singh, ...