Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013)最新文献

On the manipulability of voting systems: application to multi-operator networks 投票系统的可操控性研究:在多运营商网络中的应用

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013) Pub Date : 2013-10-14 DOI: 10.1109/CNSM.2013.6727849

F. Durand, F. Mathieu, L. Noirie

引用次数: 4

Integrating an online configuration checker with existing management systems: Application to CIM/WBEM environments 将在线配置检查器与现有管理系统集成:应用于CIM/WBEM环境

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013) Pub Date : 2013-10-14 DOI: 10.1109/CNSM.2013.6727855

Ludi Akue, E. Lavinal, T. Desprats, M. Sibilla

引用次数: 7

Lightweight link dimensioning using sFlow sampling 使用sFlow采样的轻量级链接量纲

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013) Pub Date : 2013-10-14 DOI: 10.1109/CNSM.2013.6727827

R. Schmidt, R. Sadre, A. Sperotto, A. Pras

引用次数: 8

Assessment and event based analysis of dynamic wireless networks 动态无线网络的评估与事件分析

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013) Pub Date : 2013-10-14 DOI: 10.1109/CNSM.2013.6727832

Denis Carvin, G. Kremer, P. Owezarski, Pascal Berthou

{"title":"Assessment and event based analysis of dynamic wireless networks","authors":"Denis Carvin, G. Kremer, P. Owezarski, Pascal Berthou","doi":"10.1109/CNSM.2013.6727832","DOIUrl":"https://doi.org/10.1109/CNSM.2013.6727832","url":null,"abstract":"The last decade has seen an increasing interest for wireless communications. With the current use of smart-phones and tablets, together with the rise of the Internet of Things, the number of mobile nodes in networks is significantly changing the way they are managed. Indeed, these wireless networks are highly dynamic, mainly, regarding topology and traffic matrices. The high dynamism of mobile nodes can for instance impact the connectivity of the network, or the role of the nodes in the routing graph. Given this increasing complexity, network's service management requires to be as autonomous as possible. However, autonomy can not be achieved unless the network is able to assess and understand its own behavior. In this paper, we propose an assessment index (SA) based on nodes' satisfaction and its self-estimation algorithm for wireless mobile networks.We then provide events' collection and distributed mining methods allowing nodes to analyze the evolution of this index.We illustrate our framework and characterize the estimation error for various network properties under NS3 simulations.","PeriodicalId":410168,"journal":{"name":"Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128233952","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}

引用次数: 2

A cloud monitoring framework for self-configured monitoring slices based on multiple tools 一个云监控框架，用于基于多个工具的自配置监控片

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013) Pub Date : 2013-10-01 DOI: 10.1109/CNSM.2013.6727833

M. D. Carvalho, R. Esteves, Guilherme da Cunha Rodrigues, L. Granville, L. Tarouco

{"title":"A cloud monitoring framework for self-configured monitoring slices based on multiple tools","authors":"M. D. Carvalho, R. Esteves, Guilherme da Cunha Rodrigues, L. Granville, L. Tarouco","doi":"10.1109/CNSM.2013.6727833","DOIUrl":"https://doi.org/10.1109/CNSM.2013.6727833","url":null,"abstract":"The monitoring of cloud computing environments is a key point to assure the availability of the cloud slices offered to cloud users. However, there are not any monitoring systems that satisfy all the cloud administrator requirements which imposes that cloud slices need to be monitored by a set of monitoring systems. The set of monitoring system configuration necessary to monitor a cloud slice and the corresponding set of monitored metrics we define as a monitoring slice. Unfortunately, the monitoring slices need to be built using solutions that are not integrated with cloud platforms. This lack of integration imposes that cloud administrators manually configure the monitoring solutions or develop scripts to automate this task. In this paper we propose a framework to address the problem of creating monitoring slices automatically independent of the monitoring solutions employed. To evaluate our proposed framework in an IaaS scenario, we develop FlexACMS, flexible automate cloud monitoring slices, which relies on a modules that flexibly handles cloud platforms and monitoring solutions.","PeriodicalId":410168,"journal":{"name":"Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125107416","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}

引用次数: 28

Reciprocity with virtual nodes: Supporting mobile peers in Peer-to-Peer content distribution 与虚拟节点的互惠:在点对点内容分发中支持移动节点

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013) Pub Date : 2013-10-01 DOI: 10.1109/CNSM.2013.6727866

M. Wichtlhuber, Peter Heise, Bjorn Scheurich, D. Hausheer

{"title":"Reciprocity with virtual nodes: Supporting mobile peers in Peer-to-Peer content distribution","authors":"M. Wichtlhuber, Peter Heise, Bjorn Scheurich, D. Hausheer","doi":"10.1109/CNSM.2013.6727866","DOIUrl":"https://doi.org/10.1109/CNSM.2013.6727866","url":null,"abstract":"The Peer-to-Peer (P2P) paradigm offers scalable means to perform bulk data distribution, e.g., for small businesses which cannot afford huge upfront investments, by incorporating user's resources in the dissemination process. Due to the proliferation of smartphones with wireless broadband connectivity and the increasing convergence of fixed and mobile platforms, a growing number of users are expected to participate in P2P content distribution networks wirelessly. However, the P2P approach only works if users are willing to contribute resources. A commonly applied incentive scheme is the well-known Tit-for-Tat approach, where each peer is forced to contribute as much bandwidth to the network as he consumes. Nevertheless, reciprocal schemes discriminate resource poor mobile devices in terms of energy and upload bandwidth, as they are device-bound instead of being user-bound. In this work, an incentive scheme featuring virtual nodes is presented, which allows mobile devices to seek help from other devices owned by its user, e.g., the user's home gateway or a supporting cloud instance. Preliminary results are presented in the scope of a P2P streaming scenario.","PeriodicalId":410168,"journal":{"name":"Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127024557","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}

引用次数: 3

Detecting anomalies in cellular networks using an ensemble method 利用集成方法检测蜂窝网络中的异常

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013) Pub Date : 2013-10-01 DOI: 10.1109/CNSM.2013.6727831

Gabriela F. Cretu-Ciocarlie, U. Lindqvist, S. Nováczki, H. Sanneck

引用次数: 78

Network performance improvement through evaluation of bicriteria routing methods in transport networks 通过对传输网络中双标准路由方法的评估来提高网络性能

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013) Pub Date : 2013-10-01 DOI: 10.1109/CNSM.2013.6727807

Lúcia Martins, João Lopes, J. Craveirinha, J. Clímaco, Ricardo Cadime, C. Monica

{"title":"Network performance improvement through evaluation of bicriteria routing methods in transport networks","authors":"Lúcia Martins, João Lopes, J. Craveirinha, J. Clímaco, Ricardo Cadime, C. Monica","doi":"10.1109/CNSM.2013.6727807","DOIUrl":"https://doi.org/10.1109/CNSM.2013.6727807","url":null,"abstract":"Bandwidth allocation and management is of paramount importance for telcos mainly in packet transport networks where bandwidth needs an even more tricky control than in the previous circuit-based SDH networks. In these new transport networks, as is the case of MPLS-TP or Carrier Ethernet networks, it is very important to balance the traffic load distribution in order to avoid localized overloads when some parts of the networks still have available bandwidth. The load balance in the network can improve the fulfillment of the service level agreements and the network performance, namely with respect to the amount of carried traffic. In point-to-point (p2p) virtual connections it is well known that the shortest paths obtained through the hop count metric can lead to an inefficient load distribution. In order to better distribute the traffic over the network other metrics that can be used in shortest paths algorithms have been proposed in the literature. In this paper we present a bicriteria approach in which the first objective has the purpose of better distribute the traffic in the network and the second objective function intends to minimize the amount of network resources involved in each virtual connection. This is a general approach that can be applied to different kind of virtual connections such as point to multipoint (p2m) or multipoint to multipoint (m2m). This paper is focused on the algorithms and the methods involved in the calculation and path selection for p2p connections and also presents a network performance study of the addressed methods, considering realistic transport networks.","PeriodicalId":410168,"journal":{"name":"Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116438263","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}

引用次数: 4

Refactoring multi-layered access control policies through (De)composition 通过(De)组合重构多层访问控制策略

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013) Pub Date : 2013-10-01 DOI: 10.1109/CNSM.2013.6727843

M. Casalino, R. Thion

{"title":"Refactoring multi-layered access control policies through (De)composition","authors":"M. Casalino, R. Thion","doi":"10.1109/CNSM.2013.6727843","DOIUrl":"https://doi.org/10.1109/CNSM.2013.6727843","url":null,"abstract":"Policy-based access control is a well-established paradigm for securing layered IT systems. Access control policies, however, often do not focus on dedicated architecture layers, but increasingly employ concepts of multiple layers. Web application servers, for instance, typically support request filtering on the basis of network addresses. The resulting flexibility comes with increased management complexity and the risk of security-relevant misconfiguration when looking at the various policies in isolation. We therefore propose a flexible access control framework able to provide a comprehensive view of the global access control policy implemented in a given system. The focus of this paper is to lay down the theoretical foundations of this framework that allows (i) to describe authorization policies from different architecture layers, (ii) to capture the semantics of dependencies between layers in order to create a composed view of the global policy, and (iii) to decompose the global policy again into a collection of simpler ones by means of algebraic techniques inspired from database normalization theory.","PeriodicalId":410168,"journal":{"name":"Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127930279","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}

引用次数: 2

Scalable matching and ranking for network search 网络搜索的可伸缩匹配和排名

Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013) Pub Date : 2013-10-01 DOI: 10.1109/CNSM.2013.6727844

Misbah Uddin, R. Stadler, A. Clemm

{"title":"Scalable matching and ranking for network search","authors":"Misbah Uddin, R. Stadler, A. Clemm","doi":"10.1109/CNSM.2013.6727844","DOIUrl":"https://doi.org/10.1109/CNSM.2013.6727844","url":null,"abstract":"Network search makes operational data available in real-time to management applications. In contrast to traditional monitoring, neither the data location nor the data format needs to be known to the invoking process, which simplifies application development, but requires an efficient search plane inside the managed system. The search plane is realized as a network of search nodes that process search queries in a distributed fashion. This paper introduces matching and ranking for network search queries. We are proposing a semantic for matching and ranking, which is configurable to support different types of management applications-from exact matching for database-style queries to loose, approximate matching, which is appropriate for exploratory purposes. We describe an echo protocol for efficient distributed query processing that supports matching and ranking. Further, we present the design of a search node, which maintains a real-time database of operational information and allows for parallel processing of search queries. A prototype implementation on a cloud testbed shows that the network search system, on a 9-node cluster with 24 core servers, executes 200 global search queries/sec with the 75th percetile latency below 100 milliseconds and with a CPU utilization below 5%. The performance measurements, together with our design, suggest that a system of 100,000 servers processing the same load would exhibit the same overhead per server and a query latency of below 1 sec.","PeriodicalId":410168,"journal":{"name":"Proceedings of the 9th International Conference on Network and Service Management (CNSM 2013)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115873508","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}

引用次数: 8