Optimal Control in Two-Hop Relay Routing (2009)
Altman, Eitan, Basar, Tamer, De Pellegrini, Francesco
We study the optimal control of propagation of packets in delay tolerant mobile ad-hoc networks. We consider a two-hop forwarding policy under which the expected number of nodes carrying copies of...
Optimal mobile association on hybrid networks: centralized and decentralized case (2009)
Silva, Alonso, Altman, Eitan, Debbah, Merouane, Tembine, Hamidou, Jimenez, Chloe
This paper proposes a new approach based on optimal transport theory to model network topologies for purpose of strategic planning and optimal design. We study the SINR mobile association game: we...
Magnetworks: how mobility impacts the design of Mobile Networks (2009)
Silva, Alonso, Altman, Eitan, Debbah, Merouane, Alfano, Giuseppa
In this paper we study the optimal placement and optimal number of active relay nodes through the traffic density in mobile sensor ad-hoc networks. We consider a setting in which a set of mobile...
Continuum Equilibria and Global Optimization for Routing in Dense Static Ad Hoc Networks (2009)
Silva, Alonso, Altman, Eitan, Bernhard, Pierre, Debbah, Merouane
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area with location and...
Dynamic control of Coding in Delay Tolerant Networks (2009)
Altman, Eitan, De Pellegrini, Francesco, Sassatelli, Lucile
Delay tolerant Networks (DTNs) leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other....
Optimal Routing and Power Control for a Single Cell, Dense, Ad Hoc Wireless Network (2009)
Ramaiyan, Venkatesh, Kumar, Anurag, Altman, Eitan
We consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data...
Constrained Stochastic Games in Wireless Networks (2009)
Eitan Altman, Konstantin Avrachenkov, Nicolas Bonneau, Mérouane Debbah, Rachid El-azouzi, Daniel Menasché
Abstract—We consider the situation where N nodes share a common access point. With each node i there is an associated buffer and channel state that change in time. Node i dynamically chooses both...
New cross-layer channel switching policy for TCP transmission on (2009)
Dinesh Kumar, Dhiman Barman, Eitan Altman, Jean-marc Kelif, Thème Com, Dinesh Kumar, ...
apport de recherche ISSN 0249-6399 ISRN INRIA/RR--????--FR+ENG
Markov-Modulated Stochastic Recursive Equations with Applications to Delay-Tolerant Networks (2009)
We investigate Markov-modulated stochastic recursive equations. This class includes multi-type branching processes with immigration as well as linear stochastic equations. Conditions are established...
Equilibrium in size-based scheduling systems (2009)
Soudan, Sébastien, Divakaran, Dinil Mon, Altman, Eitan
Size-based scheduling is advocated to improve response times of small flows. While researchers continue to explore different ways of giving preferential treatment to small flows without causing...
Equilibrium in size-based scheduling systems (2009)
Soudan, Sébastien, Divakaran, Dinil Mon, Altman, Eitan
Size-based scheduling is advocated to improve response times of small flows. While researchers continue to explore different ways of giving preferential treatment to small flows without causing...
P2P Networks: The interplay between legislation and information technology (2009)
Wong, Sulan, Altman, Eitan, Ibrahim, Mouhamad
P2P has become a major part of Internet traffic. Along with a growing economic e-commerce activity in which consumers purchase music, video, software and books over the Internet, P2P file sharing...
P2P Networks: The interplay between legislation and information technology (2009)
Wong, Sulan, Altman, Eitan, Ibrahim, Mouhamad
P2P has become a major part of Internet traffic. Along with a growing economic e-commerce activity in which consumers purchase music, video, software and books over the Internet, P2P file sharing...
Equilibrium in size-based scheduling systems (2009)
Soudan, Sébastien, Mon Divakaran, Dinil, Altman, Eitan
Size-based scheduling is advocated to improve response times of small flows. While researchers continue to explore different ways of giving preferential treatment to small flows without causing...
Equilibrium in size-based scheduling systems (2009)
Soudan, Sébastien, Mon Divakaran, Dinil, Altman, Eitan
Size-based scheduling is advocated to improve response times of small flows. While researchers continue to explore different ways of giving preferential treatment to small flows without causing...
Competition and cooperation between nodes in Delay Tolerant Networks with Two Hop Routing (2009)
This paper revisits the two-hop forwarding policy in delay tolerant networks (DTNs) using simple probabilistic approaches. Closed form expressions are derived for the main performance measures. We...
Competition and cooperation between nodes in Delay Tolerant Networks with Two Hop Routing (2009)
This paper revisits the two-hop forwarding policy in delay tolerant networks (DTNs) using simple probabilistic approaches. Closed form expressions are derived for the main performance measures. We...
Extending Routing Games to Flows over Time (2009)
Soudan, Sébastien, Mon Divakaran, Dinil, Altman, Eitan
Routing game presents an interesting framework to analyze the practical problem of source routing in the Internet. It is particularly useful in quantifying the inefficiency of selfish user behavior...
Extending Routing Games to Flows over Time (2009)
Soudan, Sébastien, Divakaran, Dinil Mon, Altman, Eitan, Primet, Pascale
Routing game presents an interesting framework to analyse the practical problem of source routing in the Internet. It is particularly useful in quantifying the inefficiency of selfish user behavior...
Simulating Bandwidth Sharing with Pareto distributed File Sizes (2009)
Altman, Eitan, Rojas-Mora, Julio, Jimenez, Tania
The traffic on the internet has known to be heavy tailed: the size of file transfers through FTP or HTTP applications, as well as those transferred by P2P applications has been observed to have a...
Extending Routing Games to Flows over Time (2009)
Soudan, Sébastien, Mon Divakaran, Dinil, Altman, Eitan
Routing game presents an interesting framework to analyze the practical problem of source routing in the Internet. It is particularly useful in quantifying the inefficiency of selfish user behavior...
Extending Routing Games to Flows over Time (2009)
Soudan, Sébastien, Divakaran, Dinil Mon, Altman, Eitan, Primet, Pascale
Routing game presents an interesting framework to analyse the practical problem of source routing in the Internet. It is particularly useful in quantifying the inefficiency of selfish user behavior...
Simulating Bandwidth Sharing with Pareto distributed File Sizes (2009)
Altman, Eitan, Rojas-Mora, Julio, Jimenez, Tania
The traffic on the internet has known to be heavy tailed: the size of file transfers through FTP or HTTP applications, as well as those transferred by P2P applications has been observed to have a...
A survey on core switch designs and algorithms (2009)
Divakaran, Dinil Mon, Soudan, Sébastien, Primet, Pascale, Altman, Eitan
Tremendous amounts of effort have gone into research on switch designs and architectures. This survey attempts to sketch the evolution of the modern switch architectures. The survey covers the...
A survey on core switch designs and algorithms (2009)
Divakaran, Dinil Mon, Soudan, Sébastien, Primet, Pascale, Altman, Eitan
Tremendous amounts of effort have gone into research on switch designs and architectures. This survey attempts to sketch the evolution of the modern switch architectures. The survey covers the...
Optimizing cell size in Pico-cell networks (2009)
Ramanath, Sreenath, Altman, Eitan, Kumar, Vinod, Debbah, Merouane
In this paper, we present a systematic study of the uplink capacity and coverage of pico-cell wireless networks. Both the one dimensional as well as the two dimensional cases are investigated. Our...
Operating Point Selection in Multiple Access Rate Regions (2009)
Altman, Eitan, Avrachenkov, Konstantin, Cottatellucci, Laura, Debbah, Merouane, Gaoning, He, Suarez, Alberto
We study the selection of the rate allocation in multiple access channels (MAC). We consider MACs with different rate regions. Namely, we investigate the polytope rate regions, convex non-polytope...
Optimizing cell size in Pico-cell networks (2009)
Ramanath, Sreenath, Altman, Eitan, Kumar, Vinod, Debbah, Merouane
In this paper, we present a systematic study of the uplink capacity and coverage of pico-cell wireless networks. Both the one dimensional as well as the two dimensional cases are investigated. Our...
Operating Point Selection in Multiple Access Rate Regions (2009)
Altman, Eitan, Avrachenkov, Konstantin, Cottatellucci, Laura, Debbah, Merouane, Gaoning, He, Suarez, Alberto
We study the selection of the rate allocation in multiple access channels (MAC). We consider MACs with different rate regions. Namely, we investigate the polytope rate regions, convex non-polytope...
Mean Field Asymptotic of Markov Decision Evolutionary Games and Teams (2009)
Tembine, Hamidou, Le Boudec, Jean-Yves, El-Azouzi, Rachid, Altman, Eitan
We introduce Markov Decision Evolutionary Games with N players, in which each individual in a large population interacts with other randomly selected players. The states and actions of each player in...
P2P Networks: The interplay between legislation and information technology (2009)
Wong, Sulan, Altman, Eitan, Ibrahim, Mouhamad
P2P has become a major part of Internet traffic. Along with a growing economic e-commerce activity in which consumers purchase music, video, software and books over the Internet, P2P file sharing...
P2P Networks: The interplay between legislation and information technology (2009)
Wong, Sulan, Altman, Eitan, Ibrahim, Mouhamad
P2P has become a major part of Internet traffic. Along with a growing economic e-commerce activity in which consumers purchase music, video, software and books over the Internet, P2P file sharing...
Optimal Activation and Transmission Control in Delay Tolerant Networks (2009)
Altman, Eitan, Azad, Amar Prakash, Basar, Tamer, De Pellegrini, Francesco
Much research has been devoted to maximizing the life time of mobile ad-hoc networks. Life time has often been defined as the time elapsed until the first node is out of battery power. In the context...
Optimal Activation and Transmission Control in Delay Tolerant Networks (2009)
Altman, Eitan, Azad, Amar Prakash, Basar, Tamer, De Pellegrini, Francesco
Much research has been devoted to maximizing the life time of mobile ad-hoc networks. Life time has often been defined as the time elapsed until the first node is out of battery power. In the context...
Vacation Policy Optimization with Application to IEEE 802.16e Power Saving Mechanism (2009)
Azad, Amar Prakash, Alouf, Sara, Altman, Eitan, Borkar, V. S., Paschos, Georgios Stavrou
Much research has been devoted to optimizing the power saving mechanism in wireless mobile devices. Recent advances in wireless radio technology facilitate the implementation of various possible...
Vacation Policy Optimization with Application to IEEE 802.16e Power Saving Mechanism (2009)
Azad, Amar Prakash, Alouf, Sara, Altman, Eitan, Borkar, V. S., Paschos, Georgios Stavrou
Much research has been devoted to optimizing the power saving mechanism in wireless mobile devices. Recent advances in wireless radio technology facilitate the implementation of various possible...
Optimal Activation and Transmission Control in Delay Tolerant Networks (2009)
Altman, Eitan, Azad, Amar Prakash, Basar, Tamer, De Pellegrini, Francesco
Much research has been devoted to maximizing the life time of mobile ad-hoc networks. Life time has often been defined as the time elapsed until the first node is out of battery power. In the context...
Optimal Activation and Transmission Control in Delay Tolerant Networks (2009)
Altman, Eitan, Azad, Amar Prakash, Basar, Tamer, De Pellegrini, Francesco
Much research has been devoted to maximizing the life time of mobile ad-hoc networks. Life time has often been defined as the time elapsed until the first node is out of battery power. In the context...
Vacation Policy Optimization with Application to IEEE 802.16e Power Saving Mechanism (2009)
Azad, Amar, Alouf, Sara, Altman, Eitan, Borkar, Vivek, Paschos, Georgios
Much research has been devoted to optimizing the power saving mechanism in wireless mobile devices. Recent advances in wireless radio technology facilitate the implementation of various possible...
Vacation Policy Optimization with Application to IEEE 802.16e Power Saving Mechanism (2009)
Azad, Amar, Alouf, Sara, Altman, Eitan, Borkar, Vivek, Paschos, Georgios
Much research has been devoted to optimizing the power saving mechanism in wireless mobile devices. Recent advances in wireless radio technology facilitate the implementation of various possible...
Vacation Policy Optimization with Application to IEEE 802.16e Power Saving Mechanism (2009)
Azad, Amar Prakash, Alouf, Sara, Altman, Eitan, Borkar, V. S., Paschos, Georgios Stavrou
Much research has been devoted to optimizing the power saving mechanism in wireless mobile devices. Recent advances in wireless radio technology facilitate the implementation of various possible...
Vacation Policy Optimization with Application to IEEE 802.16e Power Saving Mechanism (2009)
Azad, Amar Prakash, Alouf, Sara, Altman, Eitan, Borkar, V. S., Paschos, Georgios Stavrou
Much research has been devoted to optimizing the power saving mechanism in wireless mobile devices. Recent advances in wireless radio technology facilitate the implementation of various possible...
Methodologies for Analyzing Equilibria in Wireless Games (2009)
Lasaulce, Samson, Debbah, Merouane, Altman, Eitan
Under certain assumptions in terms of information and models, equilibria correspond to possible stable outcomes in conflicting or cooperative scenarios where rational entities interact. For wireless...
Methodologies for Analyzing Equilibria in Wireless Games (2009)
Lasaulce, Samson, Debbah, Merouane, Altman, Eitan
Under certain assumptions in terms of information and models, equilibria correspond to possible stable outcomes in conflicting or cooperative scenarios where rational entities interact. For wireless...
Optimal Sampling for State Change Detection with Application to the Control of Sleep Mode (2009)
Azad, Amar, Alouf, Sara, Altman, Eitan, Borkar, Vivek, Paschos, Georgios
This work considers systems with inactivity periods of unknown duration during which the server goes on vacation. We study the question of scheduling ``waking up'' instants in which a server can...
Optimal Sampling for State Change Detection with Application to the Control of Sleep Mode (2009)
Azad, Amar, Alouf, Sara, Altman, Eitan, Borkar, Vivek, Paschos, Georgios
This work considers systems with inactivity periods of unknown duration during which the server goes on vacation. We study the question of scheduling ``waking up'' instants in which a server can...
Routing Games : From Egoism to Altruism (2009)
Azad, Amar Prakash, Altman, Eitan, El-Azouzi, Rachid
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and that of other users,...
Routing Games : From Egoism to Altruism (2009)
Azad, Amar Prakash, Altman, Eitan, El-Azouzi, Rachid
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and that of other users,...
Battery-State Dependent Power Control as a Dynamic Game (2008)
Consider an uplink cellular network shared by a finite number of mobile users with limited batteries. Whenever the battery drains out, the user pays a fixed price to recharge the battery. Users,...
with Variable GoS ∗ Abstract (2008)
Nidhi Hegde, France Telecom, Eitan Altman
Traditional definitions of capacity of CDMA networks are either related to the number of calls they can handle (pole capacity) or to the arrival rate that guarantees that the rejection rate (or...
Fixed Point Analysis of Single Cell IEEE 802.11e WLANs: Uniqueness and Multistability (2008)
Ramaiyan, Venkatesh, Kumar, Anurag, Altman, Eitan
We consider the vector fixed point equations arising out of the analysis of the saturation throughput of a single cell IEEE 802.11e (EDCA) wireless local area network with nodes that have different...
Eitan Altman, Centre Sophia Antipolis, Ger Koole
the Netherlands We consider the control of a random walk on the nonnegative integers. The controller has two actions. It makes decisions based on noisy information on the current state but on full...
Alberto Suárez Real, Advisors Merouane Debbah, Eitan Altman
This work is the result of a 3.5 month intership at INRIA Sophia Antipolis under the supervision of professors Merouane Debbah and Eitan Altman. In spite of the number of papers studying capacity and...
New cross-layer channel switching policy for TCP transmission on (2008)
Thème Com, Dinesh Kumar, Dinesh Kumar, Dhiman Barman, Dhiman Barman, Eitan Altman, ...
apport de recherche ISSN 0249-6399 ISRN INRIA/RR--5962--FR+ENG
Second year Ph.D student specializing in wireless computer/communication networks in the Maestro group at
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Kartikeya Ch
Abstract — One of the primary concerns for the network providers in designing or upgrading a network is deciding where to add capacity. This in turn requires uniquely identifying the congestion...
Queueing analysis of simple FEC schemes for 1P Telephony (2008)
for the recovery from packet losses. These schemes need to he simple with a light coding and decoding overhead in order to not impact the interactivity. The objective of this paper is to study a well...
Performance Analysis of AIMD Mechanisms over a Multi-state Markovian Path (2008)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Parijat Dube
We analyze the performance of an Additive Increase Multiplicative Decrease (AIMD)-like flow control mechanism. The transmission rate is considered to increase linearly in time until the receipt of a...
The Linear Program approach in multi-chain Markov Decision Processes revisited (2008)
Linear Programming is known to be an important and useful tool for solving Markov Decision Processes (MDP). Its derivation relies on the Dynamic Programming approach, which also serves to solve MDP....
On the Dynamic Estimation of Multicast Group Sizes (2008)
Sara Alouf, Eitan Altman, Chadi Barakat, Philippe Nain
This paper concerns multicast applications that are interested in the evolution of their membership over time. It covers optimal on-line estimation algorithms for determining the membership of a...
Analysis of the Phenomenon of Several Slow Start Phases in TCP (2008)
INTRODUCTION TCP is known to send bursts of packets during its slow start phase due to the fast window increase and the ACK-clock based transmission [1, 2, 4]. If bu#ers in network routers are not...
A Singular Perturbation Approach to Analysing a RED queue (2008)
Eitan Altman Avrachenkov, Eitan Altman, K. Avrachenkov, B. J. Prabhu
Several Active Queue Management (AQM) techniques for routers in the Internet have been proposed and studied during the past few years. One of the widely studied proposals, Random Early Detection...
Impact of Buffer Size on TCP Start-Up (2008)
The Slow Start (SS) phase at the beginning of a TCP connection affects the performance of short transfers especially on long delay links such as Satellite Links. Many works have tried to improve the...
Performance Analysis of AIMD Mechanisms over a Multi-state Markovian Path (2008)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Parijat Dube
We analyze the performance of an Additive Increase Multiplicative Decrease (AIMD)-like flow control mechanism. The transmission rate is considered to increase linearly in time until the receipt of a...
Optimal Random Access in Networks with Two-Way Traffic (2008)
Eitan Altman, Vivek S. Borkar, Arzad A. Kherani, Eitan Altman Ý
We consider a random access network in which the nodes need to optimize their channel access rates. The nodes are assumed to be rational and interested in their performance seen as a transmitter as...
Orchestrated AIMD Flows (2008)
Eitan Altman, Bruno Tuffin, Milan Vojnovic
We consider a link of fixed capacity for which a finite population of adaptive flows compete. The send rate of a flow increases linearly with time in absence of congestion indication, otherwise, it...
A Singular Perturbation Approach to (2008)
Analysing Red Queue, Eitan Altman, K. Avrachenkov, B. J. Prabhu
Several Active Queue Management (AQM) techniques for routers in the Internet have been proposed and studied during the past few years. One of the widely studied proposals, Random Early Detection...
A Robust Identification Algorithm for Traffic Models in Telecommunications (2008)
Omar Ait-Hellal, Eitan Altman, Tamer Basar
The goal of this paper is to present a robust identification algorithm for the parameters of AR stochastic processes, and employ this in analyzing telecommunication traffic data, mainly video traffic...
In this paper we investigate the performances of the EFCI-based (Explicit Forward Congestion Indication) and ER-based (Explicit Rate) algorithms for the rate-based flow control of the ABR (Available...
Stakelberg Approach for Pricing Differentiated Services (2008)
Eitan Altman, Rachid El-Azouzi, Richard Marquez, David Ros, Bruno Tuffin
We consider in this paper both real-time traffic as well as data transfers sharing a common bottleneck link. We assume that data connections use TCP congestion control protocol and that real-time...
Queueing Systems With, Eitan Altman, Tania Jiménez
this article, we study a method to compare queueing systems and their fluid limits+ For a certain class of queueing systems, it is shown that the expected workload ~and certain functions of the...
A Singular Perturbation Approach to Analysing a RED queue (2008)
Eitan Altman Avrachenkov, Eitan Altman, K. Avrachenkov, B. J. Prabhu
Several Active Queue Management (AQM) techniques for routers in the Internet have been proposed and studied during the past few years. One of the widely studied proposals, Random Early Detection...
On ACK Filtering on a Slow Reverse Channel (2008)
ACK filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a TCP connection. Old ACKs waiting at the input of the slow...
Pricing Differentiated Services: A Game-Theoretic Approach (2008)
Eitan Altman, Dhiman Barman, Rachid El Azouzi, David Ros, Bruno Tuffin
The goal of this paper is to study pricing of differentiated services and its impact on the choice of service priority at equilibrium. We consider both TCP connections as well as non controlled (real...
Alouf, Sara, Altman, Eitan, Azad, Amar Prakash
This report presents a method for analyzing a queueing model with repeated inhomogeneous vacations. At the end of a vacation, the server goes on another vacation, possibly with a different...
Load Balancing in Processor Sharing Systems (2008)
Altman, Eitan, Ayesta, Urtzi, Prabhu, Balakrishna
In this paper, we investigate optimal load balancing strategies for a multi-class multi-server processor-sharing system with a Poisson input stream, heterogeneous service rates, and a...
Load Balancing in Processor Sharing Systems (2008)
Altman, Eitan, Ayesta, Urtzi, Prabhu, Balakrishna
In this paper, we investigate optimal load balancing strategies for a multi-class multi-server processor-sharing system with a Poisson input stream, heterogeneous service rates, and a...
Decentralized Stochastic Control of Delay Tolerant Networks (2008)
Altman, Eitan, Neglia, Giovanni, De Pellegrini, Francesco, Miorandi, Daniele
We study in this report optimal stochastic control issues in delay tolerant networks. We first derive the structure of optimal 2-hop forwarding policies. In order to be implemented, such policies...
Decentralized Stochastic Control of Delay Tolerant Networks (2008)
Altman, Eitan, Neglia, Giovanni, De Pellegrini, Francesco, Miorandi, Daniele
We study in this report optimal stochastic control issues in delay tolerant networks. We first derive the structure of optimal 2-hop forwarding policies. In order to be implemented, such policies...
Distributed Power Allocation Game for Uplink OFDM Systems (2008)
Gaoning, He, Gault, Sophie, Debbah, Merouane, Altman, Eitan
In this paper, we consider the uplink of a single cell network with K users simultaneously communicating with a base station using OFDM modulation over N carriers. In such a scenario, users can...
Iterative Mercury/waterfilling for Parallel Multiple Access Channels (2008)
Gaoning, He, Gault, Sophie, Debbah, Merouane, Altman, Eitan
This paper describes a power allocation strategy for fixed constellation over parallel Gaussian channels in the multiuser context. The criterion under consideration is mutual information, given...
Iterative Mercury/waterfilling for Parallel Multiple Access Channels (2008)
Gaoning, He, Gault, Sophie, Debbah, Merouane, Altman, Eitan
This paper describes a power allocation strategy for fixed constellation over parallel Gaussian channels in the multiuser context. The criterion under consideration is mutual information, given...
Distributed Power Allocation Game for Uplink OFDM Systems (2008)
Gaoning, He, Gault, Sophie, Debbah, Merouane, Altman, Eitan
In this paper, we consider the uplink of a single cell network with K users simultaneously communicating with a base station using OFDM modulation over N carriers. In such a scenario, users can...
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks (2008)
Altman, Eitan, Nain, Philippe, Bermond, Jean-Claude
This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant...
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks (2008)
Altman, Eitan, Nain, Philippe, Bermond, Jean-Claude
This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant...
E De Recherche, Et En Automatique, Sophia Antipolis, Eitan Altman, Eitan Altman, Centre Sophia Antipolis
We consider an M/G/1 queue where the server may take repeated vacations. Whenever a busy period terminates (i.e., when the queue empties) the server takes a vacation of random duration. At the end of...
Impact of Buffer Size on TCP Start-Up (2007)
The Slow Start (SS) phase at the beginning of a TCP connection affects the performance of short transfers especially on long delay links such as Satellite Links. Many works have tried to improve the...
Perturbed Zero-Sum Games With Applications to Stochastic and Repeated Games (2007)
Eitan Altman, Eugene A. Feinberg, Jerzy Filar, Vladimir A. Gaitsgory
This paper deals with perturbed matrix games. The main result is that for a large class of perturbations the sets of solutions of perturbed games converge to subsets of solutions of appropriate...
Rate-based flow Control with delayed information (2007)
this paper we take the approach of [2] a step length further, and design controllers based on noisy information, delayed by several time units. This corresponds to a situation where round trip delays...
Analysis Of The TCP/IP Flow Control In High-Speed Wide-Area Networks (2007)
Eitan Altman, Frédéric BOCCARA, Jean Bolot, Philippe NAIN, Patrick Brown, Denis Collange, ...
Introduction We consider the problem of evaluating the performance of TCP (Transmission Control Protocol) over the Internet [3]. Our approach combines experimental and analytic methods, and proceeds...
Rachid El Azouzi, Eitan Altman, Laura Wynter
We present a competitive model that describes the interaction between competing telecommunications service providers (SPs), their subscribers, and a network owner. Competition takes place in pricing...
Sara Alouf, Eitan Altman, Chadi Barakat
Abstract — This paper addresses optimal on-line estimation of the size of a multicast group. Three distinct approaches are used. The first one builds on Kalman filter theory to derive the...
New Insights from a Fixed Point Analysis of Single Cell IEEE 802.11 WLANs (2007)
Thme Com, Anurag Kumar, Daniele Mior, Munish Goyal, Unit Inria, Sophia Antipolis, ...
apport de recherche
Corinne Touati, Eitan Altman, Jerome Galtier
for bandwidth allocation in communication networks
Tansu Alpcan, R. Srikant, Eitan Altman
We present a game-theoretic treatment of distributed power control in CDMA wireless systems. We make use of the conceptual framework of noncooperative game theory to obtain a distributed and...
Asad Khamisy, Eitan Altman, Moshe Sidi
We introduce a new service discipline, called the synchronized gated discipline, for polling systems. It arises when there are precedence (or synchronization) constraints between the order that jobs...
Decreasing Loss Probabilities by Redundancy and Interleaving: a Queueing Analysis (2007)
Alain Jean-marie, Parijat Dube, Damien Artiges, Eitan Altman
This paper studies a forward error correction (FEC) scheme that reduces loss probabilities of messages, based on adding redundant packets and interleaving, as proposed in [17]. We rst show that when...
Admission and Flow Control in Telecommunication Networks as a Hybrid Control Problem (2007)
Eitan Altman, Tamer Basar, Zigang Pan
We consider the problem of optimally controlling piecewise deterministic (or equivalently jump parameter) linear systems, where the transition rate matrix of the underlying Markov jump process is...
Control in Integrated Services Packet Networks (2007)
Sophia Antipolis Cedex, Advisor Prof, Eitan Altman
2000-2002 Doctorat en Inormatique (Ph.D. in Computer Engineering)
ε-EQUILIBRIA FOR STOCHASTIC GAMES WITH UNCOUNTABLE STATE SPACE AND UNBOUNDED COSTS ∗ (2007)
Andrzej S. Nowak, Eitan Altman
Abstract. We study a class of noncooperative stochastic games with unbounded cost functions and an uncountable state space. It is assumed that the transition law is absolutely continuous with respect...
1 Avoiding Paradoxes in Routing Games (2007)
Eitan Altman, Rachid El Azouzi, Odile Pourtallier
Strange behavior may occur in networks due to the non-cooperative nature of decision making, when the latter are taken by individual agents. In particular, the well known Braess paradox illustrates...
Rachid El Azouzi, Eitan Altman, Vladimir Gaitsgory
averaging principle for perturbations of continuous time
Sara Alouf, Eitan Altman, Inria Sophia Antipolis, Sophia Antipolis Cedex
on-line estimation of the size of a dynamic
Abstract We study a class of noncooperative general topology networks shared by N users. Each user has a given AEow which it has to ship from a source to a destination. We consider a class of...
We consider a noncooperative game framework for combined routing and ow control in a network of parallel links, where the number of users (players) is arbitrarily large. The utility function of each...
On ACK filtering on a slow reverse channel (2007)
Chadi Barakat, Chadi Barakat, Eitan Altman, Eitan Altman, Projet Mistral
apport de recherche
Analysis of the phenomenon of several slow start phases in TCP (2007)
TCP is known to send bursts of packets during its slow start phase due to the fast window increase and the ACK-clock based transmission [1, 2, 4]. If buoeers in network routers are
1 Fluid Analysis of Early Message Discarding Policy under Heavy Traffic (2007)
Abstract--- A message(or a frame) is a group of consecutive packets (or cells ATM terminology). Often a loss of one packet from the message can result in the loss of the whole message. Selective...
1 Queueing Analysis of Early Message Discard Policy (2007)
Abstract--- We consider in this paper packets which arrive according to a Poisson process into a finite queue. A group of consecutive packets forms a frame (or a message) and one then considers not...
Capacity and Large Bandwidth-Delay Product (2007)
Chadi Barakat, Chadi Barakat, Eitan Altman, Eitan Altman, Projet Mistral
apport de recherche
Competitive routing in networks (2007)
Eitan Altman, Tamer Basar, Tania Jim, Nahum Shimkin
We study a class of noncooperative general topology networks shared by N users. Each user has a given flow which it has to ship from a source to a destination. We consider a class of polynomial link...
ISRN INRIA/RR--4312--FR+ENG (2007)
Rudesindo Nez-queija, Unit Inria, Sophia Antipolis, Eitan Altman, Eitan Altman, Konstantin Avrachenkov, ...
apport de recherche
2004 Route des Lucioles (2007)
Eitan Altman, Sandjai Bhulai, De Boelelaan A, Bruno Gaujal, Arie Hordijk
servers with no buers
Bandwidth tradeooe between TCP and link-level FEC (2007)
Abstract. FEC is widely used to improve the quality of noisy transmission media as wireless links. This improvement is of importance for a transport protocol as TCP which uses the loss of packets as...
Eitan Altman, Kostia Avrachenkov, Chadi Barakat, Rudesindo Nunez-queija
We develop a model for TCP that accounts for both sublinearity and limitation of window growth. Sublinear window growth is observed when the round-trip time of the connection increases with the...
An Asymptotic Simplex Method and Markov (2007)
Decision Processes Eitan, Eitan Altman, Konstantin Avrachenkov, Jerzy Filar
The purpose of this paper is twofold. First we present an asymptotic simplex method for the parametric linear programming. The asymptotic simplex method allows to nd a solution which is optimal for...
1 A stateless approach for improving TCP performance using Diserv (2007)
In TCP connections, the loss of some segments has more impact than the loss of others on the performance of the connection. These segments are (i) the connection establishment segments, (ii) the...
Eitan Altman, Rachid El Azouzi, Tania Jimenez
A game theoretic approach for delay minimization in slotted aloha
On the Dynamic Estimation of Multicast Group Sizes (2007)
Sara Alouf, Eitan Altman, Chadi Barakat, Philippe Nain
This paper concerns multicast applications that are interested in the evolution of their membership over time. It covers optimal on-line estimation algorithms for determining the membership of a...
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Kartikeya Chandrayana, Kartikeya Ch
One of the primary concerns for the network providers in designing or upgrading a network is deciding where to add capacity. This in turn requires uniquely identifying the congestion hot-spots....
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Kartikeya Ch
Abstract — One of the primary concerns for the network providers in designing or upgrading a network is deciding where to add capacity. This in turn requires uniquely identifying the congestion...
Closed form solutions for symmetric water filling games (2007)
Altman, Eitan, Avrachenkov, Konstantin, Garnaev, Andrey
We study power control in optimization and game frameworks. In the optimization framework there is a single decision maker who assigns network resources and in the game framework users share the...
Closed form solutions for symmetric water filling games (2007)
Altman, Eitan, Avrachenkov, Konstantin, Garnaev, Andrey
We study power control in optimization and game frameworks. In the optimization framework there is a single decision maker who assigns network resources and in the game framework users share the...
Discrete power control: Cooperative and non-cooperative optimization (2007)
Eitan Altman, Konstantin Avrachenkov, Gregory Miller, Balakrishna Prabhu
Abstract — We consider an uplink power control problem where each mobile wishes to maximize its throughput (which depends on the transmission powers of all mobiles) but has a constraint on the...
Fair power and transmission rate control in wireless networks (2006)
Altman, Eitan, Galtier, Jerome, Touati, Corinne
In third generation mobile networks, transmission rates can be assigned to both real time and non real time applications. We address in this paper the question of how to allocate transmission rates...
Performance Evaluation of Packet Relaying in Ad Hoc Networks (2006)
Al Hanbali, Ahmad, Nain, Philippe, Altman, Eitan
Considered is a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing protocol. Packets at relay nodes are assumed to have...
Route Lifetime based Interactive Routing in Intervehicle Mobile Ad Hoc Networks (2006)
Kumar, Dinesh, Kherani, Arzad A., Altman, Eitan
The main goal of this paper is to better understand the route lifetime dynamics in Intervehicle communication networks (IVC) or what we call intervehicle mobile ad hoc networks (iv-MANETs) that are a...
Fair rate sharing models in a CDMA link with multiple classes of elastic traffic (2006)
Koukoutsidis, Ioannis, Altman, Eitan, Kelif, Jean Marc
In this paper we describe a modeling approach for studying fair rate sharing on a CDMA link. Capacity models derived for CDMA indicate that fair rate sharing belongs to the class of generalized...
Cooperative and Non-Cooperative Control in IEEE 802.11 WLANs (2006)
Altman, Eitan, Kumar, Anurag, Kumar, Dinesh, Venkatesh, Ramaiyan
Numerous algorithms and techniques for optimal performance of an IEEE 802.11 WLAN have been investigated by researchers. These algorithms make use of either power control or PHY (physical layer) rate...
Expected waiting time in symmetric polling systems with correlated vacations (2006)
Polling systems have been extensively studied, and have had many applications. They have often been used for studying wired local areas networks (such as token passing rings) and wireless local area...
New Cross-Layer Channel Switching Policy for TCP Transmission on 3G UMTS Downlink (2006)
Kumar, Dinesh, Barman, Dhiman, Altman, Eitan, Kelif, Jean-Marc
In 3G UMTS, two main transport channels have been provided for downlink data transmission: a common FACH channel and a dedicated DCH channel. The performance of TCP in UMTS depends much on the...
User-Network Association in a WLAN-UMTS Hybrid Cell: Global & Individual Optimality (2006)
Kumar, Dinesh, Altman, Eitan, Kelif, Jean-Marc
We study optimal user-network association in an integrated 802.11 WLAN and 3G-UMTS hybrid cell. Assuming saturated resource allocation on the downlink of WLAN and UMTS networks and a single QoS class...
Performance Evaluation of Packet Relaying in Ad Hoc Networks (2006)
Al Hanbali, Ahmad, Nain, Philippe, Altman, Eitan
Considered is a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing protocol. Packets at relay nodes are assumed to have...
New Cross-Layer Channel Switching Policy for TCP Transmission on 3G UMTS Downlink (2006)
Kumar, Dinesh, Barman, Dhiman, Altman, Eitan, Kelif, Jean-Marc
In 3G UMTS, two main transport channels have been provided for downlink data transmission: a common FACH channel and a dedicated DCH channel. The performance of TCP in UMTS depends much on the...
User-Network Association in a WLAN-UMTS Hybrid Cell: Global & Individual Optimality (2006)
Kumar, Dinesh, Altman, Eitan, Kelif, Jean-Marc
We study optimal user-network association in an integrated 802.11 WLAN and 3G-UMTS hybrid cell. Assuming saturated resource allocation on the downlink of WLAN and UMTS networks and a single QoS class...
Cooperative and Non-Cooperative Control in IEEE 802.11 WLANs (2006)
Altman, Eitan, Kumar, Anurag, Kumar, Dinesh, Venkatesh, Ramaiyan
Numerous algorithms and techniques for optimal performance of an IEEE 802.11 WLAN have been investigated by researchers. These algorithms make use of either power control or PHY (physical layer) rate...
Uplink dynamic discrete power control in cellular networks (2006)
Altman, Eitan, Avrachenkov, Konstantin, Miller, Gregory, Prabhu, Balakrishna
We consider an uplink power control problem where each mobile wishes to maximize its throughput (which depends on the transmission powers of all mobiles) but has a constraint on the average power...
Uplink dynamic discrete power control in cellular networks (2006)
Altman, Eitan, Avrachenkov, Konstantin, Miller, Gregory, Prabhu, Balakrishna
We consider an uplink power control problem where each mobile wishes to maximize its throughput (which depends on the transmission powers of all mobiles) but has a constraint on the average power...
Constrained cost-coupled stochastic games with independent state processes, submitted (2006)
Eitan Altman, Konstantin Avrachenkov, Nicolas Bonneau, Merouane Debbah, Rachid El-azouzi, Daniel Sadoc Menasche
We consider a non-cooperative constrained stochastic games with N players with the following special structure. With each player i there is an associated controlled Markov chain MDPi. The transition...
Loss strategies for competing AIMD flows (2006)
Eitan Altman, Rachid El Azouzi, David Ros, Bruno Tuffin
We study in this paper two competing AIMD flows that share a common bottleneck link. When congestion occurs, one (or both) flows will suffer a loss that will cause its throughput to decrease by a...
Generalized Nash Bargaining Solution for Bandwidth Allocation (2006)
Corinne Touati, Eitan Altman, Jerome Galtier, Jérôme Galtier
For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game theory has been used in networks to share resources fairly. Due to its many appealing properties, it has recently...
Performance of Ad Hoc Networks with Two-Hop Relay Routing and Limited Packet Lifetime (2006)
Ahmad Al Hanbali, Philippe Nain, Eitan Altman
Considered is a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing protocol. Packets at relay nodes are assumed to have...
Performance of Ad Hoc Networks with Two-Hop Relay Routing and Limited Packet Lifetime (2006)
Ahmad Al Hanbali, Philippe Nain, Eitan Altman
Considered is a mobile ad hoc network consisting of three types of nodes (source, destination and relay nodes) and using the two-hop relay routing protocol. Packets at relay nodes are assumed to have...
Parallel tcp sockets: Simple model, throughput and validation (2006)
Abstract — We found a formula for aggregate throughput of arbitrarily given number of competing additive-increase, multiplicative-decrease connections (TCP congestion avoidance mode) for a...
Correlated equilibrium in access control for wireless communications (2006)
Eitan Altman, Nicolas Bonneau, Mérouane Debbah
We study a finite population of mobiles communicating using the slotted ALOHA-type protocol. Our objective is the study of coordination between the mobiles in both cooperative as well as...
Spectral Efficiency of CDMA Downlink Cellular Networks with Matched Filter (2006)
Nicolas Bonneau, Mérouane Debbah, Eitan Altman
In this contribution, the performance of a downlink code division multiple access (CDMA) system with orthogonal spreading and multicell interference is analyzed. A useful framework is provided in...
New Insights from a Fixed Point Analysis of Single Cell (2005)
Anurag Kumar, Eitan Altman, Daniele Mior, Munish Goyal
Abstract — We study a fixed point formalisation of the well known analysis of Bianchi [3]. We provide a significant simplification and generalisation of the analysis. In this more general...
New insights from a fixed-point analysis of single cell (2005)
Anurag Kumar, Eitan Altman, Daniele Mior, Munish Goyal
Abstract—We study a fixed-point formalization of the well-known analysis of Bianchi. We provide a significant simplification and generalization of the analysis. In this more general framework, the...
Analysis of Alternating-priority Queueing Models with (Cross) Correlated Switchover Times (2005)
Robin Groenevelt, Eitan Altman
This paper analyzes a single server queueing system in which service is alternated between two queues and the server requires a (finite) switchover time to switch from one queue to the other. The...
Downlink Fluid Model of CDMA Networks (2005)
Introduction 3 2 Study organization 3 3 Capacity of network WCDMA 3 3.1 General model 3 3.1.1 General approach 3 3.1.2 Background of a cell Limited 3 3.2 Role of the intercellular interference...
Coverage and Connectivity of Ad Hoc Networks in Presence of Channel Randomness (2005)
Daniele Miorandi, Eitan Altman
In this paper, we present an analytical procedure for the computation of the node isolation probability in an ad hoc network in the presence of channel randomness, with applications to shadowing and...
Performance analysis of AIMD mechanisms over a multi-state Markovian path (2005)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Parijat Dube
WeanalLF the performance of an Additive IncreaseMulasebflgg)Lb Decrease(AIMD)-lTF flowcontrol mechanism. The transmission rate is considered to increase lcrease in timeuntil the receipt of a...
Quasi-Optimal Resource Allocation in Multi-Spot MFTDMA Satellite Networks (2005)
Maggie Cheng, Yingshu Li, Sara Alouf, Eitan Altman, Jérôme Galtier, Jean-françois Lalande, ...
This chapter presents an algorithm for resource allocation in satellite networks.
On Stochastic Recursive Equations and Infinite Server Queues (2005)
The purpose of this paper is to investigate some performance measures of the discrete time G/G/ queue under a general arrival process. We assume more precisely that at each time unit a batch with a...
Quasi-Optimal Bandwidth Allocation for Multi-Spot MFTDMA Satellites (2005)
Sara Alouf, Eitan Altman, Jerome Galtier, Jérôme Galtier, Jean-Francois Lalande, Corinne Touati
This paper presents an algorithm for resource allocation in satellite networks . It deals with planning a time/frequency plan for a set of terminals with a known geometric configuration under...
Quasi-Optimal Bandwidth Allocation for Multi-Spot MFTDMA Satellites (2005)
Sara Alouf, Eitan Altman, Jerome Galtier, Jérôme Galtier, Jean-Francois Lalande, Corinne Touati
This paper presents an algorithm for resource allocation in satellite networks . It deals with planning a time/frequency plan for a set of terminals with a known geometric configuration under...
Analysis of alternating-priority queueing models with (cross) correlated switchover times (2005)
Robin Groenevelt, Eitan Altman
This paper analyzes a single server queueing system in which service is alternated between two queues and the server requires a (finite) switchover time to switch from one queue to the other. The...
Slotted Aloha with priorities and random power (2005)
Eitan Altman, Dhiman Barman, Abderrahim Benslimane, Rachid El Azouzi, Dhiman Barman Ý, Abderrahim Benslimane Þ, ...
This paper studies distributed choice of retransmission probabilities in slotted Aloha under power differentiation schemes. We consider random sets of possible transmission powers and further study...
Orchestrated AIMD Flows (2005)
Eitan Altman, Bruno Tuffin, Milan Vojnovic
Consider a link of a fixed capacity for which a finite population of adaptive flows compete. Suppose that the send rate of a flow increases linearly with time in absence of congestion indication,...
A Survey of TCP over Ad Hoc Networks (2005)
Ahmad Al Hanbali, Eitan Altman
The Transmission Control Protocol (TCP) was designed to provide reliable end-to-end delivery of data over unreliable networks. In practice, most TCP deployments have been carefully designed in the...
Cross-layer design for optimizing TCP performance (2005)
A. Chockalingam, Eitan Altman, Ramdoot Kumar
Abstract — In this paper, we propose and analyze novel and efficient cross-layer designs involving joint optimization of physical, link, and TCP layers in wireless. Particularly, we investigate the...
Performance of channel inversion schemes for multi-user OFDMA (2005)
Nicolas Bonneau, Mérouane Debbah, Are Hjørungnes, Eitan Altman
Abstract — A novel multi-user diversity scheme for OFDMA
Koukoutsidis, Ioannis, Altman, Eitan, Kelif, Jean Marc
We consider a WCDMA system with two types of calls: real time (RT) calls that have dedicated resources, and data non-real-time (NRT) calls that share system capacity. We consider reservation of some...
An Alternating-Priority Server with Correlated Switchover Times (2004)
Altman, Eitan, Groenevelt, Robin
This document analyzes a single server queueing system in which service is alternated between two queues and the server requires a (finite) switchover time to switch from one queue to the other. The...
Coverage and Connectivity of Ad-Hoc Networks in Presence of Channel Randomness (2004)
Miorandi, Daniele, Altman, Eitan
In this paper we present an analytical procedure for the computation of the node isolation probability in an ad-hoc network in presence of channel randomness, with applications to shadowing and...
Relaying in Mobile Ad Hoc Networks: The Brownian Motion Mobility Model (2004)
Altman, Eitan, Groenevelt, Robin, Nain, Philippe
Mobile ad hoc networks are characterized by a lack of a fixed infrastructure and by node mobility. In these networks data transfer can be improved by using mobile nodes as relay nodes. As a result,...
Analysis of AIMD protocols over paths with variable delay (2004)
Altman, Eitan, Barakat, Chadi, Ramos, Víctor
The throughput of AIMD protocols in general and of TCP in particular, has been computed in many existing works by modeling the round-trip time as a constant and thus replacing it by its expectation....
New Insights from a Fixed Point Analysis of Single Cell IEEE 802.11 WLANs (2004)
Kumar, Anurag, Altman, Eitan, Miorandi, Daniele, Goyal, Munish
We study a fixed point formalisation of the well known analysis of Bianchi. We provide a significant simplification and generalisation of the analysis. In this more general framework, the fixed point...
A Survey of TCP over Mobile Ad Hoc Networks (2004)
Al Hanbali, Ahmad, Altman, Eitan, Nain, Philippe
The Transmission Control Protocol (TCP) was designed to provide reliable end-to-end delivery of data over unreliable networks. In practice, most TCP deployments have been carefully optimized in the...
On stochastic recursive equations and infinite server queues (2004)
The purpose of this paper is to investigate some performance measures of the discrete time G/G/$\infty$ queue under a general arrival process. We assume more precisely that at each time unit a batch...
Un algorithme d'allocation de bande passante satellitaire (2004)
Alouf, Sara, Altman, Eitan, Galtier, Jérôme, Lalande, Jean-François, Touati, Corinne
Ce rapport présente un algorithme d'allocation de ressources pour les réseaux satellitaires. Il s'agit de prévoir un plan d'allocation en temps/fréquence pour un ensemble de terminaux ayant une...
Non-cooperative Forwarding in Ad-hoc Networks (2004)
Altman, Eitan, Kherani, Arzad A., Michiardi, Pietro, Molva, Refik
A wireless Ad-hoc network is expected to be made up of energy aware entities (nodes) interested in their own perceived performance. An important problem in such a scenario is to provide incentives...
Heavy Traffic Analysis of AIMD Models (2004)
Altman, Eitan, Kushner, J. Harold
The goal of this paper is to study heavy traffic asymptotics of many Additive Increase Multiplicative Decrease (AIMD) connections sharing a common router in the presence of other uncontrolled...
Loss Strategies for Competing TCP/IP Connections (2004)
Altman, Eitan, El Azouzi, Rachid, Ros, David, Tuffin, Bruno
We study in this paper two competing TCP connections that share a common bottleneck link. When congestion occurs, one (or both) connections will suffer a loss that will cause its throughput to...
Analysis of AIMD protocols over paths with variable delay (2004)
Altman, Eitan, Barakat, Chadi, Ramos, Víctor
The throughput of AIMD protocols in general and of TCP in particular, has been computed in many existing works by modeling the round-trip time as a constant and thus replacing it by its expectation....
A Survey of TCP over Mobile Ad Hoc Networks (2004)
Al Hanbali, Ahmad, Altman, Eitan, Nain, Philippe
The Transmission Control Protocol (TCP) was designed to provide reliable end-to-end delivery of data over unreliable networks. In practice, most TCP deployments have been carefully optimized in the...
A queueing model for HTTP traffic over IEEE 802.11 WLANs (2004)
Daniele Mior, Arzad A. Kherani, Eitan Altman
We consider an IEEE 802.11 based wireless LAN where an access point is used to connect a fixed number of users to the web or to a shared file system. Users alternate between activity periods...
Analysis of Scalable TCP (2004)
Eitan Altman, K. Avratchenkov, C. Barakat, A. A. Kherani, B. J. Prabhu
Abstract. Scalable TCP [2] is a proposition for a new TCP where both the increase and the decrease rate of the window size are multiplicative. It has been recently proposed in order to improve...
DPS queues with stationary ergodic service times (2004)
And The Performance, Eitan Altman, Tania Jiménez, Daniel Kofman
In a recent paper, Bonald and Roberts [1] studied non-persistent TCP connections in transient overload conditions, under the assumption that all connections have the same round-trip times. In this...
Analysis of AIMD protocols over paths with (2004)
Variable Delay Eitan, Eitan Altman, Chadi Barakat, Autónoma Metropolitana
The throughput of AIMD protocols in general and of TCP in particular, has been computed in many existing works by modeling the round-trip time as a constant and thus replacing the round-trip time by...
DPS queues with stationary ergodic service times and the performance of TCP in overload (2004)
Eitan Altman, Tania Jimenez, Daniel Kofman
In a recent paper, Bonald and Roberts [1] studied non-persistent TCP connections in transient overload conditions, under the assumption that all connections have the same round-trip times. In this...
A Game Theoretic Approach for Delay Minimization in Slotted Aloha (2004)
Eitan Altman, Dhiman Barman, Rachid El Azouzi, Tania Jiménez
This paper studies distributed choice of retransmission probabilities in slotted ALOHA. Both the cooperative team problem as well as the noncooperative game problem are considered. In previous work...
Perturbation Analysis For Denumerable Markov Chains With Application To Queueing Models (2004)
Eitan Altman, Konstantin E. Avrachenkov, Benjamin C. Pierce, David N. Turner
We study the parametric perturbation of Markov chains with denumerable state spaces. We consider both regular and singular perturbations. By the latter we mean that transition probabilities of a...
Non-Cooperative Forwarding in Ad-Hoc Networks (2004)
Eitan Altman, Arzad A. Kherani, Pietro Michiardi, Refik Molva, Pietro Michiardi Ý, Refik Molva Ý
A wireless Ad-hoc network is expected to be made up of energy aware entities (nodes) interested in their own perceived performance. An important problem in such a scenario is to provide incentives...
A Queueing Model for HTTP Traffic over IEEE 802.11 WLANs (2004)
Daniele Miorandi, Arzad A. Kherani, Eitan Altman
We consider an IEEE 802.11 based wireless LAN where an access point is used to connect a fixed number of users to the web or to a shared file system. Users alternate between activity periods...
Non-cooperative Forwarding in Ad-hoc Networks (2004)
Eitan Altman, Arzad A. Kherani, Pietro Michiardi, Refik Molva
A wireless Ad-hoc network is expected to be made up of energy aware entities (nodes) interested in their own perceived performance. An important problem in such a scenario is to provide incentives...
New Insights from a Fixed Point Analysis of Single Cell IEEE 802.11 WLANs (2004)
Anurag Kumar, Eitan Altman, Daniele Miorandi, Munish Goyal
We study a fixed point formalisation of the well known analysis of Bianchi. We provide a significant simplification and generalisation of the analysis. In this more general framework, the fixed point...
Modeling TCP and High Speed TCP: A Nonlinear Extension to AIMD Mechanisms (2004)
Richard Marquez, Eitan Altman, Solazver Sole-Alvarez
We propose two modeling approaches of AIMD congestion control mechanisms. The first separates the increase and decrease parts where as the second describes the rate evolution as a continuous process...
Analysis of AIMD protocols over paths with variable delay (2004)
The throughput of AIMD protocols in general and of TCP in particular, has been computed in many existing works by modeling the round-trip time as a constant and thus replacing it by its expectation....
Non-cooperative Forwarding in Ad-hoc Networks (2004)
Eitan Altman Arzad, Eitan Altman, Arzad A. Kherani, Pietro Michiardi, Refik Molva
A wireless Ad-hoc network is expected to be made up of energy aware entities (nodes) interested in their own perceived performance. An important problem in such a scenario is to provide incentives...
Abstract Many models for customers impatience in queueing systems have been studied in the past; the source of impatience has always been taken to be either a long wait already experienced at a...
TCP optimization through FEC, ARQ and transmission power trade offs (2004)
Dhiman Barman, Ibrahim Matta, Eitan Altman, Rachid El Azouzi
Abstract. TCP performance degrades when end-to-end connections extend over wireless connections — links which are characterized by high bit error rate and intermittent connectivity. Such link...
TCP optimization through FEC, ARQ and transmission power trade offs (2004)
Dhiman Barman, Ibrahim Matta, Eitan Altman, Rachid El Azouzi
Abstract. TCP performance degrades when end-to-end connections extend over wireless connections — links which are characterized by high bit error rate and intermittent connectivity. Such link...
Non-cooperative Forwarding in Ad-hoc Networks (2004)
Refik Molva, Eitan Altman, Eitan Altman, Arzad A. Kherani, Arzad A. Kherani, Pietro Michiardi, ...
A wireless Ad-hoc network is expected to be made up of energy aware entities (nodes) interested in their own perceived performance. An important problem in such a scenario is to provide incentives...
Simulation analysis of RED with short lived TCP connections (2004)
Several objectives have been identified in developing the randomearly drop (RED): decreasing queueingdelay increasing throughput, and increasing fairness between short and long lived connections. It...
Loss Strategies for Competing TCP/IP Connections (2004)
Eitan Altman, Rachid El-azouzi, David Ros, Bruno Tuffin
Abstract. We study in this paper two competing TCP connections that share a common bottleneck link. When congestion occurs, one (or both) connections will suffer a loss that will cause its throughput...
Connectivity in Ad-Hoc Networks: an Infinite-Server Queue Approach (2003)
Miorandi, Daniele, Altman, Eitan
In this paper we present some extensions on previously published results regarding connectivity issues in one--dimensional ad--hoc networks. We show how an equivalentGI|D|\infty$ queueing model may...
Pricing Differential Services: A Game-Theoretic Approach (2003)
Altman, Eitan, Barman, D., El Azouzi, Rachid, Ros, David, Tuffin, Bruno
The goal of this paper is to study pricing of differential services and its impact on the choice of service priority at equilibrium. We consider both TCP connections as well as non controlled (real...
On The Effect of Feedback Traffic in IEEE 802.11b WLANs (2003)
Miorandi, Daniele, Altman, Eitan
In this work we study the effect of TCP feedback traffic in IEEE 802.11b--based WLANs. In particular, we present an analytical model which allows to evaluate the impact of the delayed acknowledgments...
Simulation Analysis and Fixed Point Approach for Multiplexed TCP flows (2003)
Ayesta, Urtzi, Avrachenkov, Konstantin, Altman, Eitan, Barakat, Chadi, Dube, Parijat
We analyze with NS simulations the aggregated packet arrival process into a bottleneck queue generated by multiplexed TCP flows. We explain qualitativel- y the shape of the packet interarrival time...
Multilevel Approach for Modeling Short TCP Sessions (2003)
Ayesta, Urtzi, Avrachenkov, Konstantin, Altman, Eitan, Barakat, Chadi, Dube, Parijat
We model the TCP/IP network with non persistent sessions on three levels: Packet level, Session level and System level. On the packet level we character- ize the packet arrival process at the...
Perturbation Analysis for Denumerable Markov Chains with Application to Queueing Models (2003)
Altman, Eitan, Núñez-Queija, Rudesindo, Avrachenkov, Konstantin
We study the parametric perturbation of Markov chains with denumerable state space. We consider both regular and singular perturbations. By the latter we mean that transition probabilities of a...
Simulation Analysis and Fixed Point Approach for Multiplexed TCP flows (2003)
Ayesta, Urtzi, Avrachenkov, Konstantin, Altman, Eitan, Barakat, Chadi, Dube, Parijat
We analyze with NS simulations the aggregated packet arrival process into a bottleneck queue generated by multiplexed TCP flows. We explain qualitativel- y the shape of the packet interarrival time...
Perturbation Analysis for Denumerable Markov Chains with Application to Queueing Models (2003)
Altman, Eitan, Núñez-Queija, Rudesindo, Avrachenkov, Konstantin
We study the parametric perturbation of Markov chains with denumerable state space. We consider both regular and singular perturbations. By the latter we mean that transition probabilities of a...
Capacity of Multiservice WCDMA Networks with Variable GoS (2003)
Abstract — Traditional definitions of capacity of CDMA networks are either related to the number of calls they can handle (pole capacity) or to the arrival rate that guarantees that the rejection...
A moving average predictor for playout delay control (2003)
Abstract. Audio applications are now widely used in the Internet. Such applications require receiver playout buffers to smooth network delay variations and to reconstruct the periodic form of the...
Capacity of Multiservice WCDMA Networks with Variable GoS (2003)
Abstract--- Traditional definitions of capacity of CDMA networks are either related to the number of calls they can handle (pole capacity) or to the arrival rate that guarantees that the rejection...
Novel delayed ACK techniques for improving TCP performance in multihop wireless networks (2003)
Eitan Altman, Inria Bp, Facultad De Ingeniera
We study in this paper TCP performance over a static multihop network that uses IEEE 802.11 protocol for access. For such networks it has been shown in [6] that TCP performance is mainly determined...
Queueing and Fluid Analysis of Partial Message Discarding Policy (2003)
We consider a stream of packets that arrive at a queue with a finite buffer. A group of consecutive packets constitutes a frame. We assume that when an arriving packet finds the queue full, not only...
On the Effect of Feedback Traffic in IEEE 802.11b WLANs (2003)
Daniele Mior, Eitan Altman, Eitan Altman, Projets Mistral
In this work we study the eect of TCP feedback trac in IEEE 802.11bbased WLANs. In particular, we present an analytical model which allows to evaluate the impact of the delayed acknowledgments option...
TCP Optimization through FEC, ARQ and Transmission Power Tradeoffs (2003)
Dhiman Barman, Ibrahim Matta, Eitan Altman, Rachid El Azouzi
TCP performance degrades when end-to-end connections extend over wireless connections --- links which are characterized by high bit error rate and intermittent connectivity. Such link characteristics...
Capacity of Multiservice WCDMA Networks with Variable GoS (2003)
Traditional definitions of capacity of CDMA networks are either related to the number of calls they can handle (pole capacity) or to the arrival rate that guarantees that the rejection rate (or...
On Loss Probabilities in Presence of Redundant Packets with Random Drop (2003)
Parijat Dube, Omar Ait-Hellal, Eitan Altman
The purpose of this paper is to study the loss probabilities of messages in an M/M/1/K queueing system where in addition to losses due to buffer overflow there are also random losses in the incoming...
Optimal Estimation of Multicast Membership (2003)
Sara Alouf Eitan, Eitan Altman, Senior Member, Chadi Barakat
This paper addresses optimal on-line estimation of the size of a multicast group. Three distinct approaches are used. The first one builds on Kalman filter theory to derive the MSEoptimal estimator...
S-Modular Games and Power Control in Wireless Networks (2003)
This note shows how centralized or distributed power control algorithms in wireless communications can be viewed as S-modular games coupled policy sets (coupling is due to the fact that the set of...
Analysis of Alternating-Priority Queueing Models with (Cross) Correlated Switchover Times (2003)
Robin Groenevelt, Eitan Altman, Inria Sophia Antipolis
This paper analyzes a single server queueing system in which service is alternated between two queues and the server requires a (finite) switchover time to switch from one queue to the other. The...
Optimal Estimation of Multicast Membership (2003)
Sara Alouf, Eitan Altman, Senior Member, Philippe Nain, Chadi Barakat
This paper addresses optimal on-line estimation of the size of a multicast group. Three distinct approaches are used. The first one builds on Kalman filter theory to derive the MSEoptimal estimator...
Avoiding Paradoxes In Multi-Agent Competitive Routing (2003)
Eitan Altman, Rachid El Azouzi, Odile Pourtallier
Strq1 behavior mayoccur innetworfi due to thenon-cooperfi?`fi natur of decision making, when thelatter ar taken by individual agents. Inpar`]?1k?fl the well known Brwn1 parn1V illustrVfi1 that...
Connectivity in Ad-Hoc Networks: an Infinite-Server Queue Approach (2003)
Daniele Miorandi, Daniele Mior, Eitan Altman, Eitan Altman, Projets Mistral
In this paper we present some extensions on previously published results regarding connectivity issues in onedimensional adhoc networks. We show how an equivalent GI jDj1 queueing model may be used...
Equilibrium, games, and pricing in transportation and telecommunication networks (2002)
Network equilibrium models that have traditionally been used for transportati- on planning have penetrated in recent years to other scientific fields. These models have recently been introduced in...
Non-Cooperative Routing in Loss Networks (2002)
Altman, Eitan, El Azouzi, Rachid, Abramov, Vyacheslav
The paper studies routing in loss networks in the framework of a non-cooperati- ve game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding to the case of a...
Fair Bandwidth allocation between service providers in a geostationary satellite network (2002)
Touati, Corinne, Altman, Eitan, Galtier, Jérôme
We consider the problem of how a geostationary satellite should assign bandwidth to several service providers (operators) so as to meet some minimum requirements, on one hand, and to perform the...
Estimating Membership in a Multicast Session (2002)
Alouf, Sara, Altman, Eitan, Barakat, Chadi, Nain, Philippe
We propose two novel on-line estimation algorithms to determine the size of a dynamic multicast group. We first use a Wiener filter to derive an optimal estimator for the membership size of the...
Capacity of Multi-service CDMA Cellular Networks with Best-Effort Applications (2002)
In this paper we compute the uplink capacity of power-control CDMA mobile networks with an idealized power control, that contain best-effort type applpications, i.e. applications whose transmission...
Capacity of multi-service cdma cellular networks with best-effort applications (2002)
Eitan Altman, Eitan Altman, Projet Mistral
apport de recherche
Non-threshold equilibrium for customers joining an m/g/1 queue (2002)
An important research direction in the control of queueing systems has been to establish structural properties. In particular, there has been an intensive eort to obtain conditions in which threshold...
TCP network calculus: The case of large delay-bandwidth product (2002)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat
Abstract — We present in this paper an analytical model for the calculation of network load and drop probabilities in a TCP/IP network with general topology. First we formulate our model as a...
Utility based fair bandwidth allocation (2002)
Corinne Touati, Eitan Altman, Jrme Galtier
Abstract For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game the-ory has been used in networks as a concept that allows sharing resources fairly. Due to its many...
Stochastic recursive equations with applications to queues with dependent vacations (2002)
Abstract. We focus on a special class of nonlinear multidimensional stochastic recursive equations in which the coecients are stationary ergodic (not necessarily independent). Under appropriate...
TCP network calculus: The case of large delay-bandwidth product (2002)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat
Abstract--- We present in this paper an analytical model for the calculation of network load and drop probabilities in a TCP/IP network with general topology. First we formulate our model as a...
Regular ordering and applications in control policies (2002)
Eitan Altman, Bruno Gaujal, Arie Hordijk
In this paper we introduce the notion of regular ordering for periodic sequences based on the gaps between the entries. We dene the notion of regular preserving functions using Schur convexity. This...
Queueing Analysis of Early Message Discard Policy (2002)
Abstract--- A message(or a frame) is a group of consecutive packets (or cells ATM terminology). Often a loss of one packet from the message can result in the loss of the whole message. Selective...
Competitive routing in networks with polynomial costs (2002)
Eitan Altman, Tamer Basar, Tania Jimnez, Nahum Shimkin
Abstract--- We study a class of noncooperative general topology networks shared by N users. Each user has a given flow which it has to ship from a source to a destination. We consider a class of...
Regular ordering and applications in control policies (2002)
Eitan Altman, Bruno Gaujal, Arie Hordijk
In this paper we introduce a notion of regularity of periodic sequences based on the distances between its entries. We dene the notion of regular preserving functions using Schur convexity and we...
Non-Cooperative Routing in Loss Networks (2002)
Rachid El, Azouzi Vyacheslav Abramov, Vyacheslav Abramov, Unit Inria, Sophia Antipolis, Eitan Altman, ...
The paper studies routing in loss networks in the framework of a non-cooperative game with selsh users. Two solution concepts are considered: the Nash equilibrium, corresponding to the case of a nite...
Optimal On-Line Estimation of the Size of a Dynamic Multicast Group (2002)
Sara Alouf, Eitan Altman, Philippe Nain
In this paper we propose an efficient on-line estimation algorithm for determining the size of a dynamic multicast group. By using diffusion approximation and Kalman filter, we derive an estimator...
State-dependent M/G/1 type queueing analysis for congestion control in data networks (2002)
Eitan Altman, Kostya Avrachenkov, Chadi Barakat, Rudesindo Nunez-Queija
We study a linear-increase multiplicative-decrease flow control mechanism. We consider congestion signals that arrive in batches according to a Poisson process. We focus on the case when the...
CDMA Uplink Power Control as a Noncooperative Game (2002)
Tansu Alpcan, Tamer Basar, R. Srikant, Eitan Altman
We present a game-theoretic treatment of distributed power control in CDMA wireless systems. We make use of the conceptual framework of noncooperative game theory to obtain a distributed and...
Bandwidth tradeoff between TCP and link-level FEC (2002)
Forwarderwa correx]xM (FEC) iswidex use forthe improve0uW ofthe quality of noisy transmissionmean as wire43] links. This improve0uW is ofimportance for a transport protocol as TCP whichuse the loss...
Queueing AnalngU ofEarl Message Discard Pol3 y (2002)
Parijat Dube Eitan, Eitan Altman
We consider in this paper packets whichar2 veaccor ing to a Poisson pr ocess into a finite queue. Agr oup of consecutive packets for ms afr ame (or a message) and one then consider s not only the...
Queuing analysis of simple FEC schemes for voice over IP (2002)
In interactive voice applications FEC allows to recover from losses. FEC schemes need to be simple in order to allow interactivity. We study a simple scheme implemented in FreePhone audio tool [High...
Bandwidth tradeoff between TCP and link-level FEC (2002)
FEC is widely used to improve the quality of noisy transmission media as wireless links. This improvement is of importance for a transport protocol as TCP which uses the loss of packets as an...
Equilibrium, games, and pricing in transportation and telecommunications networks (2002)
Network equilibrium models that have traditionally been used for transportation planning have penetrated in recent years to other scientific fields. These models have recently been introduced in the...
Nash Equilibria In Load Balancing In Distributed Computer Systems (2002)
Eitan Altman, Hisao Kameda, Yoshihisa Hosokawa
this paper a third area of applications of such games, which is load balancing in distributed computer systems. One of the most important questions that arise in all applications of routing games is...
TCP Network Calculus: The case of large delay-bandwidth product (2002)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat
We present in this paper an analytical model for the calculation of network load and drop probabilities in a TCP/IP network with general topology. First we formulate our model as a nonlinear...
Competitive routing in networks with polynomial costs (2002)
Eitan Altman, Tania Jiménez, Nahum Shimkin
[27] , “Attitude control of underactuated spacecraft, ” Euro. J. Control, vol. 6, no. 3, pp. 229–242, 2000. [28] H. Sussmann, “Lie brackets, real analyticity and geometric control, ” in
CDMA Uplink Power Control as a Noncooperative Game (2002)
Tansu Alpcan Tamer, R. Srikant, Eitan Altman
We present a game-theoretic treatment of distributed power control in CDMA wireless systems. We make use of the conceptual framework of noncooperative game theory to obtain a distributed and...
CDMA Uplink Power Control as a Noncooperative Game (2002)
Tansu Alpcan Tamer, R. Srikant, Eitan Altman
We present a game-theoretic treatment of distributed power control in CDMA wireless systems.
TCP Modeling in the Presence of Nonlinear Window Growth (2001)
Altman, Eitan, Avrachenkov, Konstantin, Barakat, Chadi, Nuñez-Queija, Rudesindo
We develop a model for TCP that accounts for both sublinearity and limitation of window increase. Sublinear window growth is observed when the round-trip time of the connection increases with the...
Optimal On-Line Estimation of the Size of a Dynamic Multicast Group (2001)
Alouf, Sara, Altman, Eitan, Nain, Philippe
In this paper we propose an optimal on-line estimation algorithm for determini- ng the size of a dynamic multicast group. By using diffusion approximation and Kalman filter, we derive an estimator...
On fairness in Bandwidth Allocation (2001)
Touati, Corinne, Altman, Eitan, Galtier, Jérôme
For over a decade, the Nash bargaining solution (NBS) concept from cooperative game theory has been used in networks as a concept that allows one to share resources fairly. Due to its many appealing...
El Azouzi, Rachid, Abbad, Mohammed, Altman, Eitan
We consider the problem of the perturbation of a class of linear-quadratic systems where the change from one structure (for the dynamics and costs) to another are governed by a finite-state Markov...
State-dependent M/G/1 type queueing analysis for congestion control in data networks (2001)
E. Altman, K. Avrachenkov, C. Barakat, R. Núñez Queija, Copyright Stichting, Mathematisch Centrum, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Avoiding paradoxes in routing games (2001)
Eitan Altman, Rachid El Azouzi, Odile Pourtallier
Strange behavior may occur in networks due to the non-cooperative nature of decision making, when the latter are taken by individual agents. In particular, the well known Braess paradox illustrates...
Avoiding paradoxes in routing games (2001)
Eitan Altman, Rachid E Azouzi, Odile Pourtallier
Strange behavior may occur in networks due to the non-cooperative nature of decision making, when the latter are taken by individual agents. In particular, the well known Braess paradox illustrates...
Equilibria for multiclass routing in multi-agent networks (2001)
Abstract. We study optimal static routing problems in open multiclass networks with state-independent arrival and service rates. Our goal is to study the uniqueness of optimal routing under different...
State-dependent M/G/1 type queueing analysis for congestion control in data networks (2001)
E. Altman, K. Avrachenkov, C. Barakat, R. Nez Queija, Mathematisch Centrum (smc, The Dutch Foundation, ...
Centrum voor Wiskunde en Informatica State-dependent M/G/1 type queueing analysis for congestion control in data networks
On the Utility of FEC Mechanisms for Audio Applications (2001)
Abstract. FEC mechanisms have been proposed to recover from packet losses, and hence to improve the perceived quality in audio applications. Recently, it has been shown in [1] that the redundancy...
Queueing analysis of simple fec schemes for ip telephony (2001)
Abstract---In interactive voice applications, FEC schemes are necessary for the recovery from packet losses. These schemes need to be simple with a light coding and decoding overhead in order to not...
Queueing and Fluid Analysis of Partial Message Discard Policy (2001)
A message (or a frame) is a group of consecutive packets. Often, a loss of one packet from the message can result in the loss of the whole message. This is the case in ATM where a transport layer...
State-dependent M/G/1 type queueing analysis for congestion control in data networks (2001)
Eitan Altman, Kostya Avrachenkov, Chadi Barakat, Rudesindo Nez-queija
in data networks
TCP modeling in the presence of nonlinear window growth (2001)
Eitan Altman, Kostia Avrachenkov, Chadi Barakat, Rudesindo Nunez-Queija, Rudesindo Núñez-queija
We develop a model for TCP that accounts for both sublinearity and limitation of window increase. Sublinear window growth is observed when the round-trip time of the connection increases with the...
On Optimal Call Admission Control in a Resource-Sharing System (2001)
Eitan Altman, Tania Jimenez, Ger Koole
In this paper, we consider call admission control of multiple classes without waiting room. We use event-based dynamic programming for our model. We show that sometimes the customer classes can be...
Queueing Analysis of Simple FEC Schemes for IP Telephony (2001)
In interactive voice applications, FEC schemes are necessary for the recovery from packet losses. These schemes need to be simple with a light coding and decoding overhead in order to not impact the...
On the utility of FEC mechanisms for audio applications (2001)
Eitan Altman, Chadi Barakat, Inria Sophia Antipolis
FEC mechanisms have been proposed to recover from packet losses, and hence to improve the perceived quality in audio applications. Recently, it has been shown in [1] that the redundancy added by a...
Rachid El, Azouzi Mohammed, Abbad Eitan Altman, Unit Inria, Sophia Antipolis, Rachid El Azouzi, ...
We consider the problem of the perturbation of a class of linear-quadratic systems where the change from one structure (for the dynamics and costs) to another are governed by a nite-state Markov...
Perturbed Zero-sum Games with Applications to Stochastic and Repeated Games (2001)
Altman, Eitan, Feinberg, Eugene, Filar, Jerzy A, Gaitsgory, Vladimir
Perturbed Zero-sum Games with Applications to Stochastic and Repeated Games (2001)
Altman, Eitan, Feinberg, Eugene, Filar, Jerzy A, Gaitsgory, Vladimir
Queueing Analysis of Simple FEC Schemes for IP Telephony (2000)
Altman, Eitan, Barakat, Chadi, Ramos Ramos, Victor Manuel
In interactive voice applications, FEC schemes are necessary for the recovery from lost packets. These schemes need to be simple with a light coding and decoding overhead so as not to impact the...
Applications of Markov Decision Processes in Communication Networks : a Survey (2000)
We present in this research report a survey on applications of MDPs to communication networks. We survey both the different applications areas in communication networks as well as the theoretical...
Queueing Analysis of Partial Message Discard Policy (2000)
We consider in this paper packets which arrive according to a Poisson process into a finite queue. Often, a group of consecutive packets forms a frame, and loss of one packet results in the loss of...
On ACK Filtering on a Slow Reverse Channel (2000)
ACK filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a TCP connection- . Old ACKs waiting at the input of the slow...
Queueing Analysis of Simple FEC Schemes for IP Telephony (2000)
Altman, Eitan, Barakat, Chadi, Ramos Ramos, Victor Manuel
In interactive voice applications, FEC schemes are necessary for the recovery from lost packets. These schemes need to be simple with a light coding and decoding overhead so as not to impact the...
Applications of Markov Decision Processes in Communication Networks : a Survey (2000)
We present in this research report a survey on applications of MDPs to communication networks. We survey both the different applications areas in communication networks as well as the theoretical...
Queueing Analysis of Partial Message Discard Policy (2000)
We consider in this paper packets which arrive according to a Poisson process into a finite queue. Often, a group of consecutive packets forms a frame, and loss of one packet results in the loss of...
On ACK Filtering on a Slow Reverse Channel (2000)
ACK filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a TCP connection- . Old ACKs waiting at the input of the slow...
Multimodularity, Convexity and Optimization Properties (2000)
Altman, Eitan, Gaujal, Bruno, Hordijk, Arie
We investigate in this paper the properties of multimodular functions. In doing so we give elementary proofs for properties already established by Hajek, and we generalize some of his results. In...
Balanced Sequences and Optimal Routing (2000)
Altman, Eitan, Gaujal, Bruno, Hordijk, Arie
This paper shows how to perform optimal routing in Queues via balanced sequences
A stochastic model of TCP/IP with stationary random losses (2000)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat
Abstract — In this paper, we present a model for TCP/IP congestion control mechanism. The rate at which data is transmitted increases linearly in time until a packet loss is detected. At this...
Braess-like paradoxes in distributed computer systems (2000)
Hisao Kameda, Eitan Altman, Takayuki Kozawa, Yoshihisa Hosokawa
We consider optimal distributed decisions in distributed computer systems. We identify a Braess-like paradox in which adding capacity to the system may degrade the performance of all users. Unlike...
A stochastic model of TCP/IP with stationary random losses (2000)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat
In this paper, we present a model for TCP/IP flow control mechanism. The rate at which data is transmitted increases linearly in time until a packet loss is detected. At that point, the transmission...
A Markovian model for TCP analysis in a differentiated services network (2000)
Abstract. In a Differentiated Services network, the use of TCP by an application impacts the service it gets from the network. TCP congestion control algorithms are designed to provide a fair sharing...
Braess-like paradoxes in distributed computer systems (2000)
Hisao Kameda, Eitan Altman, Takayuki Kozawa, Yoshihisa Hosokawa
2 We consider optimal distributed decisions in distributed computer systems. We identify a Braess-like paradox in which adding capacity to the system may degrade the performance of all users. Unlike...
Paradoxes in performance optimization of distributed systems (2000)
Eitan Altman, Odile Pourtallier
Abstract---Reflecting the way in which a distributed system is used, we have different levels of distribution in the decisions on performance optimization for the distributed system, ranging from the...
TCP Over a Multi-State Markovian Path (2000)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Sophia Antipolis Cedex
Abstract. In this paper we analyze the performance of a TCP-like AEow control mechanism. The transmission rate is considered to increase linearly in time until the receipt of a congestion notication...
TCP Over a Multi-State Markovian Path (2000)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Sophia Antipolis Cedex
Abstract. In this paper we analyze the performance of a TCP-like ow control mechanism. The transmission rate is considered to increase linearly in time until the receipt of a congestion notication...
On fluid analysis of queues with selective message discarding policies (2000)
In this paper we analyse a uid queue with an on-o Markov modulated uid process as the arrival process. We call each on-period of the arrival process a message. The queue incorporates a selective...
TCP in presence of bursty losses (2000)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat
In this paper we analyze the performance of a TCP-like flow control mechanism in a lossy environment. The transmission rate in the control scheme that we consider has a linear growth rate; whenever a...
TCP in presence of bursty losses (2000)
Eitan Altman, Eitan Altman, Kostya Avrachenkov, Kostya Avrachenkov, Chadi Barakat, Chadi Barakat, ...
apport de recherche
On TCP performance in a heterogeneous network: a survey (2000)
Chadi Barakat, Chadi Barakat, Eitan Altman, Eitan Altman, Walid Dabbous, Walid Dabbous, ...
apport de recherche
Fairness Analysis of TCP/IP (2000)
Eitan Altman, Chadi Barakat, Emmanuel Laborde, Patrick Brown, Denis Collange
Bandwidth sharing between multiple TCP connections has been studied under the assumption that the windows of the di erent connections vary in a synchronized manner. This synchronization is a main...
On TCP performance in a heterogeneous network: a survey (2000)
Chadi Barakat, Chadi Barakat, Eitan Altman, Eitan Altman, Walid Dabbous, Walid Dabbous, ...
apport de recherche
Fairness Analysis of TCP/IP (2000)
Eitan Altman, Chadi Barakat, Emmanuel Laborde, Patrick Brown, Denis Collange
Bandwidth sharing between multiple TCP connections has been studied under the assumption that the windows of the dioeerent connections vary in a synchronized manner. This synchronization is a main...
Analysis of TCP Vegas and TCP Reno (2000)
In this paper we use an analytic fluid approach in order to analyze the different features of both Vegas and Reno TCP versions. We then use simulations to confirm our analytic results. When the...
Performance of Short TCP Transfers (2000)
Many works have studied the negative impact of slow start on the performance of short transfers. Some works propose to accelerate the window increase during this phase in order to improve the...
Robustness of convex optimization with application to controled Markov chains (2000)
Mabel M. Tidball, Mabel M. Tidball, Eitan Altman, Eitan Altman, Projet Miaou
We present two stability results in this paper. We first obtain sufficient conditions for the continuity of optimal values and solutions of convex programs in general vector spaces, as well as some...
A Markovian Model for TCP Analysis in a Differentiated Services Network (2000)
Many schemes have been proposed to support TCP traffic in a Differentiated Services network. We present in this paper an analytical model to study the performance of these schemes. The model is based...
On TCP Performance in a Heterogeneous Network: A Survey (2000)
Chadi Barakat, Eitan Altman, Walid Dabbous
Transmission media carrying Internet traffic present a wide range of characteristics some of which as transmission errors, long end-to-end delay, bandwidth asymmetry, may cause a degradation in TCP...
Worst-Case Rate-Based Flow Control with an ARMA Model of the Available Bandwidth (2000)
Eitan Altman, Tamer Basar, Naira Hovakimyan
A central control problem that arises in High speed networks is the control of the rate of flow of information into the network. A rate that is too high may result in congestion and hence in the...
TCP in Presence of Bursty Losses (2000)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat
In this paper we analyze the performance of a TCP-like flow control in a lossy environment. The transmission rate in the control scheme that we consider has a linear growth rate; whenever a loss...
A Stochastic Model of TCP/IP with Stationary Random Losses (2000)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat
In this paper, we present a model for TCP/IP flow control mechanism. The rate at which data is transmitted increases linearly in time until a packet loss is detected. At that point, the transmission...
Competitive Routing in Networks with Polynomial Cost (2000)
Eitan Altman, Tamer Basar, Tania Jimnez, Nahum Shimkin
We study a class of noncooperative general topology networks shared by N users. Each user has a given flow which it has to ship from a source to a destination. We consider a class of polynomial link...
On ACK Filtering on a Slow Reverse Channel (2000)
ACK filtering has been proposed as a technique to alleviate the congestion on the reverse path of a TCP connection. In the literature the case of a one-ACK per connection at a time in the buffer at...
Impact of bursty losses on TCP performance (2000)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat
In this paper we analyze the performance of a TCP-like flow control mechanism in a lossy environment. The transmission rate in the control scheme that we consider has a linear growth rate; whenever a...
Optimal Estimation of Multicast Membership (2000)
Sara Alouf, Eitan Altman, Chadi Barakat, Philippe Nain
This paper addresses optimal on-line estimation of the size of a multicast group. Three distinct approaches are used. The first one builds on Kalman filter theory to derive the MSEoptimal estimator...
TCP in Presence of Bursty Losses (2000)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat
In this paper we analyze the performance of a TCP-like flow control in a lossy environment. The transmission rate in the control scheme that we consider has a linear growth rate; whenever a loss...
Performance of Short TCP Transfers (2000)
Many works have studied the negative impact of slow start on the performance of short transfers. Some works propose to accelerate the window increase during this phase in order to improve the...
Scheduling Of An Input-Queued (2000)
Switch To Achieve, Eitan Altman, Zhen Liu, Centre Sophia Antipolis, Rhonda Righter, E. Altman, ...
INTRODUCTION In input-queued switches for such networks asATM networks, cells of a fixed length are to be switched from one of several inputs to one of several outputs+ In each time *This work was...
A Markovian Model for TCP Analysis in a Differentiated Services Network (2000)
Many schemes have been proposed to support TCP tra#c in a Di#erentiated Services network. We present in this paper an analytical model to study the performance of these schemes. The model is based on...
On ACK Filtering on a Slow Reverse Channel (2000)
ACK filtering has been proposed as a technique to alleviate the congestion on the reverse path of a TCP connection. In the literature the case of a one-ACK per connection at a time in the bu#er at...
Fairness Analysis of TCP/IP (2000)
Eitan Altman Chadi, Eitan Altman, Chadi Barakat, Emmanuel Laborde, Patrick Brown, Denis Collange
Bandwidth sharing between multiple TCP connections has been studied under the assumption that the windows of the di#erent connections vary in a synchronized manner. This synchronization is a main...
Continuity of Optimal Values and Solutions for Control of Markov Chains with Constraints (2000)
Mabel M. Tidball, Ariel Lombardi, Odile Pourtallier, Eitan Altman
We consider in this paper constrained Markov decision processes. This type of control model has many applications in telecommunications and other fields [E. Altman and A. Shwartz, IEEE Trans....
TCP over a multi-state Markovian path (2000)
Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Parijat Dube, France Dube?? Inriasophiaantipolis
In this paper we analyze the performance of a TCP-like flow control mechanism. The transmission rate is considered to increase linearly in time until the receipt of a congestion notication (via loss...
Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms (2000)
Eitan Altman, Tamer Basar, Tania Jiménez, Nahum Shimkin
this paper a routing problem in networks, in whichtwo parallel links are shared betweenanumber of players. In the context of telecommunication networks, the players could stand for users, who have to...
Approximating Nash Equilibria In Nonzero-Sum Games (2000)
Eitan Altman, Odile Pourtallier, Alain Haurie, Francesco Moresino, Nonzero-sum Games
This paper deals with the approximation of Nash equilibria in m-player games. We present conditions under which an approximating sequence of games admits nearequilibria that approximate...
Perturbation of Linear Quadratic Systems with Jump Parameters and Hybrid Controls (1999)
El Azouzi, Rachid, Abbad, Mohammed, Altman, Eitan
We consider the problem of the perturbation of a class of linear-quadratic differential games with piecewise deterministic dynamics, where the changes from one structure (for the dynamics) to another...
A stochastic Model of TCP/IP with Stationary Ergodic Random Losses (1999)
Altman, Eitan, Avrachenkov, Kostia, Barakat, Chadi
We consider here a flow control mechanism in which the rate at which data is sent increases linearly in time until a loss occurs. At that point the transmission rate decreases by a multiplicative...
On TCP Performance in an Heterogeneous Network: A Survey (1999)
Barakat, Chadi, Altman, Eitan, Dabbous, Walid
The new transmission media used to transport Internet traffic present different characteristics from the network TCP is tuned to. This results in a degradation in the performance of the protocol in...
TCP in Presence of Bursty Losses (1999)
Altman, Eitan, Avrachenkov, Kostya, Barakat, Chadi
We analyze in this paper the performance of TCP/IP-like congestion control in the presence of random losses. The input rate in the control scheme that we consider has a linear growth rate; whenever a...
Optimal Routing Problems and Multimodularity (1999)
Altman, Eitan, Bhulai, Sandjai, Gaujal, Bruno, Hordijk, Arie
In this paper we study the static assignment of packets to M parallel heterogeneous servers with no buffers. Blocked packets are lost and the objective is to minimize the average number of lost...
Analysis of TCP with Several Bottleneck Nodes (1999)
Many works have studied the performance of TCP by modeling the network as a single bottleneck node, the one having the slowest outgoing rate on the path. In these works, the behavior of the protocol,...
Fonctionnement de TCP: problèmes et améliorations (1999)
Ait-Hellal, Omar, Altman, Eitan
Dans le présent article, une description détaillée de plusieurs versions d'algorithmes pour le contrôle de flux et de congestion dans TCP est donnée, dans l'ordre chronologique (et "logique") de...
Eitan Altman, Kostya Avrachenkov, Chadi Barakat, Rudesindo Núñez-queija
M/G/1 type queueing analysis for
Abstract—We consider a noncooperative game framework for combined routing and flow control in a network of parallel links, where the number of users (players) is arbitrarily large. The utility...
Parijat Dube, Omar Ait-hellal, Eitan Altman
The purpose of this paper is to study the loss probabilities of messages in an M/M/1/K queueing system where in addition to losses due to buffer overflow there are also random losses in the incoming...
Eitan Altman, R. Srikant, Senior Member, Senior Member
Abstract—We consider a noncooperative game framework for combined routing and flow control in a network of parallel links, where the number of users (players) is arbitrarily large. The utility...
Eitan Altman, Kostya Avrachenkov, Chadi Barakat, Rudesindo Núñez-queija
M/G/1 type queueing analysis for
Analysis of TCP with several bottleneck nodes (1999)
Many works have studied the performance of TCP by modeling the network as a single bottleneck node. In this paper, we present a more general model taking into account all the nodes on the path not...
Improving TCP/IP over geostationary satellite links (1999)
Nesrine Chaher, Nesrine Chaher, Chadi Barakat, Chadi Barakat, Walid Dabbous, Walid Dabbous, ...
apport de recherche
Eitan Altman, Harold J. Kushner
Consider a queueing system with many queues, each with its own input stream, but with only one server. The server must allocate its time among the queues to minimize or nearly minimize some cost...
Eitan Altman, Konstantin E. Avrachenkov, Jerzy A. Filar
In this paper we consider a singularly perturbed Markov decision process with finitely many states and actions and the limiting expected average reward criterion. We make no assumptions about the...
Improving TCP/IP over geostationary satellite links (1999)
Chadi Barakat, Nesrine Chaher, Walid Dabbous, Eitan Altman
We focus in this paper on the undesirable phenomenon of early buoeer overAEow during Slow Start (SS) when TCP operates in large Bandwidth-Delay Product networks such as those including Geostationary...
Scheduling of an Input-Queued Switch to Achieve Maximal Throughput (1999)
Eitan Altman, Zhen Liu, Rhonda Righter, Centre Sophia Antipolis
Achieving high throughput in input-queued switches has been found to be difficult, especially when traffic is nonuniform in the sense that different inputs have very different cell generation rates....
Optimal Routing Problems and Multimodularity (1999)
Unit Inria, Sophia Antipolis, Eitan Altman, Eitan Altman, Sandjai Bhulai, Sandjai Bhulai, ...
In this paper we study the static assignment of packets to M parallel heterogeneous servers with no buffers. Blocked packets are lost and the objective is to minimize the average number of lost...
Multimodularity, Convexity and Optimization Properties (1999)
Eitan Altman, Bruno Gaujal, Arie Hordijk
We investigate in this paper the properties of multimodular functions. In doing so we give elementary proofs for properties already established by Hajek, and we generalize some of his results. In...
Admission Control in Stochastic Event Graphs (1999)
Eitan Altman, Bruno Gaujal, Arie Hordijk
In this paper, we rst show that the expectation of any convex increasing function of the workload (or waiting time) in (max,+) linear systems, under a single input sequence, is multimodular. This is...
Balanced Sequences and Optimal Routing (1999)
Eitan Altman, Bruno Gaujal, Arie Hordijk
The objective pursued in this paper is two-fold. The first part addresses the following combinatorial problem: is it possible to construct an infinite sequence over n letters where each letter is...
Omar Ait-hellal, Eitan Altman, Projet Mistral
In this paper we investigate the performances of the EFCIbased (Explicit Forward Congestion Indication) and ER-based (Explicit Rate; EPRCA in particular) algorithms for the rate-based flow control of...
Eitan Altman, Tamer Basar, R. Srikant
We consider a combined routing and flow control problem involving multiple links, and a large number of noncooperative users, with the utility function of each user quantifying a trade-off between...
A Stochastic Model of TCP/IP with Stationary Ergodic Random Losses (1999)
Eitan Altman, Eitan Altman, Kostia Avrachenkov, Kostia Avrachenkov, Chadi Barakat, Chadi Barakat, ...
We consider here a #ow control mechanism in which the rate at which data is sent increases linearly in time until a loss occurs. At that point the transmission rate decreases byamultiplicative...
Eitan Altman, Harold J. Kushner
Consider a queueing system with many queues, each with its own input stream, but with only one server. The server must allocate its time among the queues to minimize or nearly minimize some cost...
Congestion Control as a Stochastic Control Problem with Action Delays (1999)
Eitan Altman, Tamer Basar, R. Srikant
We consider the design of explicit rate-based congestion control for high-speed communication networks and show that this can be formulated as a stochastic control problem where the controls of...
Improving TCP/IP over geostationary satellite links (1999)
Apport De Recherche, Nesrine Chaher, Nesrine Chaher, Chadi Barakat, Chadi Barakat, Walid Dabbous, ...
We focus in this paper on the undesirable phenomenon of frequent losses during slow-start when TCP operates in large bandwidth-delay product networks such as those including geostationary satellite...
Eitan Altman, Harold J. Kushner
Communications systems often have many types of users. Since they share the same resource, there is a conflict in their needs. This conflict leads to the imposition of controls on admission or...
On Loss Probabilities in Presence of Redundant Packets and Several Traffic Sources (1999)
Omar Ait Hellal, Eitan Altman, Alain Jean-Marie, Irina A. Kurkova
The purpose of this paper is to study the effect of adding redundancy to an input stream on the losses that occur due to buffer overflow. We consider several sessions that generate traffic into a...
Analysis of TCP with Several Bottleneck Nodes (1999)
Many works have studied the performance of TCP by modeling the network as a single bottleneck node. In this paper, we present a more general model taking into account all the nodes on the path not...
Eitan Altman, Harold J. Kushner, Pii S
Communications systems often have many types of users. Since the users share the same resource, there is a conflict in their needs. This conflict leads to the imposition of controls on admission or...
On Loss Probabilities In Presence Of Redundant Packets And Several Traffic Sources (1999)
Omar Ait-Hellal, Eitan Altman, Alain Jean-Marie, Irina A. Kurkova
We study the effect of adding redundancy to an input stream on the losses that occur due to buffer overflow. We consider several sessions that generate traffic into a finite capacity queue. Using...
Improving TCP/IP over Geostationary Satellite Links (1999)
Chadi Barakat, Nesrine Chaher, Walid Dabbous, Eitan Altman
We focus in this paper on the undesirable phenomenon of early bu#er overflow during Slow Start (SS) when TCP operates in large Bandwidth-Delay Product networks such as those including Geostationary...
Hisao Kameda, Eitan Altman, Takayuki Kozawa
The Braess paradox which was originally identified and observed in road traffic context, shows that it may happen that by adding capacity to the network, the performance of all users degrades. This...
Constrained Markov Decision Processes (1999)
Eitan Altman, Inmanysituationsintheoptimizationofdynamicsystems Asingleutility
book turned out to be a rich and interesting constrained control problem in itself. The objectives were not always easy to quantify and many evident constraints came out, such as time and page...
A Stochastic Model of TCP/IP with Stationary Ergodic Random Losses (1999)
Eitan Altman, Eitan Altman, Kostia Avrachenkov, Kostia Avrachenkov, Chadi Barakat, Chadi Barakat, ...
We consider here a flow control mechanism in which the rate at which data is sent increases linearly in time until a loss occurs. At that point the transmission rate decreases by a multiplicative...
Improving TCP/IP over Geostationary Satellite Links (1998)
Chaher, Nesrine, Barakat, Chadi, Dabbous, Walid, Altman, Eitan
We focus in this paper on the undesirable phenomenon of frequent losses during slow-start when TCP operates in large bandwidth-delay product networks such as those including geostationary satellite...
Analysis of TCP in Networks with Small Buffering Capacity and Large Bandwidth-Delay Product (1998)
It is well known that inefficiencies occur in the operation of TCP when the bandwidth delay product of the network is large compared to its buffering capacity. A central reason for that is a cyclic...
Optimal admission, routing and service assignment control: the case of single buffer queues (1998)
Eitan Altman, Bruno Gaujal, Arie Hordijk, Ger Koole
We consider the problem of optimal routing of arriving packets into N servers having no waiting room. Packets that are routed to a busy server are lost. We consider two problems where the objective...
On optimal call admission control (1998)
Eitan Altman, Tania Jimenez, Ger Koole
In this paper we consider call admission control of multiple classes without waiting room. We use event-based dynamic programming for our model. We show that sometimes the customer classes can be...
Robust rate control for ABR sources (1998)
Eitan Altman, Tamer Bafiar, R. Srikant
Abstract — The paper considers the design of explicit rate-based flow control for ABR sources in an ATM network. The goal is to share the available capacity “fairly ” among many sources while...
Individual equilibrium and learning in a processor sharing system (1998)
Abstract: We consider a processor-sharing service system, where the service rate to individual customers decreases as the load increases. Each arriving customer may observe the current load, and...
Optimal admission, routing and service assignment control: the case of single buer queues (1998)
Eitan Altman, Bruno Gaujal, Arie Hordijk, Ger Koole
We consider the problem of optimal routing of arriving packets into N servers having no waiting room. Packets that are routed to a busy server are lost. We consider two problems where the objective...
Robust Rate Control for ABR Sources (1998)
Eitan Altman, Tamer Basar, R. Srikant
We consider the design of explicit rate-based flow control for ABR sources in an ATM network. The goal is to share the available capacity "fairly" among many sources while maintaining queue...
Optimal Admission, Routing and Service Assignment Control: The Case of Single Buffer Queues (1998)
Eitan Altman, Bruno Gaujal, Arie Hordijk, Ger Koole
We consider the problem of optimal routing of arriving packets into N servers having no waiting room. Packets that are routed to a busy server are lost. We consider two problems where the objective...
Robust Rate Control for ABR Sources (1998)
Eitan Altman, R. Srikant, Tamer Basar
The paper considers the design of explicit ratebased flow control for ABR sources in an ATM network. The goal is to share the available capacity "fairly" among many sources while...
On Submodular Value Functions and Complex Dynamic Programming (1998)
Eitan Altman, Ger Koole, De Boelelaan A
We investigate in this paper submodular value functions using complex dynamic programming. In complex dynamic programming (dp) we consider concatenations and linear combinations of standard dp...
Multi-user Rate-Based Flow Control (1998)
Flow and congestion control allow the user of a telecommunication... We study in this paper both situations using optimal control and dynamic game techniques. The first situation leads to the...
Analysis of TCP in Networks with Small Buffering Capacity and Large Bandwidth-Delay Product (1998)
Chadi Barakat, Chadi Barakat, Eitan Altman, Eitan Altman, Projet Mistral
It is well known that inefficiencies occur in the operation of TCP when the bandwidth delay product of the network is large compared to its buffering capacity. A central reason for that is a cyclic...
Weighted Discounted Stochastic Games with Perfect Information (1998)
Eitan Altman, Eugene A. Feinberg, Adam Shwartz
We consider a two-person zero-sum stochastic game with an infinite time horizon. The payoff is a linear combination of expected total discounted rewards with different discount factors. For a model...
Optimal Open-Loop Control of Vacations, Polling and Service Assignment (1997)
Altman, Eitan, Gaujal, Bruno, Hordijk, Arie
We consider in this paper the optimal open-loop control of vacations in queueing systems. The controller has to take actions without state information. We first consider the case of a single queue,...
On the Integration of Best-Effort and Guaranteed Performance Services (1997)
Altman, Eitan, Artiges, Damien, Traore, Karim
One of the main challenges of emerging high speed telecommunication networks is the integration of services. Both ATM as well as the INTERNET have been evolving so as to accomodate both best-effort...
Admission Control in Stochastic Event Graphs (1997)
Altman, Eitan, Gaujal, Bruno, Hordijk, Arie
In this paper, we show that the expected workload and the expected waiting time in (max,+) linear system under a single input sequence is multimodular. We use this result to construct the optimal...
Balanced Sequences and Optimal Routing (1997)
Altman, Eitan, Gaujal, Bruno, Hordijk, Arie
The objective pursued in this paper is two-fold. The first part gives an overview of the following combinatorial problem: is it possible to construct an infinite sequence over $n$ letters where each...
Multimodularity, Convexity and Optimization Properties (1997)
Altman, Eitan, Gaujal, Bruno, Hordijk, Arie
We investigate in this paper the properties of multimodular functions. In doing so we give alternative proofs for properties already established by Hajek, and we extend his results. In particular, we...
Performance Evaluation of the Rate-Based Flow Control Mechanism for ABR Service (1997)
Ait-Hellal, Omar, Altman, Eitan, Elouadghiri, Driss, Erramdani, Mohammed
In this paper we investigate the performances of the EFCI-based (Explicit Forward Congestion Indication) and ER-based (Explicit Rate) algorithms for the rate-based flow control of the ABR (Available...
Performance Modeling of TCP/IP in a Wide-Area Network (1997)
Altman, Eitan, Bolot, Jean, Erramdani, Mohammed, Brown, Patrick, Collange, Denis
We examine the problem of evaluating the performance of TCP connections over wide area networks. Our approach combines experimental and analytic methods, and proceeds in three steps. First, we have...
iApplications of Borovkov's Renovation Theory to Non-Stationary Stochastic Recursive (1997)
We investigate in this paper the stability of non-stationary stochastic processes, arising typically in applications of control. The setting is known as stochastic recursive sequences, which allows...
Balanced sequences and optimal routing (1997)
Eitan Altman, Bruno Gaujal, Arie Hordijk
The objective pursued in this paper is two-fold. The rst part gives an overview of the following combinatorial problem: is it possible to construct an innite sequence over n letters where each letter...
Multimodularity, convexity and optimization properties (1997)
Eitan Altman, Bruno Gaujal, Arie Hordijk
We investigate in this paper the properties of multimodular functions. In doing so we give elementary proofs for properties already established by Hajek, and we generalize some of his results. In...
Optimal Open-Loop Control of Vacations, Polling and Service Assignment (1997)
Eitan Altman, Eitan Altman, Bruno Gaujal, Bruno Gaujal, Arie Hordijk, Arie Hordijk, ...
We consider in this paper the optimal open-loop control of vacations in queueing systems. The controller has to take actions without state information. We first consider the case of a single queue,...
Eitan Altman, Tamer Başar, Rayadurgam Srikant
Rate-based flow control has been chosen by the ATM Forum Technical Committee of Traffic Management as the main approach for controlling the traffic of the ABR (Available Bit Rate) transfer capacity....
Admission Control in Stochastic Event Graphs (1997)
Eitan Altman, Eitan Altman, Bruno Gaujal, Bruno Gaujal, Arie Hordijk, Arie Hordijk, ...
In this paper, we show that the expected workload and the expected waiting time in (max,+) linear system under a single input sequence is multimodular. We use this result to construct the optimal...
On the Integration of Best-Effort and Guaranteed Performance Services (1997)
Eitan Altman, Eitan Altman, Damien Artiges, Damien Artiges, Karim Traore, Karim Traore, ...
One of the main challenges of emerging high speed telecommunication networks is the integration of services. Both ATM as well as the INTERNET have been evolving so as to accomodate both best-effort...
Performance Modeling of TCP/IP in a Wide-Area Network (1997)
Eitan Altman, Jean Bolot, Philippe Nain, Driss Elouadghiri, Mohammed Erramdani, Patrick Brown, ...
: We examine the problem of evaluating the performance of TCP connections over wide area networks. Our approach combines experimental and analytic methods, and proceeds in three steps. First, we have...
Rate Based Flow Control with Bandwidth Information (1997)
Omar Ait-hellal, Eitan Altman, Tamer Basar
The ATM Forum has chosen the rate-based approach for flow control of ABR (Available Bit Rate) traffic in ATM. It is based on a reactive approach whereby the transmission rate of ABR sources can be...
Performance of TCP/IP: the case of two Controlled Sources (1997)
Omar Ait-hellal, Eitan Altman, Driss Elouadghiri, Mohamed Erramdani, Nouffisa Mikou
In order to control the flow in TCP/IP protocol, each TCP source uses a transmission window which indicates the number of packets that may be transmitted by the source but not yet acknowledged by the...
Performance Modeling of TCP/IP in a Wide-Area Network (1997)
Eitan Altman, Jean Bolot, Driss Elouadghiri, Mohamed Erramdani, Philipe Nain, Patrick Brown, ...
We examine the problem of evaluating the performance of TCP connections over wide area networks. Our approach combines experimental and analytic methods, and proceeds in three steps. First, we have...
Performance Evaluation of the Rate-Based Flow Control Mechanism for ABR Service (1997)
Mohammed Erramdani, Omar Ait-hellal, Omar Ait-hellal, Eitan Altman, Eitan Altman, Driss Elouadghiri, ...
: In this paper we investigate the performances of the EFCI-based (Explicit Forward Congestion Indication) and ER-based (Explicit Rate) algorithms for the rate-based flow control of the ABR...
Multi-user Rate-Based Flow Control (1997)
Flow and congestion control allow the users of a telecommunication network to regulate the traffic they send into the network in accordance with the quality of service they require. Flow control may...
Multimodularity, Convexity and Optimization Properties (1997)
Eitan Altman, Eitan Altman, Bruno Gaujal, Bruno Gaujal, Arie Hordijk, Arie Hordijk, ...
: We investigate in this paper the properties of multimodular functions. In doing so we give alternative proofs for properties already established by Hajek, and we extend his results. In particular,...
Robustness of Convex Optimization with Application to Controled Markov Chains (1996)
Tidball, Mabel M., Altman, Eitan
We present two stability results in this paper. We first obtain sufficient conditions for the continuity of optimal values and solutions of convex programs in general vector spaces, as well as some...
Weighted Discounted Stochastic Games With Perfect Information (1996)
Eitan Altman, Eugene A. Feinberg, Adam Shwartz
We consider a two-person zero-sum stochastic game with an innite time horizon. The payo is a linear combination of expected total discounted rewards with dierent discount factors. For a model with a...
Non Zero-Sum Stochastic Games in Admission, Service and Routing Control in Queueing Systems (1996)
The purpose of this paper is to investigate situations of non-cooperative dynamic control of queueing systems by two agents, having different objectives. The main part of the paper is devoted to...
Individual Equilibrium and Learning in a Processor Sharing System (1996)
We consider a processor-sharing service station which serves all its customers simultaneously, with the service rate to individual customers decreasing as the load increases. Each arriving customer...
On the Stability of Timed Token Rings (1996)
Eitan Altman, Zhen Liu, Inria Centre, Sophia Antipolis
We analyze in this paper the stability of two types of timed-token rings: the existing Fiber Distributed Data Interface (FDDI) token ring protocol, and a new variant of the FDDI that we propose. The...
Robust Adaptive Flow Control in High Speed Telecommunication Networks (1996)
Zigang Pan, Eitan Altman, Tamer Basar
We consider a single controlled traffic source, sharing a bottleneck node with other (higher priority) sources, whose traffic is modeled by an ARMA process. The controlled source adapts dynamically...
Optimality of a Threshold Policy in the M/M/1 Queue with Repeated Vacations (1996)
Consider an M/M/1 queueing system with server vacations where the server is turned ooe as soon as the queue gets empty. We assume that the vacation durations form a sequence of i.i.d. random...
On Submodular Value Functions of Dynamic Programming (1995)
We investigate in this paper submodular properties of the value function arrizing in complex Dynamic programming (DPs). We consider in particular DPs that include concatenation and linear...
Constrained Markov Decision Processes (1995)
This report presents a unified approach for the study of constrained Markov decision processes with a countable state space and unbounded costs. We consider a single controller having several...
Approximations in Dynamic Zero-Sum Games, II (1995)
Mabel Tidball, Mabel Tidball, Odile Pourtallier, Odile Pourtallier, Eitan Altman, Eitan Altman, ...
We pursue in this paper our study of approximations of values and epsilon-saddle-point policies in dynamic zero-sum games. After extending the general theorem for approximation, we study zero-sum...
Control of a Random Walk with Noisy Delayed Information (1995)
Eitan Altman, Centre Sophia Antipolis, Ger Koole
We consider the control of a random walk on the nonnegative integers. The controller has two actions. It makes decisions based on noisy information on the current state but on full information on...
Constrained Markov Decision Processes (1995)
Eitan Altman, Eitan Altman, Projet Mistral
This report presents a unified approach for the study of constrained Markov decision processes with a countable state space and unbounded costs. We consider a single controller having several...
On Submodular Value Functions of Dynamic Programming (1995)
Eitan Altman, Eitan Altman, Ger Koole, Ger Koole, Projet Mistral
We investigate in this paper submodular properties of the value function arrizing in complex Dynamic programming (DPs). We consider in particular DPs that include concatenation and linear...
A Hybrid (Differential-Stochastic) Zero-Sum Game with Fast Stochastic Part (1995)
Eitan Altman, Vladimir Gaitsgory
We consider in this paper a continuous time stochastic hybrid system with a finite time horizon, controlled by two players with opposite objectives (zero-sum game). Player one wishes to maximize some...
Constrained Markov Games: Nash Equilibria (1995)
In this paper we develop the theory of constrained Markov games. We consider the expected average cost as well as discounted cost. We allow different players to have different types of costs. We...
Approximations in Dynamic Zero-Sum Games, II (1995)
Mabel M. Tidball, Odile Pourtallier, Eitan Altman
We pursue in this paper our study of approximations of values and ε-saddle-point policies in dynamic zero-sum games. After extending the general theorem for approximation, we study...
Optimal Rate Control For High Speed Telecommunication Networks (1995)
We present in this paper two approaches for designing controllers that dynamically regulate the rate of data flow into a network based on feedback state information. They result in controllers that...
Control of a Random Walk with Noisy Delayed Information (1995)
Eitan Altman, Centre Sophia Antipolis, Ger Koole
We consider the control of a random walk on the nonnegative integers. The controller has two actions. It makes decisions based on noisy information on the current state but on full information on...
Performance Bounds and Pathwise Stability for Generalized Vacation and Polling Systems (1995)
Eitan Altman, Serguei Foss, Eric Riehl, Inria Centresophiaantipolis Eitanaltmanandsergueifoss
We consider several models for a generalized vacation or polling system with a general (in particular, non-Poisson) arrival process. Our results are given in the context of an in put-output process...
This paper is the third in a series on constrained Markov decision processes (CMDPs) with a countable state space and unbounded cost. In the previous papers we studied the expected average and the...
Constrained Markov Games: Nash Equilibria (1995)
In this paper we develop the theory of constrained Markov games. We consider the expected average cost as well as discounted cost. We allow different players to have different types of costs. We...
Approximations in dynamic zero-sum games, II (1994)
Tidball, Mabel M., Pourtallier, Odile, Altman, Eitan
We pursue in this paper our study of approximations of values and $\epsilon$-saddle-point policies in dynamic zero-sum games. After extending the general theorem for approximation, we study zero-sum...
Approximations in dynamic zero-sum games, I (1994)
Tidball, Mabel M., Altman, Eitan
Disponible dans les fichiers attachés à ce document
Polling in a Closed Network (1994)
Eitan Altman, Centre Sophia Antipolis, Uri Yechiali
We consider a closed queueing network with a fixed number of customers, where a single server moves cyclically between N stations, rending service in each station according to some given discipline...
Gated-type polling systems with walking and switch-in times (1994)
Eitan Altman, Centre Sophia Antipolis, Hans Blanc, Uri Yechiali
We consider models of polling systems where switching times between channels are composed of two parts: walking times required to move from one channel (station) to another, and switch-in times that...
Discrete-Time Analysis of Adaptive Rate Control Mechanisms (1994)
Eitan Altman, François Baccelli, Jean-Chrysostome Bolot
We analyze the performance of a generic feedback flow control mechanism which captures the properties of several such mechanisms recently proposed in the literature. These mechanisms dynamically...
Monotonicity of Optimal Policies in a Zero Sum Game: A Flow Control Model (1994)
Eitan Altman, Centre Sophia Antipolis
The purpose of this paper is to illustrate how value iteration can be used in a zero-sum game to obtain structural results on the optimal (equilibrium) value and policy. This is done through the...
A Markov Game Approach for Optimal Routing into a Queueing Network (1994)
We study a dynamic optimal routing problem, where a controller has to decide to which of two queues should arriving customers (representing packets, messages, call etc...) be sent. The service rate...
Flow Control Using The Theory Of Zero Sum Markov Games (1994)
We consider the problem of dynamic flow control of arriving packets into an infinite buffer. The service rate may depend on the state of the system, may change in time and is unknown to the...
Zero-Sum Markov Games and Worst-Case Optimal Control of Queueing Systems (1994)
Zero sum stochastic games model situations where two persons, called players, control some dynamic system, and both have opposite objectives. One player wishes typically to minimize a cost which has...
Eitan Altman, Centre Sophia Antipolis, Shaler Stidham
We consider a discrete-time Markov decision process with a partially ordered state space and two feasible control actions in each state. Our goal is to find general conditions, which are satisfied in...
Eitan Altman, Israel Oferzeitouni, Thesolutiontotheseproblemsrelyontheboundsintroducedinprevioussections Involvenotonlyaveragecostcrite
The purpose of this paper is two-fold. First, bounds on the rate of convergence of empirical measures in Controlled Markov Chains are obtained under some recurrence conditions. These include bounds...
The Loss Process of Messages in an M/M/1/K Queue (1994)
Eitan Altman, Alain Jean-Marie
Our purpose in this paper is to obtain the distribution of the number of lost packets within a sequence of n consecutive packet arrivals into a finite buffer M/M/1 queue. We obtain explicit...
Sensitivity of Constrained Markov Decision Processes (1994)
Eitan Altman, Adam Shwartz, Adamshwartz Electricalengineering Haifa
We consider the optimization of finite-state, finite-action Markov Decision processes, under constraints. Costs and constraints are of the discounted or average type, and possibly finitehorizon. We...
Polling on a graph with general arrival and service time distribution (1993)
We consider a polling system on a graph with general independent arrival, service and walking times. We present necessary and sufficient conditions for stability, based on drift analysis of both the...
Improving the stability characteristics of asynchronous traffic in FDDI token ring (1993)
The Fiber Distributed Data Interface (FDDI) token ring protocol supports two classes of traffic : synchronous and asynchronous. The time constraint mechanism of FDDI garantees the transmission delay...
Improving the stability characteristics of asynchronous traffic in FDDI token ring (1993)
The Fiber Distributed Data Interface (FDDI) token ring protocol supports two classes of traffic : synchronous and asynchronous. The time constraint mechanism of FDDI garantees the transmission delay...
Asymptotic Properties of Constrained Markov Decision Processes (1993)
E De Recherche, Et En Automatique, Sophia Antipolis, Eitan Altman, Eitan Altman
We present in this paper several asymptotic properties of constrained Markov Decision Processes (MDPs) with a countable state space. We treat both the discounted and the expected average cost, with...
Polling on a Graph with General Arrival and Service Time Distribution (1993)
E De Recherche, Et En Automatique, Route Des Lucioles, Eitan Altman, Eitan Altman, Eitan Altman, ...
Nous consid'erons un syst`eme de polling sur un graphe avec des temps d'interarriv 'ees, de services et de d'eplacements du serveur qui forment des suites i.i.d. Nous...
Discrete-Time Analysis of Rate-Based Feedback Control Mechanisms (1993)
Eitan Altman, François Baccelli, Jean-chrysostome Bolot
We analyze the performance of a generic feedback rate control mechanism which captures the properties of several recently proposed such mechanisms. These mechanisms dynamically regulate the rate of...
Worst-case and Nash Routing Policies in Parallel Queues with Uncertain Service Allocations (1993)
We consider two dynamic routing problems into several parallel queues. First, we consider the case where the total service rate in all queues is constant, but its distribution between the queues may...
Approximations in Dynamic Zero-Sum Games, I (1993)
Games I, Mabel M. Tidball, Eitan Altman
We develop a unifying approach for approximating a "limit" zero-sum game by a sequence of approximating games. We discuss both the convergence of the values and the convergence of optimal...
Stochastic Scheduling Games with Markov Decision Arrival Processes (1993)
In Hordijk & Koole [4,5] a new type of arrival process, the Markov Decision Arrival Process (MDAP), was introduced which can be used to model certain dependencies between arrival streams and the...
Control Of A Hybrid Stochastic System (1993)
Eitan Altman, Centre Sophia Antipolis, Vladimir Gaitsgory
We consider in this paper a continuous time stochastic hybrid control system with a nite time horizon. The objective is to minimize a linear function of the expected state trajectory. The state...
Optimal Control of the M/G/1 Queue with Repeated Vacations of the Server (1993)
We consider a M/G/1 queue where the server may take repeated vacations. Whenever a busy period terminates the server takes a vacation of random duration. At the end of each vacation the server may...
Optimal control of the M/G/1/ queue with repeated vacations of the server (1992)
We consider an M/G/1 queue where the server may take repeated vacations. Whenever a busy period terminates (i.e. when the queue empties) the server takes a vacation of random duration. At the end of...
Closed-loop control with delayed information (1992)
The theory of Markov control model with perfect state information (MCM-PSI) requires that the current state of the system is known to the decision maker at decision instants. Otherwise one speaks of...
Some qualitative properties in polling systems (1992)
Altman, Eitan, Konstantopoulos, Panagiotis, Liu, Zhen
Consider a polling system with K 1 queues and a single server that visits the queues in a cyclic order. The polling discipline in each queue is of general gated-type or exhaustive-type. We assume...
Flow control using the theory of zero sum Markov games (1992)
We consider the problem of dynamic flow control of arriving pacquets into an infinite buffer. The service rate may depend on the state of the system, may change in time and is unknown to the...
Asymptotic properties of constrained Markov decision processes (1992)
We present in this paper several asymptotic properties of constrained Markov Decision Processes (MDPs) with a countable state space. We treat both the discounted and the expected average cost, with...
Flow control using the theory of zero sum Markov games (1992)
We consider the problem of dynamic flow control of arriving pacquets into an infinite buffer. The service rate may depend on the state of the system, may change in time and is unknown to the...
Asymptotic properties of constrained Markov decision processes (1992)
We present in this paper several asymptotic properties of constrained Markov Decision Processes (MDPs) with a countable state space. We treat both the discounted and the expected average cost, with...
Some Qualitative Properties In Polling Systems (1992)
E De Recherche, Et En Automatique, Eitan Altman, Eitan Altman, Panagiotis Konstantopoulos, Panagiotis Konstantopoulos, ...
Consider a polling system with K 1 queues and a single server that visits the queues in a cyclic order. The polling discipline in each queue is of general gated-type or exhaustive-type. We assume...
Denumerable Constrained Markov Decision Problems And Finite Approximations (1992)
E De Recherche, Et En Automatique, Sophia Antipolis, Eitan Altman, Eitan Altman, Centre Sophia Antipolis
The purpose of this paper is two fold. First to establish the Theory of discounted constrained Markov Decision Processes with a countable state and action spaces with general multi-chain structure....
Closed-Loop Control with Delayed Information (1992)
E De Recherche, Et En Automatique, Sophia Antipolis, Eitan Altman, Eitan Altman
The theory of Markov Control Model with Perfect State Information (MCM-PSI) requires that the current state of the system is known to the decision maker at decision instants. Otherwise, one speaks of...
Flow Control Using The Theory Of Zero Sum Markov Games (1992)
We consider the problem of dynamic flow control of arriving packets into an infinite buffer. The service rate may depend on the state of the system, may change in time and is unknown to the...
On Elevator Polling with Globally Gated Regime (1992)
Eitan Altman, Centre Sophia Antipolis, Asad Khamisy, Uri Yechiali
We consider a polling system consisting of N queues and a single server where polling is performed according to an Elevator (scan) scheme. The server first serves queues in the `up' direction,...
Closed-Loop Control with Delayed Information (1992)
The theory of stochastic dynamic programming requires that the current state of the system is known to the decision maker. However, this condition is violated in a number of cases, as for instance in...
Denumerable Constrained Markov Decision Processes and Finite Approximations (1992)
The purpose of this paper is two fold. First to establish the Theory of discounted constrained Markov Decision Processes with a countable state and action spaces with general multi-chain structure....
Control Of A Hybrid Stochastic System (1992)
Eitan Altman, Vladimir Gaitsgory, France Centresophiaantipolis, Weconsiderinthispaperacontinuoustimestochastichybridcontrolsystemwitha Abstract
We consider in this paper a continuous time stochastic hybrid control system with a finite time horizon. The objective is to minimize a linear function of the expected state trajectory. The state...
Denumerable constrained Markov decision problems and finite approximations (1991)
The purpose of this paper is two fold. First to establish the Theory of discounted constrained Markov Decision Process with a countable state and action spaces with general multi-chain structure....
The approach in Markov decision processes revisited (1991)
Disponible dans les fichiers attachés à ce document
Analysis of timed-token ring protocols (1991)
We analyze in this paper the performance of Token Ring Protocols with constraints on the cycle times. Each stations may have a different cycle time constraint, and a different number of buffers. We...
Optimality of a threshold policy in the M/M/1 queue with repeated vacations (1991)
Disponible dans les fichiers attachés à ce document
Denumerable constrained Markov decision problems and finite approximations (1991)
The purpose of this paper is two fold. First to establish the Theory of discounted constrained Markov Decision Process with a countable state and action spaces with general multi-chain structure....
Analysis of timed-token ring protocols (1991)
We analyze in this paper the performance of Token Ring Protocols with constraints on the cycle times. Each stations may have a different cycle time constraint, and a different number of buffers. We...
Optimality of a threshold policy in the M/M/1 queue with repeated vacations (1991)
Disponible dans les fichiers attachés à ce document
Adaptive Control of Constrained Markov Chains: Criteria and Policies (1991)
Eitan Altman, Adam Shwartz, Eitanaltmanandadamshwartz Criteriaandpolicies
We consider the constrained optimization of a finite-state, finite action Markov chain. In the adaptive problem, the transition probabilities are assumed to be unknown, and no prior distribution on...
Cyclic Bernoulli Polling \Lambda (1991)
1 2 CBP scheme for which the optimal pi's are not all equal to one, yields a smaller amount of the expected unfinished work in the system than that in the standard cyclic polling procedure with...
Polling Systems with Synchronization Constraints (1990)
Asad Khamisy, Eitan Altman, Centre Sophia Antipolis, Moshe Sidi
We introduce a new service discipline called the synchronized gated discipline, for polling systems. It arises when there are precedence (or synchronization) constraints between the order that jobs...
On Elevator Polling with Globally Gated Regime \Lambda (1990)
Abstract We consider a polling system consisting of N queues and a single server where polling is performed according to an Elevator (scan) scheme. The server first serves queues in the `up '...
Downlink Macrodiversity in Cellular Network A Fluid Analysis (1970)
This paper proposes an analytical study of the downlink macrodiversity. Considering two macrodiversity links, we first show that the downlink macrodiversity induces a specific load in the cell. We...
TELECOMMUNICATIONS AT THE START OF THE NEW MILLENNIUM
Chadi Barakat, Eitan Altman, Walid Dabbous
Transmission media carrying Internet traffic present a wide range of characteristics, some of which, such as transmission errors, long end-toend delay, and bandwidth asymmetry, may cause a...
Fluid Analysis of Early Message Discarding Policy under Heavy Traffic
A message(or a frame) is a group of consecutive packets (or cells ATM terminology). Often a loss of one packet from the message can result in the loss of the whole message. Selective Message...