Packet routing is an important problem in parallel computation since a single step of inter-processor communication can be thought of as a packet routing task. In this paper we present an optimal algorithm for packet routing on a mesh-connected computer. Two important criteria for judging a routing algorithm will be 1) its run time, i.e., the number of parallel steps it takes for the last packe...

In the existing system, the problem of TCP in MANET’s environment is packet losses induced by network congestion. In case if congestion occurs it leads to the loss of data. In the proposed system, Blue algorithm is used for avoiding packet loss in TCP with wireless network based on checking size of queue. If the size of queue is maximum, gateway directly forwards the packet to destination throu...

The increasing power, lower cost and improved convenience of wireless networks is fueling the spread of IEEE 802.11 wireless access points (APs) in the residential and commercial environments. While there has been considerable study of wireless performance, little is publicly known about the queue sizes of wireless APs. This paper presents the QFind methodology for measuring wireless AP queue s...

The steady-state waiting time in a stable GI/G/1 queue is equivalent to the maximum of a general random walk with negative drift. Thus, the distribution of the steady-state waiting time in the GI/G/1 queue is characterized by Spitzer’s (1956) formula. However, earlier, Pollaczek (1952) derived an equivalent contour-integral expression for the Laplace transform of the GI/G/1 steady-state waiting...

Packet routing is an important problem in parallel computation since a single step of inter-processor communication can be thought of as a packet routing task. In this paper we present an optimal algorithm for packet routing on a mesh-connected computer. Two important criteria for judging a routing algorithm will be 1) its run time, i.e., the number of parallel steps it takes for the last packe...

The Random early detection (RED) active queue management (AQM) scheme uses the average queue size to calculate the dropping probability in terms of minimum and maximum thresholds. The effect of heavy load enhances the frequency of crossing the maximum threshold value resulting in frequent dropping of the packets. An adaptive queue management with random dropping (AQMRD) algorithm is proposed wh...