Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.最新文献

Delay bound Guarantees with WFQ-based CBQ discipline 基于wfq的CBQ约束的延迟约束保证

Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004. Pub Date : 2004-06-09 DOI: 10.1109/IWQOS.2004.1309364

A. Millet, Z. Mammeri

引用次数: 7

On quality-of-service and energy consumption tradeoffs in FEC-encoded audio streaming fec编码音频流的服务质量和能耗权衡

Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004. Pub Date : 2004-06-07 DOI: 10.1109/IWQOS.2004.1309376

Zhinan Zhou, P. McKinley, S. M. Sadjadi

引用次数: 22

Towards content distribution networks with latency guarantees 面向具有延迟保证的内容分发网络

Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004. Pub Date : 2004-06-07 DOI: 10.1109/IWQOS.2004.1309378

Chengdu Huang, T. Abdelzaher

引用次数: 18

Robust communications for sensor networks in hostile environments 敌对环境下传感器网络的鲁棒通信

Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004. Pub Date : 2004-06-07 DOI: 10.1109/IWQOS.2004.1309350

O. Younis, S. Fahmy, P. Santi

{"title":"Robust communications for sensor networks in hostile environments","authors":"O. Younis, S. Fahmy, P. Santi","doi":"10.1109/IWQOS.2004.1309350","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309350","url":null,"abstract":"Clustering sensor nodes increases the scalability and energy efficiency of communications among them. In hostile environments, unexpected failures or attacks on cluster heads (through which communication takes place) may partition the network or degrade application performance. In this work, we propose a new approach, REED (Robust Energy Efficient Distributed clustering), for clustering sensors deployed in hostile environments. Our primary objective is to construct a k (i.e., k-connected) network, where k is a constant determined by the application. Fault tolerance can be achieved by selecting k independent sets of cluster heads (i.e., cluster head overlays) on top of the physical network, so that each node can quickly switch to other cluster heads in case of failures or attacks on its current cluster head. The independent cluster head overlays also provide multiple vertex-disjoint routing paths for load balancing and security. Network lifetime is prolonged by selecting cluster heads with high residual energy and low communication cost, and periodically reclustering the network in order to distribute energy consumption among sensor nodes. We prove that REED can asymptotically achieve k tolerance if certain constraints on node density are satisfied. We also investigate via simulations the clustering properties of REED, and show that building multiple cluster head overlays does not consume significant energy.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123995072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 46

Small world overlay P2P networks 小世界覆盖P2P网络

Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004. Pub Date : 2004-06-07 DOI: 10.1109/IWQOS.2004.1309383

K. Y. Hui, John C.S. Lui, David K. Y. Yau

{"title":"Small world overlay P2P networks","authors":"K. Y. Hui, John C.S. Lui, David K. Y. Yau","doi":"10.1109/IWQOS.2004.1309383","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309383","url":null,"abstract":"This paper considers the problem of how to construct and maintain an overlay structured P2P network based on the small world paradigm. Two main attractive properties of a small world network are (1) low average hop distance between any two randomly chosen nodes, and (2) high clustering coefficient of nodes. Having a low average hop distance implies a low latency for object lookup, while having a high clustering coefficient implies the underlying network can effectively provide object lookup even under heavy demands (for example, in a flash crowd scenario). We present a small world overlay protocol (SWOP) for constructing a small world overlay P2P network. We compare the performance of our system with that of other structured P2P networks such as Chord. We show that the SWOP protocol can achieve improved object lookup performance over the existing protocols. We also exploit the high clustering coefficient of a SWOP network to design an object replication algorithm that can effectively handle heavy object lookup traffic. As a result, a SWOP network can quickly and efficiently deliver popular and dynamic objects to a large number of requesting nodes. To the best of our knowledge, ours is the first piece of work that addresses how to handle dynamic flash crowds in a structured P2P network environment.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124842560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 62

Client-centered energy and delay analysis for TCP downloads TCP下载的以客户端为中心的能量和延迟分析

Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004. Pub Date : 2004-06-07 DOI: 10.1109/IWQOS.2004.1309391

H. Yan, Rupa Krishnan, S. Watterson, D. Lowenthal, Kang Li, L. Peterson

{"title":"Client-centered energy and delay analysis for TCP downloads","authors":"H. Yan, Rupa Krishnan, S. Watterson, D. Lowenthal, Kang Li, L. Peterson","doi":"10.1109/IWQOS.2004.1309391","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309391","url":null,"abstract":"In mobile devices, the wireless network interface card (WNIC) consumes a significant portion of overall system energy. One way to reduce energy consumed by a mobile device is to transition its WNIC to a lower-power sleep mode when data is not being received or transmitted. This paper investigates client-centered techniques for trading download time for energy savings during TCP downloads, in an attempt to reduce the energy' delay product. Effectively saving WNIC energy during a TCP download is difficult because TCP streams tend to be smooth, leaving little potential sleep time. The basic idea behind our technique is that the client increases the amount of time that can be spent in sleep mode by shaping the traffic. In particular, the client convinces the server to send data in predictable bursts, trading lower WNIC energy cost for increased transmission time. Our technique does not rely on any assistance from the server, a proxy, or IEEE 802.11b power-saving mode. Results show that in Internet experiments our scheme outperforms baseline TCP by 64% in the best case, with an average improvement of 19%.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133279746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 24

Single-service quality differentiation 单一服务质量差异化

Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004. Pub Date : 2004-06-07 DOI: 10.1109/IWQOS.2004.1309392

G. Karlsson, H. Lundqvist, Ignacio Más Ivars

引用次数: 6

Coordinated aggregate scheduling for improving end-to-end delay performance 提高端到端延迟性能的协同聚合调度

Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004. Pub Date : 2004-06-07 DOI: 10.1109/IWQOS.2004.1309361

Wei Sun, K. Shin

引用次数: 12

Network calculus meets queueing theory -a simulation based approach to bounded queues 网络演算符合排队理论——一种基于仿真的有界队列研究方法

Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004. Pub Date : 2004-06-07 DOI: 10.1109/IWQOS.2004.1309365

K. Pandit, J. Schmitt, R. Steinmetz

引用次数: 20

Maxmin overlay multicast: rate allocation and tree construction Maxmin覆盖组播:速率分配和树结构

Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004. Pub Date : 2004-06-07 DOI: 10.1109/IWQOS.2004.1309385

Yi Cui, Yuan Xue, K. Nahrstedt

{"title":"Maxmin overlay multicast: rate allocation and tree construction","authors":"Yi Cui, Yuan Xue, K. Nahrstedt","doi":"10.1109/IWQOS.2004.1309385","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309385","url":null,"abstract":"Although initially proposed as the deployable alternative to IP multicast, overlay multicast actually offers us great flexibilities on QoS-aware resource allocation for network applications. For example, in overlay multicast streaming, (1) the streaming rate of each client can be diversified to better accommodate network heterogeneity, through various end-to-end streaming adaptation techniques; and (2) one can freely organize the overlay session by rearranging the multicast tree, for the purpose of better resource utilization and fairness among all clients. The goal of this paper, is to find the max-min rate allocation in overlay multicast, which is pareto-optimal in terms of network resource utilization, and max-min fair. We approach this goal in two steps. First, we present a distributed algorithm, which is able to return the max-min rate allocation for any given overlay multicast tree. Second, we study the problem of finding the optimal tree, whose max-min rate allocation is optimal among all trees. After proving its NP-hardness, we propose a heuristic algorithm of overlay multicast tree construction. A variation of the heuristic is also designed to handle the dynamic client join/departure. Both of them have approximation bound of 1/2 to the optimal value. Experimental results show that they achieve high average throughput, almost saturate link utilization, and consistent min-favorability.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126914637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 45