The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Link-sharing and resource management models for packet networks
Abstract
Discusses the use of link-sharing mechanisms in packet networks and presents algorithms for hierarchical link-sharing. Hierarchical link-sharing allows multiple agencies, protocol families, or traffic types to share the bandwidth on a link in a controlled fashion. Link-sharing and real-time services both require resource management mechanisms at the gateway. Rather than requiring a gateway to implement separate mechanisms for link-sharing and real-time services, the approach in the paper is to view link-sharing and real-time service requirements as simultaneous, and in some respect complementary, constraints at a gateway that can be implemented with a unified set of mechanisms. While it is not possible to completely predict the requirements that might evolve in the Internet over the next decade, the authors argue that controlled link-sharing is an essential component that can provide gateways with the flexibility to accommodate emerging applications and network protocols.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290 · cited 1×
“For some classes, the gateway could use RED gateway mechanisms to monitor the average queue size and provide appropriate feedback to the sources [ FJ93 ].”
MethodSelf-citationCongestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Self-citationIntegrated Services in the Internet Architecture: an Overview
Braden, R., Clark, D., & Shenker, S. (1994) · doi:10.17487/rfc1633 · Cited by 3,145
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,614
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Self-citationAnalysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · Symposium proceedings on Communications architectures & protocols · doi:10.1145/75246.75248 · Cited by 1,729
Analysis, modeling and generation of self-similar VBR video traffic
Garrett, M. W., & Willinger, W. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190339 · Cited by 976
Clark, D. D., Shenker, S., & Zhang, L. (1992) · Conference proceedings on Communications architectures & protocols - SIGCOMM '92 · doi:10.1145/144179.144199 · Cited by 851
Recursive Estimation and Time-Series Analysis: An Introduction for the Student and Practitioner
Young, P. C. (2011) · Springer eBooks · doi:10.1007/978-3-642-21981-8 · Cited by 796
Recursive Estimation and Time-Series Analysis
Young, P. (1984) · Springer eBooks · doi:10.1007/978-3-642-82336-7 · Cited by 678
Cited by
Promoting the use of end-to-end congestion control in the Internet
Floyd, S., & Fall, K. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793002 · Cited by 1,646
Self-citationQuality-of-service routing for supporting multimedia applications
Wang, Z., & Crowcroft, J. (1996) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.536364 · Cited by 1,626
Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers
Nichols, K., Blake, S., Baker, F., & Black, D. (1998) · doi:10.17487/rfc2474 · Cited by 1,530
Efficient fair queuing using deficit round-robin
Shreedhar, M., & Varghese, G. (1996) · IEEE/ACM Transactions on Networking · doi:10.1109/90.502236 · Cited by 1,399
Delay scheduling: a simple technique for achieving locality and fairness in cluster scheduling
Zaharia, M., Borthakur, D., Sen Sarma, J., Elmeleegy, K., Shenker, S., & Stoica, I. (2010) · Proceedings of the 5th European conference on Computer systems · doi:10.1145/1755913.1755940 · Cited by 1,393
Recommendations on Queue Management and Congestion Avoidance in the Internet
Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., et al. (1998) · doi:10.17487/rfc2309 · Cited by 1,318
Self-citationReceiver-driven layered multicast
McCanne, S., Jacobson, V., & Vetterli, M. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248168 · Cited by 1,195
Self-citationFundamental design issues for the future Internet
Shenker, S. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.414637 · Cited by 1,097
TCP and explicit congestion notification
Floyd, S. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205512 · Cited by 1,016
Self-citationSurvey of network-based defense mechanisms countering the DoS and DDoS problems
Peng, T., Leckie, C., & Ramamohanarao, K. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216373 · Cited by 759
Controlling high bandwidth aggregates in the network
Mahajan, R., Bellovin, S. M., Floyd, S., Ioannidis, J., Paxson, V., & Shenker, S. (2002) · ACM SIGCOMM Computer Communication Review · doi:10.1145/571697.571724 · Cited by 742
Self-citationSpecification of the Controlled-Load Network Element Service
Wroclawski, J. (1997) · doi:10.17487/rfc2211 · Cited by 656
Building efficient wireless sensor networks with low-level naming
Heidemann, J., Silva, F., Intanagonwiwat, C., Govindan, R., Estrin, D., & Ganesan, D. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502049 · Cited by 598
Distributed denial of service attacks
Lau, F., Rubin, S. H., Smith, M. H., & Trajkovic, L. (2002) · SMC 2000 Conference Proceedings. 2000 IEEE International Conference on Systems, Man and Cybernetics. 'Cybernetics Evolving to Systems, Humans, Organizations, and their Complex Interactions' (Cat. No.00CH37166) · doi:10.1109/icsmc.2000.886455 · Cited by 582
The BLUE active queue management algorithms
Feng, W.-C., Shin, K. G., Kandlur, D. D., & Saha, D. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.801399 · Cited by 576
“Flows which are identified as being nonresponsive are then rate-limited using a mechanism such as class-based queueing [15].”
MethodImplementing Pushback: Router-Based Defense Against DDoS Attacks
Ioannidis, J., & Bellovin, S. M. (2002) · doi:10.7916/d8r78mxv · Cited by 543
Efficient fair queueing using deficit round robin
Shreedhar, M., & Varghese, G. (1995) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/217382.217453 · Cited by 542
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Goyal, P., Vin, H. M., & Chen, H. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248171 · Cited by 442
Hierarchical packet fair queueing algorithms
Bennett, J. C. R., & Zhang, H. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649568 · Cited by 422
CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation
Pan, R., Prabhakar, B., & Psounis, K. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832269 · Cited by 416
A parameterizable methodology for Internet traffic flow profiling
Claffy, K. C., Braun, H.-W., & Polyzos, G. C. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.464717 · Cited by 330
NVS: A Substrate for Virtualizing Wireless Resources in Cellular Networks
Kokku, R., Mahindra, R., Zhang, H., & Rangarajan, S. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2179063 · Cited by 329
Proportional differentiated services: delay differentiation and packet scheduling
Dovrolis, C., Stiliadis, D., & Ramanathan, P. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316211 · Cited by 265
Stochastic fair blue: a queue management algorithm for enforcing fairness
Feng, W.-C., Kandlur, D. D., Saha, D., & Shin, K. G. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916648 · Cited by 260
Metadata
- Authors
- Floyd, S., & Jacobson, V.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1995
- Volume
- 3
- Issue
- 4
- Pages
- 365-386
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2098375698
- Cited by
- 977
- References
- 16
- FWCI
- 44.01
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.