200614th IEEE International Workshop on Quality of Service最新文献

Improving Performance of Internet Services Through Reward-Driven Request Prioritization 通过奖励驱动的请求优先级改进互联网服务的性能

200614th IEEE International Workshop on Quality of Service Pub Date : 2006-11-30 DOI: 10.1109/IWQOS.2006.250452

Alexander Totok, V. Karamcheti

{"title":"Improving Performance of Internet Services Through Reward-Driven Request Prioritization","authors":"Alexander Totok, V. Karamcheti","doi":"10.1109/IWQOS.2006.250452","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250452","url":null,"abstract":"Meeting client QoS expectations proves to be a difficult task for the providers of modern Internet services, especially when Web servers experience overload conditions (steady or transient), which cause increased response times and request rejections, leading to user frustration, lowered usage of the service and reduced revenues. In this paper, we propose a server-side request scheduling mechanism that addresses these problems. Our reward-driven request prioritization (RDRP) algorithm gives higher execution priority to client Web sessions that are likely to bring more service profit (or any other application-specific reward). The method works by predicting future session structure by comparing its requests seen so far with aggregated information about recent client behavior, and using these predictions to preferentially allocate Web server resources. Our experiments using the TPC-W benchmark application and CBMG-based Web workloads, with an implementation of the RDRP techniques in the JBoss application server, show that RDRP can significantly boost reward attained by the service, while providing better QoS to clients that bring more reward","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126782096","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}

引用次数: 20

Efficient Proxy-Based Internet Media Distribution Control and Privacy Protection Infrastructure 基于代理的高效网络媒体分发控制与隐私保护基础设施

200614th IEEE International Workshop on Quality of Service Pub Date : 2006-11-30 DOI: 10.1109/IWQOS.2006.250470

Songqing Chen, Shiping Chen, Huiping Guo, Bo Shen, S. Jajodia

{"title":"Efficient Proxy-Based Internet Media Distribution Control and Privacy Protection Infrastructure","authors":"Songqing Chen, Shiping Chen, Huiping Guo, Bo Shen, S. Jajodia","doi":"10.1109/IWQOS.2006.250470","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250470","url":null,"abstract":"Massive Internet media distribution demands pro longed continuous consumption of networking and disk band widths in large capacity. Many proxy-based Internet media distribution algorithms and systems have been proposed, implemented, and evaluated to address the scalability issue. However, few of them have been used in practice, since two important issues are not satisfactorily addressed. First, existing proxy-based media distribution architectures lack an efficient media distribution control mechanism. Without protection on the Internet, content providers are hesitant to use existing fast distribution techniques. Second, little has been done to protect client privacy during client accesses. Straightforward solutions to address these two issues independently lead to conflicts. For example, to enforce distribution control, only legitimate users should be granted access rights. However, this normally discloses more information (such as which object the client is accessing) other than the client identity, which conflicts with the client's desire for privacy protection. In this paper, we propose a unified proxy-based media distribution protocol to effectively address these two problems simultaneously. We further design a set of new algorithms for cooperative proxies where our proposed scheme works practically. Simulation results show that our proposed strategy is efficient","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128910202","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}

引用次数: 5

Modeling the Peering and Routing Tussle between ISPs and P2P Applications isp和P2P应用程序之间的对等和路由争用建模

200614th IEEE International Workshop on Quality of Service Pub Date : 2006-11-30 DOI: 10.1109/IWQOS.2006.250451

Hui Wang, D. Chiu, John C.S. Lui

引用次数: 21

A Case for TCP-Friendly Admission Control 一个tcp友好的允许控制案例

200614th IEEE International Workshop on Quality of Service Pub Date : 2006-11-30 DOI: 10.1109/IWQOS.2006.250473

A. Tam, D. Chiu, John C.S. Lui, Y. Tay

{"title":"A Case for TCP-Friendly Admission Control","authors":"A. Tam, D. Chiu, John C.S. Lui, Y. Tay","doi":"10.1109/IWQOS.2006.250473","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250473","url":null,"abstract":"Admission control has been shown to be a preferred alternative to TCP-friendly congestion control for inelastic flows in heterogeneous networks shared by elastic and inelastic traffic. However, it is possible for an inelastic flow to adopt different level of aggressiveness in implementing the admission control. How these different levels of aggressiveness affect the system performance remains an open issue. In this paper, we evaluate a full spectrum of (abstract) admission control algorithms in terms of their aggressiveness towards elastic flows. A totally aggressive version would admit an inelastic flow even if this means elastic flows' fair bandwidth share is reduced to close to zero. In the other extreme, a TCP-friendly version would only admit an inelastic flow if its desired rate is no higher than what the elastic flows will receive after its arrival. We show that the performance of inelastic flows is asymptotically insensitive to their aggressiveness without strong assumptions about flow file size or holding time distributions. This makes a strong case for adopting a less aggressive, yet TCP-friendly admission control in a heterogeneous network. Extensive simulations are carried out to validate the performance, stability and asymptotic behavior the the proposed TCP-friendly admission control policy","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122488860","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}

引用次数: 9

Host-Based Service Differentiation with Congestion Feedback 基于主机的服务区分与拥塞反馈

200614th IEEE International Workshop on Quality of Service Pub Date : 2006-11-30 DOI: 10.1109/IWQOS.2006.250472

H. Lundqvist, G. Karlsson

引用次数: 1

A Service Provider's Approach for Improving Performance of Aggregate Voice-over-IP Traffic 一种服务提供商改进聚合ip话音流量性能的方法

200614th IEEE International Workshop on Quality of Service Pub Date : 2006-11-30 DOI: 10.1109/IWQOS.2006.250465

Camelia Al-Najjar, A. Reddy

引用次数: 1

How Practical is Network Coding? 网络编码有多实用?

200614th IEEE International Workshop on Quality of Service Pub Date : 2006-11-30 DOI: 10.1109/IWQOS.2006.250480

Mea Wang, Baochun Li

引用次数: 1267

Echelon: Peer-to-Peer Network Diagnosis with Network Coding 梯队:点对点网络诊断与网络编码

200614th IEEE International Workshop on Quality of Service Pub Date : 2006-11-30 DOI: 10.1109/IWQOS.2006.250447

Chuan Wu, Baochun Li

{"title":"Echelon: Peer-to-Peer Network Diagnosis with Network Coding","authors":"Chuan Wu, Baochun Li","doi":"10.1109/IWQOS.2006.250447","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250447","url":null,"abstract":"It is critical to monitor the performance and \"health\" of large-scale peer-to-peer applications. As an example, operators of peer-to-peer live streaming applications may be interested in observing performance bottlenecks, peer failures, and network topologies. In most cases, such observations are used to diagnose potential problems in the protocol design, to troubleshoot network outage, or to improve the Quality of Service of the peer-to-peer network in general. They are not time sensitive in nature, as delayed observations up to minutes or even hours are still valuable. However, such historical and delay-tolerant observations should include measurements of peers that have already failed or departed, as peer dynamics significantly affect the health of peer-to-peer applications. Such a delay-tolerant observation of peer-to-peer applications over a historical period of time is referred to as a diagnosis. In this paper, we present Echelon, a time-insensitive way to construct the diagnosis of a large-scale peer-to-peer application. Replacing the traditional wisdom of logging servers, we leverage the power of network coding to collect application-specific measurements on each peer, and disseminate them to other peers in a coded form. Over time, measurements of departed peers can still be recovered, simply by probing a small subset of peers in the network. Simulation studies have shown that Echelon is highly configurable, bandwidth efficient, and extremely tolerant of peer dynamics, thanks to the advantages of randomized network coding","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126700133","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

Supporting Loss Guarantees in Buffer-Limited Networks 缓冲有限网络中的支持损失保证

200614th IEEE International Workshop on Quality of Service Pub Date : 2006-11-30 DOI: 10.1109/IWQOS.2006.250474

Mahmoud Elhaddad, R. Melhem, T. Znati

{"title":"Supporting Loss Guarantees in Buffer-Limited Networks","authors":"Mahmoud Elhaddad, R. Melhem, T. Znati","doi":"10.1109/IWQOS.2006.250474","DOIUrl":"https://doi.org/10.1109/IWQOS.2006.250474","url":null,"abstract":"We consider the problem of packet scheduling in a network with small router buffers. The objective is to provide a statistical bound on the worst-case packet loss rate for a traffic aggregate (connection) routed along any network path, given maximum permissible link utilization (load). This problem is argued to be of interest in networks providing statistical loss-rate guarantees to ingress-egress connections with fixed bandwidth demands. We introduce a scheduling algorithm for networks using per packet transmission reservation. Reservations allow loss guarantees at the aggregate level to hold for individual flows within the aggregate. The algorithm employs randomization and traffic regulation at the ingress, and batch local scheduling at the links. It ensures that a large fraction of packets from each connection are consistently subject to small loss probability at every link. These packets are therefore likely to survive long paths. To obtain the desired loss-rate bound, we analyze the performance of the algorithm under global routing and bandwidth allocation scenarios that maximize the loss rate of a connection routed along an arbitrary network path. We compare the bound to that obtained using the scheduling algorithm that combines the FCFS service discipline and the drop-tail policy. We find that the proposed algorithm significantly improves the constraints on link utilization and path length necessary to achieve strong loss-rate guarantees","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122722511","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}

引用次数: 5

Overload Protection for IEEE 802.11 Cells IEEE 802.11 cell的过载保护

200614th IEEE International Workshop on Quality of Service Pub Date : 2006-11-30 DOI: 10.1109/IWQOS.2006.250462

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

引用次数: 3