Pub Date : 2004-04-23DOI: 10.1109/NOMS.2004.1317640
B. Simmons, H. Lutfiyya
Quality of service (QoS) requirements refer to non-functional, run-time requirements such as performance. Different applications have different QoS requirements and hence different resource needs. Differentiated services (DiffServ) from the IETF allows the network to treat IP packets differently based on a service class. The paper describes a policy-based QoS management system that allows for a change in the treatment of packets from a specific flow using DiffServ. The decision to change is based on a number of things, including the monitoring of the application's behavior (referred to as application feedback). Corrective actions include changing the service class and/or target bandwidth. The paper provides a description of the policy-based QoS management system used and experimental results.
{"title":"Using application feedback in differentiated services and policies","authors":"B. Simmons, H. Lutfiyya","doi":"10.1109/NOMS.2004.1317640","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317640","url":null,"abstract":"Quality of service (QoS) requirements refer to non-functional, run-time requirements such as performance. Different applications have different QoS requirements and hence different resource needs. Differentiated services (DiffServ) from the IETF allows the network to treat IP packets differently based on a service class. The paper describes a policy-based QoS management system that allows for a change in the treatment of packets from a specific flow using DiffServ. The decision to change is based on a number of things, including the monitoring of the application's behavior (referred to as application feedback). Corrective actions include changing the service class and/or target bandwidth. The paper provides a description of the policy-based QoS management system used and experimental results.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114829673","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 : 2004-04-23DOI: 10.1109/NOMS.2004.1317748
L. Colitti, G. Battista, M. Patrignani
Tunnels are widely used to improve security and to expand networks without having to deploy native infrastructure, and play an important role in the migration to IPv6. In this paper we introduce a number of techniques to detect, and collect information about IPv6-in-IPv4 tunnels. We also show how a known tunnel can be used as a "vantage point" to launch third-party tunnel-discovery explorations, scaling up the discovery process. We describe our Tunneltrace tool, which implements the proposed techniques, and validate them by means of a wide experimentation on the 6bone tunneled network, on the GARR network, and through the test boxes deployed worldwide by the RIPE NCC as part of the Test Traffic Measurements Service. We assess to what extent 6bone registry information is coherent with the actual network topology, and we provide the first experimental results on the current distribution of IPv6-in-IPv4 tunnels in the Internet, showing that even "native" networks reach more than 60% of all IPv6 prefixes through tunnels.
{"title":"Discovering IPv6-in-IPv4 tunnels in the Internet","authors":"L. Colitti, G. Battista, M. Patrignani","doi":"10.1109/NOMS.2004.1317748","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317748","url":null,"abstract":"Tunnels are widely used to improve security and to expand networks without having to deploy native infrastructure, and play an important role in the migration to IPv6. In this paper we introduce a number of techniques to detect, and collect information about IPv6-in-IPv4 tunnels. We also show how a known tunnel can be used as a \"vantage point\" to launch third-party tunnel-discovery explorations, scaling up the discovery process. We describe our Tunneltrace tool, which implements the proposed techniques, and validate them by means of a wide experimentation on the 6bone tunneled network, on the GARR network, and through the test boxes deployed worldwide by the RIPE NCC as part of the Test Traffic Measurements Service. We assess to what extent 6bone registry information is coherent with the actual network topology, and we provide the first experimental results on the current distribution of IPv6-in-IPv4 tunnels in the Internet, showing that even \"native\" networks reach more than 60% of all IPv6 prefixes through tunnels.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114893242","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 : 2004-04-23DOI: 10.1109/NOMS.2004.1317760
A. Corrente, Luigi Tura
SNMPv3 has just become a full standard and more and more the scientific community and the market are looking for information on its performance and related new built-in authentication and privacy features. It is sure that SNMPv3 security services (authentication and privacy) require additional CPU usage, memory and message exchange which could cause consistent performance degradation. In order to understand if performance issue could be an obstacle for the wide deployment of SNMPv3 in the commercial world, a set of measurements have been done and presented in this paper. The research evaluates the impact experienced by the network appliance, due to the computational load added by the message authentication and encryption, and analyzes the variation of the protocol overhead at different security levels introduced by SNMPv3. This work shows the results of a set of performance measurements done both with SNMPv2c and SNMPv3 managers in order to acquire results with respect to processing time, number of transactions per minute, CPU usage and protocol overhead. We discovered that SNMPv3 introduces a progressive computational load as soon as it uses security function but this additional load seems still acceptable, but if the discovery process is not implemented carefully, then the extra load becomes prohibitive. This paper suggests a way to minimize the extra load introduced by the discovery process, thereby improving protocol performance.
{"title":"Security performance analysis of SNMPv3 with respect to SNMPv2c","authors":"A. Corrente, Luigi Tura","doi":"10.1109/NOMS.2004.1317760","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317760","url":null,"abstract":"SNMPv3 has just become a full standard and more and more the scientific community and the market are looking for information on its performance and related new built-in authentication and privacy features. It is sure that SNMPv3 security services (authentication and privacy) require additional CPU usage, memory and message exchange which could cause consistent performance degradation. In order to understand if performance issue could be an obstacle for the wide deployment of SNMPv3 in the commercial world, a set of measurements have been done and presented in this paper. The research evaluates the impact experienced by the network appliance, due to the computational load added by the message authentication and encryption, and analyzes the variation of the protocol overhead at different security levels introduced by SNMPv3. This work shows the results of a set of performance measurements done both with SNMPv2c and SNMPv3 managers in order to acquire results with respect to processing time, number of transactions per minute, CPU usage and protocol overhead. We discovered that SNMPv3 introduces a progressive computational load as soon as it uses security function but this additional load seems still acceptable, but if the discovery process is not implemented carefully, then the extra load becomes prohibitive. This paper suggests a way to minimize the extra load introduced by the discovery process, thereby improving protocol performance.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116684326","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 : 2004-04-23DOI: 10.1109/NOMS.2004.1317683
T. Hamada, Kaoru Chujo, T. Chujo, Xiangying Yang
We report studies on peer-to-peer (P2P) traffic analysis, modeling, and evaluation of policies for the management P2P traffic in metropolitan networks. We conducted crawler-based measurement and analysis of P2P traffic using Gnutella. Based on the empirical parameters obtained through the measurement, known modeling techniques of P2P peers and contents, and GeoPoint, a geomapping technology, we built a P2P traffic simulator using J-Sim, a Java-based network simulation tool. The simulator is scenario-driven, allowing its user to customize network settings and service environment to examine the behavior of P2P traffic. With the P2P simulator, we were able to recreate a spatio-temporal traffic pattern characteristic to P2P services observed in August 2002. We then evaluated three different P2P traffic management policies, showing that traffic localization using a peer selection policy at super peers is possible, containing P2P traffic to the local metropolitan network as much as 40%.
{"title":"Peer-to-peer traffic in metro networks: analysis, modeling, and policies","authors":"T. Hamada, Kaoru Chujo, T. Chujo, Xiangying Yang","doi":"10.1109/NOMS.2004.1317683","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317683","url":null,"abstract":"We report studies on peer-to-peer (P2P) traffic analysis, modeling, and evaluation of policies for the management P2P traffic in metropolitan networks. We conducted crawler-based measurement and analysis of P2P traffic using Gnutella. Based on the empirical parameters obtained through the measurement, known modeling techniques of P2P peers and contents, and GeoPoint, a geomapping technology, we built a P2P traffic simulator using J-Sim, a Java-based network simulation tool. The simulator is scenario-driven, allowing its user to customize network settings and service environment to examine the behavior of P2P traffic. With the P2P simulator, we were able to recreate a spatio-temporal traffic pattern characteristic to P2P services observed in August 2002. We then evaluated three different P2P traffic management policies, showing that traffic localization using a peer selection policy at super peers is possible, containing P2P traffic to the local metropolitan network as much as 40%.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123873969","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 : 2004-04-23DOI: 10.1109/NOMS.2004.1317662
Archana Pasupulati, Jason Coit, K. Levitt, S. F. Wu, S. Li, J. Kuo, K. Fan
Attack polymorphism is a powerful tool for the attackers in the Internet to evade signature-based intrusion detection/prevention systems. In addition, new and faster Internet worms can be coded and launched easily by even high school students anytime against our critical infrastructures, such as DNS or update servers. We believe that polymorphic Internet worms will be developed in the future such that many of our current solutions might have a very small chance to survive. In this paper, we propose a simple solution called "Buttercup" to counter against attacks based on buffer-overflow exploits (such as CodeRed, Nimda, Slammer, and Blaster). We have implemented our idea in SNORT, and included 19 return address ranges of buffer-overflow exploits. With a suite of tests against 55 TCPdump traces, the false positive rate for our best algorithm is as low as 0.01%. This indicates that, potentially, Buttercup can drop 100% worm attack packets on the wire while only 0.01% of the good packets will be sacrificed.
{"title":"Buttercup: on network-based detection of polymorphic buffer overflow vulnerabilities","authors":"Archana Pasupulati, Jason Coit, K. Levitt, S. F. Wu, S. Li, J. Kuo, K. Fan","doi":"10.1109/NOMS.2004.1317662","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317662","url":null,"abstract":"Attack polymorphism is a powerful tool for the attackers in the Internet to evade signature-based intrusion detection/prevention systems. In addition, new and faster Internet worms can be coded and launched easily by even high school students anytime against our critical infrastructures, such as DNS or update servers. We believe that polymorphic Internet worms will be developed in the future such that many of our current solutions might have a very small chance to survive. In this paper, we propose a simple solution called \"Buttercup\" to counter against attacks based on buffer-overflow exploits (such as CodeRed, Nimda, Slammer, and Blaster). We have implemented our idea in SNORT, and included 19 return address ranges of buffer-overflow exploits. With a suite of tests against 55 TCPdump traces, the false positive rate for our best algorithm is as low as 0.01%. This indicates that, potentially, Buttercup can drop 100% worm attack packets on the wire while only 0.01% of the good packets will be sacrificed.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117198636","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 : 2004-04-23DOI: 10.1109/NOMS.2004.1317743
Junseok Hwang, J. Altmann, I. T. Okumus, Praveen Aravamudham
In this paper, we present an Internet transaction management system for sender/receiver payment schemes. This system allows an arbitrary split of transaction charges between two communication partners. Using this kind of system, new business models can be implemented on the Internet. The new system provides more flexibility than existing charging schemes. Under these new business models, service providers can pick up a share of the cost for the transaction with any of their customers; offer collect-call type of services; or provide services such as the 900 services on the telephone network. This paper describes in detail the transaction management protocol (TMP), its implementation, and the transaction management service platform (TMS). The TMP specifies the protocol state diagram as well as the process of how the costs for resource usage can be allocated to communicating end-users. The TMS platform defines the architecture and the modules, simplifying the implementation of the TMP on the Internet. The TMS provides a module-based transaction management environment, carrying transaction signals such as message schema, accounting policy information, communication reference information, and end-user agreement information. In addition to this, an application of the TMS within the framework of bandwidth broker interconnection networks and a short evaluation of the proposed transaction management system are given.
{"title":"Transaction management for sender/receiver-payment schemes in charging and accounting systems for interconnected networks","authors":"Junseok Hwang, J. Altmann, I. T. Okumus, Praveen Aravamudham","doi":"10.1109/NOMS.2004.1317743","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317743","url":null,"abstract":"In this paper, we present an Internet transaction management system for sender/receiver payment schemes. This system allows an arbitrary split of transaction charges between two communication partners. Using this kind of system, new business models can be implemented on the Internet. The new system provides more flexibility than existing charging schemes. Under these new business models, service providers can pick up a share of the cost for the transaction with any of their customers; offer collect-call type of services; or provide services such as the 900 services on the telephone network. This paper describes in detail the transaction management protocol (TMP), its implementation, and the transaction management service platform (TMS). The TMP specifies the protocol state diagram as well as the process of how the costs for resource usage can be allocated to communicating end-users. The TMS platform defines the architecture and the modules, simplifying the implementation of the TMP on the Internet. The TMS provides a module-based transaction management environment, carrying transaction signals such as message schema, accounting policy information, communication reference information, and end-user agreement information. In addition to this, an application of the TMS within the framework of bandwidth broker interconnection networks and a short evaluation of the proposed transaction management system are given.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130742221","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 : 2004-04-23DOI: 10.1109/NOMS.2004.1317759
R. Neisse, R. Vianna, L. Granville, M. Almeida, L. Tarouco
Web services gateways are needed to include SNMP devices into a Web services based management architecture. We propose in this paper two approaches for such gateways and evaluate these approaches in order to verify the feasibility of using Web services closer to the network devices interface. We primarily tested the bandwidth consumed by these gateways when using SOAP with HTTP, HTTPS, and a compression process. The evaluation shows that Web services gateways are especially interesting when the number of SNMP object instances retrieved is high.
{"title":"Implementation and bandwidth consumption evaluation of SNMP to Web services gateways","authors":"R. Neisse, R. Vianna, L. Granville, M. Almeida, L. Tarouco","doi":"10.1109/NOMS.2004.1317759","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317759","url":null,"abstract":"Web services gateways are needed to include SNMP devices into a Web services based management architecture. We propose in this paper two approaches for such gateways and evaluate these approaches in order to verify the feasibility of using Web services closer to the network devices interface. We primarily tested the bandwidth consumed by these gateways when using SOAP with HTTP, HTTPS, and a compression process. The evaluation shows that Web services gateways are especially interesting when the number of SNMP object instances retrieved is high.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131756376","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 : 2004-04-23DOI: 10.1109/NOMS.2004.1317755
G. Lehr, U. Degenhardt, R. Geerdsen, G. Ricucci, U. Pauluhn, P. Cortes, J. Maierhofer
Automatic switched transport networks provide innovative functionality such as configuration of connections via signaling and routing functionality implemented in a control plane. This paper describes a management concept that has been tailored to the specific needs of this novel network technology which brings together transport network and IP-based paradigms. The concept proposed comprises a network and a network element level information model where the latter is subdivided into two representations of this model. The first representation communicates with the agent implementation and uses the concepts and terminology derived from IP/MPLS. The second representation communicates with the network level management system and talks the language of M.3100 that is the guiding principle for transport networks. This approach allows to combine the best of both paradigms and reuse existing specifications thus fostering the interoperability of future management systems for ASTN.
{"title":"A management concept for automatic switched transport networks (ASTNs)","authors":"G. Lehr, U. Degenhardt, R. Geerdsen, G. Ricucci, U. Pauluhn, P. Cortes, J. Maierhofer","doi":"10.1109/NOMS.2004.1317755","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317755","url":null,"abstract":"Automatic switched transport networks provide innovative functionality such as configuration of connections via signaling and routing functionality implemented in a control plane. This paper describes a management concept that has been tailored to the specific needs of this novel network technology which brings together transport network and IP-based paradigms. The concept proposed comprises a network and a network element level information model where the latter is subdivided into two representations of this model. The first representation communicates with the agent implementation and uses the concepts and terminology derived from IP/MPLS. The second representation communicates with the network level management system and talks the language of M.3100 that is the guiding principle for transport networks. This approach allows to combine the best of both paradigms and reuse existing specifications thus fostering the interoperability of future management systems for ASTN.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131215026","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 : 2004-04-23DOI: 10.1109/NOMS.2004.1317852
T. Tonouchi, T. Igakura, Naoto Maeda, Y. Kiriha
A policy management technology is one of promising technologies for the management of networking systems, which are getting complex and difficult to manage. Conventional policy languages provide a flat policy mechanism, under which all policy rules are always active. We argue that not all policy rules should be active in all situations. Some are defined for a certain situation and others for a different situation. For example, the set of active policy rules at office hours are different from those at off-time. We propose a policy transition mechanism, which modifies active policy groups, depending on a situation. As a result, we can achieve management depending on a change in the situation while the flat policy mechanism cannot.
{"title":"Policy transition mechanism: a new approach to multi-mode management","authors":"T. Tonouchi, T. Igakura, Naoto Maeda, Y. Kiriha","doi":"10.1109/NOMS.2004.1317852","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317852","url":null,"abstract":"A policy management technology is one of promising technologies for the management of networking systems, which are getting complex and difficult to manage. Conventional policy languages provide a flat policy mechanism, under which all policy rules are always active. We argue that not all policy rules should be active in all situations. Some are defined for a certain situation and others for a different situation. For example, the set of active policy rules at office hours are different from those at off-time. We propose a policy transition mechanism, which modifies active policy groups, depending on a situation. As a result, we can achieve management depending on a change in the situation while the flat policy mechanism cannot.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123465504","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 : 2004-04-23DOI: 10.1109/NOMS.2004.1317649
Jie Gao, G. Kar, P. Kermani
Typical distributed transaction environments are a heterogeneous collection of hardware and software resources. An example of such an environment is an electronic store front where users can launch a number of different transactions to complete one or more interactions with the system. One of the challenges in managing such an environment is to figure out the root cause of a performance or throughput problem that manifests itself at a user access point, and to take appropriate action, preferably in an automated way. Our paper addresses this problem by analyzing the dependency relationship among various software components. We also provide a theoretical insight into how a set of transactions can be generated to pinpoint the root cause of a performance problem that is manifested at the user access point.
{"title":"Approaches to building self healing systems using dependency analysis","authors":"Jie Gao, G. Kar, P. Kermani","doi":"10.1109/NOMS.2004.1317649","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317649","url":null,"abstract":"Typical distributed transaction environments are a heterogeneous collection of hardware and software resources. An example of such an environment is an electronic store front where users can launch a number of different transactions to complete one or more interactions with the system. One of the challenges in managing such an environment is to figure out the root cause of a performance or throughput problem that manifests itself at a user access point, and to take appropriate action, preferably in an automated way. Our paper addresses this problem by analyzing the dependency relationship among various software components. We also provide a theoretical insight into how a set of transactions can be generated to pinpoint the root cause of a performance problem that is manifested at the user access point.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128696192","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
扫码关注我们
求助内容：
应助结果提醒方式：