Abstract not found

We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. This paper reframes the traceback problem as a polynomial reconstruction problem and uses algebraic techniques from coding theory and learning theory to provide robust methods of transmission and reconstruction. 1

Abstract not found

The Internet is expected to support various services, including best-effort services and guaranteed services. For best-effort services, we propose a new approach to achieving type-of-service (TOS) classes with adaptive nexthop routing. We consider two TOS classes, namely, delaysensitive and throughput-sensitive. As in routing protocols such as OSPF and integrated IS-IS, each node has a different next-hop for each destination and TOS class. Traditionally, a node has a single FCFS queue for each outgoing link, and the next-hops are computed using link measurements. In our approach, we attempt to isolate the two traffic classes by using for each outgoing link a separate FCFS queue for each TOS class; the link is shared cyclicly between its TOS queues. The next-hops for the delay-sensitive traffic adapts to link delays of that traffic. The next-hops for the throughput-sensitive traffic adapts to overall link utilizations. We compare our approach with the traditional approach using discret...

Abstract not found

We propose a new approach to achieving type-of-service (TOS) with adaptive next-hop routing in wide-area networks such as the Internet. We consider two traffic classes, namely delay-sensitive and throughput-sensitive. In routing protocols such as OSPF and integrated IS-IS, each node has a different nexthop for each destination and TOS. Traditionally, each node has a single FCFS queue for each outgoing link, and the next-hops are computed using link measurements. In our approach, we attempt to isolate the two traffic classes by using two FCFS queues for each outgoing link, one for each TOS; the link is shared cyclicly between the two TOS queues. The next-hops for the delay-sensitive traffic adapts to link delays of that traffic. The next-hops for the throughputsensitive traffic adapts to overall link utilizations. We compare our approach with the traditional approach using discrete-event simulation and Liapunov analysis (for stability of routes). The proposed approach offers ...

The future Internet will very likely include some components based on Asynchronous Transfer Mode (ATM), as well as existing network technologies. This environment produces the possibility of using one of the strengths of ATM (namely, quality-of-service guarantees) to improve the performance of Internet traffic. In this report, we document some of our work in progress on the use of performance-guaranteed ATM virtual circuits to carry IP datagrams. We are currently addressing the implications of various IP-over-ATM strategies on network performance, particularly those aspects relating to quality of service, multiplexing, and virtual circuit management. We are evaluating these performance effects using INSANE, a new object-oriented, discrete-event network simulator. 1 Introduction The construction and deployment of Asynchronous Transfer Mode (ATM) networks are a recent development in the field of computer communications. Integrating this new technology into the existing Internet require...

The current SCTP specification is not aware of QoS provided by a network. As a result, it is unable to support preferential treatment of the individual streams. We introduce the concept of dividing an association into subflows (SFs) so that the modified SCTP can support different levels of QoS. We define the necessary modifications to the current SCTP for this capability: namely, new data and SACK chunk formats to implement congestion control for each SF. To avoid the problem of false sharing, we modify SCTP such that each SF has its own congestion control mechanism. Using analytic models, we show that the modified SCTP is expected to perform better than the original SCTP. We verify these results through simulation experiments, where we observed that modified SCTP is able to take advantage of the diff-serv network and provides a better throughput.

In this paper we describe the deployment of a laboratory environment for building and testing various approaches to implementation of Quality-of-Service (QoS) on IP-based networks. We focus predominantly on large-scale packet classification and prioritization using Differentiated Services (DiffServ) packet marking primitives. In our research, we surveyed available software for supporting QoS and developed a set of additional tools for generating arbitrary network traffic patterns and quantitatively measuring network performance. With these tools, we conducted a number of real-world experiments, incorporating a mix of both real IP traffic and artificially generated network noise, and produced statistics concerning network performance.

(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).