Throughput and Latency in Finite-Buffer Line Networks
نویسندگان
چکیده
منابع مشابه
Stable Throughput of Cooperative Cognitive Networks with Energy Harvesting: Finite Relay Buffer and Finite Battery Capacity
This paper studies a generic model for cooperative cognitive radio networks where the secondary user is equipped with a finite length relaying queue as well as a finite length battery queue. Our prime objective is to characterize the stable throughput region. Nevertheless, the complete characterization of stable throughput region is notoriously difficult, since the computation of the steady sta...
متن کاملThroughput of CSMA networks with buffer dynamics
Random-access algorithms such as the Carrier-Sense Multiple-Access (CSMA) protocol provide a popular mechanism for distributed medium access control in large-scale wireless networks. In recent years fairly tractable models have been shown to yield remarkably accurate throughput estimates in scenarios with saturated buffers. In contrast, in non-saturated scenarios, where nodes refrain from compe...
متن کاملStable Throughput Region of Cognitive-Relay Networks with Imperfect Sensing and Finite Relaying Buffer
In this letter, we obtain the stable throughput region for a cognitive relaying scheme with a finite relaying buffer and imperfect sensing. The analysis investigates the effect of the secondary user’s finite relaying capabilities under different scenarios of primary, secondary and relaying links outages. Furthermore, we demonstrate the effect of miss detection and false alarm probabilities on t...
متن کاملTCP Throughput and Buffer Management
There have been many debates about the feasibility of providing guaranteed Quality of Service (QoS) when network traffic travels beyond the enterprise domain and into the vast unknown of the Internet. Many mechanisms have been proposed to bring QoS to TCP/IP and the Internet (RSVP, DiffServ, 802.1p). However, until these techniques and the equipment to support them become ubiquitous, most enter...
متن کاملBuffer allocation in general finite multi-server queuing networks
We address in this paper the buffer allocation problem in general service, finite waiting room, multi-server queueing networks. Several instances are examined using an approximation method to estimate the performance of the queueing networks and an iterative search method is developed to find the optimal buffer allocation within the network. The coefficient of variation of the service time is s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2137070