{"title":"Monitoring the status of MPLS VPN and VPLS based on BGP signaling information","authors":"G. Battista, M. Rimondini, Giorgio Sadolfo","doi":"10.1109/NOMS.2012.6211904","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211904","url":null,"abstract":"The flexibility and ease of setup of MPLS Virtual Private Networks (VPNs) and Virtual Private LAN Service (VPLS) motivate the large and growing user base of these services. It is therefore important for an Internet Service Provider (ISP) to ensure their uninterrupted operation, as also specified in service contracts. Although network monitoring is regarded as an essential activity to pursue this goal, existing monitoring approaches are often limited in the ability to capture the effects of VPN-related events such as reconfigurations and device failures. In this paper we provide several contributions: 1) a methodology to monitor the status of MPLS VPN and VPLS over time, which considers the BGP signaling messages sent by routers to propagate VPN information; the methodology is founded on an analysis of the observable effects of network events; it also envisions presenting the status of MPLS VPN and VPLS in an easy-to-understand visual form that allows to immediately spot potential anomalies; 2) an extensive discussion of the tradeoff between scalability of our monitoring approach and visibility of the effects of network events; 3) an architecture and prototype implementation of a tool based on our methodology; 4) a thorough experimentation of our approach in a realistic network scenario. As an example, the methodology allowed us to spot a subtle routing anomaly triggered by an implementation choice in the routing software used in our experiments.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124814753","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":"A bio-inspired scheme on quorum systems for reliable services data management in MANETs","authors":"Elisa Mannes, M. N. Lima, A. Santos","doi":"10.1109/NOMS.2012.6211909","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211909","url":null,"abstract":"Network services in MANETs, such as resource location and distribution of connectivity information, deal with node mobility and resource constraints to support applications. The reliability and availability of these services can be assured by data management approaches, as replication techniques using quorum systems. However, these systems are vulnerable to selfish and malicious nodes, that intentionally do not collaborate with replication operations or spread malicious data while participating in data replication. In order to handle these issues, this paper proposes QS2, a bio-inspired scheme to tolerate selfish and malicious nodes in replication operation of quorum systems. Differently from existing works on the literature, QS2 is distributed and self-organized, and each node has the autonomy to exclude misbehaving nodes. The scheme is inspired by quorum sensing and kin selection, both biological mechanisms resident in bacteria. Simulation results show that QS2 improves significantly the reliability of a quorum system for MANETs, detecting more than 80% of misbehaving nodes on replication operations.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125941340","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":"Parameters and challenges for Virtual Network embedding in the Future Internet","authors":"David Stezenbach, Matthias Hartmann, K. Tutschku","doi":"10.1109/NOMS.2012.6212063","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6212063","url":null,"abstract":"Recent developments in network science will facilitate the Internet as we know it today to integrate existing and upcoming technologies into a heterogeneous and highly dynamic resource pool. This enables the design of new applications and services which will form the Future Internet (FI). From this, many interesting prospects and unknown flexibility in terms of resource usage arise. In order to achieve this flexibility and make it usable for Service Providers (SPs) a key concept of the FI will be Virtual Networks (VNs) embedded into this resource pool. Furthermore, Federation which includes a closer interaction, resource sharing, and information exchange between providers will be an enabler for this freedom of design. This allows the operation of heterogeneous and divergent services on the same physical infrastructure substrate. It is clear to see that all these upcoming possibilities offer new areas of research. In this work we structure the parameters required to describe resources and services accurately. Furthermore, we summarize research questions that need to be resolved in order to make the FI a story of success.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130379466","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":"Autonomies in policy based network management","authors":"M. Siddiqui, C. Hong, Mi-Jung Choi","doi":"10.1109/NOMS.2012.6212046","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6212046","url":null,"abstract":"In this paper, we have devised a reinforcement learning algorithm, which helps in enabling autonomic control loops in Policy based Autonomic Network Management (PBANM). We have proposed two autonomic control loops for optimal configuration and policy optimization in PBANM system. Simulations are performed to validate our proposal.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"8 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129176936","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}
M. Assunção, M. Netto, B. Peterson, Lakshminarayanan Renganarayana, J. Rofrano, Chris Ward, Christopher Young
{"title":"CloudAffinity: A framework for matching servers to cloudmates","authors":"M. Assunção, M. Netto, B. Peterson, Lakshminarayanan Renganarayana, J. Rofrano, Chris Ward, Christopher Young","doi":"10.1109/NOMS.2012.6211901","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211901","url":null,"abstract":"Increasingly organizations are considering moving their workloads to clouds to take advantage of the anticipated benefits of a more cost effective and agile IT infrastructure. A key component of a cloud service, as it is exposed to the consumer, is the published selection of instance resource configurations (CPU, memory, and disk). The number of instance configurations, as well as the specific values that characterize them, form important decisions for the cloud service provider. This paper explores these resource configurations; examines how well a traditional data center fits into the cloud model from a resource allocation perspective; and proposes a framework, named CloudAffinity, aimed at selecting an optimal number of configurations based on customer requirements.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129309611","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}
Kwang-Koog Lee, J. Ryoo, Sun Me Kim, Jong Hyun Lee
{"title":"Effective load balancing in Ethernet rings","authors":"Kwang-Koog Lee, J. Ryoo, Sun Me Kim, Jong Hyun Lee","doi":"10.1109/NOMS.2012.6211936","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211936","url":null,"abstract":"This paper models a ring loading problem suited for survivable Ethernet rings blocking a link to create a loop-free topology. When a block is given on a link of an Ethernet ring, loading of traffic demands is immediately determined due to the logically formed bus topology. As the traffic load over a ring varies depending on the position of the block, the ring loading problem can be viewed a new optimization problem named the ring block positioning (RBP) problem. Our RBP is grouped into two types: RBPG to minimize the overall ring load and RBPL to minimize the maximum link load. For each RBP, we present an exhaustive search method to check all block cases on a ring and then suggest a more effective ring loading algorithm ensuring the computing time shorter than the exhaustive search. According to our experiments using MATLAB, each effective ring loading method shows computing time about 360 times in RBPG and about four times in RBPL faster than each exhaustive search while finding the optimal block to satisfy the goal of each RBP.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127948763","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":"Towards energy-awareness in managing wireless LAN applications","authors":"Markus Tauber, S. Bhatti, Yi Yu","doi":"10.1109/NOMS.2012.6211930","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211930","url":null,"abstract":"We have investigated the scope for enabling WLAN applications to manage the trade-off between performance and energy usage. We have conducted measurements of energy usage and performance in our 802.11n WLAN testbed, which operates in the 5 GHz ISM band. We have defined an effective energy usage envelope with respect to application-level packet transmission, and we demonstrate how performance as well as the effective energy usage envelope is effected by various configurations of IEEE 802.11n, including transmission power levels and channel width. Our findings show that the packet size and packet rate of the application flow have the greatest impact on application-level energy usage, compared to transmission power and channel width. As well as testing across a range of packet sizes and packet rates, we emulate a Skype flow, a YouTube flow and file transfers (HTTP over Internet and local server) to place our results in context. Based on our measurements we discuss approaches and potential improvements of management in effective energy usage for the tested applications.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"C-27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126481050","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":"Fault detection in MANETs","authors":"Walee Al Mamun, H. Lutfiyya, D. Kidston, Li Li","doi":"10.1109/NOMS.2012.6211981","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211981","url":null,"abstract":"Node faults may be frequent in a mobile ad hoc network (MANET). Most work related to fault detection and localization for MANETS essentially use changes in topology to identify faults. Most of this work does not distinguish between node movement that results in a functioning node moving out of range of all other nodes versus a node that crashes as the result of a radio transmitter malfunctioning or a battery no longer operating. This paper introduces a novel protocol that makes this distinction. Nodes forward their neighbourhood observations to a cluster head. The cluster head uses this to determine a list of suspected crashed nodes and sends this list to all the other nodes to filter out those nodes that have moved out of range. The cross-layer implementation of the protocol is effective in distinguishing between crashed nodes and nodes that have moved out of range.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"os-54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127847101","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":"An evasive attack on SNORT flowbits","authors":"Tung Tran, I. Aib, E. Al-Shaer, R. Boutaba","doi":"10.1109/NOMS.2012.6211918","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211918","url":null,"abstract":"The support of stateful signatures is an important feature of signature-based Network Intrusion Detection Systems (NIDSs) which permits the detection of multi-stage attacks. However, due to the difficulty to completely simulate every application protocol, several NIDS evasion techniques exploit this Achilles' heel, making the NIDS and its protected system see and explain a packet sequence differently. In this paper, we propose an evasion technique to the Snort NIDS which exploits its flowbits feature. We specify the flowbit evasion attack and provide practical algorithms to solve it with controllable false positives and formally prove their correctness and completeness. We implemented a tool called SFET which can automatically parse a Snort rule set, generate all possible sequences that can evade it, as well as produce a patch to guard the rule set against those evasions. Although Snort was used for illustration, both the evasion attack and the solution to it are applicable to any stateful signature-based NIDS.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121246543","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}
Hai Huang, Salman Baset, Chunqiang Tang, Ashu Gupta, K. Sudhan, Fazal Feroze, Rajesh Garg, Sumithra Ravichandran
{"title":"Patch management automation for enterprise cloud","authors":"Hai Huang, Salman Baset, Chunqiang Tang, Ashu Gupta, K. Sudhan, Fazal Feroze, Rajesh Garg, Sumithra Ravichandran","doi":"10.1109/NOMS.2012.6211988","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211988","url":null,"abstract":"Applying patches to operating systems, middleware, and applications is considered a major IT pain point due to several reasons. The operating systems and software are of myriad types, there is interdependency among the updates, operating system, and applications, there is lack of standardization among different enterprise customers, and finally testing the applications and operating systems post-update is challenging. As a result, human operator is involved in different stages of the patching process, making it costly and cumbersome. Cloud can help standardize various offerings to customers, and potentially remove human operators. However, it introduces other challenges such as VM time zones and restoring VMs from snapshots which are not present in traditional enterprise environments. We discuss the challenges of achieving patch automation in a Cloud, and then describe our solution.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122775786","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}