Xunet 2: a nationwide testbed in high-speed networking

Published 1 January 1992

Alistair Fraser, Charles Kalmanek, A.E. Kaplan, William T. Marshall, R.C. Restrick

DOI10.1109/infcom.1992.263452

Citations43

TL;DR

The authors provide an overview of the architecture of the Xunet 2 testbed, which has three principal components: routers, switches and network management systems.

Abstract

Xunet 2 is an experimental wide-area network that serves as a testbed for research on data communications techniques. The authors provide an overview of the architecture of the Xunet 2 testbed. Xunet 2 has three principal components: routers, switches and network management systems. Long-haul transmission between them will initially use DS3 facilities. Performance objectives for the backbone have been set to cover a wide range of transmission speeds. Each router attaches a local area network to the backbone network. The backbone network provides virtual circuit connectivity between the routers. Circuit setup and teardown is done by a control computer associated with each switch, and the network as a whole will be managed by a network management station in the network operations center.>

Keywords

Computer Science

ACM SIGCOMM Computer Communication ReviewCongestion avoidance and control

5,337 Citations1995Van Jacobson

The measurements and the reports of beta testers suggest that the final product is fairly good at dealing with congested conditions on the Internet, and an algorithm recently developed by Phil Karn of Bell Communications Research is described in a soon-to-be-published RFC.

Congestion avoidance and control

2,447 Citations1988Van Jacobson

In October of '86, the Internet had the first of what became a series of 'congestion collapses' during this period, the data throughput from LBL to UC Berkeley dropped from 32 Kbps to 40 bps.

View PDF

Rate controlled servers for very high-speed networks

324 Citations2002Charles Kalmanek, Hemant Kanakia +1 more

Two queue service disciplines, rate-based scheduling and hierarchical round robin scheduling, are described, designed for fast packet networks and suitable for use in networks based on the asynchronous transfer mode (ATM) being defined in CCITT.

Characteristics of wide-area TCP/IP conversations

224 Citations1991Ramón Cáceres, Peter B. Danzig +2 more

The model characterizes individual TCP conversations by the distributions of number of bytes transferred, duration, number of packets transferred, packet size, and packet interarrival time and shows that interactive applications send significantly different amounts of data in each direction of a conversation.

View PDF

Queueing disciplines and passive congestion control in byte-stream networks

33 Citations1989S. Philip Morgan

The performance is compared of first-in-first-out and round-robin packet service disciplines at the trunk nodes of byte-stream networks, including priority service for single-packet messages.

ACM SIGARCH Computer Architecture NewsDistributed round-robin and first-come first-serve protocols and their applications to multiprocessor bus arbitration

25 Citations1988M.K. Vernon, Udi Manber

Two new distributed protocols for fair and efficient bus arbitration are presented, which use statically assigned arbitration numbers to resolve conflict during an arbitration and have a better combination of efficiency, cost, and fairness characteristics than existing multiprocessor bus arbitration algorithms.

View PDF

Nomenclator descriptive query optimization for large X.500 environments

14 Citations1991Joann J. Ordille, Barton P. Miller

Nomenclator is an architecture for providing efficient descriptive (attribute-based) naming in a large internet environment that will eventually incorporate other name services in addition to X.500 as its underlying data repository.

View PDF

Distributed round-robin and first-come first-serve protocols and their application to multiprocessor bus arbitrary

4 Citations2003M.K. Vernon, U. Manber

Simulation results indicate that there is very little practical difference in the performance of the two protocols, and the proposed first-come-first-served (FCFS) protocol has a better combination of efficiency, cost, and fairness characteristics than existing multiprocessor bus arbitration algorithms.