This paper presents Random Early Detection (RED) gate-ways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by com-puting the average queue size. The gateway could notify connections of congestion either by dropping packets ar-riving at the gateway or by setting a bit in packet headers. When the average queue size exceeds a preset threshold,the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a func-tion of the average queue size. RED gateways keep the average queue size low while allowing occasional bursts of packets in the queue. During congestion, the probability that the gateway notifies a particular connection to reduce its window is roughly proportional to that connection's share of the bandwidth throughthe gateway. RED gateways are designed to accompany a transport-layer congestion control protocol such as TCP.The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connectionsdecreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways.

Wireless and satellite networks often have non-negligible packet corruption rates that can significantly degrade TCP performance. This is due to TCP's assumption that every packet loss is an indication of network congestion (causing TCP to reduce the transmission rate). This problem has received much attention in the literature. In this paper, we take a broad look at the problem of enhancing TCP performance under corruption losses, and include a discussion of the key issues. The main contributions of this paper are: (i) a confirmation of previous studies that show the reduction of TCP performance in the face of corruption loss, and in addition a plausible upper bound achievable with perfect knowledge of the cause of loss, (ii) a classification of the potential mitigation space, and (iii) the introduction of a promising new mitigation that employs rich cumulative information from intermediate nodes in a path to form a better congestion response.

In this paper we present an architecture and prototype implementation for discovering key network characteristics, such as hosts, gateways, and topology. The Fremont system uses an extensible set of modules to discover information, based on a variety of different protocols and information sources, rather than a single network management protocol. This approach allows more complete and timely information to be discovered than, for example, using only one protocol, even one as capable as the Simple Network Management Protocol. The discovered information is time-stamped and recorded in a database. The contents of this database are cross-correlated to form an increasingly complete network picture, to direct further discovery, and to highlight inconsistent information.

Abstract – The On-Demand Multicast Routing Protocol (ODMRP) is an effective and efficient routing protocol designed for mobile wireless ad hoc networks. One of the major strengths of ODMRP is its capability to operate both as a unicast and a multicast routing protocol. This versatility of ODMRP can increase network efficiency as the network can handle both unicast and multicast traffic with one protocol. We describe the unicast functionality of ODMRP and analyze the protocol performance in a real ad hoc network testbed of seven laptop computers in an indoor environment. Both static and dynamic networks are deployed. We generate various topological scenarios in our wireless testbed by applying mobility to network hosts and study their impacts on our protocol performance. We believe that the performance study in a testbed network can help us analyze the protocol in a realistic way and point us to the future research direction. I.

Higher bandwidths in computer networks have made application with real-time constraints, such as control, command, and interactive voice and video communication feasible. We describe two congestion control mechanisms that utilize properties of real-time applications. First, many real-time applications, such as voice and video, can tolerate some loss due to signal redundancy. We propose and analyze a congestion control algorithm that aims to discard packets if they stand little chance of reaching their destination in time as early on their path as possible. Dropping late and almost-late packets improves the likelihood that other packets will make their deadline. Secondly, in real-time syst...

Understanding the end-to-end packet delay dynamics of the Internet is of crucial importance since it directly affects the QoS (Quality of Services) of realtime services, and it enables us to design an efficient congestion control mechanism. In this paper, we measure the round-trip time, and build a mathematical model representing its dynamics using system identification. We first measure, as the input and output data for system identification, the packet inter-departure time from a source host and the corresponding round-trip time measured by the source host.

Digital developed the intermediate system--to-- intermediate system (IS-IS) intradomain routing information exchange protocol for the DECnet Phase V network layer architecture. This protocol, which has been adopted by the International Organization for Standardization, is based on a link state routing algorithm. The benefits derived from the IS-IS protocol include a self-stablizing method for reliable link state packet distribution, a hierarchical network structure to support larger networks, protocols for efficiently utilizing local area networks, and simultaneous support for multiple network layer protocols. The network layer architecture has three basic components. The first concerns the transmission of data packets from one end system (a host) to a remote end system, regardless of whether or not these packets are sent by way of routers. The main features of this component are packet formats and addressing. Standards for these features are defined in the connectionless network laye...

(IETF), its Areas, and its Working Groups. Note that other groups may also distribute working documents as Internet Drafts. Internet Drafts are draft documents valid for a maximum of six months. Internet Drafts may be updated, replaced, or obsoleted by other documents at any time. It is not appropriate to use Internet Drafts as reference material or to cite them other than as a ‘‘working draft’ ’ or ‘‘work in progress.’ ’ Please check the 1id-abstracts.txt listing contained in the internet-drafts Shadow Directories on nic.ddn.mil, nnsc.nsf.net, nic.nordu.net, ftp.nisc.sri.com, or munnari.oz.au to learn the current status of any Internet Draft. Internet Draft Requirements for IP Routers December 1993 This is a working document only, it should neither be cited nor quoted in any formal document. This document will expire before 26 June 1994. Distribution of this document is unlimited. Please send comments to the editor. If your comment pertains to a particular piece of text, please remember to mention the section number, this document is very large and locating the text solely by context might not be possible. Please also mention the date of this draft (12/21/93) and the revision level (1.47).

www.javvin.com www.networkdictionary. com Dynamic Host Configuration Protocol March 1997 Status of this memo This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards " (STD) for the standardization state and status of this protocol. Distribution of this memo is unlimited. The Dynamic Host Configuration Protocol (DHCP) provides a framework for passing configuration information to hosts on a TCPIP network. DHCP is based on the Bootstrap Protocol (BOOTP) [7], adding the capability of automatic allocation of reusable network addresses and additional configuration options [ 9].

This paper discusses the state-of-the-art of World Wide Web management. We first identify a set of requirements for the management of the Web. Based on these requirements, we present the relevant Internet standards defined by the Internet Engineering Task Force (IETF) and we compare them with approaches that use the Web itself to make management information available. We evaluate both approaches against the identified requirements and we conclude with remarks how both approaches should evolve in the future. 1. Introduction The World Wide Web is in wide-spread use today and many people and organizations, among them the organizers of this workshop, rely on its correct operation. The success of the Web is largely based on the development of a common naming scheme which allows to link documents of arbitrary types together. The complexity of the technology underlying the Web has increased in the last years, while at the same time the accessibility, usability and reliability of the Web beca...