Pub Date : 2004-04-23DOI: 10.1109/NOMS.2004.1317792
M. Miyagi, K. Ohkubo, Mikio Kataoka, S. Yoshizawa
Since there are many causes that can affect Web response time, it is difficult to predict. NetForecast Inc. has proposed a formula to calculate the response time of an application over the TCP/IP layer. This paper proposes a method to generate a probability function for the response time by using NetForecast's formula. This calculation method uses two input parameters: the file-size cumulative distribution function (CDF) and the delay probability density function (PDF). In the formula, the data sampled from the file-size CDF is input as the payload-length parameter, and the data sampled from the delay PDF is input as the round-trip delay parameter. Processing these parameters using the performance prediction method, we can generate the response-time CDF.
{"title":"Performance prediction method for Web-access response time distribution using formula","authors":"M. Miyagi, K. Ohkubo, Mikio Kataoka, S. Yoshizawa","doi":"10.1109/NOMS.2004.1317792","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317792","url":null,"abstract":"Since there are many causes that can affect Web response time, it is difficult to predict. NetForecast Inc. has proposed a formula to calculate the response time of an application over the TCP/IP layer. This paper proposes a method to generate a probability function for the response time by using NetForecast's formula. This calculation method uses two input parameters: the file-size cumulative distribution function (CDF) and the delay probability density function (PDF). In the formula, the data sampled from the file-size CDF is input as the payload-length parameter, and the data sampled from the delay PDF is input as the round-trip delay parameter. Processing these parameters using the performance prediction method, we can generate the response-time CDF.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"608 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":"116465173","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.1317855
Yao Chen, Yanyan Yang
Intrusion detection and prevention systems are becoming an essential part of network infrastructure. They provide the ability to detect intrusion signatures or discover abnormal behaviors, and thus trigger actions. The actions are performed to preempt ongoing attacks as well as to prevent future intrusions. In the past, intrusion detection technology is mainly deployed as sensors that passively monitor traffic to detect symptoms that indicate attacks or their prelude. However, recent Internet worms and distributed denial-of-service attacks have shown that such passive detection is not timely enough in coping with network-based attacks. Thus, the recent trend is to integrate detection and prevention technologies into security firewalls, and deploy the technologies as active components in the network infrastructure. This poses a new challenge for network operation and policy management. The objective of this paper is to provide a framework for managing related policies in an enterprise-networking environment. Specifically, we propose a framework called attack-response matrix (ARM), to integrate intrusion analysis with traffic enforcement for security purposes. ARM describes the mapping from intrusion types to traffic enforcement actions. It allows policies to dictate what actions to take on what types or stages of attacks. It is intuitive, and introduces a paradigm shift from flat detection rules to a structural representation that better describes an intrusion prevention system (IPS). It can be integrated with the framework of policy-based management, using policy decision points (i.e. PDP) and policy enforcement points (i.e. PEP), to configure, enforce, update and monitor intrusion prevention devices in the network. In the paper, we also point out related research issues, such as the chaining of prevention actions and the self-correction of traffic enforcement policies.
{"title":"Policy management for network-based intrusion detection and prevention","authors":"Yao Chen, Yanyan Yang","doi":"10.1109/NOMS.2004.1317855","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317855","url":null,"abstract":"Intrusion detection and prevention systems are becoming an essential part of network infrastructure. They provide the ability to detect intrusion signatures or discover abnormal behaviors, and thus trigger actions. The actions are performed to preempt ongoing attacks as well as to prevent future intrusions. In the past, intrusion detection technology is mainly deployed as sensors that passively monitor traffic to detect symptoms that indicate attacks or their prelude. However, recent Internet worms and distributed denial-of-service attacks have shown that such passive detection is not timely enough in coping with network-based attacks. Thus, the recent trend is to integrate detection and prevention technologies into security firewalls, and deploy the technologies as active components in the network infrastructure. This poses a new challenge for network operation and policy management. The objective of this paper is to provide a framework for managing related policies in an enterprise-networking environment. Specifically, we propose a framework called attack-response matrix (ARM), to integrate intrusion analysis with traffic enforcement for security purposes. ARM describes the mapping from intrusion types to traffic enforcement actions. It allows policies to dictate what actions to take on what types or stages of attacks. It is intuitive, and introduces a paradigm shift from flat detection rules to a structural representation that better describes an intrusion prevention system (IPS). It can be integrated with the framework of policy-based management, using policy decision points (i.e. PDP) and policy enforcement points (i.e. PEP), to configure, enforce, update and monitor intrusion prevention devices in the network. In the paper, we also point out related research issues, such as the chaining of prevention actions and the self-correction of traffic enforcement policies.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"35 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":"116641188","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.1317656
D. Hong, C. Hong, Dong-Sik Yun
The paper proposes a hierarchical restoration scheme that can be applied to the restoration of working label switched paths (LSPs) and pre-provisioned backup LSPs. Our hierarchical restoration scheme is composed of two subsequent algorithms, one to determine the reasonable restoration scope (RS) and the other to compute an optimal alternative path that avoids the fault location. The first algorithm for dynamic RS determination increases the restoration speed by minimizing the complexity of the network topology for restoration as soon as possible. By increasing the reusability of the existing path, we can minimize the length of the new alternative path. In addition, the newly proposed concept of the hierarchical RS extension minimizes the probability of restoration failure by dynamically widening the restoration scope until the RS is equal to the whole network topology. Through simulation, we evaluate the performance of our restoration scheme and existing protection schemes (Huang, C. et al., 2000; Haskin, D. and Krishnan, R., 2000) in terms of the restoration speed, packet loss, network resource utilization, and resource reusability of the existing working LSP.
本文提出了一种分层恢复方案，可用于恢复工作标签交换路径(lsp)和预发放的备份lsp。我们的分层恢复方案由两个后续算法组成，一个是确定合理的恢复范围(RS)，另一个是计算避免故障定位的最优替代路径。第一种动态RS确定算法通过最小化网络拓扑的复杂性来提高恢复速度，以便尽快恢复。通过增加现有路径的可重用性，我们可以最小化新的备选路径的长度。此外，新提出的分层RS扩展概念通过动态扩大恢复范围，使恢复失败的概率最小化，直到RS等于整个网络拓扑。通过模拟，我们评估了我们的修复方案和现有保护方案的性能(Huang, C. et al.， 2000;Haskin, D.和Krishnan, R.， 2000)在恢复速度、丢包、网络资源利用率和现有工作LSP的资源可重用性方面进行了研究。
{"title":"A hierarchical restoration scheme with dynamic adjustment of restoration scope in an MPLS network","authors":"D. Hong, C. Hong, Dong-Sik Yun","doi":"10.1109/NOMS.2004.1317656","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317656","url":null,"abstract":"The paper proposes a hierarchical restoration scheme that can be applied to the restoration of working label switched paths (LSPs) and pre-provisioned backup LSPs. Our hierarchical restoration scheme is composed of two subsequent algorithms, one to determine the reasonable restoration scope (RS) and the other to compute an optimal alternative path that avoids the fault location. The first algorithm for dynamic RS determination increases the restoration speed by minimizing the complexity of the network topology for restoration as soon as possible. By increasing the reusability of the existing path, we can minimize the length of the new alternative path. In addition, the newly proposed concept of the hierarchical RS extension minimizes the probability of restoration failure by dynamically widening the restoration scope until the RS is equal to the whole network topology. Through simulation, we evaluate the performance of our restoration scheme and existing protection schemes (Huang, C. et al., 2000; Haskin, D. and Krishnan, R., 2000) in terms of the restoration speed, packet loss, network resource utilization, and resource reusability of the existing working LSP.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"23 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":"121181151","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.1317742
M. V. Le, B. Beijnum, G. Huitema
Today, telematics services are often compositions of different chargeable service components offered by different service providers. To enhance component-based accounting and charging, the service composition information is used to match with the corresponding charging structure of a service session. This enables the sharing of revenues among the service providers, and calculation of the total cost for the end-user. When multiple independent service providers are involved, it is a great challenge to apply interim accounting and charging during a service session in order to minimize financial risks between business partners. Another interesting development is the trend towards outsourcing accounting and charging processes to specialized business partners. This requires a decoupling between provisioning and accounting and charging processes. In this paper, we propose a comprehensive component-based accounting and charging architecture to support service session provisioning across multiple domains. The architecture, modeled in UML, incorporates an interim accounting and charging mechanism to enable the processing and exchange of accounting information needed to update intermediate charges for separate service components and the user's credit, even during the service provisioning phase.
{"title":"A service component-based accounting and charging architecture to support interim mechanisms across multiple domains","authors":"M. V. Le, B. Beijnum, G. Huitema","doi":"10.1109/NOMS.2004.1317742","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317742","url":null,"abstract":"Today, telematics services are often compositions of different chargeable service components offered by different service providers. To enhance component-based accounting and charging, the service composition information is used to match with the corresponding charging structure of a service session. This enables the sharing of revenues among the service providers, and calculation of the total cost for the end-user. When multiple independent service providers are involved, it is a great challenge to apply interim accounting and charging during a service session in order to minimize financial risks between business partners. Another interesting development is the trend towards outsourcing accounting and charging processes to specialized business partners. This requires a decoupling between provisioning and accounting and charging processes. In this paper, we propose a comprehensive component-based accounting and charging architecture to support service session provisioning across multiple domains. The architecture, modeled in UML, incorporates an interim accounting and charging mechanism to enable the processing and exchange of accounting information needed to update intermediate charges for separate service components and the user's credit, even during the service provisioning phase.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"541 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":"129904291","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.1317749
Mohit Lad, Lixia Zhang, D. Massey
Failures at the BGP level can have significant impact on the overall Internet. Understanding the behavior of BGP is thus both an important practical challenge and an interesting research problem. To understand the true dynamics, and help interpret the multiple gigabytes of BGP log data, we have developed the "Link-Rank" graphical toolset. Link-Rank weighs the links between autonomous systems by the number of routing prefixes going through each link. Tracing these graphs over time results in a directed graph that shows the weight changes of the logical inter-AS links. From this graph one can easily visualise the complex BGP path changes and also combine views from multiple vantage points, to get a better picture of global routing dynamics. We illustrate the usefulness of Link-Rank by using it to examine BGP routing dynamics in three example cases. These examples show Link-Rank is able to help BGP analysts estimate the scope of routing changes and to reveal important routing dynamics in the presence of superfluous BGP update messages.
{"title":"Link-Rank: a graphical tool for capturing BGP routing dynamics","authors":"Mohit Lad, Lixia Zhang, D. Massey","doi":"10.1109/NOMS.2004.1317749","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317749","url":null,"abstract":"Failures at the BGP level can have significant impact on the overall Internet. Understanding the behavior of BGP is thus both an important practical challenge and an interesting research problem. To understand the true dynamics, and help interpret the multiple gigabytes of BGP log data, we have developed the \"Link-Rank\" graphical toolset. Link-Rank weighs the links between autonomous systems by the number of routing prefixes going through each link. Tracing these graphs over time results in a directed graph that shows the weight changes of the logical inter-AS links. From this graph one can easily visualise the complex BGP path changes and also combine views from multiple vantage points, to get a better picture of global routing dynamics. We illustrate the usefulness of Link-Rank by using it to examine BGP routing dynamics in three example cases. These examples show Link-Rank is able to help BGP analysts estimate the scope of routing changes and to reveal important routing dynamics in the presence of superfluous BGP update messages.","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":"133339959","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.1317658
Sang-Heon Shin, Hae-Joon Shin, Young-Tak Kim
We propose a packet lossless fast rerouting scheme at a link/node fault in an MPLS (multiprotocol label switching) network with a minimized buffer delay problem at the ingress node. The proposed scheme uses a predefined, alternative LSP (label switched path) in order to restore user traffic. We propose two restoration approaches: (i) an alternative LSP is initially allocated with more bandwidth than the protected working LSP, and, after failure recovery, the allocated bandwidth of the alternative LSP is readjusted to the bandwidth of the working LSP; (ii) the length of the protected working LSP is reduced by using segment-based restoration. In the proposed approaches, there is no buffer delay problem after failure recovery at the ingress node, and the required buffer size at the ingress node is smaller than the previous approach.
{"title":"Packet lossless fast rerouting scheme with minimized buffer delay","authors":"Sang-Heon Shin, Hae-Joon Shin, Young-Tak Kim","doi":"10.1109/NOMS.2004.1317658","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317658","url":null,"abstract":"We propose a packet lossless fast rerouting scheme at a link/node fault in an MPLS (multiprotocol label switching) network with a minimized buffer delay problem at the ingress node. The proposed scheme uses a predefined, alternative LSP (label switched path) in order to restore user traffic. We propose two restoration approaches: (i) an alternative LSP is initially allocated with more bandwidth than the protected working LSP, and, after failure recovery, the allocated bandwidth of the alternative LSP is readjusted to the bandwidth of the working LSP; (ii) the length of the protected working LSP is reduced by using segment-based restoration. In the proposed approaches, there is no buffer delay problem after failure recovery at the ingress node, and the required buffer size at the ingress node is smaller than the previous approach.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"29 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":"133439652","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.1317794
Ki-Young Jung, Miyi Hong
A softswitch (SSW) is the core element of the NGN (next generation network) in the call control and signaling layer. The SSW-EMS (element management system) manages the SSW itself as its basic function, and serves as a mediation device between NMS (network management system) and one or more SSWs. Existing SSW-EMS products can be categorized by two models. One only cares about the SSW itself and the other takes a role of integrated EMS for SSW and gateways (GW). Other servers manage their own NGN-element product lines (namely, NGN-EMS) including AS (application server) and MS (media server). Many products belong to the latter category. Some kinds of EMS take functions from the NMS by their features, such as correlating the faults from different NGN elements. The article looks at the design of NGN softswitch-element management systems.
{"title":"Design considerations for NGN softswitch-element management system","authors":"Ki-Young Jung, Miyi Hong","doi":"10.1109/NOMS.2004.1317794","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317794","url":null,"abstract":"A softswitch (SSW) is the core element of the NGN (next generation network) in the call control and signaling layer. The SSW-EMS (element management system) manages the SSW itself as its basic function, and serves as a mediation device between NMS (network management system) and one or more SSWs. Existing SSW-EMS products can be categorized by two models. One only cares about the SSW itself and the other takes a role of integrated EMS for SSW and gateways (GW). Other servers manage their own NGN-element product lines (namely, NGN-EMS) including AS (application server) and MS (media server). Many products belong to the latter category. Some kinds of EMS take functions from the NMS by their features, such as correlating the faults from different NGN elements. The article looks at the design of NGN softswitch-element management systems.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"13 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":"131620023","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.1317787
Joaquin Jose Silva Tobella, M. Stiemerling, M. Brunner
Self-configuration of networks is the key to reducing operational costs and enhancing usability for inexperienced users. Various network technologies already perform self-configuration. For example, Ethernet is self-configuring. Since more and more networks are based on IP, and IP is used everywhere, IP routers must get to a state where they are plug-and-play as well. Naturally, this is not true for managed backbone or multi-service networks, but a high number of small to medium size businesses and home users do not want to deal with the hassle of configuring their networks and most of them are not able to. We propose a protocol for self-configuration of IPv6 networks.
{"title":"Towards self-configuration of IPv6 networks","authors":"Joaquin Jose Silva Tobella, M. Stiemerling, M. Brunner","doi":"10.1109/NOMS.2004.1317787","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317787","url":null,"abstract":"Self-configuration of networks is the key to reducing operational costs and enhancing usability for inexperienced users. Various network technologies already perform self-configuration. For example, Ethernet is self-configuring. Since more and more networks are based on IP, and IP is used everywhere, IP routers must get to a state where they are plug-and-play as well. Naturally, this is not true for managed backbone or multi-service networks, but a high number of small to medium size businesses and home users do not want to deal with the hassle of configuring their networks and most of them are not able to. We propose a protocol for self-configuration of IPv6 networks.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"90 10 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":"132486287","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.1317837
D. Milham, E. Ronco
One of the most interesting and valuable initiatives of the TeleManagement Forum (http://www.tmforum.org) for Information and Communications Service Providers (ICSP), is the definition and development of the enhanced Telecom Operations Map® (eTOM) Business Process Framework [1], [2], [3]. In this paper we cover three main aspects: ○ Description of the eTOM, its background, & the recent B2B enhancements for Information and Communications Service Providers (ICSPs); ○ How the eTOM may be used, including case studies; ○ The future challenges for the eTOM Framework covering: enhancements to the eTOM to take account of the changing ICT (Information Communication and Technology) market; Impact of Next Generation Networking Technologies; and the move towards service based ICT business models. Moreover details will be provided on the changes that will be necessary as the model matures and evolves toward the use of second generation Business Process Modeling principles [4]. The eTOM was developed within TeleManagement Forum (TMF) in the Fall 2000 -Spring 2002 timeframe, and was approved by TMF in June 2002. The eTOM framework (v 3.6) was submitted to ITU-T in September 2003. This presentation has been prepared by two members of the TMF eTOM team, with the approval of the TeleManagement Forum. We would like to acknowledge that the work has been a team effort from some of the most relevant talents representing all geographic regions, service providers, system integrators, consultants, defense organizations, independent software vendors and network equipment vendors. Without such a broad range of knowledge and talent an endeavor of this complexity could not have be tackled successfully.
{"title":"How can the eTOM framework help service providers in today's marketplace?","authors":"D. Milham, E. Ronco","doi":"10.1109/NOMS.2004.1317837","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317837","url":null,"abstract":"One of the most interesting and valuable initiatives of the TeleManagement Forum (http://www.tmforum.org) for Information and Communications Service Providers (ICSP), is the definition and development of the enhanced Telecom Operations Map® (eTOM) Business Process Framework [1], [2], [3]. In this paper we cover three main aspects: ○ Description of the eTOM, its background, & the recent B2B enhancements for Information and Communications Service Providers (ICSPs); ○ How the eTOM may be used, including case studies; ○ The future challenges for the eTOM Framework covering: enhancements to the eTOM to take account of the changing ICT (Information Communication and Technology) market; Impact of Next Generation Networking Technologies; and the move towards service based ICT business models. Moreover details will be provided on the changes that will be necessary as the model matures and evolves toward the use of second generation Business Process Modeling principles [4]. The eTOM was developed within TeleManagement Forum (TMF) in the Fall 2000 -Spring 2002 timeframe, and was approved by TMF in June 2002. The eTOM framework (v 3.6) was submitted to ITU-T in September 2003. This presentation has been prepared by two members of the TMF eTOM team, with the approval of the TeleManagement Forum. We would like to acknowledge that the work has been a team effort from some of the most relevant talents representing all geographic regions, service providers, system integrators, consultants, defense organizations, independent software vendors and network equipment vendors. Without such a broad range of knowledge and talent an endeavor of this complexity could not have be tackled successfully.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"149 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":"134181232","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.1317777
Young-Tak Kim
We propose an integrated traffic engineering and management system for DiffServ-over-MPLS services in the next generation Internet, called DoumiMan (DiffServ-over-universal-MPLS Internet Manager). Using the proposed DoumiMan for DiffServ-over-MPLS network, the Internet service provider (ISP) can easily configure Diffserv-over-MPLS traffic flows among the customer's distributed sites, and can provide guaranteed end-to-end QoS by controlling the virtual topology of MPLS tunnel LSP which are configured by MPLS traffic engineering. We explain the requirements and overall operations of the DiffServ-over-MPLS traffic engineering, the architecture of the MPLS network management system, and its detailed functions for network configuration, MPLS E-LSP establishment, performance management, fault management, and MPLS-based VPN. This paper also provides the experimental results and performance analysis of the proposed traffic engineering and management system that configured and managed a sample DiffServ-over-MPLS network with Cisco MPLS routers.
{"title":"DoumiMan for guaranteed QoS provisioning in next generation Internet","authors":"Young-Tak Kim","doi":"10.1109/NOMS.2004.1317777","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317777","url":null,"abstract":"We propose an integrated traffic engineering and management system for DiffServ-over-MPLS services in the next generation Internet, called DoumiMan (DiffServ-over-universal-MPLS Internet Manager). Using the proposed DoumiMan for DiffServ-over-MPLS network, the Internet service provider (ISP) can easily configure Diffserv-over-MPLS traffic flows among the customer's distributed sites, and can provide guaranteed end-to-end QoS by controlling the virtual topology of MPLS tunnel LSP which are configured by MPLS traffic engineering. We explain the requirements and overall operations of the DiffServ-over-MPLS traffic engineering, the architecture of the MPLS network management system, and its detailed functions for network configuration, MPLS E-LSP establishment, performance management, fault management, and MPLS-based VPN. This paper also provides the experimental results and performance analysis of the proposed traffic engineering and management system that configured and managed a sample DiffServ-over-MPLS network with Cisco MPLS routers.","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":"129842372","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
扫码关注我们
求助内容：
应助结果提醒方式：