메뉴 건너뛰기




Volumn 20, Issue 3 SPEC. ISS., 1996, Pages 169-181

Adding service discrimination to the Internet

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; DATA COMMUNICATION SYSTEMS; FREQUENCY ALLOCATION; RESOURCE ALLOCATION; TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC;

EID: 0030125172     PISSN: 03085961     EISSN: None     Source Type: Journal    
DOI: 10.1016/0308-5961(96)00001-8     Document Type: Article
Times cited : (29)

References (19)
  • 1
    • 85013623251 scopus 로고
    • Congestion avoidance and control
    • Jacobson, V 'Congestion avoidance and control', Proceedings of ACM Sigcomm 1988 15 (4) 314-329
    • (1988) Proceedings of ACM Sigcomm , vol.15 , Issue.4 , pp. 314-329
    • Jacobson, V.1
  • 2
    • 0042260403 scopus 로고    scopus 로고
    • note
    • Another fact worth noting about the Internet is the rather long delays in the control mechanisms. With the cross-country round-trip delay of about 0.1 s, the response time of TCP to congestion information is necessarily slow. In this sort of time, many packets can be sent from a single source, and substantial short-term congestion can occur, which must be dealt with by queuing.
  • 3
    • 0003325412 scopus 로고    scopus 로고
    • Pricing the Internet
    • JFK School of Government, May 1993. Latest version available via
    • MacKie-Mason, J and Varian, H 'Pricing the Internet' presented at Public Access to the Internet, JFK School of Government, May 1993. Latest version available via ftp://ftp.econ.lsa.umich.edu/pub/Papers/ Pricing_the_Internet.ps.Z.
    • Public Access to the Internet
    • MacKie-Mason, J.1    Varian, H.2
  • 4
    • 0043262711 scopus 로고    scopus 로고
    • note
    • The typical round trip for a cross-country Internet path is about 0.1 s. The transmission time of a 2 kb data element on today's long-distance trunks (45 mb/s) is about 0.00035 s. Thus, even a queuing delay of 100 packets, adding 0.035 s of delay, is substantially less than the irreducible round-trip delay.
  • 5
    • 0041759642 scopus 로고    scopus 로고
    • note
    • If the user fetches a new Web page on the average every 10 s, and each page on the average is 2 kb, then the data from each user occupies the trunk for 0.0035 s every 10 s. 28 000 of this sort of user can be supported in each direction across a 45 mb/s trunk. It is also worth noting that one such user generates data at about 2.5% of the rate of a single phone call. This relative efficiency is one of the characteristics of data transfers over the Internet.
  • 6
    • 0002733005 scopus 로고
    • Self-similarity through high-variability: Statistica analysis of ethernet LAN traffic at the source level
    • Willinger, W, Murad, M, Sherman, R and Wilson, D 'Self-similarity through high-variability: statistica analysis of ethernet LAN traffic at the source level' Proceedings of ACM SigComm 1995 25 (4) 101-113
    • (1995) Proceedings of ACM SigComm , vol.25 , Issue.4 , pp. 101-113
    • Willinger, W.1    Murad, M.2    Sherman, R.3    Wilson, D.4
  • 7
    • 0042260400 scopus 로고    scopus 로고
    • note
    • This adaptivity is also what allows TCP to transfer data over links of widely varying speeds, from dialup modems to 100 mb/s LANs and beyond. The current record for a long-distance TCP transfer is over 500 mb/s.
  • 8
    • 0042761551 scopus 로고    scopus 로고
    • note
    • The Frame Relay service is defined in this way. The subscriber to a Frame Relay network must purchase a Permanent Virtual Circuit (PVC) between each source and destination for which a direct connection is desired. For each PVC, it is possible to specify a Committed Information Rate (CIR), which is the worst case rate that that PVC. Presumably, the provider must provision the network so that there are sufficient resources to support all the CIRs of all the clients. However, capacity not being used can be shifted at each instant to other users, so that the best case peak rate can exceed the CIR. This makes the service more attractive.
  • 9
    • 0024889726 scopus 로고
    • Analysis and simulation of a fair queuing algorithm
    • Demers, A, Keshav, S, and Shenker, S 'Analysis and simulation of a fair queuing algorithm' Proceedings of ACM SigComm 1992 19 (4) 1-12; also Demers, A, Keshav, S, and Shenker, S Research and Experience Journal of Internetworking 1990 1 3-26
    • (1992) Proceedings of ACM SigComm , vol.19 , Issue.4 , pp. 1-12
    • Demers, A.1    Keshav, S.2    Shenker, S.3
  • 10
    • 0024889726 scopus 로고
    • Research and Experience
    • Demers, A, Keshav, S, and Shenker, S 'Analysis and simulation of a fair queuing algorithm' Proceedings of ACM SigComm 1992 19 (4) 1-12; also Demers, A, Keshav, S, and Shenker, S Research and Experience Journal of Internetworking 1990 1 3-26
    • (1990) Journal of Internetworking , vol.1 , pp. 3-26
    • Demers, A.1    Keshav, S.2    Shenker, S.3
  • 11
    • 0026980590 scopus 로고
    • Supporting real-time applications in an integrated services packet network: Architecture and mechanism
    • Clark, David D, Shenker, S, and Zhang, L 'Supporting real-time applications in an integrated services packet network: architecture and mechanism' Proceedings of ACM SigComm 1992 22 14-26
    • (1992) Proceedings of ACM SigComm , vol.22 , pp. 14-26
    • Clark, D.D.1    Shenker, S.2    Zhang, L.3
  • 12
    • 0003325412 scopus 로고    scopus 로고
    • Pricing the Internet
    • JFK School of Government, May 1993. Latest version available via
    • MacKie-Mason, J and Varian, H 'Pricing the Internet', presented at Public Access to the Internet, JFK School of Government, May 1993. Latest version available via ftp://ftp.econ.lsa.umich.edu/pub/Papers/ Pricing_the_Internet.ps.Z.
    • Public Access to the Internet
    • MacKie-Mason, J.1    Varian, H.2
  • 13
    • 0042761554 scopus 로고    scopus 로고
    • note
    • There is another drawback to the smart market scheme, which is that it couples the service model and the price model in a very direct way, which reduces the flexibility that providers have in setting price for the service.
  • 15
    • 0042260402 scopus 로고    scopus 로고
    • note
    • If there is no congestion, then there is presumably no queue of packets, which means that there is not a set of packets of different priority in the queue to reorder. Thus, priority scheduling normally has an effect only during congestion.
  • 16
    • 0038078962 scopus 로고    scopus 로고
    • A model for cost allocation and pricing in the Internet
    • McKnight, L and Bailey, J (eds) University of Michigan Press (forthcoming). Available via
    • Clark, D 'A model for cost allocation and pricing in the Internet' in McKnight, L and Bailey, J (eds) Internet Economics Journal of Electronic Publishing, University of Michigan Press (forthcoming). Available via http://www.press.umich.edu:80/jep/
    • Internet Economics Journal of Electronic Publishing
    • Clark, D.1
  • 17
    • 0000472220 scopus 로고
    • Pricing the Internet
    • JFK School of Government, May Latest version available via
    • MacKie-Mason, J and Varian, H 'Pricing the Internet' presented at Public Access to the Internet, JFK School of Government, May 1993. Latest version available via ftp://ftp.econ.lsa.umich.edu/pub/Papers/ Pricing_the_Internet.ps.Z.
    • (1993) Public Access to the Internet
    • MacKie-Mason, J.1    Varian, H.2
  • 18
    • 0041759643 scopus 로고    scopus 로고
    • note
    • Of course, in the future, this whole payment pattern could be inverted. The long-distance providers could directly attract the individual subscribers, and then contract with the regional or local area providers to carry their traffic. This pattern now applies when businesses directly purchase long-distance telephone service from a provider, who then contracts with a CAP to connect the business to that provider.


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