skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Routing, flow control, and fairness in computer networks

Abstract

The success of computer networks is based on efficient sharing of resources among users. Routing and flow control were designed to enhance the sharing of common resources and to optimize overall system performance. A key performance criterion in this optimization is fairness i.e., the ability to provide equal satisfaction to all users. The author proposes a measure of fairness based on balance interference among users for wide-area, packet-switched computer network. This measure guarantees that the throughput of the individual user cannot be zero and the actual throughput achieved by a user tends to be proportional to his traffic demand. Assuming input rate flow control, and integrated routing and flow control algorithm is developed to optimize this fairness measure, and yet satisfy an overall average delay constraint. An open network model is used in the optimization. An appropriate algorithm is developed to optimize the same fairness measure and satisfy an overall average network delay constraint using this time window flow control. Closed network model and fixed routing are used in the optimization. The algorithm is computationally very efficient and provides nearly optimal solution.

Authors:
Publication Date:
Research Org.:
California Univ., Los Angeles (USA)
OSTI Identifier:
6989638
Resource Type:
Thesis/Dissertation
Resource Relation:
Other Information: Thesis (Ph. D.)
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; COMPUTER NETWORKS; OPTIMIZATION; ROUTING; ALGORITHMS; PERFORMANCE; MATHEMATICAL LOGIC; 990220* - Computers, Computerized Models, & Computer Programs- (1987-1989)

Citation Formats

Chan, H W. Routing, flow control, and fairness in computer networks. United States: N. p., 1986. Web.
Chan, H W. Routing, flow control, and fairness in computer networks. United States.
Chan, H W. Wed . "Routing, flow control, and fairness in computer networks". United States.
@article{osti_6989638,
title = {Routing, flow control, and fairness in computer networks},
author = {Chan, H W},
abstractNote = {The success of computer networks is based on efficient sharing of resources among users. Routing and flow control were designed to enhance the sharing of common resources and to optimize overall system performance. A key performance criterion in this optimization is fairness i.e., the ability to provide equal satisfaction to all users. The author proposes a measure of fairness based on balance interference among users for wide-area, packet-switched computer network. This measure guarantees that the throughput of the individual user cannot be zero and the actual throughput achieved by a user tends to be proportional to his traffic demand. Assuming input rate flow control, and integrated routing and flow control algorithm is developed to optimize this fairness measure, and yet satisfy an overall average delay constraint. An open network model is used in the optimization. An appropriate algorithm is developed to optimize the same fairness measure and satisfy an overall average network delay constraint using this time window flow control. Closed network model and fixed routing are used in the optimization. The algorithm is computationally very efficient and provides nearly optimal solution.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {1986},
month = {1}
}

Thesis/Dissertation:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this thesis or dissertation.

Save / Share: