Pub Date : 2004-04-23DOI: 10.1109/NOMS.2004.1317765
I. Yamasaki, R. Kawamura
Future IP networks will be multi-service-class networks that provide multiple levels of quality of services (QoS). The network service provider (NSP) must manage network resources and multiple protocol label switching can be used to control logical path allocation. This paper proposes a scheme that maximizes NSP profit by controlling the service-list and path-allocation under the constraint of available network resources. We introduce a model in which the users' class choice from among the multiple classes is influenced not by the price and QoS of one class, but the prices and QoS levels of all classes, the service-list. To model the users' class choice, we adopt discrete choice analysis. We propose a functional framework that consists of user choice model function, original demand forecast function, and service-list and path-allocation determination function. We evaluate the effectiveness of the proposed method using a multiple service-class example.
{"title":"Service-list and path-allocation control for maximizing network profit in multiple service-classes networks","authors":"I. Yamasaki, R. Kawamura","doi":"10.1109/NOMS.2004.1317765","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317765","url":null,"abstract":"Future IP networks will be multi-service-class networks that provide multiple levels of quality of services (QoS). The network service provider (NSP) must manage network resources and multiple protocol label switching can be used to control logical path allocation. This paper proposes a scheme that maximizes NSP profit by controlling the service-list and path-allocation under the constraint of available network resources. We introduce a model in which the users' class choice from among the multiple classes is influenced not by the price and QoS of one class, but the prices and QoS levels of all classes, the service-list. To model the users' class choice, we adopt discrete choice analysis. We propose a functional framework that consists of user choice model function, original demand forecast function, and service-list and path-allocation determination function. We evaluate the effectiveness of the proposed method using a multiple service-class example.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"8 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":"129827190","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.1317766
M. Salle, C. Bartolini
Companies are increasingly seeking to manage their IT infrastructure in light of their business objectives. To address this need, we introduce management by contract (MbC) as a new paradigm for IT management. We propose a way of formalizing and analyzing contractual relationships in order to better inform IT-related decisions. In this paper, we present the information model that underpins MbC and describe our contract-based analysis algorithm.
{"title":"Management by contract","authors":"M. Salle, C. Bartolini","doi":"10.1109/NOMS.2004.1317766","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317766","url":null,"abstract":"Companies are increasingly seeking to manage their IT infrastructure in light of their business objectives. To address this need, we introduce management by contract (MbC) as a new paradigm for IT management. We propose a way of formalizing and analyzing contractual relationships in order to better inform IT-related decisions. In this paper, we present the information model that underpins MbC and describe our contract-based analysis algorithm.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"17 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":"127528937","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.1317646
Ruibing Hao, David Lee, Juntao Ma, Jiahai Yang
For network fault management, we present a new technique that is based on on-line monitoring of networks with link state routing protocols, such as OSPF (open shortest path first) and integrated IS-IS. Our approach employs an agent that monitors the on-line information of the network link state database, analyzes the events generated by network faults for event correlation, and detects and localizes the faults. We apply our method to a real network topology with various types of network faults. Experimental results show that our approach can detect and localize the faults in a timely manner, yet without disrupting normal network operations.
{"title":"Fault management for networks with link state routing protocols","authors":"Ruibing Hao, David Lee, Juntao Ma, Jiahai Yang","doi":"10.1109/NOMS.2004.1317646","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317646","url":null,"abstract":"For network fault management, we present a new technique that is based on on-line monitoring of networks with link state routing protocols, such as OSPF (open shortest path first) and integrated IS-IS. Our approach employs an agent that monitors the on-line information of the network link state database, analyzes the events generated by network faults for event correlation, and detects and localizes the faults. We apply our method to a real network topology with various types of network faults. Experimental results show that our approach can detect and localize the faults in a timely manner, yet without disrupting normal network operations.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"15 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":"126454638","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.1317776
T. Asano, Akihiko Tsuno, T. Nishizono
In Japan, medium- to high-speed access networks using technologies such as ADSL have recently been expanding rapidly. We propose a quality management system enabling efficient, accurate measurement of streaming video quality to meet the requirements of network provisioning and customer service. Streaming video is delivered through a content delivery network (CDN) consisting of a content server, network, and customers' personal computers (client PC). In the digital content delivery business, it is thus necessary to manage the overall quality for all these elements.
{"title":"Quality measuring system for network provisioning and customer service in content delivery","authors":"T. Asano, Akihiko Tsuno, T. Nishizono","doi":"10.1109/NOMS.2004.1317776","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317776","url":null,"abstract":"In Japan, medium- to high-speed access networks using technologies such as ADSL have recently been expanding rapidly. We propose a quality management system enabling efficient, accurate measurement of streaming video quality to meet the requirements of network provisioning and customer service. Streaming video is delivered through a content delivery network (CDN) consisting of a content server, network, and customers' personal computers (client PC). In the digital content delivery business, it is thus necessary to manage the overall quality for all these elements.","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":"130725971","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.1317685
Andrzej Kochut, N. Bobroff, K. Beaty, G. Kar
This paper explores merging SAN performance management tools into the host system thus dissolving the traditional boundary between hosts and storage. The host service time distribution is exploited to locate caches in the SAN, detect and isolate contention in the communication channels and backend disk drives. We define essential metrics and measure I/O workloads over extended periods to define baseline behavior. We have implemented architecture to acquire configuration and performance data from agents on the host and SAN elements. In addition to performance management this data is the basis of management functions such as capacity planning, and sizing host and SAN resources required for application rollout and expansion. The static dependency map (SAN topology or 'wiring' diagram), provided by current SAN management tools, is extended into the host server. We then attempt to develop a corresponding dynamic dependency view showing how performance metrics at the application and host level, such as I/O queuing levels and service times, relate to response times in the SAN. The dynamic view is also an important complement to the static dependency graph because the actual traffic flow may be difficult to deduce from the topology.
{"title":"Management issues in storage area networks: detection and isolation of performance problems","authors":"Andrzej Kochut, N. Bobroff, K. Beaty, G. Kar","doi":"10.1109/NOMS.2004.1317685","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317685","url":null,"abstract":"This paper explores merging SAN performance management tools into the host system thus dissolving the traditional boundary between hosts and storage. The host service time distribution is exploited to locate caches in the SAN, detect and isolate contention in the communication channels and backend disk drives. We define essential metrics and measure I/O workloads over extended periods to define baseline behavior. We have implemented architecture to acquire configuration and performance data from agents on the host and SAN elements. In addition to performance management this data is the basis of management functions such as capacity planning, and sizing host and SAN resources required for application rollout and expansion. The static dependency map (SAN topology or 'wiring' diagram), provided by current SAN management tools, is extended into the host server. We then attempt to develop a corresponding dynamic dependency view showing how performance metrics at the application and host level, such as I/O queuing levels and service times, relate to response times in the SAN. The dynamic view is also an important complement to the static dependency graph because the actual traffic flow may be difficult to deduce from the topology.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"5 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":"134535740","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.1317758
Q. Gu, A. Marshall
The performance of network management applications is becoming an increasingly important factor as the scale of the networks they have to manage increases. This paper presents a series of comparative performance tests on two common platforms used for network management: SNMP and CORBA. In terms of network performance, the two platforms are used to achieve the same network management tasks. The bandwidth consumed and the time taken to complete the tasks is compared. Both systems were tested by manipulating different types of management objects (single or tabular) in different network environments. The results highlight the bottlenecks in each system and the reasons for them. The paper compares both systems and identifies their respective advantages and disadvantages. The work shows that their different features will decide what kind of application they are most suited to.
{"title":"Network management performance analysis and scalability tests: SNMP vs. CORBA","authors":"Q. Gu, A. Marshall","doi":"10.1109/NOMS.2004.1317758","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317758","url":null,"abstract":"The performance of network management applications is becoming an increasingly important factor as the scale of the networks they have to manage increases. This paper presents a series of comparative performance tests on two common platforms used for network management: SNMP and CORBA. In terms of network performance, the two platforms are used to achieve the same network management tasks. The bandwidth consumed and the time taken to complete the tasks is compared. Both systems were tested by manipulating different types of management objects (single or tabular) in different network environments. The results highlight the bottlenecks in each system and the reasons for them. The paper compares both systems and identifies their respective advantages and disadvantages. The work shows that their different features will decide what kind of application they are most suited to.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"69 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":"132692358","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.1317839
S-H Choi, Jeong-Ho Ha, Joong-Goo Song
For the past several years, new Internet-centric services have rapidly entered the stage and have been supported by complex networks based on the PSTN, ATM, metro and so forth. These require modifications to current business processes in the OSS. Alternatively, they could require new systems. We have faced difficulties in adopting new data or Internet services in time to market because of complex system structures, inter-operations, etc. To address market needs, we have been promoting the NeOSS (new operations support systems) project since 2001. We have just completed its design level, and are currently implementing it. In these processes, we are still facing many problems and difficulties. We focus on "service assurance", and describe what the problems in the KT OSS are, and how we are approaching them from the point of view of the architectures and technologies and of inter-operations with legacy systems. We also provide an economic analysis based on the key indexes of the KT NeOSS project.
{"title":"Building a service assurance system in KT","authors":"S-H Choi, Jeong-Ho Ha, Joong-Goo Song","doi":"10.1109/NOMS.2004.1317839","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317839","url":null,"abstract":"For the past several years, new Internet-centric services have rapidly entered the stage and have been supported by complex networks based on the PSTN, ATM, metro and so forth. These require modifications to current business processes in the OSS. Alternatively, they could require new systems. We have faced difficulties in adopting new data or Internet services in time to market because of complex system structures, inter-operations, etc. To address market needs, we have been promoting the NeOSS (new operations support systems) project since 2001. We have just completed its design level, and are currently implementing it. In these processes, we are still facing many problems and difficulties. We focus on \"service assurance\", and describe what the problems in the KT OSS are, and how we are approaching them from the point of view of the architectures and technologies and of inter-operations with legacy systems. We also provide an economic analysis based on the key indexes of the KT NeOSS project.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"27 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":"132729792","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.1317643
C. Adam, R. Stadler
The paper contributes towards engineering self-stabilizing networks and services. We propose the use of navigation patterns, which define how information for state updates is disseminated in the system, as fundamental building blocks for self-stabilizing systems. We present two navigation patterns for self-stabilization: the progressive wave pattern and the stationary wave pattern. The progressive wave pattern defines the update dissemination in Internet routing systems running the DUAL and OSPF (open shortest path first) protocols. Similarly, the stationary wave pattern defines the interactions of peer nodes in structured peer-to-peer systems, including Chord, Pastry, Tapestry, and CAN. It turns out that the two patterns are related. They both disseminate information in the form of waves, i.e, sets of messages that originate from single events. Patterns can be instrumented to obtain wave statistics, which enables monitoring the process of self-stabilization in a system. We focus on Internet routing and peer-to-peer systems, since we believe that studying these (existing) systems can lead to engineering principles for self-stabilizing systems in various application areas.
{"title":"Patterns for routing and self-stabilization","authors":"C. Adam, R. Stadler","doi":"10.1109/NOMS.2004.1317643","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317643","url":null,"abstract":"The paper contributes towards engineering self-stabilizing networks and services. We propose the use of navigation patterns, which define how information for state updates is disseminated in the system, as fundamental building blocks for self-stabilizing systems. We present two navigation patterns for self-stabilization: the progressive wave pattern and the stationary wave pattern. The progressive wave pattern defines the update dissemination in Internet routing systems running the DUAL and OSPF (open shortest path first) protocols. Similarly, the stationary wave pattern defines the interactions of peer nodes in structured peer-to-peer systems, including Chord, Pastry, Tapestry, and CAN. It turns out that the two patterns are related. They both disseminate information in the form of waves, i.e, sets of messages that originate from single events. Patterns can be instrumented to obtain wave statistics, which enables monitoring the process of self-stabilization in a system. We focus on Internet routing and peer-to-peer systems, since we believe that studying these (existing) systems can lead to engineering principles for self-stabilizing systems in various application areas.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"36 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":"123870665","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.1317669
M. Menth, S. Kopf, J. Milbrandt
We introduce the notion of link and network admission control (LAC, NAC) and present three fundamentally different budget based NAC methods which categorize most of today's implemented NAC approaches. We propose a performance evaluation framework for their comparison. The required network capacity for each method is dimensioned for a certain flow blocking probability, and the average resource utilization is taken as performance measure. We point out several implementation options and investigate their impact. Based on numerical results, we give recommendations for preferred procedures. Finally, we compare different NAC methods under varying load conditions.
{"title":"A performance evaluation framework for network admission control methods","authors":"M. Menth, S. Kopf, J. Milbrandt","doi":"10.1109/NOMS.2004.1317669","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317669","url":null,"abstract":"We introduce the notion of link and network admission control (LAC, NAC) and present three fundamentally different budget based NAC methods which categorize most of today's implemented NAC approaches. We propose a performance evaluation framework for their comparison. The required network capacity for each method is dimensioned for a certain flow blocking probability, and the average resource utilization is taken as performance measure. We point out several implementation options and investigate their impact. Based on numerical results, we give recommendations for preferred procedures. Finally, we compare different NAC methods under varying load conditions.","PeriodicalId":260367,"journal":{"name":"2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507)","volume":"33 Pt 6 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":"124630081","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.1317830
Yoichiro Yamaki, Tatsuyuki Kimura
Enterprise networks constructed in recent years have rarely composed one service offered by one company. Instead, they have typically combined various services provided by various carriers, with connections between IP-VPN, large-area Ethernet access networks, DSL providers, and so forth. Under these conditions, providing fast services according to customer needs requires information on related enterprises for flexible integration of the mechanism. To provide a method of meeting this requirement, we applied semantic Web and ontology technology to achieve information integration between enterprises. We examine the resulting system, which enables flexible cooperation.
{"title":"Method for operation support systems (OSS) integration by using semantic Web","authors":"Yoichiro Yamaki, Tatsuyuki Kimura","doi":"10.1109/NOMS.2004.1317830","DOIUrl":"https://doi.org/10.1109/NOMS.2004.1317830","url":null,"abstract":"Enterprise networks constructed in recent years have rarely composed one service offered by one company. Instead, they have typically combined various services provided by various carriers, with connections between IP-VPN, large-area Ethernet access networks, DSL providers, and so forth. Under these conditions, providing fast services according to customer needs requires information on related enterprises for flexible integration of the mechanism. To provide a method of meeting this requirement, we applied semantic Web and ontology technology to achieve information integration between enterprises. We examine the resulting system, which enables flexible cooperation.","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":"122163528","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
扫码关注我们
求助内容：
应助结果提醒方式：