Results 1  10
of
15
Making Greed Work in Networks: A GameTheoretic Analysis of Switch Service Disciplines
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1994
"... This paper discusses congestion control from a gametheoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is exercised only at the network switches. The operating points resulting from selfish user behavior ..."
Abstract

Cited by 203 (12 self)
 Add to MetaCart
This paper discusses congestion control from a gametheoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is exercised only at the network switches. The operating points resulting from selfish user behavior depend crucially on the service disciplines implemented in network switches. This effect is investigated in a simple model consisting of a single exponential server shared by many Poisson sources. We discuss the extent to which one can guarantee, through the choice of switch service disciplines, that these selfish operating points will be efficient and fair. We also discuss to what extent the choice of switch service disciplines can ensure that these selfish operating points are unique and are easily and rapidly accessible by simple selfoptimization techniques. We show that no service discipline can guarantee optimal efficiency. As for the other properties, we show that the traditio...
Economic models for allocating resources in computer systems
 Market Based Control of Distributed Systems. World Scientific
, 1996
"... With the advances in computer and networking technology, thousands of heterogeneous computers can be interconnected to provide a large collection of computing and communication resources. These systems are used by agrowing and increasingly heterogeneous set of users. ..."
Abstract

Cited by 105 (2 self)
 Add to MetaCart
(Show Context)
With the advances in computer and networking technology, thousands of heterogeneous computers can be interconnected to provide a large collection of computing and communication resources. These systems are used by agrowing and increasingly heterogeneous set of users.
A Stochastic Equilibrium Model of Internet Pricing
 Journal of Economic Dynamics and Control
, 1995
"... Perhaps the greatest technological innovation of the next several decades will be universal access and utilization of the Internet. Already congestion is becoming a serious impediment to efficient utilization. We introduce a stochastic equilibrium concept for a general mathematical model of the Inte ..."
Abstract

Cited by 56 (7 self)
 Add to MetaCart
Perhaps the greatest technological innovation of the next several decades will be universal access and utilization of the Internet. Already congestion is becoming a serious impediment to efficient utilization. We introduce a stochastic equilibrium concept for a general mathematical model of the Internet, and demonstrate that the efficient social welfare maximizing stochastic allocation of Internet traffic can be supported by optimal congestion prices. We further demonstrate that approximately optimal prices can be readily computed and implemented in a decentralized system by constructing a large computer simulation model. We also address the alternative of building excess capacity to avoid congestion. 2 1. Introduction The "information revolution" is currently underway and it is made possible by increasingly powerful personal computers and the rapidly developing information superhighway (The Internet). This revolution will foster a profound transformation of the economic organizati...
Integration of Pricing and Flow Control for Available Bit Rate Services in ATM Networks
 In Proceedings of the IEEE GLOBECOM
, 1996
"... We present a theoretically justified pricing scheme for ABR services which utilizes mechanisms provided by ratebased flow control as defined by the ATM Forum. As a result, the scheme imposes no additional communication overhead, while the added complexity at the switches and endsystems is minimal. ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
(Show Context)
We present a theoretically justified pricing scheme for ABR services which utilizes mechanisms provided by ratebased flow control as defined by the ATM Forum. As a result, the scheme imposes no additional communication overhead, while the added complexity at the switches and endsystems is minimal. Our approach complements ABR's ratebased flow control and leads to economically efficient utilization of network resources. According to the scheme, a connection is charged based on the sum of the price per unit of bandwidth on all links along its route. Prices depend on the demand for bandwidth and are adjusted in a decentralized and iterative manner. Simulation results show that prices converge reasonably fast and do not have a negative effect on the convergence properties of flow control. 1 Introduction The Available Bit Rate (ABR) service class is one of the five service classes identified by the ATM Forum for ATMbased integrated services networks, [1, 2]. It is intended for "beste...
The Application of Microeconomics to the Design of Resource Allocation and Control Algorithms
, 1989
"... In this thesis, we present a new methodology for resource sharing algorithms in distributed systems. We propose that a distributed computing system should be composed of a decentralized community of microeconomic agents. We show that this approach decreases complexity and can substantially improve ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
In this thesis, we present a new methodology for resource sharing algorithms in distributed systems. We propose that a distributed computing system should be composed of a decentralized community of microeconomic agents. We show that this approach decreases complexity and can substantially improve performance. We compare the performance, generality and complexity of our algorithms with noneconomic algorithms. To validate the usefulness of our approach, we present economies that solve three distinct resource management problems encountered in large, distributed systems. The first economy performs CPU load balancing and demonstrates how our approach limits complexity and effectively allocates resources when compared to noneconomic algorithms. We show that the economy achieves better performance than a representative noneconomic algorithm. The load balancing economy spa...
Why is Flow Control Hard: Optimality, Fairness, Partial and Delayed Information
 IN PROC. 2ND ORSA TELECOMMUNICATIONS CONFERENCE
