A Passive System for Server Selection within Mirrored Resource Environments Using AS Path Length Heuristics

Published 1 January 2000

Patrick McManus

Citations34

TL;DR

An experiment using a heuristic algorithm that is utilized by clients to select the closest available web server from a group of mirrors indicates this is a promising strategy for passive determination of good, though not always optimal, servers.

Abstract

Abstract: This work presents the results of an experiment using a heuristic algorithm that is utilized by clients to select the closest available web server from a group of mirrors. The heuristic is based on BGP AS path lengths and can be determined without the introduction of any additional measurement traffic into the network. The results indicate this is a promising strategy for passive determination of good, though not always optimal, servers. Many traditional load balancing solutions distribute load based solely on server side criteria such as current processor load, the number of outstanding queued requests, and network saturation. These schemes fail to consider the client’s relationship to the members of the server pool when making the decision of which host to use to process a request. They consider only the

Keywords

Computer ScienceEngineering

Border Gateway Protocol 3 (BGP-3)

1,990 Citations1991K. Lougheed, Y. Rekhter

This memo, together with its companion document, "Application of the Border Gateway Protocol in the Internet", define an inter-autonomous system routing protocol for the Internet.

View PDF

TCP Congestion Control

1,810 Citations1999Mark Allman, Vern Paxson +1 more

This document defines TCP's four intertwined congestion control algorithms: slow start, congestion avoidance, fast retransmit, and fast recovery, as well as discussing various acknowledgment generation methods.

View PDF

End-to-end Internet packet dynamics

539 Citations1997Vern Paxson

The prevalence of unusual network events such as out-of-order delivery and packet corruption are characterized and a robust receiver-based algorithm for estimating "bottleneck bandwidth" is discussed that addresses deficiencies discovered in techniques based on "packet pair".

View PDF

Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy

481 Citations1993V. Fuller, T. Li +2 more

This memo discusses strategies for address assignment of the existing IP address space with a view to conserve the address space and stem the explosive growth of routing tables in default-route-free routers.

On calibrating measurements of packet transit times

277 Citations1998Vern Paxson

By analyzing a large set of measurements of Internet TCP connections, it is found that both clock adjustments and relative skew are sufficiently common that failing to detect them can lead to potentially large errors when analyzing packet transit times.

Computer Networks and ISDN SystemsAdaptive web caching: towards a new global caching architecture

275 Citations1998Scott Michel, Khoi Khac Nguyen +4 more

Equipped with the URL routing table and neighbor cache contents, a cache in the revised design can now search the local group, and forward all missing queries quickly and efficiently, thus eliminating both the waiting delay and the overhead associated with multicast queries.

An architecture for a global Internet host distance estimation service

195 Citations1999Paul Francis, Sugih Jamin +4 more

Technical issues related to the creation of a public infrastructure service to provide distance information over the Internet, using IP multicast groups, in the form of a virtual distance map are explored.

Autonomous System Confederations for BGP

99 Citations2007P. Traina, D. McPherson +1 more

A client oriented, IP level redirection mechanism

12 Citations1999Sumit Gupta, A. L. Narasimha Reddy

This paper introduces a new approach for implementing transparent client access to network services that involves the client network layer actively in redirection and a FreeBSD based implementation of a testbed.