Learn More
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 fixed-point solution and performance measures resulting from it are studied. Uniqueness of the fixed point is established. Simple and general throughput formulas are(More)
We consider the vector fixed point equations arising out of the analysis of the saturation throughput of a single cell IEEE 802.11e wireless local area network with nodes that have different back-off parameters, including different Arbitration InterFrame Space (AIFS) values. We consider balanced and unbalanced solutions of the fixed point equations arising(More)
We consider an optimal power and rate scheduling problem for a single user transmitting to a base station on a fading wireless link with the objective of minimizing the mean delay subject to an average power constraint. The base station acts as a controller which, depending upon the transmitter buffer lengths and the signal power to interference ratio (SIR)(More)
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 backoff parameters, including different Arbitration InterFrame Space (AIFS) values. We consider balanced and unbalanced solutions of the fixed point equations(More)
We consider a model comprising several servers, with possibly different service speeds, each equipped with its own queue. Each server receives a dedicated amval stream of jobs; there is also a stream of generic jobs that amve to a job scheduler and can be individually allocated to any of the servers. We show that if the arrival streams are all Poisson, and(More)
We study a scheduling problem in a mobile network scenario where vehicles are used as relays. A fixed source node wants to transfer a file of a known size to a fixed destination node, located beyond its communication range. In the absence of any infrastructure connecting the two nodes, we consider the possibility of communication using vehicles passing by.(More)
Abwmcr-This paper is ahnut analytical mndels fnr calculating the average handwidth shares nhtained hy TCP cnntrnlled finite file transfers that arrive randnmly and share a single (hnttleneck) link. Owing tn the cnmplex nature nf the TCP cnngestinn cnntrnl algnrithm, a single mndel dries nnt wnrk well fnr all cnmhinatinns nf netwnrk parameters (i.e., mean(More)
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the medium access control, link, and physical layers. We assume Markov models for the packet arrival processes and the channel gain processes. Perfect channel state information is assumed(More)