Pub Date : 2012-11-26DOI: 10.1109/APNOMS.2012.6356105
Ji-hye Kim, S. Yoon, Myung-Sup Kim
Internet traffic has rapidly increased due to the increasing use of wireless devices and the appearance of various applications and services. With the rapid increase of Internet traffic, the need for Internet traffic classification becomes important for the effective use of network resources. However, the traffic classification taxonomy has received little attention compared to the study of classification methods. In this paper, we propose novel traffic classification taxonomy for multilateral and hierarchical traffic identification. The proposed taxonomy can support multilateral identification based on the proposed four classification criteria: service, application, protocol, and function. In addition, the proposed taxonomy can support hierarchical structure supporting roll-up and drill-down operation to the classification result. We proved the applicability and advantages of the proposed taxonomy by applying it to real campus network traffic.
{"title":"Study on traffic classification taxonomy for multilateral and hierarchical traffic classification","authors":"Ji-hye Kim, S. Yoon, Myung-Sup Kim","doi":"10.1109/APNOMS.2012.6356105","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356105","url":null,"abstract":"Internet traffic has rapidly increased due to the increasing use of wireless devices and the appearance of various applications and services. With the rapid increase of Internet traffic, the need for Internet traffic classification becomes important for the effective use of network resources. However, the traffic classification taxonomy has received little attention compared to the study of classification methods. In this paper, we propose novel traffic classification taxonomy for multilateral and hierarchical traffic identification. The proposed taxonomy can support multilateral identification based on the proposed four classification criteria: service, application, protocol, and function. In addition, the proposed taxonomy can support hierarchical structure supporting roll-up and drill-down operation to the classification result. We proved the applicability and advantages of the proposed taxonomy by applying it to real campus network traffic.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134511358","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}
Synchronous Digital Hierarchy (SDH) networks are wildly deployed by telecom service providers (SP) around the world. Conventionally, SDH network circuits have to be designed and provisioned beforehand. Circuit profiles, including capacity, circuit route, end points..., have to be assigned before service activations. Any attempt of network re-configuration caused by network failures or traffic congestions will lead to uncertain service interruption. To further increase network availability, SPs have to overbuild their networks or to assign backup route(s) for each critical circuit, which, however, is costly and inefficient. With the introduction of technologies such as Virtual Concatenation (VCAT) and Link Capacity Adjustment Scheme (LCAS) of Next generation SDH (NG-SDH), SPs are able to adjust their SDH circuits at various bandwidth granularities and to hitlessly increase or decrease bandwidth of each circuit. In this study, we propose an effective approach to locate overbuild bandwidth, failed circuits, as well as congested circuits based on real time traffic flow data and network alarm message. Then our approach reallocates overbuilt network bandwidth in responding to network failures or traffic congestions by exploiting the benefit of VCAT and LCAS. Our simulation results show that our approach can significantly improve network availability as well as network resource utilization with minimal cost.
{"title":"Dynamic bandwidth reallocation for NG-SDH networks based on Real-time Traffic Flow Analysis","authors":"Tsan-Chang Kuo, Min-Chia Chang, Chuan Yin, Been-Huang Liao","doi":"10.1109/APNOMS.2012.6356078","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356078","url":null,"abstract":"Synchronous Digital Hierarchy (SDH) networks are wildly deployed by telecom service providers (SP) around the world. Conventionally, SDH network circuits have to be designed and provisioned beforehand. Circuit profiles, including capacity, circuit route, end points..., have to be assigned before service activations. Any attempt of network re-configuration caused by network failures or traffic congestions will lead to uncertain service interruption. To further increase network availability, SPs have to overbuild their networks or to assign backup route(s) for each critical circuit, which, however, is costly and inefficient. With the introduction of technologies such as Virtual Concatenation (VCAT) and Link Capacity Adjustment Scheme (LCAS) of Next generation SDH (NG-SDH), SPs are able to adjust their SDH circuits at various bandwidth granularities and to hitlessly increase or decrease bandwidth of each circuit. In this study, we propose an effective approach to locate overbuild bandwidth, failed circuits, as well as congested circuits based on real time traffic flow data and network alarm message. Then our approach reallocates overbuilt network bandwidth in responding to network failures or traffic congestions by exploiting the benefit of VCAT and LCAS. Our simulation results show that our approach can significantly improve network availability as well as network resource utilization with minimal cost.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123368850","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356095
Yuichi Sakuraba
In a network management with huge numbers of nodes, network topology is usually displayed in a manner that sub-network is organized as a group and each group is displayed respectively by itself. However, we can't see nodes in plural groups and connections between them simultaneously in this model. To solve the problem, we proposed a hierarchical layout model that expands groups on demand in the same screen keeping connections between nodes in a previous paper [1]. However, when many groups are expanded, they may not fit within the display area. Therefore, we introduce expanding factor by the interest level for more efficient display of the network in this paper. According to the interest level factor, the groups with high interest level are displayed widely, and the groups with low interest level in displayed narrowly or iconized. We model the interest level mathematically, and discuss the model efficacy.
{"title":"Displaying network topology by hierarchical layout with interest level","authors":"Yuichi Sakuraba","doi":"10.1109/APNOMS.2012.6356095","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356095","url":null,"abstract":"In a network management with huge numbers of nodes, network topology is usually displayed in a manner that sub-network is organized as a group and each group is displayed respectively by itself. However, we can't see nodes in plural groups and connections between them simultaneously in this model. To solve the problem, we proposed a hierarchical layout model that expands groups on demand in the same screen keeping connections between nodes in a previous paper [1]. However, when many groups are expanded, they may not fit within the display area. Therefore, we introduce expanding factor by the interest level for more efficient display of the network in this paper. According to the interest level factor, the groups with high interest level are displayed widely, and the groups with low interest level in displayed narrowly or iconized. We model the interest level mathematically, and discuss the model efficacy.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126027472","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356055
Dongwoo Kwon, J. W. Hong, Hong-Taek Ju
This paper proposes a proactive security system to forecast Distributed Denial of Service (DDoS) attacks. A reactive system focused on detection after network attacks occur has difficulties responding rapidly to massive distributed attacks, such as DDoS. By forecasting the attack, we can take active countermeasures such as strengthening the power of the security devices and it would also enable us to plan a recovery procedure and countermeasures beforehand, providing a more rapid response. In this paper, we discuss previous studies related to intrusion forecasting, define the concept of intrusion forecasting and propose the Internet Intrusion Forecasting System Architecture. To obtain intrusion factors for DDoS attack forecasts, Honeynet was deployed and we analyze Hflow data gathered from Honeynet.
{"title":"DDoS attack forecasting system architecture using Honeynet","authors":"Dongwoo Kwon, J. W. Hong, Hong-Taek Ju","doi":"10.1109/APNOMS.2012.6356055","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356055","url":null,"abstract":"This paper proposes a proactive security system to forecast Distributed Denial of Service (DDoS) attacks. A reactive system focused on detection after network attacks occur has difficulties responding rapidly to massive distributed attacks, such as DDoS. By forecasting the attack, we can take active countermeasures such as strengthening the power of the security devices and it would also enable us to plan a recovery procedure and countermeasures beforehand, providing a more rapid response. In this paper, we discuss previous studies related to intrusion forecasting, define the concept of intrusion forecasting and propose the Internet Intrusion Forecasting System Architecture. To obtain intrusion factors for DDoS attack forecasts, Honeynet was deployed and we analyze Hflow data gathered from Honeynet.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125312126","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356094
Li-Der Chou, Yao-Tsung Yang, Yi-Shou Chen, Te-Chin Chang, C. Shieh, S. Huang
With the increase in the bandwidth needs of network service, the customer requirements for Quality of Service (QoS) are also higher. Although the QoS guarantees can be offered by signing the Service Level Agreement (SLA), the costs of infrastructures are increased as well. This paper proposes a shortest path algorithm based on SLA, combined with the resource allocation for virtual networks (VNs). It can help service providers to enhance the achievement of overall SLA contracts in the case of lack of resources. This architecture was also implemented on NetFPGA platforms applied with the concept of OpenFlow to meet the demands of network performance and flexibility. Finally, the experimental results show that the proposed algorithm can dynamically provide the better path to reach the SLA achievement rates.
随着网络业务对带宽需求的增加，客户对QoS (Quality of service)的要求也越来越高。虽然可以通过签署服务水平协议(SLA)来提供QoS保证，但基础设施的成本也会增加。结合虚拟网络的资源分配，提出了一种基于SLA的最短路径算法。它可以帮助服务提供商在缺乏资源的情况下提高整体SLA合同的实现。为了满足网络性能和灵活性的要求，该架构还在NetFPGA平台上应用OpenFlow概念实现。最后，实验结果表明，该算法可以动态地提供更好的路径来达到SLA成果率。
{"title":"Implementation of virtual network management system with SLA on NetFPGA","authors":"Li-Der Chou, Yao-Tsung Yang, Yi-Shou Chen, Te-Chin Chang, C. Shieh, S. Huang","doi":"10.1109/APNOMS.2012.6356094","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356094","url":null,"abstract":"With the increase in the bandwidth needs of network service, the customer requirements for Quality of Service (QoS) are also higher. Although the QoS guarantees can be offered by signing the Service Level Agreement (SLA), the costs of infrastructures are increased as well. This paper proposes a shortest path algorithm based on SLA, combined with the resource allocation for virtual networks (VNs). It can help service providers to enhance the achievement of overall SLA contracts in the case of lack of resources. This architecture was also implemented on NetFPGA platforms applied with the concept of OpenFlow to meet the demands of network performance and flexibility. Finally, the experimental results show that the proposed algorithm can dynamically provide the better path to reach the SLA achievement rates.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117029386","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356104
Sungbong Chang, Hyungsoo Kim, Byung-deok Chung, Hyunchul Jung
IT (Information Technology) is known as one of the best solution to slow down the global warming by various industry sectors. IT equipments are responsible of 2% of GHG emission of total. Especially, Concentrate Energy Consuming Facilities such as Data Centers are to blame most as increasing sources of global warming caused by energy consumption by IT network equipments. This paper shows how to manage and control the energy consumed by IT equipments such as switches, routers, storages and servers loaded in a rack type facility. How to collect the energy consumption data from the individual equipment effectively and how to monitor and save the energy in a smart way without interrupting the services by introduction of Energy/Carbon Management Platform are to be explained. Smart Rack, Intelligent PDU (i-PDU), SECMP (Smart Energy/Carbon Management Platform) are introduced in this paper.
{"title":"Energy/carbon management network for IT equipments","authors":"Sungbong Chang, Hyungsoo Kim, Byung-deok Chung, Hyunchul Jung","doi":"10.1109/APNOMS.2012.6356104","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356104","url":null,"abstract":"IT (Information Technology) is known as one of the best solution to slow down the global warming by various industry sectors. IT equipments are responsible of 2% of GHG emission of total. Especially, Concentrate Energy Consuming Facilities such as Data Centers are to blame most as increasing sources of global warming caused by energy consumption by IT network equipments. This paper shows how to manage and control the energy consumed by IT equipments such as switches, routers, storages and servers loaded in a rack type facility. How to collect the energy consumption data from the individual equipment effectively and how to monitor and save the energy in a smart way without interrupting the services by introduction of Energy/Carbon Management Platform are to be explained. Smart Rack, Intelligent PDU (i-PDU), SECMP (Smart Energy/Carbon Management Platform) are introduced in this paper.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117042546","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356080
Miao Li, Jessie Hui Wang, Jiahai Yang
Understanding of the Internet evolution is important for many research topics, such as network planning, optimal routing design, etc. In this paper, we try to analyze CAIDA AS-level topology dataset from 2004 to 2010 to validate two conjectures on the Internet evolution, i.e., the Internet flattening trend and the preferential attachment rule. Our analysis shows that the evolvement of the Internet core is different from the edge of Internet. We classify the Internet into several layers using different layering methods, i.e., Rich Club coefficient based method, k-core decomposition method and SARK hierarchy model, and then study the changes of the features of these layers. Under all of these laying methods, we find that the boundaries between neighboring layers in the Internet core are more and more blurred; ASes in the core distribute more evenly and different layers are closer to each other in size, while the Internet edge still has a distinct hierarchical characteristic. It is more evident in Asia and Europe than North America. The other difference between Internet core and Internet edge is that link births/deaths in the Internet core follow the “Preferential Attachment/de-attachment” rule, while link births/deaths in the Internet edge follow a super linear preferential attachment/de-attachement rule. On the other hand, in both Internet core and Internet edge, link births caused by AS births present stronger preference than link rewiring.
{"title":"Flattening and preferential attachment in the internet evolution","authors":"Miao Li, Jessie Hui Wang, Jiahai Yang","doi":"10.1109/APNOMS.2012.6356080","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356080","url":null,"abstract":"Understanding of the Internet evolution is important for many research topics, such as network planning, optimal routing design, etc. In this paper, we try to analyze CAIDA AS-level topology dataset from 2004 to 2010 to validate two conjectures on the Internet evolution, i.e., the Internet flattening trend and the preferential attachment rule. Our analysis shows that the evolvement of the Internet core is different from the edge of Internet. We classify the Internet into several layers using different layering methods, i.e., Rich Club coefficient based method, k-core decomposition method and SARK hierarchy model, and then study the changes of the features of these layers. Under all of these laying methods, we find that the boundaries between neighboring layers in the Internet core are more and more blurred; ASes in the core distribute more evenly and different layers are closer to each other in size, while the Internet edge still has a distinct hierarchical characteristic. It is more evident in Asia and Europe than North America. The other difference between Internet core and Internet edge is that link births/deaths in the Internet core follow the “Preferential Attachment/de-attachment” rule, while link births/deaths in the Internet edge follow a super linear preferential attachment/de-attachement rule. On the other hand, in both Internet core and Internet edge, link births caused by AS births present stronger preference than link rewiring.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114848810","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356090
Yi-Chang Chen, Jeu-Yih Jeng, Teh-Sheng Huang, P. Lin
Today, Internet services are utilized as major service platforms to provide business services. Web-based Internet applications that follow the multi-tier architecture are a well-accepted computation model when providing Internet services. Such a model suffers from interruption caused by software failures, hardware errors or software maintenance. The interruption may incur significant financial loss to Internet service providers. Thus, Service Continuity is one of the main challenges for Web-based Internet applications. Although several service continuity technologies have been developed, many of them focus on a single tier of the applications and do not guarantee end-to-end service continuity. In this paper, we describe the design, implementation, and performance evaluation of our proposed service continuity technology. This technology resolves the long time interruption problem caused by database schema evolution, handles software components upgrade, and achieves end-to-end Service Continuity. We propose a mechanism that contains multiple modules running interactively between each module. This approach only requires minimal amount of code rewriting and a small storage space. Comparing with existing approaches, our approach is more efficient with the least overhead.
{"title":"Design and implementation of database schema evolution for service continuity of web-based internet applications","authors":"Yi-Chang Chen, Jeu-Yih Jeng, Teh-Sheng Huang, P. Lin","doi":"10.1109/APNOMS.2012.6356090","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356090","url":null,"abstract":"Today, Internet services are utilized as major service platforms to provide business services. Web-based Internet applications that follow the multi-tier architecture are a well-accepted computation model when providing Internet services. Such a model suffers from interruption caused by software failures, hardware errors or software maintenance. The interruption may incur significant financial loss to Internet service providers. Thus, Service Continuity is one of the main challenges for Web-based Internet applications. Although several service continuity technologies have been developed, many of them focus on a single tier of the applications and do not guarantee end-to-end service continuity. In this paper, we describe the design, implementation, and performance evaluation of our proposed service continuity technology. This technology resolves the long time interruption problem caused by database schema evolution, handles software components upgrade, and achieves end-to-end Service Continuity. We propose a mechanism that contains multiple modules running interactively between each module. This approach only requires minimal amount of code rewriting and a small storage space. Comparing with existing approaches, our approach is more efficient with the least overhead.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129912502","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356060
Yongfeng Huang, Jin Xiao, J. W. Hong, A. Mehaoua, R. Boutaba
In managing multimedia services, it is important to understand how network performance affects user experience. The model presented in this paper aims to estimate user perception of video quality based on defect events, which are automatically classified by machine learning techniques. The underlying principle of our model is that human experience is event-based and there is a strong correlation between defective events and user MOS. Through experiments, we show that our model can detect different types of defect events with good accuracy even under small data set, and we find that indeed different defect event types affect user experience with different sensitivity.
{"title":"Event-based estimation of user experience for network video streaming","authors":"Yongfeng Huang, Jin Xiao, J. W. Hong, A. Mehaoua, R. Boutaba","doi":"10.1109/APNOMS.2012.6356060","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356060","url":null,"abstract":"In managing multimedia services, it is important to understand how network performance affects user experience. The model presented in this paper aims to estimate user perception of video quality based on defect events, which are automatically classified by machine learning techniques. The underlying principle of our model is that human experience is event-based and there is a strong correlation between defective events and user MOS. Through experiments, we show that our model can detect different types of defect events with good accuracy even under small data set, and we find that indeed different defect event types affect user experience with different sensitivity.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129589226","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 : 2012-11-26DOI: 10.1109/APNOMS.2012.6356091
Yuya Inoue, Masanori Yamazaki, Y. Hirota, K. Kinoshita, H. Tode, K. Murakami
Recently, network services based on distributed components that provide services by using components running on remote nodes have attracted much attention. Advanced services can be provided at a lower cost by using existing components. We have previously proposed a method that ensures a stable QoS for each service by allocating components dynamically according to changes in access frequency. In that method, however, we considered only CPU resources rather than network resources. In this paper, we propose a method for providing bandwidth-guaranteed services stably by considering available wavelength resources in backend servers on a platform with a WDM optical network.
{"title":"A bandwidth management method using available wavelength resources in backend servers for network services based on distributed components","authors":"Yuya Inoue, Masanori Yamazaki, Y. Hirota, K. Kinoshita, H. Tode, K. Murakami","doi":"10.1109/APNOMS.2012.6356091","DOIUrl":"https://doi.org/10.1109/APNOMS.2012.6356091","url":null,"abstract":"Recently, network services based on distributed components that provide services by using components running on remote nodes have attracted much attention. Advanced services can be provided at a lower cost by using existing components. We have previously proposed a method that ensures a stable QoS for each service by allocating components dynamically according to changes in access frequency. In that method, however, we considered only CPU resources rather than network resources. In this paper, we propose a method for providing bandwidth-guaranteed services stably by considering available wavelength resources in backend servers on a platform with a WDM optical network.","PeriodicalId":385920,"journal":{"name":"2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126713687","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
扫码关注我们
求助内容：
应助结果提醒方式：