, 1992
"... Flow control has been studied since the early stages of research in telecommunication networks. In these early studies the term flow control has been used to describe almost any type of network control. With the rapid growth of telecommunication networks control and management, flow control has evol ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
Flow control has been studied since the early stages of research in telecommunication networks. In these early studies the term flow control has been used to describe almost any type of network control. With the rapid growth of telecommunication networks control and management, flow control has evolved as a distinct class of algorithms and substantial research effort has been devoted to its study. An extensive survey of the most representative of these efforts is presented in this paper. The motivation for this work is the need for of a thorough, deep understanding of the flow control problem in gigabit, multiclass networks. A broad class of flow control schemes, namely optimal flow control, is considered within a game theoretic framework. The class of adaptive flow control mechanisms is not presented extensively, but valuable insight about the performance of such schemes can be gained from the study of optimal flow control policies. A number of important efforts to define and study fa...
A Mechanism for Congestion Control in Computer Networks
 the Existence of Equilibria in Noncooperative Optimal Flow Control&quot;, Proceedings of ITC Workshop
, 1989
"... this paper, we present an economic model of a computer network. We then make some simplifying assumptions to derive a mechanism for congestion control. Subsequently we relax some of the assumptions and generalize the solution. We will not present details of implementation of the scheme in reallife ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
this paper, we present an economic model of a computer network. We then make some simplifying assumptions to derive a mechanism for congestion control. Subsequently we relax some of the assumptions and generalize the solution. We will not present details of implementation of the scheme in reallife networks: these will be discussed in a forthcoming thesis.
Performance Analysis and Pricing in Broadband Networks
, 1997
"... Effective procedures for performance analysis and pricing are important for controlling the use and dimensioning of broadband networks. These procedures must be accurate, efficient, and take into account the technological characteristics of broadband networks, such as the support for traffic with di ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Effective procedures for performance analysis and pricing are important for controlling the use and dimensioning of broadband networks. These procedures must be accurate, efficient, and take into account the technological characteristics of broadband networks, such as the support for traffic with different characteristics and different Quality of Service (QoS) requirements, as well as the support for services with open loop and closed loop congestion control. The objective of this dissertation is to apply and evaluate large deviation techniques for performance analysis and traffic engineering, to investigate usagebased pricing schemes for network transport services with open loop congestion control, and to investigate pricing and resource sharing for Available Bit Rate (ABR) services, which support closed loop congestion control.
An Advanced RealTime Ramp Metering System (arms): The System Concept
, 1994
"... This report presents an Advanced Realtime Ramp Metering System (ARMS), which consists of three levels of control algorithms integrated for control of freeway ramp metering systems. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This report presents an Advanced Realtime Ramp Metering System (ARMS), which consists of three levels of control algorithms integrated for control of freeway ramp metering systems.
Lower bounds for distributed . . .
, 2008
"... We study the worstcase communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat that G is also the communication network. The problem is a natural generalization of shortest path lengths to expected ..."
Abstract
 Add to MetaCart
(Show Context)
We study the worstcase communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat that G is also the communication network. The problem is a natural generalization of shortest path lengths to expected path lengths, and represents a model used in many practical applications such as pagerank and eigentrust as well as other problems involving Markov chains defined by networks. For the problem of computing a single stationary probability, we prove an Ω(n 2 log n) bits lower bound; the trivial centralized algorithm costs O(n 3) bits and no known algorithm beats this. We also prove lower bounds for the related problems of approximately computing the stationary probabilities, computing only the ranking of the nodes, and computing the node with maximal rank. As a corollary, we obtain lower bounds for labelling schemes for the hitting time between two nodes.