{"title":"A scalable source multipath routing architecture for datacenter networks","authors":"Wen-Kang Jia, Gen-Hen Liu, Yaw-Chung Chen","doi":"10.1109/CNSM.2015.7367372","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367372","url":null,"abstract":"The continuous growth in traffic volumes on modern Data Center Networks (DCNs) can be classified into either delay-or throughput-sensitive applications. In order to providing quality delivery to such applications, it is important that multipath routing and/or forwarding can be supported in the DCNs. However, some inherent problems of multipath forwarding have not been totally solved by existing solutions. Aiming to balance all these requirements for the multipath DCNs, we propose a novel solution - Code-Oriented eXplicit MultiPath (COXMP) scheme which evenly distributes traffic along multiple paths, resulting in better network throughput, delay, jitter, and resilience. The simulation results show that COXMP outperforms existing solutions and achieves a reasonable tradeoff between scalability and overhead.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126772103","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}
{"title":"Scalable microservice based architecture for enabling DMTF profiles","authors":"Divyanand Malavalli, Sivakumar Sathappan","doi":"10.1109/CNSM.2015.7367395","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367395","url":null,"abstract":"This paper proposes an architecture for implementing DMTF management Profiles in middleware layer of a management console, using microservices. Microservices is a software architecture style, gaining popularity for developing Internet scale applications. This paper will also provide a comparison with the current prevalent method of design. This paper will also discuss how this microservice can be exposed utilizing REST thus further making it scalable, lightweight etc. This scalable microservice in turn can interact with the managed device using either SOAP (as defined in DASH or SMASH) or REST (as defined in Redfish).","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"358 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134006463","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}
{"title":"Ant colony optimization for QoE-centric flow routing in software-defined networks","authors":"O. Dobrijevic, Matija Santl, M. Matijasevic","doi":"10.1109/CNSM.2015.7367371","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367371","url":null,"abstract":"We present design, implementation, and an evaluation of an ant colony optimization (ACO) approach to flow routing in software-defined networking (SDN) environments. While exploiting a global network view and configuration flexibility provided by SDN, the approach also utilizes quality of experience (QoE) estimation models and seeks to maximize the user QoE for multimedia services. As network metrics (e.g., packet loss) influence QoE for such services differently, based on the service type and its integral media flows, the goal of our ACO-based heuristic algorithm is to calculate QoE-aware paths that conform to traffic demands and network limitations. A Java implementation of the algorithm is integrated into SDN controller OpenDaylight so as to program the path selections. The evaluation results indicate promising QoE improvements of our approach over shortest path routing, as well as low running time.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134395087","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}
Ahmed Medhat, G. Carella, Christian Lück, M. Corici, T. Magedanz
{"title":"Near optimal service function path instantiation in a multi-datacenter environment","authors":"Ahmed Medhat, G. Carella, Christian Lück, M. Corici, T. Magedanz","doi":"10.1109/CNSM.2015.7367379","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367379","url":null,"abstract":"Service Function Chaining (SFC) supports services/applications through linking an ordered list of service functions (such as firewalls, deep packet inspections and load balancers) in the network. Using Software Defined Networking (SDN) and Network Function Virtualization (NFV) provides a simpler and shorter SFC process. In order to provide high-availability on a multi-site SFC, it is required a flexible algorithm able to properly select Service Function instances while creating the Service Function Path (SFP). This paper presents a new service function selection algorithm providing a flexible tradeoff between the SFP distance and the loads per service function instances at the deployment stage. The flexible tradeoff provided in the algorithm can be adjusted by a parameter. This parameter value can differ among different types of SFCs based on the service/application (real time or non-real time) dedicated for its SFC. Matlab has been utilized for validating it with different scenarios. It is also compared to other existing algorithms such as, load balancing and shortest path. The results showed that the proposed algorithm could provide the best SFP end-to-end distance performance as the shortest path algorithm for the real time services/applications, and that will result a good Quality of Service (QoS) performance for real time services/applications. Furthermore, the proposed algorithm provides an acceptable load distribution over the available service functions instances better than shortest path algorithm and not far from and load balancing algorithms.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"261 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134463846","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}
{"title":"On the limits of PCI auto configuration and reuse in 4G/5G ultra dense networks","authors":"Stephen S. Mwanje, Janne Ali-Tolppa, H. Sanneck","doi":"10.1109/CNSM.2015.7367344","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367344","url":null,"abstract":"Increased demand for higher user throughput has led to deployment of multi-layer networks commonly called heterogeneous networks (Hetnets). Therein, small cells are deployed alongside traditional macro cells, in many cases on the same spectrum. Such scenarios complicate the configuration of network parameters such as the Physical Cell Identity (PCI). A number of approaches have as such been proposed to automate the allocation of PCIs in such scenarios. These approaches seek to address the two conflicting objectives for PCI assignment in a hetnet scenario: 1) the need for optimal performance by avoiding conflicts, against 2) the requirement to separate the different layers and avoid any need to share knowledge among the layers. However, as the density of small cells increases evolving the Hetnets into what are called Ultra Dense Networks (UDN), these approaches reach their limits. In this paper, we study the performance of the current PCI allocation strategies in such UDN scenarios and evaluate their break down points. Our results show that these strategies do not adequately address PCI allocation for the UDN scenario. Specifically, we observe that PCI assignment in one layer requires knowledge of the assignments in the other layer, otherwise the consequence is a very high count of PCI confusions.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121919497","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}
{"title":"ICC: An incentive-compatible inter-cloud communication traffic management mechanism","authors":"Manos Dramitinos, G. Stamoulis","doi":"10.1109/CNSM.2015.7367336","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367336","url":null,"abstract":"In this paper we introduce the Inter-Cloud Communication Traffic Management mechanism (ICC). ICC performs rate control over the ISP transit link(s) aiming to attain a target reduction of transit cost. ICC reduces ISPs transit charge by shaping a portion of the inter-domain traffic (e.g. delay-tolerant inter-cloud traffic), which has been marked as time-shiftable by the traffic source, i.e. by the business customer of the ISP such as a cloud/data center. In particular, ICC reduces the transmission rate of marked traffic at peak 5-min billable intervals and increases it at off-peak, acting at even shorter timescales according to a novel rate-adaptation algorithm. We evaluate numerically ICC by employing real traffic traces. The results reveal that ICC can significantly reduce the ISP transit charge and thus can be a promising and practically applicable solution for ISPs while also being beneficial for their customers whom the ISP should incentivize by sharing its savings.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130373190","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}
{"title":"Certifying spoofing-protection of firewalls","authors":"C. Diekmann, Lukas Schwaighofer, G. Carle","doi":"10.1109/CNSM.2015.7367354","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367354","url":null,"abstract":"We present an algorithm to certify IP spoofing protection of firewall rulesets. The algorithm is machine-verifiably proven sound and its use is demonstrated in real-world scenarios.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132004210","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}
Gaetan Hurel, Rémi Badonnel, Abdelkader Lahmadi, O. Festor
{"title":"Behavioral and dynamic security functions chaining for Android devices","authors":"Gaetan Hurel, Rémi Badonnel, Abdelkader Lahmadi, O. Festor","doi":"10.1109/CNSM.2015.7367339","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367339","url":null,"abstract":"We present an approach for dynamically outsourcing and composing security functions for mobile devices, according to the network behavior of their running applications. Applications are characterized from a network point of view using data mining and clustering techniques with the aim to select their appropriate security functions. Software-defined networking mechanisms are employed to chain the selected functions and to redirect mobile apps traffic through the resulting security compositions. Those ones can be fully outsourced or split between in-cloud and on-device. Both a prototype and extensive simulations demonstrate the feasibility of the approach and assess its benefits.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125663562","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}
{"title":"LogCluster - A data clustering and pattern mining algorithm for event logs","authors":"Risto Vaarandi, Mauno Pihelgas","doi":"10.1109/CNSM.2015.7367331","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367331","url":null,"abstract":"Modern IT systems often produce large volumes of event logs, and event pattern discovery is an important log management task. For this purpose, data mining methods have been suggested in many previous works. In this paper, we present the LogCluster algorithm which implements data clustering and line pattern mining for textual event logs. The paper also describes an open source implementation of LogCluster.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126599113","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}
{"title":"Real-time data reduction at the network edge of Internet-of-Things systems","authors":"Apostolos Papageorgiou, Bin Cheng, E. Kovacs","doi":"10.1109/CNSM.2015.7367373","DOIUrl":"https://doi.org/10.1109/CNSM.2015.7367373","url":null,"abstract":"The expected huge increase in the number of IoT data sources (sensors, embedded systems, personal devices etc.) will give rise to network-edge computing, i.e., data pre-processing, local storage, and filtering close to the data sources. Specifically, data reduction at the network edge (e.g., on an IoT gateway device or a mini-server deployed locally at an IoT area network) can prevent I/O bottlenecks, as well as dramatically reduce storage, bandwidth, and energy costs. However, current solutions face two main obstacles towards achieving this benefits of network-edge computing. Firstly, the most efficient algorithms for data reduction of time series (which is one of the prevailing kinds of data in IoT) are developed to work a posteriori upon big datasets and they cannot take decisions per incoming data item. Secondly, the state of the art lacks systems that can apply any of many different possible data reduction methods without adding significant delays or heavyweight re-configurations. This paper presents a solution that automates the switching between different data handling algorithms at the network edge, including an analysis of adjusted data reduction methods, as well as three flavors of a new algorithm that is capable of performing real-time reduction of incoming time series items based on the concept of Perceptually Important Points. The potential benefits are evaluated upon real datasets from street, household, and robot sensors, showing that our solution achieves accuracies between 76,1 % and 93,8 % despite forwarding only 1/3 of the data items, without adding significant forwarding delays.","PeriodicalId":207635,"journal":{"name":"2015 11th International Conference on Network and Service Management (CNSM)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116732008","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}