2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)最新文献

筛选
英文 中文
Multi-class latency-bounded Web services 多类延迟受限的Web服务
V. Kanodia, E. Knightly
{"title":"Multi-class latency-bounded Web services","authors":"V. Kanodia, E. Knightly","doi":"10.1109/IWQOS.2000.847959","DOIUrl":"https://doi.org/10.1109/IWQOS.2000.847959","url":null,"abstract":"Two recent advances have resulted in significant improvements in Web server quality of service. First, both centralized and distributed Web servers can provide isolation among service classes by fairly distributing system resources. Second, session admission control can protect classes from performance degradation due to overload. The goal of this work is to design a general \"front-end\" algorithm that uses these two building blocks to support a new Web service model, namely, multi-class services which control response latencies to within pre-specified targets. Our key technique is to devise a general service abstraction to adaptively control not only the latency of a particular class, but also to assess the inter-class relationships. In this way, we capture the extent to which classes are isolated or share system resources (as determined by the server architecture and system internals) and hence their effects on each other's QoS. For example, if the server provides class isolation (i.e., a minimum fraction of system resources independent of other classes), yet also allows a class to utilize unused resources from other classes, the algorithm infers and exploits this behavior without an explicit low level model of the server. Thus, as new functionalities are incorporated into Web servers, the approach naturally exploits their properties to efficiently satisfy the classes' performance targets. We validate the scheme with trace driven simulations.","PeriodicalId":416650,"journal":{"name":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115003971","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}
引用次数: 78
A representation of network node QoS control policies using rule-based building blocks 使用基于规则的构建块的网络节点QoS控制策略的表示
Y. Kanada
{"title":"A representation of network node QoS control policies using rule-based building blocks","authors":"Y. Kanada","doi":"10.1109/IWQOS.2000.847948","DOIUrl":"https://doi.org/10.1109/IWQOS.2000.847948","url":null,"abstract":"Network node functions, such as QoS or the security functions of routers, are becoming increasingly complex, so programs, not only configuration parameters, are required to control network nodes. In a policy-based network, a policy is defined at a policy server as a set of rules that deploy at network nodes where it must be translated into an executable program or parameters. Thus, a policy must be represented by a form in which the syntax and semantics are clearly defined, and which can be mechanically translated into an executable program. This is possible if the policy is written in an appropriate rule-based programming language. This paper describes such a language in which functions required for DiffServ can be specified for the interface between a policy server and network nodes. In this language, a policy rule can be composed using predefined primitive building blocks and control structures.","PeriodicalId":416650,"journal":{"name":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117346874","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
Of packets and people: a user-centered approach to quality of service 数据包和人:以用户为中心的服务质量方法
A. Bouch, M. Sasse, H. deMeer
{"title":"Of packets and people: a user-centered approach to quality of service","authors":"A. Bouch, M. Sasse, H. deMeer","doi":"10.1109/IWQOS.2000.847955","DOIUrl":"https://doi.org/10.1109/IWQOS.2000.847955","url":null,"abstract":"Multimedia communication has gained increasing attention, both from the application side and the network provider side. While resource provisioning for QoS support in packet switched networks has led to the design and development of sophisticated QoS architectures, notably ATM, IntServ or DiffServ, research has not exactly been user or application-context centered. In the cause of the evolution of QoS architectures, the integrated service network approach has lost momentum, and with it, the notion of QoS guarantees. Differentiation of QoS classes within the DiffServ framework is based on the definition of various per-hop behaviors. What is currently missing is a technique for specification and mapping of application and user QoS preferences onto evolving service profiles. In addition, adaptation of applications (and users) is becoming increasingly important in the face of dominating weak QoS-assurance paradigms, both in wireline and wireless environments. As a prerequisite, this paper investigates cognitive and perceptive conditioning of users and applications in a situated setting. The contribution of this paper is twofold: first, essential empirical results on user QoS preferences and QoS graduations are presented, and second, methodological foundations are laid for investigating user-centered QoS.","PeriodicalId":416650,"journal":{"name":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115884162","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}
引用次数: 90
Traffic shaping for end-to-end delay guarantees with EDF scheduling 基于EDF调度的端到端延迟保证的流量整形
V. Sivaraman, F. Chiussi, Mario Gerla
{"title":"Traffic shaping for end-to-end delay guarantees with EDF scheduling","authors":"V. Sivaraman, F. Chiussi, Mario Gerla","doi":"10.1109/IWQOS.2000.847934","DOIUrl":"https://doi.org/10.1109/IWQOS.2000.847934","url":null,"abstract":"The provision of quality of service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Of the various packet scheduling schemes that have been proposed in the literature, earliest deadline first (EDF) scheduling in conjunction with per-hop traffic shaping (jointly referred to as rate-controlled EDF or RC-EDF) has been recognized as an effective means of end-to-end deterministic delay provisioning. An important aspect that has not been addressed satisfactorily in the literature, however, concerns the choice of RC-EDF shaping parameters that realize maximal network utilizations. In this paper, we first establish that except in trivial cases, it is infeasible to identify \"optimal\" shapers that realize maximal RC-EDF schedulable regions. Ascertaining the optimal flow shaper requires the state of the entire network to be considered, making it computationally impractical. We then propose an heuristic choice of shaper derived from the number of hops traversed by the flow. The resulting shaper is easy to compute, and varies gracefully between the known optimal shapers for limiting values of the hop-length. We show via simulations that for a realistic traffic mix, our choice of shaper allows RC-EDF to outperform the GPS (generalized processor sharing) scheduling discipline as well as RC-EDF disciplines that use shapers chosen independent of the flow hop-length.","PeriodicalId":416650,"journal":{"name":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126269691","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}
引用次数: 35
Minimum-latency dual-leaky-bucket shapers for packet multiplexers: theory and implementation 用于分组多路复用器的最小延迟双泄漏桶形状器:理论与实现
A. Francini, F. Chiussi
{"title":"Minimum-latency dual-leaky-bucket shapers for packet multiplexers: theory and implementation","authors":"A. Francini, F. Chiussi","doi":"10.1109/IWQOS.2000.847935","DOIUrl":"https://doi.org/10.1109/IWQOS.2000.847935","url":null,"abstract":"The need for integrating per-flow dual leaky-bucket regulators with a scheduler that enforces strict bandwidth guarantees is becoming a crucial issue in networks that provide differentiated services. Despite the increasing relevance of the topic, existing solutions either lack accuracy in their shaping action, or compromise the provision of strict bandwidth guarantees to the shaped flows, or suboptimally utilize the output link. In this paper, we present the monolithic shaper-scheduler (MSS), which integrates the shaping and scheduling functions while preserving the bandwidth guarantees of the shaped flows. The MSS handles shaped and unshaped flows simultaneously. It allows us to provision per flow shaping parameters that are independent of the corresponding bandwidth requirements; thus, the available link bandwidth can be fully utilized. The latency and worst case fairness properties of the new scheduler are optimal among GPS-related schedulers. We describe how the MSS can be easily implemented in practice, with minimal overhead with respect to a conventional GPS-related scheduler.","PeriodicalId":416650,"journal":{"name":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128052286","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}
引用次数: 19
Fair queuing with in/out bit in core stateless networks 核心无状态网络中具有输入/输出位的公平排队
M. Nabeshima, T. Shimizu, I. Yamasaki
{"title":"Fair queuing with in/out bit in core stateless networks","authors":"M. Nabeshima, T. Shimizu, I. Yamasaki","doi":"10.1109/IWQOS.2000.847933","DOIUrl":"https://doi.org/10.1109/IWQOS.2000.847933","url":null,"abstract":"Several fair queuing schemes have been proposed for core stateless networks. They can achieve fairer bandwidth allocation than RED (random early detection). However, there have not been any studies that consider in/out bit usage. This paper proposes a way to extend the schemes that have been proposed for core stateless networks to allow the support of in/out bit usage. The extended schemes are suitable for realizing guaranteed rate (GR) service, which provides each user with a minimum guaranteed rate and a fair share of the residual bandwidth. We present the performance of one of the extended schemes and compare the scheme to RIO (RED with in/out bit) in terms of fair bandwidth allocation.","PeriodicalId":416650,"journal":{"name":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133244271","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}
引用次数: 10
On mapping of QoS between integrated services and differentiated services 集成服务与差异化服务之间的QoS映射
T. Chahed, G. Hébuterne, C. Fayet
{"title":"On mapping of QoS between integrated services and differentiated services","authors":"T. Chahed, G. Hébuterne, C. Fayet","doi":"10.1109/IWQOS.2000.847952","DOIUrl":"https://doi.org/10.1109/IWQOS.2000.847952","url":null,"abstract":"End-to-end QoS in IP networks views Intserv, acting on a per-flow basis, at the peripheries of large core networks where Diffserv, acting on aggregation of flows, operates. In this context, it is necessary to map QoS, in terms of QoS parameters, between the individual and the aggregate flow levels. This is crucial as only the individual, Intserv flow performance is relevant to the end user, whereas the aggregate, Diffserv view is of interest to the network operator only. A deterministic approach at the packet level reveals the presence of synchronization that may result in biases of loss and delay among the individual flows at a Diffserv router, and at the edge router where packets are tagged according to their conformance. We show that, qualitatively, packet loss at the Diffserv level results in 'bursty loss' at the Intserv level. Quantitatively, packet loss at the Diffserv region is first related to consecutive, Intserv packet loss and then to the local packet loss at the Intserv level. As for delay, synchronization may lead a packet to experience maximum delay at every network element of the end-to-end path.","PeriodicalId":416650,"journal":{"name":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126597110","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}
引用次数: 10
Application-level IP measurements for multimedia 用于多媒体的应用级IP测量
V. Raisanen, J. Rosti
{"title":"Application-level IP measurements for multimedia","authors":"V. Raisanen, J. Rosti","doi":"10.1109/IWQOS.2000.847951","DOIUrl":"https://doi.org/10.1109/IWQOS.2000.847951","url":null,"abstract":"The benefits of application-level packet multimedia measurements are described by using VoIP as an example. The need for statistical reliability and comparative QoS analyses is illustrated, and the role of QoS measurements in providing end-to-end QoS via per-domain QoS budgets is discussed.","PeriodicalId":416650,"journal":{"name":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132087254","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
Proportional differentiated services, part II: loss rate differentiation and packet dropping 比例差异化业务,第二部分:丢包率差异化和丢包
C. Dovrolis, Parameswaran Ramanathann
{"title":"Proportional differentiated services, part II: loss rate differentiation and packet dropping","authors":"C. Dovrolis, Parameswaran Ramanathann","doi":"10.1109/IWQOS.2000.847938","DOIUrl":"https://doi.org/10.1109/IWQOS.2000.847938","url":null,"abstract":"The proportional differentiation model was proposed in Dovrolis et al. (1999), as a target for controllable and predictable relative differentiated services. Only the delay differentiation aspect of the model was considered, and focused on packet scheduling mechanisms. In this paper, we extend the proportional differentiation model in the direction of loss rate differentiation. Several previous mechanisms for buffer management and packet dropping, such as complete buffer partitioning, partial buffer sharing, or multi-class RED, are not suitable for relative differentiated services. We propose and evaluate two dropping mechanisms that closely approximate the proportional loss rate differentiation model. The two droppers, PLR(/spl infin/) and PLR(M), differ in the time interval over which the loss rates are measured and proportionally adjusted. This difference results in several trade-offs, in terms of implementation complexity, accuracy, and ability to deal with nonstationary traffic loads. We also re-evaluate the delay differentiation that the waiting time priorities (WTP) scheduler, of Dovrolis et al., can achieve in the presence of finite buffers and packet losses; this study extends their results providing further insight into the behavior of WTP in heavy load conditions. Finally, we examine the coupled effect of delay and loss rate proportional differentiation on the throughput of bulk-transfer TCP connections.","PeriodicalId":416650,"journal":{"name":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123713691","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}
引用次数: 156
MLDA: a TCP-friendly congestion control framework for heterogeneous multicast environments MLDA:一个tcp友好的异构组播环境拥塞控制框架
D. Sisalem, A. Wolisz
{"title":"MLDA: a TCP-friendly congestion control framework for heterogeneous multicast environments","authors":"D. Sisalem, A. Wolisz","doi":"10.1109/IWQOS.2000.847939","DOIUrl":"https://doi.org/10.1109/IWQOS.2000.847939","url":null,"abstract":"To avoid overloading the Internet and starving TCP connections, multimedia flows using non-congestion controlled UDP need to be enhanced with congestion control mechanisms. In this paper, we present a general framework for achieving TCP-friendly congestion control called MLDA. Using MLDA, multimedia senders adjust their transmission rate in accordance with the network congestion state. Taking the heterogeneity of the Internet and the end systems into account, MLDA supports layered data transmission where the shape and number of the layers is determined dynamically based on feedback information generated by the receivers. Performance tests of MLDA as well as comparisons to other congestion control schemes suggest that MLDA achieves TCP-friendly congestion control on the one hand and is able to accommodate the needs of heterogeneous receivers on the other.","PeriodicalId":416650,"journal":{"name":"2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128873490","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}
引用次数: 119
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信