메뉴 건너뛰기




Volumn 31, Issue 3, 2001, Pages 14-23

An ECN probe-based connection acceptance control

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0012200434     PISSN: 01464833     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/505659.505662     Document Type: Article
Times cited : (15)

References (26)
  • 5
    • 0032090155 scopus 로고    scopus 로고
    • Generating representative Web workloads for network and server performance evaluation
    • Madison, WI, July
    • P. Barford and M. Crovella. Generating representative Web workloads for network and server performance evaluation. In ACM SIGMETRICS 1998, pages 151-160, Madison, WI, July 1998.
    • (1998) ACM SIGMETRICS 1998 , pp. 151-160
    • Barford, P.1    Crovella, M.2
  • 6
    • 0033889590 scopus 로고    scopus 로고
    • Throughput analysis of end-to-end measurement-based admission control in IP
    • Tel Aviv, Israel, March
    • G. Bianchi, A. Capone, and C. Petrioli. Throughput analysis of end-to-end measurement-based admission control in IP. In IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
    • (2000) IEEE INFOCOM 2000
    • Bianchi, G.1    Capone, A.2    Petrioli, C.3
  • 10
    • 0033907691 scopus 로고    scopus 로고
    • Comments on the performance of measurement-based admission control algorithms
    • Tel Aviv, Israel, March
    • L. Breslau, S. Jamin, and S. Shenker. Comments on the performance of measurement-based admission control algorithms. In IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
    • (2000) IEEE INFOCOM 2000
    • Breslau, L.1    Jamin, S.2    Shenker, S.3
  • 11
    • 0033651714 scopus 로고    scopus 로고
    • Endpoint admission control: Architectural issues and performance
    • Stockholm, Sweeden, October
    • L. Breslau, E. W. Knightly, S. Shenker, I. Stoica, and H. Zhang. Endpoint admission control: Architectural issues and performance. In ACM SIGCOMM 2000, pages 57-69, Stockholm, Sweeden, October 2000.
    • (2000) ACM SIGCOMM 2000 , pp. 57-69
    • Breslau, L.1    Knightly, E.W.2    Shenker, S.3    Stoica, I.4    Zhang, H.5
  • 12
    • 0033884536 scopus 로고    scopus 로고
    • Admission control based on end-to-end measurements
    • Tel Aviv, Israel, March
    • V. Elek, G. Karlsson, and R. Ronngren. Admission control based on end-to-end measurements. In IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
    • (2000) IEEE INFOCOM 2000
    • Elek, V.1    Karlsson, G.2    Ronngren, R.3
  • 13
    • 0039178192 scopus 로고    scopus 로고
    • Web page
    • S. Floyd. ECN (explicit congestion notification) in TCP/IP. Web page http://www.aciri.org/floyd/ecn.html.
    • TCP/IP
    • Floyd, S.1
  • 14
    • 0002348257 scopus 로고
    • TCP and explicit congestion notification
    • October
    • S. Floyd. TCP and explicit congestion notification. ACM Computer Communication Review, 24(5): 10-23, October 1994.
    • (1994) ACM Computer Communication Review , vol.24 , Issue.5 , pp. 10-23
    • Floyd, S.1
  • 15
    • 0032594135 scopus 로고    scopus 로고
    • Promoting the use of end-to-end congestion control in the internet
    • May
    • S. Floyd and K. Fall. Promoting the use of end-to-end congestion control in the internet. IEEE/ACM Transcations on Networking, 7(4):458-472, May 1999.
    • (1999) IEEE/ACM Transcations on Networking , vol.7 , Issue.4 , pp. 458-472
    • Floyd, S.1    Fall, K.2
  • 18
    • 0033283294 scopus 로고    scopus 로고
    • Resource pricing and the evolution of congestion control
    • R. J. Gibbens and F. P. Kelly. Resource pricing and the evolution of congestion control. Automatica, 35:1969-1985, 1999.
    • (1999) Automatica , vol.35 , pp. 1969-1985
    • Gibbens, R.J.1    Kelly, F.P.2
  • 21
    • 0347308103 scopus 로고    scopus 로고
    • Models for a self-managed internet
    • The Royal Society, August
    • F. P. Kelly. Models for a self-managed internet. In Philosophical Transactions of The Royal Society A358, pages 2335-2348. The Royal Society, August 2000. Available via http: //www.statslab.cam.ac.uk/~frank/smi.html.
    • (2000) Philosophical Transactions of The Royal Society A358 , pp. 2335-2348
    • Kelly, F.P.1
  • 22
    • 0032671970 scopus 로고    scopus 로고
    • Differential QoS and pricing in networks: Where flow-control meets game theory
    • March
    • P. Key and D. McAuley. Differential QoS and pricing in networks: where flow-control meets game theory. IEE Proceedings Software, 146(2), March 1999.
    • (1999) IEE Proceedings Software , vol.146 , Issue.2
    • Key, P.1    McAuley, D.2
  • 23
    • 0033893168 scopus 로고    scopus 로고
    • End-to-end congestion control schemes: Utility functions, random losses and ECN marks
    • Tel Aviv, Israel, March
    • S. Kunniyur and R. Srikant. End-to-end congestion control schemes: Utility functions, random losses and ECN marks. In IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
    • (2000) IEEE INFOCOM 2000
    • Kunniyur, S.1    Srikant, R.2
  • 24
    • 0034997164 scopus 로고    scopus 로고
    • A time-scale decomposition approach to adaptive ECN marking
    • Anchorage, Alaska, April
    • S. Kunniyur and R. Srikant. A time-scale decomposition approach to adaptive ECN marking. In IEEE INFOCOM 2001, Anchorage, Alaska, April 2001.
    • (2001) IEEE INFOCOM 2001
    • Kunniyur, S.1    Srikant, R.2
  • 26
    • 0009519219 scopus 로고    scopus 로고
    • How to mark fairly
    • MIT, September
    • D. Wischik. How to mark fairly. In Workshop on Internet Service Quality Economics. MIT, September 1999. Available via http://www.statslab.cam.ac.uk/ ~djw1005/Stats/Research/marking.ps.
    • (1999) Workshop on Internet Service Quality Economics
    • Wischik, D.1


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