A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
LIFO-Backpressure Achieves Near Optimal Utility-Delay Tradeoff
[article]
2011
arXiv
pre-print
Preserved Fulltext
Other Versions
In this paper, we show that the Backpressure algorithm, when combined with the LIFO queueing discipline (called LIFO-Backpressure), is able to achieve a utility that is within O(1/V) of the optimal value ...
A key open problem has been the development of utility-optimal algorithms that are also delay efficient. ...
Most prior performance results for Backpressure are given in the following [O(1/V ), O(V )] utility-delay tradeoff form [6] : Backpressure is able to achieve a utility that is within O(1/V ) of the optimal ...
arXiv:1008.4895v2
fatcat:ybja6dcayvcz5ebwtlzwgxta3u
LIFO-Backpressure Achieves Near-Optimal Utility-Delay Tradeoff
2013
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show that the Backpressure algorithm, when combined with the LIFO queueing discipline (called LIFO-Backpressure), is able to achieve a utility that is within O(1/V ) of the optimal value ...
A key open problem has been the development of utility-optimal algorithms that are also delay efficient. ...
We show that LIFO p -Backpressure achieves the same near-optimal tradeoff, and guarantees that all packets are delivered. ...
doi:10.1109/tnet.2012.2226215
fatcat:xorhbwy2yrh6rfjbwqacy2owmy
LIFO-Backpressure achieves near optimal utility-delay tradeoff
2011
2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show that the Backpressure algorithm, when combined with the LIFO queueing discipline (called LIFO-Backpressure), is able to achieve a utility that is within O(1/V ) of the optimal value ...
A key open problem has been the development of utility-optimal algorithms that are also delay efficient. ...
We show that LIFO p -Backpressure achieves the same near-optimal tradeoff, and guarantees that all packets are delivered. ...
doi:10.1109/wiopt.2011.5930067
dblp:conf/wiopt/HuangMNK11
fatcat:y6okj4otiferlbzhh5v3x4dibm
Backpressure Routing Made Practical
2010
2010 INFOCOM IEEE Conference on Computer Communications Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In theory, according to recent literature on cross-layer stochastic network optimization, such a dynamic routing approach can provide near-optimal utilization of the available bandwidth. ...
We also show that the average end-to-end packet delays in BCP can be drastically reduced (75% under high load, 98% under low load) by using LIFO queues. ...
Delay Performance Finally, we evaluate the improvement achieved by replacing BCP FIFO queues with LIFO ones. ...
doi:10.1109/infcomw.2010.5466634
fatcat:ccon56eaizexzfpw2lzn27uj4a
The power of online learning in stochastic network optimization
2014
The 2014 ACM international conference on Measurement and modeling of computer systems - SIGMETRICS '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We prove strong performance guarantees of the proposed algorithms: OLAC and OLAC2 achieve the near-optimal [O( ), O([log(1/ )] 2 )] utility-delay tradeoff and OLAC2 possesses an O( −2/3 ) convergence time ...
To the best of our knowledge, OLAC and OLAC2 are the first algorithms that simultaneously possess explicit near-optimal delay guarantee and sub-linear convergence time, and our attempt is the first to ...
As we will see, OLAC achieves a near-optimal utility-delay tradeoff and has a significantly faster learning speed. ...
doi:10.1145/2591971.2591990
dblp:conf/sigmetrics/HuangLH14
fatcat:sizymjvigbdnxaelrglf5uujhq
The Power of Online Learning in Stochastic Network Optimization
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We prove strong performance guarantees of the proposed algorithms: OLAC and OLAC2 achieve the near-optimal [O(ϵ), O([(1/ϵ)]^2)] utility-delay tradeoff and OLAC2 possesses an O(ϵ^-2/3) convergence time. ...
OLAC and OLAC2 are probably the first algorithms that simultaneously possess explicit near-optimal delay guarantee and sub-linear convergence time. ...
As we will see, OLAC achieves a near-optimal utility-delay tradeoff and has a significantly faster learning speed. ...
arXiv:1404.1592v2
fatcat:ko7yw332snej7e3bldrfjivcsa
Achieving utility-delay-reliability tradeoff in stochastic network optimization with finite buffers
2015
2015 IEEE Conference on Computer Communications (INFOCOM)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
One practical open problem is the development of a distributed algorithm that achieves near-optimal utility using only a finite (and small) buffer size for queues in a stochastic network. ...
With a finite buffer size of B packets, the proposed algorithm achieves within O(e −B ) of the optimal utility while maintaining average per-hop delay of O(B) and an average per-hop drop rate of O(e −B ...
Further, they achieve an [O(1/V ), O(V )] utility-delay tradeoff, where V > 0 is a parameter that can be chosen as desired to achieve a specific operating point on the [O(1/V ), O(V )] utility-delay tradeoff ...
doi:10.1109/infocom.2015.7218520
dblp:conf/infocom/Supittayapornpong15
fatcat:hd75xh3wpffj7jxhrgztg7dra4
Achieving Utility-Delay-Reliability Tradeoff in Stochastic Network Optimization with Finite Buffers
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
One practical open problem is the development of a distributed algorithm that achieves near-optimal utility using only a finite (and small) buffer size for queues in a stochastic network. ...
With a finite buffer size of B packets, the proposed algorithm achieves within O(e^-B) of the optimal utility while maintaining average per-hop delay of O(B) and an average per-hop drop rate of O(e^-B) ...
)] utility-delay tradeoff curve. ...
arXiv:1501.03457v1
fatcat:pbji2f3gdnauveuhjs4w43up3y
Receding learning-aided control in stochastic networks
2015
Performance evaluation (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that RLC achieves near-optimal utility-delay tradeoffs for stationary systems, while ensuring an effeicient distribution-change detection and a fast convergence speed when applied to non-stationary ...
Then, it carefully selects the sampled information and estimates a Lagrange multiplier of an underlying optimization problem via dual-learning. ...
Theorem 1 shows that RLC achieves the near-optimal [O(1/V ), O(log(V ) 2 )] utility-delay tradeoff (only a log-factor from the optimal), which is the same compared to the previous algorithms, e.g., OLAC ...
doi:10.1016/j.peva.2015.06.010
fatcat:yrnmstmjvbbobkbhwnshtowve4
A Survey on Delay-Aware Resource Control for Wireless Systems—Large Deviation Theory, Stochastic Lyapunov Drift, and Distributed Stochastic Learning
2012
IEEE Transactions on Information Theory
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2011 pre-print arXiv:1110.4535v1 fatcat:rudyejdeuzfkpau7vsyqpsxxoq
Furthermore, recent results regarding delay-aware multi-hop routing designs in general multi-hop networks are elaborated. ...
These approaches essentially embrace most of the existing literature regarding delay-aware resource control in wireless systems. ...
Using the "exponential attraction" result developed in [59] , Neely shows in [61] that the LIFO DBP routing algorithm can achieve [O(1/V ), O(log 2 (V ))] utility-delay tradeoff for almost all the arrival ...
doi:10.1109/tit.2011.2178150
fatcat:3vrelknnure25kyqwwcu2undma
Trust-based backpressure routing in wireless sensor networks
2015
International Journal of Sensor Networks (IJSNet)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
The backpressure scheduling is known for being throughput-optimal. However, it is usually assumed that nodes cooperate with each other to forward the network traffic. ...
In this paper, we apply a Vector AutoRegression (VAR) based trust model over the Backpressure Collection Protocol (BCP), a collection mechanism based on dynamic backpressure routing in Wireless Sensor ...
It was shown that Backpressure algorithm when combined with LIFO queuing discipline is able to achieve near-optimal utilitydelay tradeoff Huang et al. (2011) . ...
doi:10.1504/ijsnet.2015.067591
fatcat:k57gdzgor5hxbkze5rcznwq57m
Achieving Congestion Diversity in Multi-hop Wireless Mesh Networks
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
This paper reports on the first systematic study of congestion-aware routing algorithms for wireless mesh networks to achieve an improved end-end delay performance. ...
SRCR solely utilizes link qualities, while BP relies on queue differential to route packets. ...
It shows that the delay performance is poor for CDP and for intermediate α, 0 < α < 1, i.e. when diversity is utilized. The end-end delay increases significantly for α near 0.5. ...
arXiv:1203.4841v1
fatcat:idk7yybcx5b5tpcdy5kq3b6tye
Learning-aided Stochastic Network Optimization with Imperfect State Prediction
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In particular, for stationary networks, PLC achieves a near-optimal [O(ϵ), O((1/ϵ)^2)] utility-delay tradeoff. ...
Our results demonstrate that state prediction (even imperfect) can help (i) achieve faster detection and convergence, and (ii) obtain better utility-delay tradeoffs. ...
We show that for stationary networks, PLC achieves an [O( ), O(log 2 (1/ ))] utility-delay tradeoff. ...
arXiv:1705.05058v2
fatcat:ipvrxid66ffr3pxoqhoxsrumhq
Opportunistic Routing with Adaptive CSMA/CA in Wireless Mesh Networks
2010
2010 IEEE Global Telecommunications Conference GLOBECOM 2010
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Based on a cross-layer optimization framework, we design a crosslayer protocol for congestion control, opportunistic routing and CSMA scheduling for WMNs that is able to handle the described tradeoff. ...
In this paper, we address the question of how opportunistic routing (OR) should be used in wireless mesh networks (WMNs) based on carrier sense multiple access (CSMA) in order to efficiently utilize multi-user ...
Neely et al. characterize the tradeoff between utility and end-to-end delay for NUM problems [32, 86, 89] . ...
doi:10.1109/glocom.2010.5683520
dblp:conf/globecom/KurthR10
fatcat:tujdirbg6zb73gpvourm425mcm
Software-Defined Networking meets Software-Defined Radio in Mobile Ad hoc Networks: State of the Art and Future Directions
2022
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We discuss the state of the art of cross-layer optimization, SDN and SDR, and current challenges associated with coexistence and interaction of SDN and SDR. ...
INDEX TERMS Software-Defined Networking (SDN), Software-Defined Radio (SDR), coexistence, Mobile Ad hoc Networks (MANETs), Cross-layer design and optimization. ...
Second, a last-in-first-out (LIFO) queue service is proposed instead of first-in-first-out (FIFO), which leads to reduction in packet delivery delays.
C. ...
doi:10.1109/access.2022.3144072
fatcat:sd2a2veiznca7kz2esmhiyawqq
« Previous
Showing results 1 — 15 out of 18 results