Optimal throughput allocation in general random-access networks

2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Volumn , Issue , 2006, Pages 1254-1259

  Gupta, Piyush ^a   Stolyar, Alexander L ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMAL SYSTEMS; PARAMETERIZATION; PARETO PRINCIPLE; TELECOMMUNICATION LINKS; THROUGHPUT;

DYNAMIC LINKS; LINK-THROUGHPUT ALLOCATION; OPTIMAL THROUGHPUT ALLOCATION; RANDOM ACCESS NETWORKS;

MEDIUM ACCESS CONTROL;

EID: 44049105355     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2006.286657     Document Type: Conference Paper

References (12)

1. N. Abramson. The ALOHA system - Another alternative for computer communications. Proc. AFIPS Conf., Vol. 37, (1970), pp. 281-285.
2. M. Andrews, L. Qian, A. L. Stolyar. Optimal Utility Based Multi-User Throughput Allocation subject to Throughput Constraints. Proceeding of INFOCOM'2005, Miami, March 13-17, 2005.
3. P. Gupta, Y. Sankarasubramaniam, A. L. Stolyar. Random-Access Scheduling with Service Differentiation in Wireless Networks. Proceeding of INFOCOM'2005, Miami, March 13-17, 2005.
4. P. Gupta, A. L. Stolyar. Throughput Region of Random Access Networks of General Topology. Bell Labs Technical Memo, 2005. Submitted.
5. P. Gupta, A. L. Stolyar. Optimal Throughput Allocation in Random Access Networks of General Topology. Bell Labs Technical Memo, 2005.
6. K. Kar, S. Sarkar, L. Tassiulas. Achieving Proportionally Fair Rates using Local Information in Aloha Networks. IEEE Trans. Autom. Control, Vol. 49, (2004), No. 10, pp. 1858-1862.
7. F. P. Kelly. Mathematical Modelling of the Internet. In: Engquist B., Schmidt W. (eds). Mathematics Unlimited - 2001 and Beyond. Springer, Berlin, 2001, pp. 685-702.
8. J. Massey and P. Mathys. The collision channel without feedback. IEEE Trans. Inform. Theory, Vol. IT-31, (1985), no. 2, pp. 192-204.
9. K. A. Post. Convexity of the Nonachievable Rate Region for the collision channel without feedback. IEEE Trans. Inform. Theory, Vol. IT-31, (1985), No. 2, pp. 205-206.
10. A. L. Stolyar. Maximizing Queueing Network Utility subject to Stability: Greedy Primal-Dual Algorithm. Queueing Systems, 2005, Vol.50, No.4, pp.401-457.
11. A. L. Stolyar. Dynamic Distributed Scheduling in Random Access Networks. Bell Labs Technical Memo, 2005. Submitted.
12. X. Wang and K. Kar. Distributed Algorithms for Max-min Fair Rate Allocation in Aloha Networks. Proceedings of the 42nd Annual Allerton Conference, Urbana-Champaign, 2004.