The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
QRON: QoS-Aware Routing in Overlay Networks
Abstract
Recently, many overlay applications have emerged in the Internet. Currently, each of these applications requires their proprietary functionality support. A general unified framework may be a desirable alternative to application-specific overlays. We introduce the concept of overlay brokers (OBs). We assume that each autonomous system in the Internet has one or more OBs. These OBs cooperate with each other to form an overlay service network (OSN) and provide overlay service support for overlay applications, such as resource allocation and negotiation, overlay routing, topology discovery, and other functionalities. The scope of our effort is the support of quality-of-service (QoS) in overlay networks. Our primary focus is on the design of QoS-aware routing protocols for overlay networks (QRONs). The goal of QRON is to find a QoS-satisfied overlay path, while trying to balance the overlay traffic among the OBs and the overlay links in the OSN. A subset of OBs, connected by the overlay paths, can form an application specific overlay network for an overlay application. The proposed QRON algorithm adopts a hierarchical methodology that enhances its scalability. We analyze two different types of path selection algorithms. We have simulated the protocols based on the transit-stub topologies produced by GT-ITM. Simulation results show that the proposed algorithms perform well in providing a QoS-aware overlay routing service.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
A case for end system multicast
Chu, Y.-H., Rao, S. G., Seshan, S., & Zhang, H. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803066 · Cited by 2,202
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · ACM SIGCOMM Computer Communication Review · doi:10.1145/964723.383071 · Cited by 1,923
Andersen, D., Balakrishnan, H., Kaashoek, F., & Morris, R. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502048 · Cited by 1,868
A case for end system multicast (keynote address)
Chu, Y.-H., Rao, S., & Zhang, H. (2000) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/339331.339337 · Cited by 956
End-to-end Internet packet dynamics
Paxson, V. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.779192 · Cited by 908
Chen, S., & Nahrstedt, K. (1998) · IEEE Network · doi:10.1109/65.752646 · Cited by 874
Zhuang, S. Q., Zhao, B. Y., Joseph, A. D., Katz, R. H., & Kubiatowicz, J. D. (2001) · International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV) · doi:10.1145/378344.378347 · Cited by 722
On the constancy of internet path properties
Zhang, Y., & Duffield, N. (2001) · Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement - IMW '01 · doi:10.1145/505202.505228 · Cited by 466
Host multicast: a framework for delivering multicast to end users
Zhang, B., Jamin, S., & Zhang, L. (2003) · Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) · doi:10.1109/infcom.2002.1019387 · Cited by 421
On the use and performance of content distribution networks
Krishnamurthy, B., Wills, C., & Zhang, Y. (2001) · Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement - IMW '01 · doi:10.1145/505202.505224 · Cited by 305
Cited by
Szymanski, T. H. (2022) · IEEE Access · doi:10.1109/access.2022.3169137 · Cited by 59
Metadata
- Authors
- Li, Z., & Mohapatra, P.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2004-01
- Volume
- 22
- Issue
- 1
- Pages
- 29-40
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2104517640
- Cited by
- 286
- References
- 11
- FWCI
- 38.10
- 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.