Search Results - "Courcoubetis, C."

Incentives for large peer-to-peer systems by Courcoubetis, C., Weber, R.

“…We consider problems of provisioning an excludable public good amongst n potential members of a peer-to-peer system who are able to communicate information…”
Get full text

The algorithmic analysis of hybrid systems by Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.

“…We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an…”
Get full text

Weighted round-robin cell multiplexing in a general-purpose ATM switch chip by Katevenis, M., Sidiropoulos, S., Courcoubetis, C.

“…The authors present the architecture of a general-purpose broadband-ISDN (B-ISDN) switch chip and, in particular, its novel feature: the weighted round-robin…”
Get full text

Markov decision processes and regular events by Courcoubetis, C., Yannakakis, M.

“…Desirable properties of the infinite histories of a finite-state Markov decision process are specified in terms of a finite number of events represented as…”
Get full text

Application of the many sources asymptotic and effective bandwidths to traffic engineering by Courcoubetis, Costas, Siris, Vasilios A, Stamoulis, George D

“…Accurate yet simple methods for traffic engineering are important for efficient management of resources in broadband networks. The goal of this paper is to…”
Get full text

Admission control and routing in ATM networks using inferences from measured buffer occupancy by Courcoubetis, C., Kesidis, G., Ridder, A., Walrand, J., Weber, R.

“…Addresses the issue of call acceptance and routing in ATM networks. The goal is to design an algorithm that guarantees bounds on the fraction of cells lost by…”
Get full text

Decoupling bandwidths for networks: a decomposition approach to resource management by de Veciana, G., Courcoubetis, C., Walrand, J.

“…The authors consider buffer asymptotics for feed-forward networks shared by heterogeneous traffic streams. This is done by identifying the effective bandwidth…”
Get full text

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing by Coffman, E. G., Courcoubetis, C., Garey, M. R., Johnson, D. S., Shor, P. W., Weber, R. R., Yannakakis, M.

“…We consider the one-dimensional bin packing problem under the discrete uniform distributions$U{j, k}, 1 \qeq j \geq k - 1$, in which the bin capacity is k and…”
Get full text

Resource control for loss-sensitive traffic in CDMA networks by Siris, V.A., Courcoubetis, C.

“…We investigate the problem of efficient resource control for loss-sensitive traffic in CDMA networks, using an economic modelling framework that takes into…”
Get full text

Managing and pricing service level agreements for differentiated services by Courcoubetis, C., Siris, V.A.

“…We present an approach to managing and pricing service level agreements (SLA) for differentiated services that uses a simple upper bound for the effective…”
Get full text

Economic Issues in Shared Infrastructures by Courcoubetis, C., Weber, R.

“…In designing and managing a shared infrastructure, one must take account of the fact that its participants will make self-interested and strategic decisions…”
Get full text

Traffic equivalence and substitution in a multiplexer with applications to dynamic available capacity estimation by Courcoubetis, C.A., Dimakis, A., Stamoulis, G.D.

“…For a multiplexer fed by a large number of sources, we derive conditions under which a given subset of the sources can be substituted for a single source while…”
Get full text

Comparing economic incentives in peer-to-peer networks by Antoniadis, Panayotis, Courcoubetis, Costas, Mason, Robin

“…Users who join a peer-to-peer network have, in general, suboptimal incentives to contribute to the network, because of the externalities that exist between…”
Get full text

Resource allocation in multiservice MPLS by Chatzaki, M., Sartzetakis, S., Papadakis, N., Courcoubetis, C.

“…This work deals with the problems of routing flows with QoS requirements across MPLS-capable networks. We identify the functional capabilities that should be…”
Get full text

Optimal control of a queueing system with simultaneous service requirements by Courcoubetis, C., Reiman, M.

“…We consider a system with N identical servers, operating in parallel. There are two types of customers, ordinary and locking, having exponential service times…”
Get full text

Fair background data transfers of minimal delay impact by Courcoubetis, C., Dimakis, A.

“…In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short…”
Get full text

A game-theoretic view of two processes using a single resource by Courcoubetis, C., Varaiya, P.

“…Two processes are served on a first-come, first-serve basis by a single resource (server). The thinking and resource holding times of both processes are…”
Get full text

Auction-based resource allocation in UMTS high speed downlink packet access (HSDPA) by Dramitinos, M., Stamoulis, G.D., Courcoubetis, C.

“…Data, audio and video services over 3G networks possess certain requirements in QoS and thus in resources. Accommodating such service requests constitutes a…”
Get full text

Serving process with least thinking time maximizes resource utilization by Courcoubetis, C., Varaiya, P.

“…A fixed number of processes (users) share a common resource. Each process is described by a Markov chain with a "thinking" state and a "request" for service…”
Get full text

Auction-based bandwidth trading in a competitive hierarchical market by Bitsaki, M., Stamoulis, G.D., Courcoubetis, C.

“…We deal with the problem of bandwidth allocation in a two-level hierarchical market. In the top level a unique seller allocates bandwidth to intermediate…”
Get full text