메뉴 건너뛰기




Volumn 3, Issue , 2005, Pages 1557-1567

Throughput guarantees through maximal scheduling in wireless networks

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84962076650     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (147)

References (10)
  • 1
    • 84962087745 scopus 로고    scopus 로고
    • Joint asynchronous congestion control and distributed scheduling for multihop wireless networks
    • L. Bui, A. Eryilmaz, R. Srikant, and X. Wu. Joint asynchronous congestion control and distributed scheduling for multihop wireless networks. In Preprint, 2005.
    • (2005) Preprint
    • Bui, L.1    Eryilmaz, A.2    Srikant, R.3    Wu, X.4
  • 3
    • 0033891586 scopus 로고    scopus 로고
    • The throughput of data switches with and without speedup
    • Tel Aviv, Israel Mar
    • J. Dai and B. Prabhakar. The throughput of data switches with and without speedup. In IEEE INFOCOM'00, pages 556-564, Tel Aviv, Israel, Mar 2000.
    • (2000) IEEE INFOCOM'00 , pp. 556-564
    • Dai, J.1    Prabhakar, B.2
  • 4
    • 25844499235 scopus 로고    scopus 로고
    • The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks. in
    • Miami, FL Mar
    • X. Lin and N. Shroff. The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks. In IEEE INFOCOM'05, Miami, FL, Mar 2005.
    • (2005) IEEE INFOCOM'05
    • Lin, X.1    Shroff, N.2
  • 6
    • 0036170240 scopus 로고    scopus 로고
    • An efficient randomized algorithm for input-queued switch scheduling
    • Jan-Feb
    • D. Shah, P. Giaccone, and B. Prabhakar. An efficient randomized algorithm for input-queued switch scheduling. IEEE Micro, 22 (1): 19-25, Jan-Feb 2002.
    • (2002) IEEE Micro , vol.22 , Issue.1 , pp. 19-25
    • Shah, D.1    Giaccone, P.2    Prabhakar, B.3
  • 7
    • 0031701310 scopus 로고    scopus 로고
    • Linear complexity algorithms for maximum throughput in radio networks and input queued switches
    • L. Tassiulas. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In INFOCOM'98, pages 533-539, 1998.
    • (1998) INFOCOM'98 , pp. 533-539
    • Tassiulas, L.1
  • 8
    • 84930890020 scopus 로고
    • Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
    • Dec
    • L. Tassiulas and A. Ephremidis. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37 (12): 1936-1948, Dec 1992.
    • (1992) IEEE Transactions on Automatic Control , vol.37 , Issue.12 , pp. 1936-1948
    • Tassiulas, L.1    Ephremidis, A.2
  • 9
    • 84962042503 scopus 로고    scopus 로고
    • Bounds on the capacity region of multihop wireless networks under distributed greedy scheduling
    • X. Wu and R. Srikant. Bounds on the capacity region of multihop wireless networks under distributed greedy scheduling. In Preprint, 2005.
    • (2005) Preprint
    • Wu, X.1    Srikant, R.2
  • 10
    • 33847194188 scopus 로고    scopus 로고
    • Regulated maximal matching: A distributed scheduling algorithm for multihop wireless networks with nodeexclusive spectrum sharing
    • Seville, Spain Dec
    • X. Wu and R. Srikant. Regulated maximal matching: a distributed scheduling algorithm for multihop wireless networks with nodeexclusive spectrum sharing. In Proceedings of IEEE CDC-ECC'05, Seville, Spain, Dec 2005.
    • (2005) Proceedings of IEEE CDC-ECC'05
    • Wu, X.1    Srikant, R.2


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