Approximation Algorithms for Throughput Maximization in Wireless Networks With Delay Constraints
暂无分享,去创建一个
Aravind Srinivasan | Srinivasan Parthasarathy | Guanhong Pei | Anil Kumar S. Vullikanti | S. Parthasarathy | A. Srinivasan | A. Vullikanti | Guanhong Pei
[1] Anil Vullikanti,et al. Low-complexity scheduling for wireless networks , 2012, MobiHoc '12.
[2] Xiaojun Lin,et al. A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay , 2011, 2011 Proceedings IEEE INFOCOM.
[3] R. Srikant,et al. Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints , 2011, IEEE Journal on Selected Areas in Communications.
[4] Matthew Andrews,et al. Minimizing End-to-End Delay in Wireless Networks Using a Coordinated EDF Schedule , 2010, 2010 Proceedings IEEE INFOCOM.
[5] Thomas Erlebach,et al. Length-bounded cuts and flows , 2006, TALG.
[6] M.J. Neely,et al. Delay Analysis for Maximal Scheduling With Flow Control in Wireless Networks With Bursty Traffic , 2009, IEEE/ACM Transactions on Networking.
[7] Martin Haenggi,et al. Towards an end-to-end delay analysis of wireless multihop networks , 2009, Ad Hoc Networks.
[8] Peng-Jun Wan,et al. Multiflows in multihop wireless networks , 2009, MobiHoc '09.
[9] Ness B. Shroff,et al. Delay Analysis for Multi-Hop Wireless Networks , 2009, IEEE INFOCOM 2009.
[10] Aravind Srinivasan,et al. Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks , 2009, IEEE INFOCOM 2009.
[11] Koushik Kar,et al. Delay Guarantees for Throughput-Optimal Wireless Link Scheduling , 2009, IEEE INFOCOM 2009.
[12] Eytan Modiano,et al. Delay analysis of maximum weight scheduling in wireless Ad Hoc networks , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.
[13] Y.T. Hou,et al. On Path Selection and Rate Allocation for Video in Wireless Mesh Networks , 2009, IEEE/ACM Transactions on Networking.
[14] Tobias Achterberg,et al. SCIP: solving constraint integer programs , 2009, Math. Program. Comput..
[15] R. Srikant,et al. Low-Complexity Distributed Scheduling Algorithms for Wireless Networks , 2007, IEEE/ACM Transactions on Networking.
[16] Devavrat Shah,et al. Optimal delay scheduling in networks with arbitrary constraints , 2008, SIGMETRICS '08.
[17] Lisa Zhang,et al. Satisfying Arbitrary Delay Requirements in Multihop Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[18] Aravind Srinivasan,et al. Capacity of Asynchronous Random-Access Scheduling in Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[19] Koushik Kar,et al. Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks , 2008, IEEE Transactions on Information Theory.
[20] Xiaojun Lin,et al. A Distributed Joint Channel-Assignment, Scheduling and Routing Algorithm for Multi-Channel Ad-hoc Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[21] Jean Mairesse,et al. Queues, stores, and tableaux , 2005, ArXiv.
[22] Alhussein A. Abouzeid,et al. Queuing network models for delay analysis of multihop wireless ad hoc networks , 2006, IWCMC '06.
[23] Leandros Tassiulas,et al. Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..
[24] Ness B. Shroff,et al. Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[25] Nitin H. Vaidya,et al. Capacity of multi-channel wireless networks: impact of number of channels and interfaces , 2005, MobiCom '05.
[26] Murali S. Kodialam,et al. Characterizing the capacity region in multi-radio multi-channel wireless mesh networks , 2005, MobiCom '05.
[27] David Starobinski,et al. Performance of wireless networks with hidden nodes: a queuing-theoretic analysis , 2005, Comput. Commun..
[28] Edward W. Knightly,et al. Schedulability criterion and performance analysis of coordinated schedulers , 2005, IEEE/ACM Transactions on Networking.
[29] Eytan Modiano,et al. Capacity and delay tradeoffs for ad hoc mobile networks , 2004, IEEE Transactions on Information Theory.
[30] Ravi Mazumdar,et al. Scaling laws for capacity and delay in wireless ad hoc networks with random mobility , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).
[31] Andrea J. Goldsmith,et al. Large wireless networks under fading, mobility, and delay constraints , 2004, IEEE INFOCOM 2004.
[32] Devavrat Shah,et al. Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.
[33] David Tse,et al. Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.
[34] Edward W. Knightly,et al. Coordinated network scheduling: a framework for end-to-end services , 2000, Proceedings 2000 International Conference on Network Protocols.
[35] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[36] Aravind Srinivasan,et al. New algorithmic aspects of the Local Lemma with applications to routing and partitioning , 1999, SODA '99.
[37] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.
[38] Lisa Zhang,et al. Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[39] Anand S. Bedekar,et al. The Information-Theoretic Capacity of Discrete-Time Queues , 1997, IEEE Trans. Inf. Theory.
[40] Roch Guérin,et al. Efficient network QoS provisioning based on per node traffic shaping , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[41] Aravind Srinivasan,et al. An extension of the Lovász local lemma, and its applications to integer programming , 1996, SODA '96.
[42] Roland Wunderling,et al. Paralleler und objektorientierter Simplex-Algorithmus , 1996 .
[43] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[44] Subramanian Ramanathan,et al. Scheduling algorithms for multihop radio networks , 1993, TNET.
[45] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[46] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[47] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[48] P. Burke,et al. Behavior of Tandem Buffers with Geometric Input and Markovian Output , 1976, IEEE Trans. Commun..