Waters, A. Gill (2000) Hierarchies for Network Evolution. In: 16th UK Teletraffic Symposium on Management of Quality of Service - the New Challenge. . 5/1-5/6. IEE (KAR id:22019)
PDF
Language: English |
|
Download this file (PDF/82kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Postscript
Language: English |
|
Download this file (Postscript/376kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader |
Abstract
The success of the Internet is due to best-efforts delivery which allows for easy expansion, coupled with a congestion-adaptive reliable transport protocol (TCP), which serves well for the delay-insensitive traffic of Web browsing or file transfer. There are several new proposals for handling Quality of Service (QoS) for real-time and multimedia traffic, but their introduction is slow. The scale of the Internet is one of the impediments to successful QoS provision. Hierarchical structure is the key to scaling problems, but it must be provided in a way that helps evolution too. This paper reports work in progress on techniques for organising hierarchies using clustering, which could be applied to clouds of QoS capable routers or to support multicast applications.
Item Type: | Conference or workshop item (Paper) |
---|---|
Uncontrolled keywords: | hierarchy scaling Quality of Service multicast clustering |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Funders: | Institute of Electrical and Electronics Engineers (https://ror.org/01n002310) |
Depositing User: | Mark Wheadon |
Date Deposited: | 04 Sep 2009 15:20 UTC |
Last Modified: | 05 Nov 2024 10:00 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/22019 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):