Pub Date : 2005-05-15DOI: 10.1109/E2EMON.2005.1564472
Wenli Liu, R. Boutaba
As peer-to-peer (P2P) networks are being developed and deployed on the Internet at a fast pace, the need for a traceroute like mechanism at the application layer surfaces. Such mechanism, once implemented and deployed, will significantly reduce the complexity involved in developing, researching and evolving P2P networks. It will also help users understand how their queries are handled in P2P networks and mitigate their frustration when their queries return nothing. In this paper, we propose and describe AppTraceroute, which is analogous to traditional traceroute but determines the application layer hops and hosts that a query has visited. Meanwhile, we studied the bandwidth consumptions involved when introducing AppTraceroute into pure P2P networks, hybrid P2P networks and structured P2P networks. We have implemented and experimented the concept of AppTraceroute on a structured P2P network, and the results are promising.
{"title":"Tracerouting peer-to-peer networks","authors":"Wenli Liu, R. Boutaba","doi":"10.1109/E2EMON.2005.1564472","DOIUrl":"https://doi.org/10.1109/E2EMON.2005.1564472","url":null,"abstract":"As peer-to-peer (P2P) networks are being developed and deployed on the Internet at a fast pace, the need for a traceroute like mechanism at the application layer surfaces. Such mechanism, once implemented and deployed, will significantly reduce the complexity involved in developing, researching and evolving P2P networks. It will also help users understand how their queries are handled in P2P networks and mitigate their frustration when their queries return nothing. In this paper, we propose and describe AppTraceroute, which is analogous to traditional traceroute but determines the application layer hops and hosts that a query has visited. Meanwhile, we studied the bandwidth consumptions involved when introducing AppTraceroute into pure P2P networks, hybrid P2P networks and structured P2P networks. We have implemented and experimented the concept of AppTraceroute on a structured P2P network, and the results are promising.","PeriodicalId":354965,"journal":{"name":"Workshop on End-to-End Monitoring Techniques and Services, 2005.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129763788","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 : 2005-05-15DOI: 10.1109/E2EMON.2005.1564468
L. Deri
With the increasing network speed, it is no longer possible to capture and transmit network packets at wire-speed using general-purpose operating systems. Many companies tried to tackle this problem by manufacturing costly network adapters able to keep up at high network speeds. This paper describes a new approach to wire-speed packet capture and transmission named nCap based on commercial network adapters rather than on custom network adapters and software.
{"title":"nCap: wire-speed packet capture and transmission","authors":"L. Deri","doi":"10.1109/E2EMON.2005.1564468","DOIUrl":"https://doi.org/10.1109/E2EMON.2005.1564468","url":null,"abstract":"With the increasing network speed, it is no longer possible to capture and transmit network packets at wire-speed using general-purpose operating systems. Many companies tried to tackle this problem by manufacturing costly network adapters able to keep up at high network speeds. This paper describes a new approach to wire-speed packet capture and transmission named nCap based on commercial network adapters rather than on custom network adapters and software.","PeriodicalId":354965,"journal":{"name":"Workshop on End-to-End Monitoring Techniques and Services, 2005.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117222140","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 : 2005-05-15DOI: 10.1109/E2EMON.2005.1564478
T. Braun, M. Scheidegger, M. Studer
Endpoint admission control is a scalable QoS mechanism that relies on measuring the amount of lost or marked packets of a probing stream before allowing user data flows to enter the network. The existing approaches can be classified based on whether or not they use a separate traffic class for probing traffic, and whether or not they rely on a marking mechanism. Approaches that use a separate traffic class and rely on a marking mechanism are called out-of-band marking approaches and have proven to be most reliable but are also hard to deploy. As an alternative for out-of-band marking the approach of virtual dropping has been proposed, which discards packets that would have been marked otherwise, based on a virtual queue algorithm, thus removing the requirement of a common marking scheme. This paper compares the behavior of virtual dropping and out-of-band marking. Both mechanisms do not behave exactly the same, but differ slightly.
{"title":"Virtual dropping for endpoint admission control","authors":"T. Braun, M. Scheidegger, M. Studer","doi":"10.1109/E2EMON.2005.1564478","DOIUrl":"https://doi.org/10.1109/E2EMON.2005.1564478","url":null,"abstract":"Endpoint admission control is a scalable QoS mechanism that relies on measuring the amount of lost or marked packets of a probing stream before allowing user data flows to enter the network. The existing approaches can be classified based on whether or not they use a separate traffic class for probing traffic, and whether or not they rely on a marking mechanism. Approaches that use a separate traffic class and rely on a marking mechanism are called out-of-band marking approaches and have proven to be most reliable but are also hard to deploy. As an alternative for out-of-band marking the approach of virtual dropping has been proposed, which discards packets that would have been marked otherwise, based on a virtual queue algorithm, thus removing the requirement of a common marking scheme. This paper compares the behavior of virtual dropping and out-of-band marking. Both mechanisms do not behave exactly the same, but differ slightly.","PeriodicalId":354965,"journal":{"name":"Workshop on End-to-End Monitoring Techniques and Services, 2005.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126596790","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 : 2005-05-15DOI: 10.1109/E2EMON.2005.1564477
Seung-Hwa Chung, Y. Won, D. Agrawal, Seong-Cheol Hong, J. W. Hong, Hong-Taek Ju, Kihong Park
ISPs and enterprises usually overprovision their networks as a means of supporting QoS. In spite of that, the service quality of QoS-sensitive applications such as VoIP, video conferencing and streaming media may not be up to expectations. We believe this is due to sporadic but non-negligible packet losses due to traffic bursts even in underutilized links. Our earlier work attempted to detect and analyze packet losses in underutilized links in an enterprise network environment using SNMP. This paper presents an extension of our earlier work by attempting to detect and analyze packet loss at finer granularity of time scale. We have developed a passive traffic capturing system, which can provide smaller time scale analysis of packet loss. We have analyzed the data and identified parts that are representative of packet loss across various time scales: 10 milliseconds, one second, 10 seconds and one minute. Analysis reveals that packet losses on underutilized link do occur due to bursty traffic packets in a small time scale. We also present analysis of other traffic properties such as packet size distribution and flows for the packet loss.
{"title":"Detection and analysis of packet loss on underutilized enterprise network links","authors":"Seung-Hwa Chung, Y. Won, D. Agrawal, Seong-Cheol Hong, J. W. Hong, Hong-Taek Ju, Kihong Park","doi":"10.1109/E2EMON.2005.1564477","DOIUrl":"https://doi.org/10.1109/E2EMON.2005.1564477","url":null,"abstract":"ISPs and enterprises usually overprovision their networks as a means of supporting QoS. In spite of that, the service quality of QoS-sensitive applications such as VoIP, video conferencing and streaming media may not be up to expectations. We believe this is due to sporadic but non-negligible packet losses due to traffic bursts even in underutilized links. Our earlier work attempted to detect and analyze packet losses in underutilized links in an enterprise network environment using SNMP. This paper presents an extension of our earlier work by attempting to detect and analyze packet loss at finer granularity of time scale. We have developed a passive traffic capturing system, which can provide smaller time scale analysis of packet loss. We have analyzed the data and identified parts that are representative of packet loss across various time scales: 10 milliseconds, one second, 10 seconds and one minute. Analysis reveals that packet losses on underutilized link do occur due to bursty traffic packets in a small time scale. We also present analysis of other traffic properties such as packet size distribution and flows for the packet loss.","PeriodicalId":354965,"journal":{"name":"Workshop on End-to-End Monitoring Techniques and Services, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130187868","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 : 2005-05-15DOI: 10.1109/E2EMON.2005.1564470
Y. Labit, P. Owezarski, N. Larrieu
Available bandwidth - as well as capacity or achievable bandwidth - on a path or a link is one of the very important parameters to measure or estimate in a network: it is of high interest for many networking functions (routing, admission and congestion control, load balancing, etc). Active probing techniques provide the easiest and the more flexible approach, for estimating available bandwidth. In addition, they can be used for different network technologies or structures. Many techniques and tools for available bandwidth estimation appeared recently, but little attention has been given to the accuracy of the estimated values in the real Internet, most of previous studies focusing on validating the accuracy of these tools on local platform. Therefore, this paper deals with evaluating the accuracy of active estimation tools in the real wide area Internet. We use passive monitoring tools for this purpose. We then built a platform combining active and passive equipments, and define a methodology for evaluating active probing techniques using passive tools. The passive evaluation relies on DAG system cards that represent references for such kind of measurements. This paper then discusses the results we got in the different experiments with different tools. In particular, we use traffic generators for changing the characteristics of the traffic on the Internet paths, which we are making our measurements on. It is useful for analyzing the accuracy of active estimation tools according to network and traffic conditions.
{"title":"Evaluation of active measurement tools for bandwidth estimation in real environment","authors":"Y. Labit, P. Owezarski, N. Larrieu","doi":"10.1109/E2EMON.2005.1564470","DOIUrl":"https://doi.org/10.1109/E2EMON.2005.1564470","url":null,"abstract":"Available bandwidth - as well as capacity or achievable bandwidth - on a path or a link is one of the very important parameters to measure or estimate in a network: it is of high interest for many networking functions (routing, admission and congestion control, load balancing, etc). Active probing techniques provide the easiest and the more flexible approach, for estimating available bandwidth. In addition, they can be used for different network technologies or structures. Many techniques and tools for available bandwidth estimation appeared recently, but little attention has been given to the accuracy of the estimated values in the real Internet, most of previous studies focusing on validating the accuracy of these tools on local platform. Therefore, this paper deals with evaluating the accuracy of active estimation tools in the real wide area Internet. We use passive monitoring tools for this purpose. We then built a platform combining active and passive equipments, and define a methodology for evaluating active probing techniques using passive tools. The passive evaluation relies on DAG system cards that represent references for such kind of measurements. This paper then discusses the results we got in the different experiments with different tools. In particular, we use traffic generators for changing the characteristics of the traffic on the Internet paths, which we are making our measurements on. It is useful for analyzing the accuracy of active estimation tools according to network and traffic conditions.","PeriodicalId":354965,"journal":{"name":"Workshop on End-to-End Monitoring Techniques and Services, 2005.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122931584","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 : 2005-05-15DOI: 10.1109/E2EMON.2005.1564473
C. Shen, H. Schulzrinne, Sung-Hyuck Lee, Jongho Bang
A next step in signaling (NSIS) protocol is currently under standardization by the Internet Engineering Task Force (IETF) to support various applications that need to manipulate control information along the flow path. This paper addresses the NSIS protocol and IP routing interaction problem. We conducted routing measurement experiments to characterize the current Internet path dynamics, and discussed the impact of the observations on NSIS protocol design. The focus of our study is route change. We introduce NSIS-affecting route changes and define them in typical NSIS deployment models. With the NSIS deployment models in mind, we evaluate the simple packet TTL monitoring route change detection method. Finally, we propose a new route change detection method based on one-way-delay monitoring and provide preliminary evaluation.
{"title":"Routing dynamics measurement and detection for next step Internet signaling protocol","authors":"C. Shen, H. Schulzrinne, Sung-Hyuck Lee, Jongho Bang","doi":"10.1109/E2EMON.2005.1564473","DOIUrl":"https://doi.org/10.1109/E2EMON.2005.1564473","url":null,"abstract":"A next step in signaling (NSIS) protocol is currently under standardization by the Internet Engineering Task Force (IETF) to support various applications that need to manipulate control information along the flow path. This paper addresses the NSIS protocol and IP routing interaction problem. We conducted routing measurement experiments to characterize the current Internet path dynamics, and discussed the impact of the observations on NSIS protocol design. The focus of our study is route change. We introduce NSIS-affecting route changes and define them in typical NSIS deployment models. With the NSIS deployment models in mind, we evaluate the simple packet TTL monitoring route change detection method. Finally, we propose a new route change detection method based on one-way-delay monitoring and provide preliminary evaluation.","PeriodicalId":354965,"journal":{"name":"Workshop on End-to-End Monitoring Techniques and Services, 2005.","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115057754","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 : 2005-05-15DOI: 10.1109/E2EMON.2005.1564467
M. Siekkinen, E. Biersack, G. Urvoy-Keller, V. Goebel, T. Plagemann
Internet traffic analysis as a research area has attracted lots of interest over the last decade. The traffic data collected for analysis are usually stored in plain files and the analysis tools consist of customized scripts each tailored for a specific task. As data are often collected over a longer period of time or from different vantage points, it is important to keep metadata that describe the data collected. The use of separate files to store the data, the metadata, and the analysis scripts provides an abstraction that is much too primitive. The information that "glues" these different files together is not made explicit but is solely in the heads of the people involved in the activity. As a consequence, manipulating the data is very cumbersome, does not scale, and severely limits the way these data can be analyzed. We propose to use a database management system (DBMS) that provides the infrastructure for the analysis and management of data from measurements, related metadata, and obtained results. We discuss the problems and limitations with today's approaches, describe our ideas, and demonstrate how our DBMS-based solution, called InTraBase, addresses these problems and limitations. We present the first version of our prototype and preliminary performance analysis results.
{"title":"InTraBase: integrated traffic analysis based on a database management system","authors":"M. Siekkinen, E. Biersack, G. Urvoy-Keller, V. Goebel, T. Plagemann","doi":"10.1109/E2EMON.2005.1564467","DOIUrl":"https://doi.org/10.1109/E2EMON.2005.1564467","url":null,"abstract":"Internet traffic analysis as a research area has attracted lots of interest over the last decade. The traffic data collected for analysis are usually stored in plain files and the analysis tools consist of customized scripts each tailored for a specific task. As data are often collected over a longer period of time or from different vantage points, it is important to keep metadata that describe the data collected. The use of separate files to store the data, the metadata, and the analysis scripts provides an abstraction that is much too primitive. The information that \"glues\" these different files together is not made explicit but is solely in the heads of the people involved in the activity. As a consequence, manipulating the data is very cumbersome, does not scale, and severely limits the way these data can be analyzed. We propose to use a database management system (DBMS) that provides the infrastructure for the analysis and management of data from measurements, related metadata, and obtained results. We discuss the problems and limitations with today's approaches, describe our ideas, and demonstrate how our DBMS-based solution, called InTraBase, addresses these problems and limitations. We present the first version of our prototype and preliminary performance analysis results.","PeriodicalId":354965,"journal":{"name":"Workshop on End-to-End Monitoring Techniques and Services, 2005.","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128742327","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 : 2005-05-15DOI: 10.1109/E2EMON.2005.1564475
Ju-Won Park, Sangwoo Han, JongWon Kim
As the demand for high-quality real-time media service through multicast-enabled AG (access grid) increases, the end-to-end QoS (quality of service) provisioning of the media service has become very important. To guarantee the end-to-end QoS, it is essential to monitor the time-varying status of both network (i.e., delay, jitter and loss) and system metrics (i.e., CPU and memory utilization). In this paper, we propose a new service for the AG, to monitor the time-varying conditions of both multicast networks and the AG node systems. When the performance of the AG degrades, the proposed monitoring attempts to pinpoint the cause of performance degradation and explores corresponding reactions to improve the end-to-end performance of the AG. The experimental results show that the proposed monitoring service is really useful in improving the quality of media service for the AG.
{"title":"End-to-end monitoring service for multicast-based high-quality real-time media delivery","authors":"Ju-Won Park, Sangwoo Han, JongWon Kim","doi":"10.1109/E2EMON.2005.1564475","DOIUrl":"https://doi.org/10.1109/E2EMON.2005.1564475","url":null,"abstract":"As the demand for high-quality real-time media service through multicast-enabled AG (access grid) increases, the end-to-end QoS (quality of service) provisioning of the media service has become very important. To guarantee the end-to-end QoS, it is essential to monitor the time-varying status of both network (i.e., delay, jitter and loss) and system metrics (i.e., CPU and memory utilization). In this paper, we propose a new service for the AG, to monitor the time-varying conditions of both multicast networks and the AG node systems. When the performance of the AG degrades, the proposed monitoring attempts to pinpoint the cause of performance degradation and explores corresponding reactions to improve the end-to-end performance of the AG. The experimental results show that the proposed monitoring service is really useful in improving the quality of media service for the AG.","PeriodicalId":354965,"journal":{"name":"Workshop on End-to-End Monitoring Techniques and Services, 2005.","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131760540","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 : 2005-05-15DOI: 10.1109/E2EMON.2005.1564474
I. J. Niño, B. D. L. Ossa, J. A. Gil, J. Sahuquillo, A. Pont
Web user behavior has widely changed over the last years. To perform precise and up-to-date Web user behavior characterization is important to carry out representative Web performance studies. In this sense, it is valuable to capture detailed information about the user's experience, which permits to perform a fine grain characterization. Two main types of tools are distinguishable: complex commercial software tools like workload generators and academic tools. The latter mainly concentrate on the development of windows applications which gather Web events (e.g., browser events) or tools modifying a part of the web browser rode. In this paper, we present CARENA, a client-side browser-embedded tool to capture and replay user navigation sessions. Like some commercial software packages our tool captures information about the user session, which can be used later to replay or mimic the gathered user navigation. Nevertheless, unlike these software packages, our tool emulates the original user think times since these times are important to obtain precise and reliable performance results. Among the main features of CARENA are: multiplatform, open source, lightweight, standards based, easily installable and usable, programmed in JavaScript and XUL.
{"title":"CARENA: a tool to capture and replay Web navigation sessions","authors":"I. J. Niño, B. D. L. Ossa, J. A. Gil, J. Sahuquillo, A. Pont","doi":"10.1109/E2EMON.2005.1564474","DOIUrl":"https://doi.org/10.1109/E2EMON.2005.1564474","url":null,"abstract":"Web user behavior has widely changed over the last years. To perform precise and up-to-date Web user behavior characterization is important to carry out representative Web performance studies. In this sense, it is valuable to capture detailed information about the user's experience, which permits to perform a fine grain characterization. Two main types of tools are distinguishable: complex commercial software tools like workload generators and academic tools. The latter mainly concentrate on the development of windows applications which gather Web events (e.g., browser events) or tools modifying a part of the web browser rode. In this paper, we present CARENA, a client-side browser-embedded tool to capture and replay user navigation sessions. Like some commercial software packages our tool captures information about the user session, which can be used later to replay or mimic the gathered user navigation. Nevertheless, unlike these software packages, our tool emulates the original user think times since these times are important to obtain precise and reliable performance results. Among the main features of CARENA are: multiplatform, open source, lightweight, standards based, easily installable and usable, programmed in JavaScript and XUL.","PeriodicalId":354965,"journal":{"name":"Workshop on End-to-End Monitoring Techniques and Services, 2005.","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117269624","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 : 2005-05-15DOI: 10.1109/e2emon.2005.1564465
C. Elster, D. Raz, R. Wolff
Verifying that each flow in the network satisfies its QoS requirements is one of the biggest scalability challenges in the current DiffServ architecture. This task is usually performed by a centralized allocation entity that monitors the flows' QoS parameters. Efficient detection of problematic flows is even more challenging when considering aggregated information such as the end to end delay suffered by packets belonging to a specific flow. Known oblivious and reactive monitoring techniques do not scale well when the number of flows and the length of their paths increase, and when the network load increases. This is due both to load on the centralized bandwidth allocation entity and to the excessive number of monitoring and control messages needed. We propose a new monitoring paradigm termed autonomous monitoring, in which the network itself (i.e. the routers along the flow path) is responsible to discover when a violation of the SLA occurs (or is soon to occur). Only in such cases the centralized allocation entity is notified, and can take the required actions. We study the performance of this new distributed algorithm through theoretical analysis and extensive simulations. Our results indicate that in addition to dramatically reducing the load from the centralized allocation entity, the amount of network traffic needed is relatively small and thus the new monitoring scheme scales well.
{"title":"Autonomous end to end QoS monitoring","authors":"C. Elster, D. Raz, R. Wolff","doi":"10.1109/e2emon.2005.1564465","DOIUrl":"https://doi.org/10.1109/e2emon.2005.1564465","url":null,"abstract":"Verifying that each flow in the network satisfies its QoS requirements is one of the biggest scalability challenges in the current DiffServ architecture. This task is usually performed by a centralized allocation entity that monitors the flows' QoS parameters. Efficient detection of problematic flows is even more challenging when considering aggregated information such as the end to end delay suffered by packets belonging to a specific flow. Known oblivious and reactive monitoring techniques do not scale well when the number of flows and the length of their paths increase, and when the network load increases. This is due both to load on the centralized bandwidth allocation entity and to the excessive number of monitoring and control messages needed. We propose a new monitoring paradigm termed autonomous monitoring, in which the network itself (i.e. the routers along the flow path) is responsible to discover when a violation of the SLA occurs (or is soon to occur). Only in such cases the centralized allocation entity is notified, and can take the required actions. We study the performance of this new distributed algorithm through theoretical analysis and extensive simulations. Our results indicate that in addition to dramatically reducing the load from the centralized allocation entity, the amount of network traffic needed is relatively small and thus the new monitoring scheme scales well.","PeriodicalId":354965,"journal":{"name":"Workshop on End-to-End Monitoring Techniques and Services, 2005.","volume":"54 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120879419","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
扫码关注我们
求助内容：
应助结果提醒方式：