Pub Date : 2018-04-23DOI: 10.1109/NOMS.2018.8406141
Hung-Cheng Chang, Bo-Jun Qiu, Chen-Hao Chiu, Jyh-cheng Chen, F. Lin, David de la Bastida, B. Lin
Virtualizing the EPC (Evolved Packet Core) in modern carrier-grade networks provides more flexible and reliable network services by decoupling dependence on the hardware. Hy- pervisor and container are two popular virtualization techniques nowadays to enable virtualization of EPC. In this paper, we compared the Open5GCore, a 5G EPC prototype, over KVM and Docker, which are representatives of the hypervisor and container techniques. Moreover, to verify how each supports new services for Internet of Things (IoT) and Machine-to-Machine (M2M) communications, we also analyze the performance of two systems with the IoT and M2M traffic generated by Open5GMTC, a prototype tool for IoT/M2M platforms.
{"title":"Performance evaluation of Open5GCore over KVM and Docker by using Open5GMTC","authors":"Hung-Cheng Chang, Bo-Jun Qiu, Chen-Hao Chiu, Jyh-cheng Chen, F. Lin, David de la Bastida, B. Lin","doi":"10.1109/NOMS.2018.8406141","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406141","url":null,"abstract":"Virtualizing the EPC (Evolved Packet Core) in modern carrier-grade networks provides more flexible and reliable network services by decoupling dependence on the hardware. Hy- pervisor and container are two popular virtualization techniques nowadays to enable virtualization of EPC. In this paper, we compared the Open5GCore, a 5G EPC prototype, over KVM and Docker, which are representatives of the hypervisor and container techniques. Moreover, to verify how each supports new services for Internet of Things (IoT) and Machine-to-Machine (M2M) communications, we also analyze the performance of two systems with the IoT and M2M traffic generated by Open5GMTC, a prototype tool for IoT/M2M platforms.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"3 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84480398","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406127
Frank Loh, Theodoros Karagkioules, Michael Seufert, Bernd Zeidler, D. Tsilimantos, P. Tran-Gia, S. Valentin, Florian Wamser
This demo introduces a wrapper used for automated measurements of mobile video streaming in the Android YouTube app. The difference to traditional measurement techniques is that the measurement is done with the native YouTube app as it is provided in the Google Play Store. In addition to bandwidth or packet loss detection, the QoE of the video stream can be measured and quantified. For this, the amount of quality changes, the current playtime, the buffer level, and statistics like video and audio format are captured. Thus, detailed relationships between network parameters and streaming behavior based on many factors can be detected within the native app available in the Play Store.
本演示介绍了一个用于在Android YouTube应用程序中自动测量移动视频流的包装器。与传统测量技术的不同之处在于，测量是在原生YouTube应用程序中完成的，因为它在Google Play Store中提供。除了带宽或丢包检测外，还可以测量和量化视频流的QoE。为此，将捕获质量变化量、当前播放时间、缓冲级别以及视频和音频格式等统计数据。因此，基于许多因素的网络参数和流媒体行为之间的详细关系可以在Play Store中可用的本机应用中检测到。
{"title":"Demo: A wrapper for automated measurements with YouTube's native app","authors":"Frank Loh, Theodoros Karagkioules, Michael Seufert, Bernd Zeidler, D. Tsilimantos, P. Tran-Gia, S. Valentin, Florian Wamser","doi":"10.1109/NOMS.2018.8406127","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406127","url":null,"abstract":"This demo introduces a wrapper used for automated measurements of mobile video streaming in the Android YouTube app. The difference to traditional measurement techniques is that the measurement is done with the native YouTube app as it is provided in the Google Play Store. In addition to bandwidth or packet loss detection, the QoE of the video stream can be measured and quantified. For this, the amount of quality changes, the current playtime, the buffer level, and statistics like video and audio format are captured. Thus, detailed relationships between network parameters and streaming behavior based on many factors can be detected within the native app available in the Play Store.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"36 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84804409","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406209
Takuma Tsubaki, M. Ishizuka, S. Yasukawa
Due to the 2011 Great East Japan Earthquake, relay cables (physical routes) connecting telephone exchange offices (TEOs) were disconnected and communication between TEOs ceased. Routes compose a ring network using an optical add-drop multiplexer (OADM). Since large-scale earthquakes will likely occur in the future, we must design disaster-resistant routes, which are assumed to be short routes overlapping disaster areas. In addition to this resistance, route designer should also consider ease of accessing manholes, ease of pipelines maintenance, and cost. To do this, the route designer needs to select a route from a huge number of routes between TEOs that pass through a disaster area. Candidate routes, which are a set of routes satisfying the above conditions, all go through the upper, middle, and lower parts of a disaster area. The routes which go through the upper and lower parts of a disaster area become disaster- resistant routes, and the routes which go through the middle part become minimum-cost routes. The route designer needs to eliminate jumping routes, which bypass more than the length of the disaster which we focus on and similar routes, which pass through much of the same pipeline and are not the most disaster- resistant route. To calculate candidate routes, we proposed the algorithm that divides an area into smaller areas (meshes) and uses mesh combinations that are highly likely to contain disaster resistant routes. We report the effectiveness of our algorithm utilizing actual tsunami and liquefaction data.
{"title":"A new algorithm of route design against large-scale disasters","authors":"Takuma Tsubaki, M. Ishizuka, S. Yasukawa","doi":"10.1109/NOMS.2018.8406209","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406209","url":null,"abstract":"Due to the 2011 Great East Japan Earthquake, relay cables (physical routes) connecting telephone exchange offices (TEOs) were disconnected and communication between TEOs ceased. Routes compose a ring network using an optical add-drop multiplexer (OADM). Since large-scale earthquakes will likely occur in the future, we must design disaster-resistant routes, which are assumed to be short routes overlapping disaster areas. In addition to this resistance, route designer should also consider ease of accessing manholes, ease of pipelines maintenance, and cost. To do this, the route designer needs to select a route from a huge number of routes between TEOs that pass through a disaster area. Candidate routes, which are a set of routes satisfying the above conditions, all go through the upper, middle, and lower parts of a disaster area. The routes which go through the upper and lower parts of a disaster area become disaster- resistant routes, and the routes which go through the middle part become minimum-cost routes. The route designer needs to eliminate jumping routes, which bypass more than the length of the disaster which we focus on and similar routes, which pass through much of the same pipeline and are not the most disaster- resistant route. To calculate candidate routes, we proposed the algorithm that divides an area into smaller areas (meshes) and uses mesh combinations that are highly likely to contain disaster resistant routes. We report the effectiveness of our algorithm utilizing actual tsunami and liquefaction data.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89683132","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406323
Herry Herry, Emily Band, C. Perkins, Jeremy Singer
We consider the problem of securely distributing software updates to large scale clusters of heterogeneous edge compute nodes. Such nodes are needed to support the Internet of Things and low-latency edge compute scenarios, but are difficult to manage and update because they exist at the edge of the network behind NATs and firewalls that limit connectivity, or because they are mobile and have intermittent network access. We present a prototype secure update architecture for these devices that uses the combination of peer-to-peer protocols and automated NAT traversal techniques. This demonstrates that edge devices can be managed in an environment subject to partial or intermittent network connectivity, where there is not necessarily direct access from a management node to the devices being updated.
{"title":"Peer-to-peer secure updates for heterogeneous edge devices","authors":"Herry Herry, Emily Band, C. Perkins, Jeremy Singer","doi":"10.1109/NOMS.2018.8406323","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406323","url":null,"abstract":"We consider the problem of securely distributing software updates to large scale clusters of heterogeneous edge compute nodes. Such nodes are needed to support the Internet of Things and low-latency edge compute scenarios, but are difficult to manage and update because they exist at the edge of the network behind NATs and firewalls that limit connectivity, or because they are mobile and have intermittent network access. We present a prototype secure update architecture for these devices that uses the combination of peer-to-peer protocols and automated NAT traversal techniques. This demonstrates that edge devices can be managed in an environment subject to partial or intermittent network connectivity, where there is not necessarily direct access from a management node to the devices being updated.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"16 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88270008","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406267
Gaetano Bonofiglio, Veronica Iovinella, Gabriele Lospoto, G. Battista
Network Function Virtualization (NFV) and Software-Defined Networking (SDN) are deeply changing the networking field by introducing software at any level, aiming at decoupling the logic from the hardware. Together, they bring several benefits, mostly in terms of scalability and flexibility. Up to now, SDN has been used to support NFV from the routing and the architectural point of view. In this paper we present Kathará, a framework based on containers, that allows network operators to deploy Virtual Network Functions (VNFs) through the adoption of emerging data-plane programmable capabilities, such as P4-compliant switches. It also supports the coexistence of SDN and traditional routing protocols in order to set up arbitrarily complex networks. As a side effect, thanks to Kathará, we demonstrate that implementing NFV by means of specific-purpose equipment is feasible and it provides a gain in performance while preserving the benefits of NFV. We measure the resource consumption of Kathará and we show that it performs better than frameworks that implement virtual networks using virtual machines by several orders of magnitude.
{"title":"Kathará: A container-based framework for implementing network function virtualization and software defined networks","authors":"Gaetano Bonofiglio, Veronica Iovinella, Gabriele Lospoto, G. Battista","doi":"10.1109/NOMS.2018.8406267","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406267","url":null,"abstract":"Network Function Virtualization (NFV) and Software-Defined Networking (SDN) are deeply changing the networking field by introducing software at any level, aiming at decoupling the logic from the hardware. Together, they bring several benefits, mostly in terms of scalability and flexibility. Up to now, SDN has been used to support NFV from the routing and the architectural point of view. In this paper we present Kathará, a framework based on containers, that allows network operators to deploy Virtual Network Functions (VNFs) through the adoption of emerging data-plane programmable capabilities, such as P4-compliant switches. It also supports the coexistence of SDN and traditional routing protocols in order to set up arbitrarily complex networks. As a side effect, thanks to Kathará, we demonstrate that implementing NFV by means of specific-purpose equipment is feasible and it provides a gain in performance while preserving the benefits of NFV. We measure the resource consumption of Kathará and we show that it performs better than frameworks that implement virtual networks using virtual machines by several orders of magnitude.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"25 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88196571","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406162
M. Steinke, Wolfgang Hommel
Operating large-scale IT infrastructures and IT services necessitates the management of the involved devices (e. g., network components and servers) and applications. Recent advances and trends in technology, such as software-defined networking, network function virtualization, and distributed data centers render many established organization-wide management processes and tools almost useless: We argue that they must be significantly re-designed to profoundly address the specifics of the new technologies and operational procedures. In this paper, we present a common data model and inter-domain information exchange procedures for integrated network and security management; it is designed for dynamically instantiated IT services in federated, i. e., inter-organizational scenarios. First, we extend STIX and TAXII to generically support network and security event exchange; then we propose a complementary lightweight data model in favor of efficient data processing and correlation. We discuss our data model's application to four layers of abstraction - from single assets to federated services - along with their management activities and the information required to support them with management tools. An evaluation discusses the feasibility of our concept.
{"title":"A data model for federated network and security management information exchange in inter-organizational IT service infrastructures","authors":"M. Steinke, Wolfgang Hommel","doi":"10.1109/NOMS.2018.8406162","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406162","url":null,"abstract":"Operating large-scale IT infrastructures and IT services necessitates the management of the involved devices (e. g., network components and servers) and applications. Recent advances and trends in technology, such as software-defined networking, network function virtualization, and distributed data centers render many established organization-wide management processes and tools almost useless: We argue that they must be significantly re-designed to profoundly address the specifics of the new technologies and operational procedures. In this paper, we present a common data model and inter-domain information exchange procedures for integrated network and security management; it is designed for dynamically instantiated IT services in federated, i. e., inter-organizational scenarios. First, we extend STIX and TAXII to generically support network and security event exchange; then we propose a complementary lightweight data model in favor of efficient data processing and correlation. We discuss our data model's application to four layers of abstraction - from single assets to federated services - along with their management activities and the information required to support them with management tools. An evaluation discusses the feasibility of our concept.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"19 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75497474","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406251
Jasmina Bogojeska, Dorothea Wiesmann
Technology refresh is an important component in data-center management that needs to be properly justified because of its high cost and associated migration risk. The goal of this paper is to support the technology refresh decision process for small target IT environments with a statistical learning method that automatically identifies and ranks their servers with problematic behavior based on incident ticket and server attribute data. Since the IT environments are heterogeneous, in practice, a separate model is trained for each of them. To address the small sample sizes available for many IT environments, we develop a random forest transfer learning solution that leverages information from large IT environments in a selective manner. It trains a model for each target IT environment that uses properly derived resampling weights such that the distribution of the pool of all examples from the large accounts is matched to the target distribution of the small target IT environment. In this way, a tailored predictive model that uses the information available from many large IT environments provides good quality predictions for small IT environments. We demonstrate the superior prediction quality of our model on a large set of real data.
{"title":"Transfer learning for server behavior classification in small IT environments","authors":"Jasmina Bogojeska, Dorothea Wiesmann","doi":"10.1109/NOMS.2018.8406251","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406251","url":null,"abstract":"Technology refresh is an important component in data-center management that needs to be properly justified because of its high cost and associated migration risk. The goal of this paper is to support the technology refresh decision process for small target IT environments with a statistical learning method that automatically identifies and ranks their servers with problematic behavior based on incident ticket and server attribute data. Since the IT environments are heterogeneous, in practice, a separate model is trained for each of them. To address the small sample sizes available for many IT environments, we develop a random forest transfer learning solution that leverages information from large IT environments in a selective manner. It trains a model for each target IT environment that uses properly derived resampling weights such that the distribution of the pool of all examples from the large accounts is matched to the target distribution of the small target IT environment. In this way, a tailored predictive model that uses the information available from many large IT environments provides good quality predictions for small IT environments. We demonstrate the superior prediction quality of our model on a large set of real data.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"68 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72683288","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406272
M. Maswood, Robayet Nasim, A. Kassler, D. Medhi
Geo-distributed Data Centers (DCs) are increasingly common in order to provide scalability for increasing compute demands of modern applications. When multiple geo-distributed DCs serve user requests, it is important to determine which DC and server to select to fulfill the demand at minimum cost, given that enough resources are available in terms of e.g., CPU and bandwidth. This is a complex task since every DC has different operational costs due to e.g. energy, carbon emission, and bandwidth costs. In this paper, we develop a novel mathematical optimization model that guides the decision maker which DC to select, which server to use, and which DC gateway and network path to use to route the user demand in order to satisfy the time varying compute, bandwidth, and latency demands. Our model is based on the concept of virtual networks, which have different requirements in terms of e.g. latency, and we model the queuing delay as a function of the traffic load. Our extensive numerical evaluation, which is based on real-world DC locations, their resource provision costs, and typical demand patterns, shows how operational costs increase with the traffic load, and we analyze the impact of different latency bounds on the performance of different virtual networks.
{"title":"Cost-efficient resource scheduling under QoS constraints for geo-distributed data centers","authors":"M. Maswood, Robayet Nasim, A. Kassler, D. Medhi","doi":"10.1109/NOMS.2018.8406272","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406272","url":null,"abstract":"Geo-distributed Data Centers (DCs) are increasingly common in order to provide scalability for increasing compute demands of modern applications. When multiple geo-distributed DCs serve user requests, it is important to determine which DC and server to select to fulfill the demand at minimum cost, given that enough resources are available in terms of e.g., CPU and bandwidth. This is a complex task since every DC has different operational costs due to e.g. energy, carbon emission, and bandwidth costs. In this paper, we develop a novel mathematical optimization model that guides the decision maker which DC to select, which server to use, and which DC gateway and network path to use to route the user demand in order to satisfy the time varying compute, bandwidth, and latency demands. Our model is based on the concept of virtual networks, which have different requirements in terms of e.g. latency, and we model the queuing delay as a function of the traffic load. Our extensive numerical evaluation, which is based on real-world DC locations, their resource provision costs, and typical demand patterns, shows how operational costs increase with the traffic load, and we analyze the impact of different latency bounds on the performance of different virtual networks.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"30 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75866755","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}
This paper studies the multi-layer structure of coupled power network based on the problem of fault cascade and unreasonable network design in the network virtualization environment (NV). Based on the complex network theory, we propose a network optimization algorithm: PNGA (Primary Nodes Group Algorithm). The objective of PNGA is promoting the robustness of the entire network. In the simulation experiment, this paper analyzes the network modeling and topological characteristics of a three-tier power grid in NV. We use the degree sorting algorithm as the control group which is widely used in power grid. Under different attack strategies, we investigate the performance of different algorithms and the state of fault generation. The results of the simulation we performed in this paper have shown that PNGA is superior to the rest of the algorithm in suppressing faults.
针对网络虚拟化环境下的故障级联和网络设计不合理问题，研究了耦合电网的多层结构。基于复杂网络理论，提出了一种网络优化算法:PNGA (Primary Nodes Group algorithm)。PNGA的目标是提高整个网络的鲁棒性。在仿真实验中，本文分析了NV三层电网的网络建模和拓扑特征，并采用电网中广泛使用的度排序算法作为对照组。在不同的攻击策略下，研究了不同算法的性能和故障生成状态。本文的仿真结果表明，PNGA在抑制故障方面优于其他算法。
{"title":"A backup algorithm for power communication network based on fault cascade in the network virtualization environment","authors":"Xia Zhen, Lanlan Rui, Xue-song Qiu, Biyao Li, Peng Yu","doi":"10.1109/NOMS.2018.8406198","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406198","url":null,"abstract":"This paper studies the multi-layer structure of coupled power network based on the problem of fault cascade and unreasonable network design in the network virtualization environment (NV). Based on the complex network theory, we propose a network optimization algorithm: PNGA (Primary Nodes Group Algorithm). The objective of PNGA is promoting the robustness of the entire network. In the simulation experiment, this paper analyzes the network modeling and topological characteristics of a three-tier power grid in NV. We use the degree sorting algorithm as the control group which is widely used in power grid. Under different attack strategies, we investigate the performance of different algorithms and the state of fault generation. The results of the simulation we performed in this paper have shown that PNGA is superior to the rest of the algorithm in suppressing faults.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"33 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76113954","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 : 2018-04-23DOI: 10.1109/NOMS.2018.8406182
Yao Zhang, Lanlan Rui, Hui Guo, Xue-song Qiu, Linwei
With the development of the Internet of Things, more and more devices can access the network through wireless access. And the wireless access of vehicles, which constitutes an edge network, can provide real-time road information and significant traffic state. Thus, it has gradually got the public attention. In order to offer the better quality of service (QoS) in the vehicular network, we propose a multi-priority bionic competition mechanism to implement service differentiation and resource allocation. Firstly, we deduce a context metric (CM) through fuzzy inference, which relates the urgency degree of a vehicle to its environment. Vehicle traffic is re-prioritized into four access categories (ACs) combined with the CM and transmission data types. Then, we propose the bionic competition model based on 802.11e EDCA protocol. This model considers the competition in the same level ACs and the competition among different level ACs, allocates different transmission rate and bandwidth for different ACs, which greatly improve the network throughput and bandwidth utilization. Finally, the simulation results show that our method improves the throughput, reduces the mean delay and packet loss rate.
{"title":"A QoS guarantee mechanism based on multi- priority bionic competition model in vehicular edge etwork","authors":"Yao Zhang, Lanlan Rui, Hui Guo, Xue-song Qiu, Linwei","doi":"10.1109/NOMS.2018.8406182","DOIUrl":"https://doi.org/10.1109/NOMS.2018.8406182","url":null,"abstract":"With the development of the Internet of Things, more and more devices can access the network through wireless access. And the wireless access of vehicles, which constitutes an edge network, can provide real-time road information and significant traffic state. Thus, it has gradually got the public attention. In order to offer the better quality of service (QoS) in the vehicular network, we propose a multi-priority bionic competition mechanism to implement service differentiation and resource allocation. Firstly, we deduce a context metric (CM) through fuzzy inference, which relates the urgency degree of a vehicle to its environment. Vehicle traffic is re-prioritized into four access categories (ACs) combined with the CM and transmission data types. Then, we propose the bionic competition model based on 802.11e EDCA protocol. This model considers the competition in the same level ACs and the competition among different level ACs, allocates different transmission rate and bandwidth for different ACs, which greatly improve the network throughput and bandwidth utilization. Finally, the simulation results show that our method improves the throughput, reduces the mean delay and packet loss rate.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"8 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77919521","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
扫码关注我们
求助内容：
应助结果提醒方式：