2009 17th International Workshop on Quality of Service最新文献_第3页

Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos 具有可扩展视频的点对点流媒体系统中种子服务器的有效分配

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201417

Kianoosh Mokhtarian, M. Hefeeda

引用次数: 10

Fast rerouting for IP multicast in managed IPTV networks 管理IPTV网络中IP多播的快速重路由

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201406

Ralf Lübben, Guangzhi Li, Dongmei Wang, R. Doverspike, Xiaoming Fu

引用次数: 11

Integrated control of matching delay and CPU utilization in information dissemination systems 信息传播系统中匹配延迟与CPU利用率的综合控制

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201402

Ming Chen, Xiaorui Wang, Ben Taylor

引用次数: 6

Optimal multi-path routing and bandwidth allocation under utility max-min fairness 效用最大最小公平性下的最优多路径路由和带宽分配

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201396

J. Chou, Bill Lin

{"title":"Optimal multi-path routing and bandwidth allocation under utility max-min fairness","authors":"J. Chou, Bill Lin","doi":"10.1109/IWQoS.2009.5201396","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201396","url":null,"abstract":"An important goal of bandwidth allocation is to maximize the utilization of network resources while sharing the resources in a fair manner among network flows. To strike a balance between fairness and throughput, a widely studied criterion in the network community is the notion of max-min fairness. However, the majority of work on max-min fairness has been limited to the case where the routing of flows has already been defined and this routing is usually based on a single fixed routing path for each flow. In this paper, we consider the more general problem in which the routing of flows, possibly over multiple paths per flow, is an optimization parameter in the bandwidth allocation problem. Our goal is to determine a routing assignment for each flow so that the bandwidth allocation achieves optimal utility max-min fairness with respect to all feasible routings of flows. We present evaluations of our proposed multi-path utility max-min fair allocation algorithms on a statistical traffic engineering application to show that significantly higher minimum utility can be achieved when multi-path routing is considered simultaneously with bandwidth allocation under utility max-min fairness, and this higher minimum utility corresponds to significant application performance improvements.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128430228","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}

引用次数: 25

Tree-structured data regeneration with network coding in distributed storage systems 分布式存储系统中基于网络编码的树状结构数据再生

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201391

Jun Li, Shuang Yang, Xin Wang, X. Xue, Baochun Li

{"title":"Tree-structured data regeneration with network coding in distributed storage systems","authors":"Jun Li, Shuang Yang, Xin Wang, X. Xue, Baochun Li","doi":"10.1109/IWQoS.2009.5201391","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201391","url":null,"abstract":"Distributed storage systems, built on peer-to-peer networks, can provide large-scale data storage and high data reliability by redundant schemes, such as replica, erasure codes and linear network coding. Redundant data may get lost due to the instability of distributed systems, such as permanent node departures, hardware failures, and accidental deletions. In order to maintain data availability, it is necessary to regenerate new redundant data in another node, referred to as a newcomer. Regeneration is expected to be finished as soon as possible, because the regeneration time can influence the data reliability and availability of distributed storage systems. It has been acknowledged that linear network coding can regenerate redundant data with less network traffic than replica and erasure codes. However, previous regeneration schemes are all star-structured regeneration schemes, in which data are transferred directly from existing storage nodes, referred to as providers, to the newcomer, so the regeneration time is always limited by the path with the narrowest bandwidth between newcomer and provider, due to bandwidth heterogeneity. In this paper, we exploit the bandwidth between providers and propose a tree-structured regeneration scheme using linear network coding. In our scheme, data can be transferred from providers to the newcomer through a regeneration tree, defined as a spanning tree covering the newcomer and all the providers. In a regeneration tree, a provider can receive data from other providers, then encode the received data with the data this provider stores, and finally send the encoded data to another provider or to the newcomer. We prove that a maximum spanning tree is an optimal regeneration tree and analyze its performance. In a trace-based simulation, the results show the tree-structured scheme can reduce the regeneration time by 75%–82% and improve data availability by 73%–124%.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126999203","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}

引用次数: 36

End-wise admission control delegation for effective end-to-end quality of service 为有效的端到端服务质量而进行的端到端准入控制委托

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201418

Yingxin Jiang, A. Striegel

引用次数: 0

Admission control for roadside unit access in Intelligent Transportation Systems 智能交通系统中路边单元的准入控制

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201409

Bo Yu, Chengzhong Xu

{"title":"Admission control for roadside unit access in Intelligent Transportation Systems","authors":"Bo Yu, Chengzhong Xu","doi":"10.1109/IWQoS.2009.5201409","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201409","url":null,"abstract":"Roadside units can provide a variety of potential services for passing-by vehicles in future Intelligent Transportation Systems. Since each vehicle has a limited time period when passing by a roadside unit, it is important to predict whether a service can be finished in time. In this paper, we focus on admission control problems, which are important especially when a roadside unit is in or close to overloaded conditions. Traditional admission control schemes mainly concern long-term flows, such as VOIP and multimedia service. They are not applicable to highly mobile vehicular environments. Our analysis finds that it is not necessarily accurate to use deadline to evaluate the risk whether a flow can be finished in time. Instead, we introduce a potential metric to more accurately predict the total data size that can be transmitted to/from a vehicle. Based on this new concept, we formulate the admission control task as a linear programming problem and then propose a lexicographically maxmin algorithm to solve the problem. Simulation results demonstrate that our scheme can efficiently make admission decisions for coming transmission requests and effectively avoid system overload.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115967644","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}

引用次数: 13

Rate and delay controlled core networks: An experimental demonstration 速率与延迟控制核心网:实验演示

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201400

Z. Rosberg, F. Sabrina, S. Dealy, John Matthews, Craig Russell

{"title":"Rate and delay controlled core networks: An experimental demonstration","authors":"Z. Rosberg, F. Sabrina, S. Dealy, John Matthews, Craig Russell","doi":"10.1109/IWQoS.2009.5201400","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201400","url":null,"abstract":"Growing demand for streaming, voice and interactive gaming applications emphasize the importance of quality of service (QoS) provisioning in the Internet, particularly the need for maximum end-to-end delay guarantee. Current methods of QoS provisioning have either scalability concerns or cannot guarantee end-to-end delay with acceptable packet loss unless bandwidth is over-provisioned. While low jitter guarantee is required for streaming applications, maximum end-to-end delay is also required for VoIP and interactive games. We propose, analyze the stability and demonstrate the viability of three combined rate and end-to-end delay controls. The stability analysis is done on a fluid network model with greedy flows showing that all controls are globally asymptotically stable without information time lags and one of them is also globally asymptotically stable with arbitrary time lags; however it substantivally under-utilizes the network. Another control, which numerically demonstrates stability with arbitrary time lags, is implemented in edge and core routers of our WAN-in-Lab with long haul links. The prototype implementation confirms its viability and its advantage over the Differentiated Service architecture. The viability of the two other controls is shown by detailed NS2 packet-based simulations of an eight-node real core network.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116482496","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}

引用次数: 7

Passive access capacity estimation for QoS measurement 用于QoS测量的被动接入容量估计

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201383

Martino Fornasa, M. Maresca, P. Baglietto, N. Zingirian

引用次数: 2

A calculus for information-driven networks 信息驱动网络的微积分

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201386

Kui Wu, Yuming Jiang, G. Hu

{"title":"A calculus for information-driven networks","authors":"Kui Wu, Yuming Jiang, G. Hu","doi":"10.1109/IWQoS.2009.5201386","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201386","url":null,"abstract":"Information-driven networks include a large category of networking systems, where network nodes are aware of information delivered and thus can not only forward data packets but may also perform information processing. In many situations, the quality of service (QoS) in information-driven networks is provisioned with the redundancy in information. Traditional performance models generally adopt evaluation measures suitable for packet-oriented service guarantee, such as packet delay, throughput, and packet loss rate. These performance measures, however, do not align well with the actual need of information-driven networks. New performance measures and models for information-driven networks, despite their importance, have been mainly blank, largely because information processing is clearly application dependent and cannot be easily captured within a generic framework. To fill the vacancy, we develop a new performance evaluation framework particularly tailored for information-driven networks, based on the recent development of stochastic network calculus. Particularly, our model captures the information processing and the QoS guarantee with respect to stochastic information delivery rates, which have never been formally modeled before. This analytical model is very useful in deriving theoretical performance bounds for a large body of systems where QoS is stochastically guaranteed with a certain level of information delivery.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127161197","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}

引用次数: 12