2010 IEEE 18th International Workshop on Quality of Service (IWQoS)最新文献

Intelligent price-based congestion control for communication networks 基于价格的通信网络智能拥塞控制

2010 IEEE 18th International Workshop on Quality of Service (IWQoS) Pub Date : 2010-06-16 DOI: 10.1109/IWQoS.2010.5542720

Hao Wang, Z. Tian

引用次数: 17

On the complexity of maximizing the minimum Shannon capacity in Wireless Networks by joint channel assignment and power allocation 联合信道分配和功率分配最大化无线网络最小香农容量的复杂性研究

2010 IEEE 18th International Workshop on Quality of Service (IWQoS) Pub Date : 2010-06-16 DOI: 10.1109/IWQoS.2010.5542766

M. Fallgren

引用次数: 14

SureCall: Towards glitch-free real-time audio/video conferencing SureCall:走向无故障的实时音频/视频会议

2010 IEEE 18th International Workshop on Quality of Service (IWQoS) Pub Date : 2010-06-16 DOI: 10.1109/IWQoS.2010.5542727

Amit Mondal, Ross Cutler, Cheng Huang, Jin Li, A. Kuzmanovic

{"title":"SureCall: Towards glitch-free real-time audio/video conferencing","authors":"Amit Mondal, Ross Cutler, Cheng Huang, Jin Li, A. Kuzmanovic","doi":"10.1109/IWQoS.2010.5542727","DOIUrl":"https://doi.org/10.1109/IWQoS.2010.5542727","url":null,"abstract":"Global enterprises are increasingly adopting unified communication solutions over traditional telephone systems. Such solutions provide integrated audio/video conferencing and messaging services, and enable flexible working environments by allowing mobile and dispersed users to communicate and collaborate easily and efficiently. The ultimate goal of unified communications is to ensure a smooth and best possible user experience across all scenarios. To address this challenge and understand the impact of various network scenarios on unified audio/video conferencing, we have developed a distributed experimental platform – SureCall – and deployed it on over 80 machines across a global enterprise and many residential networks. SureCall has collected worth of more than 6 months of packet-level audio/video conferencing traces. Through in-depth analysis of these traces, we have quantitatively compared how key performance metrics, such as packet loss and jitter, as well as the correlation between them, are affected by the enterprise and residential networks, by WiFi connections and VPN links, etc. In addition, we show how SureCall can serve as an ideal platform to design, experiment and validate new schemes and algorithms. We have developed a new audio quality classifier using the SureCall platform, which is being experimented with the recent release of Office Communicator solution for large-scale validation.","PeriodicalId":300479,"journal":{"name":"2010 IEEE 18th International Workshop on Quality of Service (IWQoS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130159882","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}

引用次数: 2

QoS-revenue tradeoff with time-constrained ISP pricing qos收入与时间限制的ISP定价之间的权衡

2010 IEEE 18th International Workshop on Quality of Service (IWQoS) Pub Date : 2010-06-16 DOI: 10.1109/IWQoS.2010.5542744

Yuan Wu, P. Hande, Hongseok Kim, M. Chiang, D. Tsang

{"title":"QoS-revenue tradeoff with time-constrained ISP pricing","authors":"Yuan Wu, P. Hande, Hongseok Kim, M. Chiang, D. Tsang","doi":"10.1109/IWQoS.2010.5542744","DOIUrl":"https://doi.org/10.1109/IWQoS.2010.5542744","url":null,"abstract":"Usage-based pricing has been recognized as a network congestion management tool. Internet Service Providers (ISPs), however, have limited ability to set time-adaptive usage-price to manage congestion arising from time-varying consumer utility for data. To achieve the maximum revenue, ISP can set its time-invariant usage-price low enough to aggressively encourage consumer's traffic demand. The downside is that ISP has to drop consumer's excessive traffic demand through congestion management (i.e., packet dropping), which may degrade Quality of Service (QoS) of consumer's traffic. Alternatively, to protect consumer's QoS, ISP can set its time-invariant usage-price high enough to reduce consumer's traffic demand, thus minimizing the need for congestion management through packet dropping. The downside is that ISP suffers a revenue loss due to the inefficient usage of its network. The tradeoff between ISP's revenue maximization and consumer's QoS protection motivates us to study ISP's revenue maximization subject to QoS constraint in terms of the number of packets dropped. We investigate two different QoS measures: short-term per-slot packet dropping constraint and long-term packet dropping constraint. The short-term constraint can be interpreted as a more transparent congestion management practice compared to the long-term constraint. We analyze ISP's optimal time-invariant pricing for both constraints, and develop an upper bound for the optimal revenue by considering the specified packet dropping threshold. We quantify the impact of consumer's price elasticity on ISP's optimal revenue and show that ISP should carry out a differentiated QoS protection strategy based on consumer's price elasticity in order to mitigate the revenue loss1.","PeriodicalId":300479,"journal":{"name":"2010 IEEE 18th International Workshop on Quality of Service (IWQoS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133833477","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}

引用次数: 18

Characterizing tight-link bandwidth of multi-hop paths using probing response curves 用探测响应曲线表征多跳路径的紧密链路带宽

2010 IEEE 18th International Workshop on Quality of Service (IWQoS) Pub Date : 2010-06-16 DOI: 10.1109/IWQoS.2010.5542739

Seong-ryong Kang, D. Loguinov

{"title":"Characterizing tight-link bandwidth of multi-hop paths using probing response curves","authors":"Seong-ryong Kang, D. Loguinov","doi":"10.1109/IWQoS.2010.5542739","DOIUrl":"https://doi.org/10.1109/IWQoS.2010.5542739","url":null,"abstract":"Bandwidth estimation plays an important role in characterizing Internet paths. Existing approaches can be classified into measurement tools [3], [6], [9], [10], [16], [17], [23], [29], which usually have extensive simulations, but no convergence analysis for general cross-traffic, and theoretical models [5], [14], [19], [20], [22], which usually have provable convergence, but no practical implementation. Another issue in related work is the unknown performance of certain proposed algorithms in real networks where delay measurements are not perfect due to various OS and hardware-related timing irregularities [26]. We address the former issue by developing a measurement tool PRC-MT that not only achieves asymptotic accuracy in multi-path networks with arbitrary cross-traffic, but also simultaneously measures the capacity and available bandwidth of the tight link. We address the latter issue by performing a comparison study of existing tools in Emulab and assessing their susceptibility to timing irregularities of end-hosts. Our results show that PRC-MT outperforms all existing tools in terms of accuracy, achieves similar convergence delay, and does not require any manual configuration. We also find that interrupt moderation may cause existing tools (such as Pathload [10], Pathchirp [27], and CapProbe [16]) to become quite inaccurate in certain network configurations and exhibit behavior completely different from that in ns2 [28].","PeriodicalId":300479,"journal":{"name":"2010 IEEE 18th International Workshop on Quality of Service (IWQoS)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132423359","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}

引用次数: 6

Fish a lake: Fast release/capture sampling in large-scale sensor networks 湖面上的鱼:大规模传感器网络中的快速释放/捕获采样

2010 IEEE 18th International Workshop on Quality of Service (IWQoS) Pub Date : 2010-06-16 DOI: 10.1109/IWQoS.2010.5542756

Shaoliang Peng, G. Xing, Shanshan Li, W. Jia, Yuxing Peng

{"title":"Fish a lake: Fast release/capture sampling in large-scale sensor networks","authors":"Shaoliang Peng, G. Xing, Shanshan Li, W. Jia, Yuxing Peng","doi":"10.1109/IWQoS.2010.5542756","DOIUrl":"https://doi.org/10.1109/IWQoS.2010.5542756","url":null,"abstract":"Efficient estimation of global information is a common requirement for many wireless sensor network applications. Examples include counting the number of nodes alive in the network and measuring the scale of physically correlated events. These tasks must be accomplished at extremely low overhead due to the severe resource limitation of sensor nodes, which poses a challenge for large-scale sensor networks. In this paper, we develop a novel protocol called FLAKE that can efficiently and accurately estimate the global information of large-scale sensor networks based on the sparse sampling theory. Specially, FLAKE disseminates a small number of messages called seeds to the network and issues a query about which nodes receive a seed. The number of nodes that have the information of interest can be estimated by counting the seeds disseminated, the nodes queried, and the nodes that receive a seed. FLAKE can be easily implemented in a distributed manner due to its simplicity. Moreover, desirable trade-offs can be achieved between the accuracy of estimation and the system overhead. Our simulations show that FLAKE significantly outperforms several existing schemes on accuracy, delay and message overhead.","PeriodicalId":300479,"journal":{"name":"2010 IEEE 18th International Workshop on Quality of Service (IWQoS)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121203780","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}

引用次数: 1

A smart RFID system 智能RFID系统

2010 IEEE 18th International Workshop on Quality of Service (IWQoS) Pub Date : 2010-06-16 DOI: 10.1109/IWQoS.2010.5542717

Min Chen, Runhe Huang, Yan Zhang, H. Chao

引用次数: 4

BitTorrent under a microscope: Towards static QoS provision in dynamic peer-to-peer networks 显微镜下的BitTorrent:动态点对点网络中的静态QoS提供

2010 IEEE 18th International Workshop on Quality of Service (IWQoS) Pub Date : 2010-06-16 DOI: 10.1109/IWQoS.2010.5542741

T. Luan, Xuemin Shen, D. Tsang

{"title":"BitTorrent under a microscope: Towards static QoS provision in dynamic peer-to-peer networks","authors":"T. Luan, Xuemin Shen, D. Tsang","doi":"10.1109/IWQoS.2010.5542741","DOIUrl":"https://doi.org/10.1109/IWQoS.2010.5542741","url":null,"abstract":"For peer-to-peer (P2P) networks continually to flourish, QoS provision is critical. However, the P2P networks are notoriously dynamic and heterogeneous. As a result, QoS provision in P2P networks is a challenging task with nodes of the varying and intermittent throughput. This raises a fundamental problem: is stable and delicate QoS provision achievable in the highly dynamic and heterogeneous P2P networks? In this work, we investigate BitTorrent (BT) with the particular interest in its QoS performance in the highly dynamic and heterogeneous network. Our contributions are two-fold. First, we develop an analytical model to examine a randomly selected BT node under a microscope. Based on the model, we study the mean and variance of nodal download rate in the dynamic network and the performance of BT in QoS provision under different levels of peer churns. Our analysis unveils that although BT strives to provide nodes with guaranteed throughput, due to the network dynamics, the download rates of the peers oscillate extraordinarily and can hardly converge to the target QoS as proposed in previous literature. Second, to improve the QoS provision, we propose an enhanced protocol incorporating with BT. The proposed protocol enables nodes to quickly and elaborately search their uploaders, and as a result, achieve guaranteed and stable QoS in the dynamic networks. Using both analysis and simulations, we validate the effectiveness of the proposed protocol in comparisons with the original BT.","PeriodicalId":300479,"journal":{"name":"2010 IEEE 18th International Workshop on Quality of Service (IWQoS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134058656","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}

引用次数: 1

Research on uncertain weight of web service QoS criterions web服务QoS标准的不确定权重研究

2010 IEEE 18th International Workshop on Quality of Service (IWQoS) Pub Date : 2010-06-16 DOI: 10.1109/IWQoS.2010.5542707

Zhiqiang Fan, Li Zhang, Jufang Shen, Shouxin Wang, Xiang Qiu

引用次数: 0

Distributed tries for load balancing in peer-to-peer systems 分布式尝试在点对点系统中实现负载平衡

2010 IEEE 18th International Workshop on Quality of Service (IWQoS) Pub Date : 2010-06-16 DOI: 10.1109/IWQoS.2010.5542755

Gahyun Park, Minseok Kwon

{"title":"Distributed tries for load balancing in peer-to-peer systems","authors":"Gahyun Park, Minseok Kwon","doi":"10.1109/IWQoS.2010.5542755","DOIUrl":"https://doi.org/10.1109/IWQoS.2010.5542755","url":null,"abstract":"In structured peer-to-peer (p2p) systems, distributed hash tables (DHTs) often partition the ID space into disjoint intervals with each interval assigned to the corresponding node. While nodes join and leave dynamically, one of the hard challenges posed by DHTs is load balancing across the ID space. Tries are known to be a viable data structure such that a balanced trie implies balanced intervals in the ID space. We establish a distributed trie as a deployable overlay network that connects the IDs of participating nodes. We propose a decentralized, efficient, and low-cost algorithm that balances ID intervals in DHTs using the trie. Our scheme allows a node to join or leave the system at a low cost, R + Θ(log log n), where R denotes the message routing cost in DHTs and n is the number of nodes. Compared to the prior ID assignment schemes that require R + Θ(log n) at best for the same operations, our new algorithm reduces the additional cost incurred to maintain the ID space balanced by a factor of Θ(log n/log log n). In our analysis and experiments, we show that the ID space is indeed well-balanced such that the ratio between the largest interval and the smallest is at most 8 with high probability. Finally, we discuss applications of the distributed trie to item load balancing and the multiple choice paradigm.","PeriodicalId":300479,"journal":{"name":"2010 IEEE 18th International Workshop on Quality of Service (IWQoS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130595610","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}

引用次数: 2