메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1157-1165

Cluster-based back-pressure routing algorithm

Author keywords

[No Author keywords available]

Indexed keywords

BACK PRESSURES;

EID: 51349103148     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.96     Document Type: Conference Paper
Times cited : (27)

References (25)
  • 2
    • 14944346958 scopus 로고    scopus 로고
    • Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs
    • D. Applegate and E. Cohen. "Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs," Proc. ACM SIGCOMM, 2003.
    • (2003) Proc. ACM SIGCOMM
    • Applegate, D.1    Cohen, E.2
  • 4
    • 34548322743 scopus 로고    scopus 로고
    • Polynomial complexity algorithms for full utilization of multi-hop wireless networks
    • A. Eryilmaz, A. Ozdaglar, and E. Modiano, "Polynomial complexity algorithms for full utilization of multi-hop wireless networks," Proc. IEEE INFOCOM, 2007.
    • (2007) Proc. IEEE INFOCOM
    • Eryilmaz, A.1    Ozdaglar, A.2    Modiano, E.3
  • 5
    • 25844526594 scopus 로고    scopus 로고
    • Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control
    • A. Eryilmaz and R. Srikant. "Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control," Proc. IEEE INFOCOM, 2005.
    • (2005) Proc. IEEE INFOCOM
    • Eryilmaz, A.1    Srikant, R.2
  • 6
    • 33747303799 scopus 로고    scopus 로고
    • Joint congestion control, routing and mac for stability and fairness in wireless networks
    • August
    • A. Eryilmaz and R. Srikant. "Joint congestion control, routing and mac for stability and fairness in wireless networks," IEEE Journal on Selected Aivas in Communications, vol. 24, no. 8, pp. 1514-1524, August 2006.
    • (2006) IEEE Journal on Selected Aivas in Communications , vol.24 , Issue.8 , pp. 1514-1524
    • Eryilmaz, A.1    Srikant, R.2
  • 8
    • 0033873349 scopus 로고    scopus 로고
    • Internet traffic engineering by optimizing OSPF weights
    • Mar
    • B. Fortz and M. Thorup. "Internet traffic engineering by optimizing OSPF weights," Proc. IEEE INFOCOM. Mar. 2000.
    • (2000) Proc. IEEE INFOCOM
    • Fortz, B.1    Thorup, M.2
  • 10
    • 33645768772 scopus 로고    scopus 로고
    • Stability of end-to-end algorithms for joint routing and rate control
    • F. Kelly and T. Voice. "Stability of end-to-end algorithms for joint routing and rate control," Computer Communication Review, 35(2), pp. 5-12, 2005.
    • (2005) Computer Communication Review , vol.35 , Issue.2 , pp. 5-12
    • Kelly, F.1    Voice, T.2
  • 11
    • 34548324845 scopus 로고    scopus 로고
    • Path selection and multipath congestion control
    • May
    • P. Key. L. Massoulie, and D. Towsley. "Path selection and multipath congestion control," Proc. INFOCOM, May 2007.
    • (2007) Proc. INFOCOM
    • Key, P.1    Massoulie, L.2    Towsley, D.3
  • 14
    • 0004066011 scopus 로고    scopus 로고
    • Request For Comments (Standard) RFC 2328. Internet Engineering Task Force, April
    • J. Moy. "OSPF Version 2," Request For Comments (Standard) RFC 2328. Internet Engineering Task Force, April 1998.
    • (1998) OSPF Version 2
    • Moy, J.1
  • 15
    • 25844437987 scopus 로고    scopus 로고
    • Fairness and optimal stochastic control for heterogeneous networks
    • M. J. Neely, E. Modiano, and C. Li, "Fairness and optimal stochastic control for heterogeneous networks," Proc. IEEE INFOCOM, 2005.
    • (2005) Proc. IEEE INFOCOM
    • Neely, M.J.1    Modiano, E.2    Li, C.3
  • 18
    • 51249122988 scopus 로고    scopus 로고
    • Distributed link scheduling with constant overhead
    • San Diego, CA, June
    • S. Sanghavi, L. Bui, and R. Srikant. "Distributed link scheduling with constant overhead," Proc. ACM SIGMETRICS. San Diego, CA, June 2007.
    • (2007) Proc. ACM SIGMETRICS
    • Sanghavi, S.1    Bui, L.2    Srikant, R.3
  • 19
    • 18844444815 scopus 로고    scopus 로고
    • Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks
    • April
    • A. Sridharan, R. Guerin, and C. Diot. "Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks," IEEE/ACM Transactions on Networking. 13(2). April 2005.
    • (2005) IEEE/ACM Transactions on Networking , vol.13 , Issue.2
    • Sridharan, A.1    Guerin, R.2    Diot, C.3
  • 20
    • 24944508677 scopus 로고    scopus 로고
    • Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm
    • A. L. Stolyar, "Maximizing queueing network utility subject to stability: greedy primal-dual algorithm," Queueing Systems, vol. 50, pp. 401-457, 2005.
    • (2005) Queueing Systems , vol.50 , pp. 401-457
    • Stolyar, A.L.1
  • 21
    • 84930890020 scopus 로고
    • Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks
    • December
    • L. Tassiulas and A. Ephremides. "Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks," IEEE Transactions on Automatic Control. Vol. 37. No. 12. pp. 1936-1949, December 1992.
    • (1992) IEEE Transactions on Automatic Control , vol.37 , Issue.12 , pp. 1936-1949
    • Tassiulas, L.1    Ephremides, A.2
  • 22
    • 0035013439 scopus 로고    scopus 로고
    • Internet traffic engineering without full mesh overlaying
    • April
    • Y. Wang, Z. Wang, L. Zhang. "Internet traffic engineering without full mesh overlaying," Proc INFOCOM, April 2001.
    • (2001) Proc INFOCOM
    • Wang, Y.1    Wang, Z.2    Zhang, L.3
  • 23
    • 36348955885 scopus 로고    scopus 로고
    • Learning contention patterns and adapting to load/topology changes in a mac scheduling algorithm
    • Y. Yi, G. de Veciana, and S. Shakkottai, "Learning contention patterns and adapting to load/topology changes in a mac scheduling algorithm." Proc. WiMesh, 2006.
    • (2006) Proc. WiMesh
    • Yi, Y.1    de Veciana, G.2    Shakkottai, S.3
  • 24
    • 51349094735 scopus 로고    scopus 로고
    • Cluster-based backpressure routing algorithm,
    • Technical Report. Available at
    • L. Ying, R. Srikant, and D. Towsley. "Cluster-based backpressure routing algorithm," Technical Report. Available at http://www.ifp.uiuc.edu/ ~srikant/WorkingPapers/yinsritow07.pdf.
    • Ying, L.1    Srikant, R.2    Towsley, D.3
  • 25
    • 33750312581 scopus 로고    scopus 로고
    • Optimal routing with multiple traffic matrices: Tradeoff between average case and worst case performance
    • November
    • C. Zhang, Z. Ge, J. Kurose. Y. Liu, and D. Towsley. "Optimal routing with multiple traffic matrices: Tradeoff" between average case and worst case performance," Proc. ICNP 2005. November 2005.
    • (2005) Proc. ICNP 2005
    • Zhang, C.1    Ge, Z.2    Kurose, J.3    Liu, Y.4    Towsley, D.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.