Pub Date : 2015-09-22DOI: 10.4304/jnw.10.8.470-476
Kai-Wayne Chuang, Chien-Nan Lin
This study proposes a single-supplier, single-retailer inventory and pricing strategies for deteriorating items with ramp type demand and a fixed shelf-life u nder s hortage . In practice, there are many commodity such as food, medication exist the shelf life . Therefore the shelf life expiration date has become an important research topic in inventory management. We will discuss three cases. We assume that the inventory objective is to minimize the total cost per unit time of the system. By using the subroutine FindRoot in commercial software Mathematica 5.2, we obtain the optimal solutions
{"title":"Replenishment Policies for Deteriorating Items with Ramp Type Demand and a Fixed Shelf-Life under Shortage","authors":"Kai-Wayne Chuang, Chien-Nan Lin","doi":"10.4304/jnw.10.8.470-476","DOIUrl":"https://doi.org/10.4304/jnw.10.8.470-476","url":null,"abstract":"This study proposes a single-supplier, single-retailer inventory and pricing strategies for deteriorating items with ramp type demand and a fixed shelf-life u nder s hortage . In practice, there are many commodity such as food, medication exist the shelf life . Therefore the shelf life expiration date has become an important research topic in inventory management. We will discuss three cases. We assume that the inventory objective is to minimize the total cost per unit time of the system. By using the subroutine FindRoot in commercial software Mathematica 5.2, we obtain the optimal solutions","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"255 1","pages":"470-476"},"PeriodicalIF":0.0,"publicationDate":"2015-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73247735","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 : 2015-08-17DOI: 10.4304/jnw.10.7.407-412
Asmidar Abu Bakar, Elmunzir Hassan El Talib
Mobile ad hoc networks (MANETs) foster a new research trend in today’s computing. MANET unique features such as scalability, fault tolerant and autonomous system enable a network to be setup with or without any trusted authority makes it suitable for the emergency and rescue operations. During an emergency situation, there is a need for the information sharing among the group of rescuers. However, there is data collected during emergency which cannot be shared to all groups or within members in the same group. Thus, the privacy of data becomes a main concern here. We proposed a heterogeneous access control model which assigned an access to information during emergency based on information sensitivity and member-role in the group created at the emergency area. We formulate a complete HACM model with authentication and authorization. A privacy policy access policy is created and simple analysis with proving technique is used to evaluate it
{"title":"Formulating Heterogeneous Access Control model for MANET Emergency Services","authors":"Asmidar Abu Bakar, Elmunzir Hassan El Talib","doi":"10.4304/jnw.10.7.407-412","DOIUrl":"https://doi.org/10.4304/jnw.10.7.407-412","url":null,"abstract":"Mobile ad hoc networks (MANETs) foster a new research trend in today’s computing. MANET unique features such as scalability, fault tolerant and autonomous system enable a network to be setup with or without any trusted authority makes it suitable for the emergency and rescue operations. During an emergency situation, there is a need for the information sharing among the group of rescuers. However, there is data collected during emergency which cannot be shared to all groups or within members in the same group. Thus, the privacy of data becomes a main concern here. We proposed a heterogeneous access control model which assigned an access to information during emergency based on information sensitivity and member-role in the group created at the emergency area. We formulate a complete HACM model with authentication and authorization. A privacy policy access policy is created and simple analysis with proving technique is used to evaluate it","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"27 1","pages":"407-412"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88189538","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 : 2015-08-17DOI: 10.4304/jnw.10.7.420-430
Victor Kardeby, Ulf Jennehag, M. Gidlund
One of the major challenges to realize the Internet of Things is to support IP mobility for the large amount of connected entities when they move between different locations and access methods. Current solutions for mobility are host centric, requiring support from the infrastructure, or breaks backwards compatibility, which will take a long time or high economic motivation to implement. Solutions for context information exchange are created for specific, small, or localized scenarios with centralized coordination that do not scale well. There is therefore a need for a solution which both scales well, and support IP mobility, without additional demands on current or future Internet infrastructure.We propose the use of a dual-overlay network structure for both information dissemination and as an alternative to current IP mobility technologies. It separates identities from location by introducing a second overlay network where the identity-to-location association is stored. We show analytically that the proposed solution provide logarithmic latency for localization and reduces the overall workload when the number of sensors per host increases beyond seven, with a workload reduction of 15 percentage points at fifteen sensors per host.
{"title":"Overlay Enhanced Mobility for the Internet of Things","authors":"Victor Kardeby, Ulf Jennehag, M. Gidlund","doi":"10.4304/jnw.10.7.420-430","DOIUrl":"https://doi.org/10.4304/jnw.10.7.420-430","url":null,"abstract":"One of the major challenges to realize the Internet of Things is to support IP mobility for the large amount of connected entities when they move between different locations and access methods. Current solutions for mobility are host centric, requiring support from the infrastructure, or breaks backwards compatibility, which will take a long time or high economic motivation to implement. Solutions for context information exchange are created for specific, small, or localized scenarios with centralized coordination that do not scale well. There is therefore a need for a solution which both scales well, and support IP mobility, without additional demands on current or future Internet infrastructure.We propose the use of a dual-overlay network structure for both information dissemination and as an alternative to current IP mobility technologies. It separates identities from location by introducing a second overlay network where the identity-to-location association is stored. We show analytically that the proposed solution provide logarithmic latency for localization and reduces the overall workload when the number of sensors per host increases beyond seven, with a workload reduction of 15 percentage points at fifteen sensors per host.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"7 1","pages":"420-430"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87898314","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 : 2015-08-17DOI: 10.4304/jnw.10.7.397-406
G. F. Shidik, Azhari, K. Mustofa
Various VM instances in Cloud Infrastructure provide flexibility for user to meet their computation requirements. However, this condition leads to the complex infrastructure that require numerous resources and consumes massive electricity due to the flexibility of VM instances. This paper concern in evaluate VM selection policy in Dynamic VM Consolidation. The study would evaluate our proposed method Constant Position Selection Policy (CPS) that compared with other VM Selection Policy such as Minimum Migration Time (MMT),Random Choice(RC) and Maximum Correlation (MC).Evaluation process of this study, measured the performance of Energy Consumption, SLAV, SLATAH, and PDMwith real workload trace data from PlanetLab VMs in various VM instances. Result the proposed method able to minimizing energy consumption of cloud data center in various VM instances with acceptable SLA
{"title":"Evaluation of Selection Policy with Various Virtual Machine Instances in Dynamic VM Consolidation for Energy Efficient at Cloud Data Centers","authors":"G. F. Shidik, Azhari, K. Mustofa","doi":"10.4304/jnw.10.7.397-406","DOIUrl":"https://doi.org/10.4304/jnw.10.7.397-406","url":null,"abstract":"Various VM instances in Cloud Infrastructure provide flexibility for user to meet their computation requirements. However, this condition leads to the complex infrastructure that require numerous resources and consumes massive electricity due to the flexibility of VM instances. This paper concern in evaluate VM selection policy in Dynamic VM Consolidation. The study would evaluate our proposed method Constant Position Selection Policy (CPS) that compared with other VM Selection Policy such as Minimum Migration Time (MMT),Random Choice(RC) and Maximum Correlation (MC).Evaluation process of this study, measured the performance of Energy Consumption, SLAV, SLATAH, and PDMwith real workload trace data from PlanetLab VMs in various VM instances. Result the proposed method able to minimizing energy consumption of cloud data center in various VM instances with acceptable SLA","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"35 1","pages":"397-406"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74800602","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 : 2015-08-17DOI: 10.4304/jnw.10.7.431-442
N. Meghanathan
Scale-free networks are a type of complex networks in which the degree distribution of the nodes is according to the power-law. Centrality of the nodes is a quantitative measure of the importance of the nodes according to the topological structure of the network. The commonly used centrality measures are the degree-based degree centrality and eigenvector centrality and the shortest path-based closeness centrality and betweenness centrality. We use the widely studied Barabasi-Albert (BA) model to simulate the evolution of scale-free networks. The model works by adding new nodes to the network, one at a time, with the new node connected to m of the currently existing nodes. Accordingly, nodes that have been in the network for a longer time have greater chances of acquiring more links and hence a larger degree centrality. While the degree centrality of the nodes has been observed to show a concave down pattern of increase with time; but the time-dependent variation of the other centrality measures has not been analyzed until now. In this paper, we study the time-dependent variation of degree centrality, eigenvector centrality, closeness centrality and betweenness centrality of the nodes during the evolution of a scale-free network according to the BA model
{"title":"Time-Dependent Variation of the Centrality Measures of the Nodes during the Evolution of a Scale-Free Network","authors":"N. Meghanathan","doi":"10.4304/jnw.10.7.431-442","DOIUrl":"https://doi.org/10.4304/jnw.10.7.431-442","url":null,"abstract":"Scale-free networks are a type of complex networks in which the degree distribution of the nodes is according to the power-law. Centrality of the nodes is a quantitative measure of the importance of the nodes according to the topological structure of the network. The commonly used centrality measures are the degree-based degree centrality and eigenvector centrality and the shortest path-based closeness centrality and betweenness centrality. We use the widely studied Barabasi-Albert (BA) model to simulate the evolution of scale-free networks. The model works by adding new nodes to the network, one at a time, with the new node connected to m of the currently existing nodes. Accordingly, nodes that have been in the network for a longer time have greater chances of acquiring more links and hence a larger degree centrality. While the degree centrality of the nodes has been observed to show a concave down pattern of increase with time; but the time-dependent variation of the other centrality measures has not been analyzed until now. In this paper, we study the time-dependent variation of degree centrality, eigenvector centrality, closeness centrality and betweenness centrality of the nodes during the evolution of a scale-free network according to the BA model","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"26 1","pages":"431-442"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80240974","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 : 2015-08-17DOI: 10.4304/jnw.10.7.413-419
Khairul Anshar, N. Suryana, Zahriah Othman, S. K. Baharin
Nowdays, there are many map applications that can be accessed through the web . All these applications are accessing different geospatial data stored on server only. The approach to display different geospatial data type, format, and source from local system becomes new topic in hybrid application for Smartphone. File protocol in XMLHttpRequest can be used to access a file from local system in hybrid application. Another approach is using File API provided by Native Application Framework. To incorporate this API, we create two new classes i.e. URI and HybridFileAPI , as a protocol and request class. These classes utilize File API to access a file in Smartphone local system. We starts the discussion with hybrid map application and system architecture to get understanding about components and processes involved in hybrid map application for Smartphone
{"title":"Different Geospatial Data on Hybrid Map Application","authors":"Khairul Anshar, N. Suryana, Zahriah Othman, S. K. Baharin","doi":"10.4304/jnw.10.7.413-419","DOIUrl":"https://doi.org/10.4304/jnw.10.7.413-419","url":null,"abstract":"Nowdays, there are many map applications that can be accessed through the web . All these applications are accessing different geospatial data stored on server only. The approach to display different geospatial data type, format, and source from local system becomes new topic in hybrid application for Smartphone. File protocol in XMLHttpRequest can be used to access a file from local system in hybrid application. Another approach is using File API provided by Native Application Framework. To incorporate this API, we create two new classes i.e. URI and HybridFileAPI , as a protocol and request class. These classes utilize File API to access a file in Smartphone local system. We starts the discussion with hybrid map application and system architecture to get understanding about components and processes involved in hybrid map application for Smartphone","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"35 1","pages":"413-419"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80381149","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 : 2015-06-29DOI: 10.4304/jnw.10.6.353-368
Muhammad Usman, V. Muthukkumarasamy, Xin-Wen Wu
Existing mobile agent-enabled anomaly detection schemes have not considered temporal behavior for their correct functioning and detection of temporal anomalies. This study employs a holistic system approach to design an Enhanced mobile Agent-enabled Anomaly Detection System (EAADS) by designing two new algorithms. The proposed algorithms are not only important for the completeness of the EAADS, but also for the detection of the anomalies caused by the delayed arrival of the in situ verification results. The formal specifications of the individual algorithmic functionalities are addressed by employing the Petri net theory. A bottom-up synthesis of the individual Petri net modules is carried out to formulate a unified model, which has helped in the identification and removal of inconsistencies in the system design. This process formally characterizes the behavioral properties and the overall workflow of the EAADS. The standard unified Petri net model is then extended into a corresponding high class Generalized Stochastic Petri Net (GSPN) model to formalize and analyze the temporal behavior of the EAADS in a highly nondeterministic communication environment. Finally, the GSPNbased temporal behavior is validated through implementation of the functional specifications on a real testbed composed of the resource constrained MICAz motes. The theoretical and experimental results demonstrate the ability of the EAADS to detect certain types of anomalies and the aptness of the temporal behavior of the EAADS for the low resource sensor networks even in a highly nondeterministic communication environment
{"title":"Specification and Validation of Enhanced Mobile Agent-Enabled Anomaly Detection and Verification in Resource Constrained Networks","authors":"Muhammad Usman, V. Muthukkumarasamy, Xin-Wen Wu","doi":"10.4304/jnw.10.6.353-368","DOIUrl":"https://doi.org/10.4304/jnw.10.6.353-368","url":null,"abstract":"Existing mobile agent-enabled anomaly detection schemes have not considered temporal behavior for their correct functioning and detection of temporal anomalies. This study employs a holistic system approach to design an Enhanced mobile Agent-enabled Anomaly Detection System (EAADS) by designing two new algorithms. The proposed algorithms are not only important for the completeness of the EAADS, but also for the detection of the anomalies caused by the delayed arrival of the in situ verification results. The formal specifications of the individual algorithmic functionalities are addressed by employing the Petri net theory. A bottom-up synthesis of the individual Petri net modules is carried out to formulate a unified model, which has helped in the identification and removal of inconsistencies in the system design. This process formally characterizes the behavioral properties and the overall workflow of the EAADS. The standard unified Petri net model is then extended into a corresponding high class Generalized Stochastic Petri Net (GSPN) model to formalize and analyze the temporal behavior of the EAADS in a highly nondeterministic communication environment. Finally, the GSPNbased temporal behavior is validated through implementation of the functional specifications on a real testbed composed of the resource constrained MICAz motes. The theoretical and experimental results demonstrate the ability of the EAADS to detect certain types of anomalies and the aptness of the temporal behavior of the EAADS for the low resource sensor networks even in a highly nondeterministic communication environment","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"61 1","pages":"353-368"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88039472","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 : 2015-06-29DOI: 10.4304/jnw.10.6.344-352
M. M. Alam, M. Y. Arafat, Feroz Ahmed
Denial of Service (DoS) or Distributed Denial of Service (DDoS) is a powerful attack which prevents the system from providing services to its legitimate users. Several approaches exist to filter network-level attacks, but application-level attacks are harder to detect at the firewall. Filtering at application level can be computationally expensive and difficult to scale, while still creating bogus positives that block legitimate users. In this paper, authors show application layer DoS attack for SIP server using some open source DoS attack tools and also suggest a mechanism that can protect a given SIP server from application-level DoS attacks especially the attacks targeting the resources including CPU, sockets, memory of the victim server. In this paper author’s attempt to illustrate application layer distributed denial of Service (DDoS) attack on SIP Server such as SIP flooding attack, real time transport (RTP) flooding attack using open source DDoS attack tools. We propose a new DDoS defence mechanism that protects SIP servers from application-level DDoS attacks based on the two methodologies: IPtables and fail2ban detection. The attack flow detection mechanism detects attach flows based on the symptom or stress at the server, since it is getting more difficult to identify bad flows only based on the incoming traffic patterns. A popular software known as Wireshark which is a network protocol analyzer is used to capture the packets during DoS attack from the victim server Ethernet interface to detect the attacking host IP address and analysis the types of attack. We evaluate the performance of the proposed scheme via experiment
{"title":"Study on Auto Detecting Defence Mechanisms against Application Layer Ddos Attacks in SIP Server","authors":"M. M. Alam, M. Y. Arafat, Feroz Ahmed","doi":"10.4304/jnw.10.6.344-352","DOIUrl":"https://doi.org/10.4304/jnw.10.6.344-352","url":null,"abstract":"Denial of Service (DoS) or Distributed Denial of Service (DDoS) is a powerful attack which prevents the system from providing services to its legitimate users. Several approaches exist to filter network-level attacks, but application-level attacks are harder to detect at the firewall. Filtering at application level can be computationally expensive and difficult to scale, while still creating bogus positives that block legitimate users. In this paper, authors show application layer DoS attack for SIP server using some open source DoS attack tools and also suggest a mechanism that can protect a given SIP server from application-level DoS attacks especially the attacks targeting the resources including CPU, sockets, memory of the victim server. In this paper author’s attempt to illustrate application layer distributed denial of Service (DDoS) attack on SIP Server such as SIP flooding attack, real time transport (RTP) flooding attack using open source DDoS attack tools. We propose a new DDoS defence mechanism that protects SIP servers from application-level DDoS attacks based on the two methodologies: IPtables and fail2ban detection. The attack flow detection mechanism detects attach flows based on the symptom or stress at the server, since it is getting more difficult to identify bad flows only based on the incoming traffic patterns. A popular software known as Wireshark which is a network protocol analyzer is used to capture the packets during DoS attack from the victim server Ethernet interface to detect the attacking host IP address and analysis the types of attack. We evaluate the performance of the proposed scheme via experiment","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"24 1","pages":"344-352"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84507495","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 : 2015-06-29DOI: 10.4304/jnw.10.6.338-343
Vandung Nguyen, D. Nguyen, H. Nguyen, K. Sripimanwat
Cognitive cellular-femtocell networks are considered as future mobile communication networks which can satisfy challenging requirements of current mobile communications including high user density, quality of service (QoS) provision and efficient spectrum utilization. In this paper, we present a novel downlink channel allocation scheme which allocates downlink channels to new connection requests of real-time connections in cognitive cellular-femtocell networks. In the scheme, a cognitive femtocell access point (CFAP) cooperates with other 2-hop neighbor CFAPs to establish a cooperative channel monitoring group for monitoring and exchanging information of channel occupancy among the CFAPs belonging to the group. Upon receiving a new connection request from a femtocell user (FU), the serving CFAP uses the information of channel occupancy updated from neighboring CFAPs and interference level of channels to allocate a channel, which is expected to cause the minimum interference to macro users (MUs) of the covering macro base station (MBS). Simulation results prove that the proposed scheme can provide better performance than the conventional downlink channel allocation scheme which does not exploit the cooperation of CFAPs in channel monitoring.
{"title":"Downlink Channel Allocation Scheme deploying Cooperative Channel Monitoring for Cognitive Cellular-FemtocellNetworks","authors":"Vandung Nguyen, D. Nguyen, H. Nguyen, K. Sripimanwat","doi":"10.4304/jnw.10.6.338-343","DOIUrl":"https://doi.org/10.4304/jnw.10.6.338-343","url":null,"abstract":"Cognitive cellular-femtocell networks are considered as future mobile communication networks which can satisfy challenging requirements of current mobile communications including high user density, quality of service (QoS) provision and efficient spectrum utilization. In this paper, we present a novel downlink channel allocation scheme which allocates downlink channels to new connection requests of real-time connections in cognitive cellular-femtocell networks. In the scheme, a cognitive femtocell access point (CFAP) cooperates with other 2-hop neighbor CFAPs to establish a cooperative channel monitoring group for monitoring and exchanging information of channel occupancy among the CFAPs belonging to the group. Upon receiving a new connection request from a femtocell user (FU), the serving CFAP uses the information of channel occupancy updated from neighboring CFAPs and interference level of channels to allocate a channel, which is expected to cause the minimum interference to macro users (MUs) of the covering macro base station (MBS). Simulation results prove that the proposed scheme can provide better performance than the conventional downlink channel allocation scheme which does not exploit the cooperation of CFAPs in channel monitoring.","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"9 1","pages":"338-343"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77742937","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 : 2015-06-29DOI: 10.4304/jnw.10.6.329-337
Fouad Benamrane, M. B. Mamoun, R. Benaini
Software Defined Networking (SDN) has gained significant attention from network researchers and industry in recent years. Indeed, the SDN concept provides many advantages such as programmability and easy management of the network. However, it generates new challenges as scalability and performances issues, understanding in-depth the performances and limitations of the SDN concept is a prerequisite to its implementation and deployment in real networks. In this paper, we aim to present in a comprehensive way, the most important works that focus on performances of SDN. As SDN separates the control plane from the data plane, we first present research efforts made to enhance the performances of data plane devices, then, we give an overview of different solutions proposed to improve controller performances. We provide also an overview on recent control plane architectures with multiple controllers that have been proposed to meet performances and scalability constraints. Finally, we present the different techniques and tools used in literature to evaluate the performances of software defined networks
{"title":"Performances of OpenFlow-Based Software-Defined Networks: An overview","authors":"Fouad Benamrane, M. B. Mamoun, R. Benaini","doi":"10.4304/jnw.10.6.329-337","DOIUrl":"https://doi.org/10.4304/jnw.10.6.329-337","url":null,"abstract":"Software Defined Networking (SDN) has gained significant attention from network researchers and industry in recent years. Indeed, the SDN concept provides many advantages such as programmability and easy management of the network. However, it generates new challenges as scalability and performances issues, understanding in-depth the performances and limitations of the SDN concept is a prerequisite to its implementation and deployment in real networks. In this paper, we aim to present in a comprehensive way, the most important works that focus on performances of SDN. As SDN separates the control plane from the data plane, we first present research efforts made to enhance the performances of data plane devices, then, we give an overview of different solutions proposed to improve controller performances. We provide also an overview on recent control plane architectures with multiple controllers that have been proposed to meet performances and scalability constraints. Finally, we present the different techniques and tools used in literature to evaluate the performances of software defined networks","PeriodicalId":14643,"journal":{"name":"J. Networks","volume":"1 1","pages":"329-337"},"PeriodicalIF":0.0,"publicationDate":"2015-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84645215","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
扫码关注我们
求助内容：
应助结果提醒方式：