Algorithmic problems in Internet research

0Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The first part of this tutorial starts by describing the basic Internet Protocols (e.g., TCP/IP), goes on to describe some of the newer protocols being proposed (e.g., RSVP, Mobile IP, IP Multicast), and some of the newer problems for which protocols must be designed (e.g., accounting, reliable multicast, combining multicast, mobility, and policy routing). The tutorial describes some of the problems with existing protocols, and the need for careful designs and proofs for the newer protocols. The PODC community may be interested in making contributions in this area. The second part of the tutorial will describe specific bottlenecks in Internet implementations that are important today. Effective solutions in this area appear to require somewhat different thinking from that suggested by standard algorithmic approaches. The tutorial will also outline how parallel approaches may be useful for some of the harder problems (e.g., filter matching, weighted fair queuing) faced by routers today. Such problems may be of interest to the SPAA community.

Cite

CITATION STYLE

APA

Varghese, G. (1998). Algorithmic problems in Internet research. In Annual ACM Symposium on Parallel Algorithms and Architectures (pp. 1–2). ACM. https://doi.org/10.1145/277697.277698

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free