Pub Date : 1999-05-31DOI: 10.1109/IWQOS.1999.766470
L. Breslau, S. Jamin, S. Shenker
Measurement-based admission control algorithms (MBACs) have been shown to achieve much higher utilization than parameter-based admission control algorithms (Jamin et al, 1997). There has been much research interest in MBACs, and several new MBACs have been proposed in the literature. This research has typically focused on the equations (and, to a lesser extent, the measurement algorithms) used to decide whether or not to accept an incoming flow. These proposals range from the simple and ad hoc to the complicated and principled, derived from detailed mathematical analysis. Recent empirical examination of the relative performance of these algorithms, however, has shown that they all achieve almost identical levels of performance. That is, for a given level of QoS they all achieve very similar levels of utilization. Thus, regardless of whether the MBAC equation is ad hoc or principled, it produces essentially the same performance. Given this result, the authors claim that further research on different MBAC equations is largely irrelevant. Thus, the authors take the following position with regard to research on MBACs. Further research on better admission control equations will likely be a fruitless endeavour. Rather, research should focus on the development of mechanisms that would enable MBACs to support a range of policy beyond the single policy implicit in current algorithms.
基于测量的准入控制算法(MBACs)已被证明比基于参数的准入控制算法实现更高的利用率(Jamin et al, 1997)。近年来，人们对MBACs的研究兴趣浓厚，并在文献中提出了几种新的MBACs。这项研究通常集中在用于决定是否接受流入流的方程(以及较小程度上的测量算法)上。这些建议从简单的和临时的到复杂的和原则性的，都是从详细的数学分析中得出的。然而，最近对这些算法的相对性能的实证检验表明，它们都达到了几乎相同的性能水平。也就是说，对于给定的QoS级别，它们都实现了非常相似的利用率水平。因此，无论MBAC方程是临时的还是原则性的，它产生的性能基本上是相同的。鉴于这一结果，作者声称对不同MBAC方程的进一步研究在很大程度上是无关紧要的。因此，笔者对mba的研究持以下立场。对更好的准入控制方程的进一步研究可能是徒劳的。相反，研究应侧重于开发机制，使MBACs能够支持当前算法中隐含的单一策略之外的一系列策略。
{"title":"Measurement-based admission control: what is the research agenda?","authors":"L. Breslau, S. Jamin, S. Shenker","doi":"10.1109/IWQOS.1999.766470","DOIUrl":"https://doi.org/10.1109/IWQOS.1999.766470","url":null,"abstract":"Measurement-based admission control algorithms (MBACs) have been shown to achieve much higher utilization than parameter-based admission control algorithms (Jamin et al, 1997). There has been much research interest in MBACs, and several new MBACs have been proposed in the literature. This research has typically focused on the equations (and, to a lesser extent, the measurement algorithms) used to decide whether or not to accept an incoming flow. These proposals range from the simple and ad hoc to the complicated and principled, derived from detailed mathematical analysis. Recent empirical examination of the relative performance of these algorithms, however, has shown that they all achieve almost identical levels of performance. That is, for a given level of QoS they all achieve very similar levels of utilization. Thus, regardless of whether the MBAC equation is ad hoc or principled, it produces essentially the same performance. Given this result, the authors claim that further research on different MBAC equations is largely irrelevant. Thus, the authors take the following position with regard to research on MBACs. Further research on better admission control equations will likely be a fruitless endeavour. Rather, research should focus on the development of mechanisms that would enable MBACs to support a range of policy beyond the single policy implicit in current algorithms.","PeriodicalId":435117,"journal":{"name":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127733035","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}
Pub Date : 1999-05-31DOI: 10.1109/IWQOS.1999.766502
Martin Mayt, Jean Bolott, Christophe Diot, B. Lyles
In this paper we examine the benefits of random early detection (RED) by using a testbed made of two commercially available routers and up to 16 PCs to observe RED performance under a traffic load made of FTP transfers, together with HTTP traffic and non-responsive UDP flows. The main results we found were, first, that RED with small buffers does not improve significantly the performance of the network, in particular the overall throughput is smaller than with tail drop and the difference in delay is not significant. Second, parameter tuning in RED remains an inexact science, but has no big impact on the end-to-end performance. We argue that RED deployment is not straightforward, and we strongly recommend more research with realistic network settings to develop a full quantitative understanding of RED. Nevertheless, RED allows us to control the queue size with large buffers.
{"title":"Reasons not to deploy RED","authors":"Martin Mayt, Jean Bolott, Christophe Diot, B. Lyles","doi":"10.1109/IWQOS.1999.766502","DOIUrl":"https://doi.org/10.1109/IWQOS.1999.766502","url":null,"abstract":"In this paper we examine the benefits of random early detection (RED) by using a testbed made of two commercially available routers and up to 16 PCs to observe RED performance under a traffic load made of FTP transfers, together with HTTP traffic and non-responsive UDP flows. The main results we found were, first, that RED with small buffers does not improve significantly the performance of the network, in particular the overall throughput is smaller than with tail drop and the difference in delay is not significant. Second, parameter tuning in RED remains an inexact science, but has no big impact on the end-to-end performance. We argue that RED deployment is not straightforward, and we strongly recommend more research with realistic network settings to develop a full quantitative understanding of RED. Nevertheless, RED allows us to control the queue size with large buffers.","PeriodicalId":435117,"journal":{"name":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131532624","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}
Pub Date : 1999-05-31DOI: 10.1109/IWQOS.1999.766478
V. Witana, M. Fry, M. Antoniades
We present a software framework that facilitates the development of adaptive applications. This framework allows the installation of application-dependent policies which govern the adaptive behaviour of the application. These policies take into account user preferences and resource availability. The framework provides a generic interface to a variety of re-usable resource classes. We describe an application built using this framework.
{"title":"A software framework for application-level QoS management","authors":"V. Witana, M. Fry, M. Antoniades","doi":"10.1109/IWQOS.1999.766478","DOIUrl":"https://doi.org/10.1109/IWQOS.1999.766478","url":null,"abstract":"We present a software framework that facilitates the development of adaptive applications. This framework allows the installation of application-dependent policies which govern the adaptive behaviour of the application. These policies take into account user preferences and resource availability. The framework provides a generic interface to a variety of re-usable resource classes. We describe an application built using this framework.","PeriodicalId":435117,"journal":{"name":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","volume":"27 14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116474540","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}
Pub Date : 1999-05-31DOI: 10.1109/IWQOS.1999.766477
G. Blair, A. Andersen, L. Blair, G. Coulson
In previous papers, the authors have reported on the design and implementation of reflective middleware platforms. The aim of this paper is to consider the implications of such an architecture for the area of quality of service (QoS) management. More specifically, the paper describes how critical QoS management functions can be incorporated into our reflective middleware platform, with particular emphasis on the dynamic QoS management functions of QoS monitoring and adaptation. It is argued that the reflective approach leads to a natural and highly flexible implementation of such QoS management functions (and indeed the approach offers considerable benefits over more conventional approaches).
{"title":"The role of reflection in supporting dynamic QoS management functions","authors":"G. Blair, A. Andersen, L. Blair, G. Coulson","doi":"10.1109/IWQOS.1999.766477","DOIUrl":"https://doi.org/10.1109/IWQOS.1999.766477","url":null,"abstract":"In previous papers, the authors have reported on the design and implementation of reflective middleware platforms. The aim of this paper is to consider the implications of such an architecture for the area of quality of service (QoS) management. More specifically, the paper describes how critical QoS management functions can be incorporated into our reflective middleware platform, with particular emphasis on the dynamic QoS management functions of QoS monitoring and adaptation. It is argued that the reflective approach leads to a natural and highly flexible implementation of such QoS management functions (and indeed the approach offers considerable benefits over more conventional approaches).","PeriodicalId":435117,"journal":{"name":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122722427","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}
Pub Date : 1999-05-31DOI: 10.1109/IWQOS.1999.766501
T. Bonald, M. May
We prove analytically that, as claimed in Jacobson and Floyd's (1993) initial paper on RED, RED gateways "avoid the bias against bursty traffic", meaning that bursty traffic suffers more losses than smooth traffic with tail drop (TD) gateways, but both types of traffic suffer equally with RED gateways. We also show, again as claimed by Jacobson and Floyd, that RED gateways mark or drop packets from a connection at a rate proportional to that connection's arrival rate. Interestingly, both properties above only hold when the bursty traffic may be modeled by Poisson arrivals of bursts; we exhibit non-Poisson cases where these properties do not hold at all. We conclude the paper with a discussion on the implication of these results on traffic management in the Internet.
{"title":"Drop behavior of RED for bursty and smooth traffic","authors":"T. Bonald, M. May","doi":"10.1109/IWQOS.1999.766501","DOIUrl":"https://doi.org/10.1109/IWQOS.1999.766501","url":null,"abstract":"We prove analytically that, as claimed in Jacobson and Floyd's (1993) initial paper on RED, RED gateways \"avoid the bias against bursty traffic\", meaning that bursty traffic suffers more losses than smooth traffic with tail drop (TD) gateways, but both types of traffic suffer equally with RED gateways. We also show, again as claimed by Jacobson and Floyd, that RED gateways mark or drop packets from a connection at a rate proportional to that connection's arrival rate. Interestingly, both properties above only hold when the bursty traffic may be modeled by Poisson arrivals of bursts; we exhibit non-Poisson cases where these properties do not hold at all. We conclude the paper with a discussion on the implication of these results on traffic management in the Internet.","PeriodicalId":435117,"journal":{"name":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115858488","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}
Pub Date : 1999-05-31DOI: 10.1109/IWQOS.1999.766492
C. Courcoubetis, V. Siris
We present an approach to managing and pricing service level agreements (SLA) for differentiated services that uses a simple upper bound for the effective bandwidth of the conforming traffic as a proxy for resource usage. The bound depends on the user's traffic profile (peak rate and token bucket descriptor). Usage charges for a specific time period are proportional to this proxy, and their calculation requires only measurements of volume. We discuss and present experimental results regarding the incentives and fairness of the proxy, which is required in order to achieve economic efficiency. An important feature of our approach is the simplicity of the user's procedure for selecting optimal token bucket parameters. Our approach is quite generic and can be applied to scheduling disciplines that enable the provision of multiple service classes with different levels of performance. Finally, we present a case study for two service classes, real-time and non-real-time, with actual Internet traces.
{"title":"Managing and pricing service level agreements for differentiated services","authors":"C. Courcoubetis, V. Siris","doi":"10.1109/IWQOS.1999.766492","DOIUrl":"https://doi.org/10.1109/IWQOS.1999.766492","url":null,"abstract":"We present an approach to managing and pricing service level agreements (SLA) for differentiated services that uses a simple upper bound for the effective bandwidth of the conforming traffic as a proxy for resource usage. The bound depends on the user's traffic profile (peak rate and token bucket descriptor). Usage charges for a specific time period are proportional to this proxy, and their calculation requires only measurements of volume. We discuss and present experimental results regarding the incentives and fairness of the proxy, which is required in order to achieve economic efficiency. An important feature of our approach is the simplicity of the user's procedure for selecting optimal token bucket parameters. Our approach is quite generic and can be applied to scheduling disciplines that enable the provision of multiple service classes with different levels of performance. Finally, we present a case study for two service classes, real-time and non-real-time, with actual Internet traces.","PeriodicalId":435117,"journal":{"name":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124454533","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}
Pub Date : 1999-05-31DOI: 10.1109/IWQOS.1999.766481
Cheng-Shang Chang, Wen-Jyh Chen, Hsiang-Yi Huang
Based on a decomposition result by Birkhoff (1946) and von Neumann (1953) for a doubly substochastic matrix, in this paper we propose a scheduling algorithm that is capable of providing service guarantees for input-buffered crossbar switches. Our service guarantees are uniformly good for all non-uniform traffic, and thus imply 100% throughput. The off-line computational complexity to identify the scheduling algorithm is O(N/sup 4.5/) for an N/spl times/N switch. Once the algorithm is identified, its on-line computational complexity is O(logN) and its on-line memory complexity is O(N/sup 3/logN). Neither framing nor internal speedup is required for our approach.
{"title":"On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann","authors":"Cheng-Shang Chang, Wen-Jyh Chen, Hsiang-Yi Huang","doi":"10.1109/IWQOS.1999.766481","DOIUrl":"https://doi.org/10.1109/IWQOS.1999.766481","url":null,"abstract":"Based on a decomposition result by Birkhoff (1946) and von Neumann (1953) for a doubly substochastic matrix, in this paper we propose a scheduling algorithm that is capable of providing service guarantees for input-buffered crossbar switches. Our service guarantees are uniformly good for all non-uniform traffic, and thus imply 100% throughput. The off-line computational complexity to identify the scheduling algorithm is O(N/sup 4.5/) for an N/spl times/N switch. Once the algorithm is identified, its on-line computational complexity is O(logN) and its on-line memory complexity is O(N/sup 3/logN). Neither framing nor internal speedup is required for our approach.","PeriodicalId":435117,"journal":{"name":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116470412","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}
Pub Date : 1999-05-31DOI: 10.1109/IWQOS.1999.766485
N. Taft-Plotkin, B. Bellur, R. Ogier
We apply and evaluate a new efficient algorithm for finding maximally link disjoint pairs of paths in a network. We apply this algorithm for QoS routing in connection-oriented networks that support calls with multiple QoS requirements. Our algorithm (called MADSWIP) is applied for precomputing paths in advance of call arrivals. Through simulations, we compare our QoS routing method to another method that is typical of what a switch vendor might implement today. We then examine the performance of three different policies for selecting a path among multiple potential paths. We also study the effects of decreasing the density of a network topology. We study two styles of topologies: commercial-style and random topologies. We demonstrate that precomputing paths that have minimal overlap is more important than precomputing paths that explicitly address all QoS metrics in a network. We also show that load balancing policies outperform call packing policies in networks that support diverse applications.
{"title":"Quality-of-service routing using maximally disjoint paths","authors":"N. Taft-Plotkin, B. Bellur, R. Ogier","doi":"10.1109/IWQOS.1999.766485","DOIUrl":"https://doi.org/10.1109/IWQOS.1999.766485","url":null,"abstract":"We apply and evaluate a new efficient algorithm for finding maximally link disjoint pairs of paths in a network. We apply this algorithm for QoS routing in connection-oriented networks that support calls with multiple QoS requirements. Our algorithm (called MADSWIP) is applied for precomputing paths in advance of call arrivals. Through simulations, we compare our QoS routing method to another method that is typical of what a switch vendor might implement today. We then examine the performance of three different policies for selecting a path among multiple potential paths. We also study the effects of decreasing the density of a network topology. We study two styles of topologies: commercial-style and random topologies. We demonstrate that precomputing paths that have minimal overlap is more important than precomputing paths that explicitly address all QoS metrics in a network. We also show that load balancing policies outperform call packing policies in networks that support diverse applications.","PeriodicalId":435117,"journal":{"name":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116124976","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}
Pub Date : 1999-05-31DOI: 10.1109/IWQOS.1999.766471
G. Karisson, F. Orava
There is much attention given today to the provisioning of service quality in the Internet. In this position paper we advocate the use of an architecture that improves the integrated-services architecture and allows it to be brought into a differentiated-services context. The main idea in our work is to move functionality and per-session state from the network nodes out to the hosts. Such decentralization improves scalability and simplifies QoS for multicast sessions.
{"title":"The DIY approach to QoS","authors":"G. Karisson, F. Orava","doi":"10.1109/IWQOS.1999.766471","DOIUrl":"https://doi.org/10.1109/IWQOS.1999.766471","url":null,"abstract":"There is much attention given today to the provisioning of service quality in the Internet. In this position paper we advocate the use of an architecture that improves the integrated-services architecture and allows it to be brought into a differentiated-services context. The main idea in our work is to move functionality and per-session state from the network nodes out to the hosts. Such decentralization improves scalability and simplifies QoS for multicast sessions.","PeriodicalId":435117,"journal":{"name":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123718632","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}
Pub Date : 1999-05-31DOI: 10.1109/IWQOS.1999.766483
R. Bless, Klaus Wehrle
Current efforts to provide distinct levels of quality-of-service in the Internet are concentrated on the differentiated services (DS) approach. In order to investigate the gain for users of those differentiated services, early experiences with implementations with respect to real applications are needed. Simulation models are often not sufficient if a judgement of the behavior under realistic traffic scenarios is desired. Because implementing new functionality into dedicated router hardware is difficult and time-consuming, we focused on a software implementation for standard PC hardware. In this paper we present an implementation of differentiated services functions for a PC-based router running under the Linux operating system. Two per-hop forwarding behaviors for assured service and premium service were realized. Components for traffic conditioning such as traffic meter, token bucket, leaky bucket and traffic shaper were implemented as well as an efficient traffic classificator and queueing disciplines. We describe the design and implementation issues of these components, which were validated in detail by measurements. Evaluation of these measurements shows that the proposed forwarding behaviors work well for boundary and interior routers. But, it also becomes apparent that standard applications using short-lived TCP connections cannot always exploit the requested service completely whereas rate-controlled sending applications are able to take full advantage of it. Furthermore, it is planned to release the implementation to the public for research purposes.
{"title":"Evaluation of differentiated services using an implementation under Linux","authors":"R. Bless, Klaus Wehrle","doi":"10.1109/IWQOS.1999.766483","DOIUrl":"https://doi.org/10.1109/IWQOS.1999.766483","url":null,"abstract":"Current efforts to provide distinct levels of quality-of-service in the Internet are concentrated on the differentiated services (DS) approach. In order to investigate the gain for users of those differentiated services, early experiences with implementations with respect to real applications are needed. Simulation models are often not sufficient if a judgement of the behavior under realistic traffic scenarios is desired. Because implementing new functionality into dedicated router hardware is difficult and time-consuming, we focused on a software implementation for standard PC hardware. In this paper we present an implementation of differentiated services functions for a PC-based router running under the Linux operating system. Two per-hop forwarding behaviors for assured service and premium service were realized. Components for traffic conditioning such as traffic meter, token bucket, leaky bucket and traffic shaper were implemented as well as an efficient traffic classificator and queueing disciplines. We describe the design and implementation issues of these components, which were validated in detail by measurements. Evaluation of these measurements shows that the proposed forwarding behaviors work well for boundary and interior routers. But, it also becomes apparent that standard applications using short-lived TCP connections cannot always exploit the requested service completely whereas rate-controlled sending applications are able to take full advantage of it. Furthermore, it is planned to release the implementation to the public for research purposes.","PeriodicalId":435117,"journal":{"name":"1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354)","volume":"515 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123083148","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：