Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10840Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Anastasiadis, S. V. | en |
| dc.contributor.author | Varman, P. | en |
| dc.contributor.author | Vitter, J. S. | en |
| dc.contributor.author | Yi, K. | en |
| dc.date.accessioned | 2015-11-24T17:00:56Z | - |
| dc.date.available | 2015-11-24T17:00:56Z | - |
| dc.identifier.issn | 0018-9340 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10840 | - |
| dc.rights | Default Licence | - |
| dc.subject | data smoothing | en |
| dc.subject | streaming | en |
| dc.subject | prefetching | en |
| dc.subject | energy efficiency | en |
| dc.subject | content distribution networks | en |
| dc.subject | client/server systems | en |
| dc.subject | optimization | en |
| dc.subject | vbr video | en |
| dc.subject | networks | en |
| dc.title | Optimal lexicographic shaping of aggregate streaming data | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2005 | - |
| heal.abstract | We investigate the problem of smoothing multiplexed network traffic when either a streaming server transmits data to multiple clients or a storage server accesses data from multiple storage devices or other servers. We introduce efficient algorithms for lexicographically optimally smoothing the aggregate bandwidth requirements over a shared network link. Possible applications include improvement in the bandwidth utilization of network links and reduction in the energy consumption of server hosts. In the data transmission problem, we consider the case in which the clients have different buffer capacities and unlimited bandwidth constraints or unlimited buffer capacities and different bandwidth constraints. For the data access problem, we handle the general case of a shared buffer capacity and individual network bandwidth constraints. Previous approaches for the data access problem handled either the case of only a single stream or did not compute the lexicographically optimal schedule. By provably minimizing the variance of the required aggregate bandwidth, lexicographically optimal smoothing makes the maximum resource requirements within the network more predictable and increases the useful resource utilization. It also improves fairness in sharing a network link among multiple users and makes new requests from future clients more likely to be successfully admitted without the need for rescheduling previously accepted traffic. With appropriate hardware and system support, data traffic smoothing can also reduce the energy consumption of the host processor and the communication links. Overall, we expect that efficient resource management at the network edges will better meet quality of service requirements without restricting the scalability of the system. | en |
| heal.journalName | IEEE Transactions on Computers | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Anastasiadis-2005-Optimal lexicographic shaping of aggregate streaming data.pdf | 828.96 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
