Home

Selfish Optimization in Computer Networks

Yechiam Yemini

Title:
Selfish Optimization in Computer Networks
Author(s):
Yemini, Yechiam
Date:
Type:
Technical reports
Department:
Computer Science
Permanent URL:
Series:
Columbia University Computer Science Technical Reports
Part Number:
CUCS-020-81
Notes:
This research has been supported in part by an NSF grant No. MCS 8110319 and by the Defense Advanced Research Project Agency of the Department of Defense. This paper was presented at the 20th IEEE Conference on Decision and Control, December 1981.
Publisher:
Department of Computer Science, Columbia University
Publisher Location:
New York
Abstract:
This paper describes two applications of decentralized (Pareto) optimization to problems of computer communication networks. The first application is to develop a generalized principle for optimality of multi-hop broadcast channel access schemes. The second application is to decentralized flow-control in fixed virtual-circuit networks (e.g., SNA) using power maximization as the performance index. The decentralized approach to optimum network behavior yields, among other results, characterization of fair global objective functions, and optimal decentralized greedy network control algorithms. The main conclusion of this paper is that Pareto-optimality methods can be successfully used to develop optimal decentralized behavior algorithms where a centralized approach is (sometimes provably) not applicable.
Subject(s):
Computer science
Item views:
369
Metadata:
text | xml

In Partnership with the Center for Digital Research and Scholarship at Columbia University Libraries/Information Services | Terms of Use