{"title":"A novel mechanism for rapid provisioning virtual machines of cloud services","authors":"Chun-Hao Liao, Chi-Sheng Wu, Hey-Chyi Young, Kuo-Hua Chang, Hsien-Hui Huang, Chia-Ching Hsu, Kuan-Hsiung Liang","doi":"10.1109/NOMS.2012.6211990","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211990","url":null,"abstract":"Cost down and energy saving are concerned issues in recent years. As a result, cloud computing services for enterprises and persons have been increasing. As for cloud Infrastructure-as-a Service (IaaS), virtual machines (VM) in \"cloud\" are also starting to replace the original local hosts commonly. Meeting consumers' IaaS requirements with different computing powers, different operating systems, and different quantities in a fast and on-demand fashion has become an important issue for cloud service providers. For Chunghwa Telecom's IaaS service, branded \"hicloud\", we propose a novel mechanism for rapid provisioning a variety of virtual machines. We illustrate the end-to-end IaaS fulfillment process, kernel VM Pool Management and multi-threading VM activation mechanism for fast VM provisioning in this paper in detail.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"86 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":"123104359","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}
G. Gonçalves, M. Santos, Gustavo Charamba, P. Endo, D. Sadok, J. Kelner, B. Melander, Jan-Erik Mångs
{"title":"D-CRAS: Distributed cloud resource allocation system","authors":"G. Gonçalves, M. Santos, Gustavo Charamba, P. Endo, D. Sadok, J. Kelner, B. Melander, Jan-Erik Mångs","doi":"10.1109/NOMS.2012.6211980","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211980","url":null,"abstract":"In this paper we present implementation guidelines of the Distributed Cloud Resource Allocation System (D-CRAS). D-CRAS ensures an automatic monitoring and control of resources to guarantee the optimal functioning of the Cloud while meeting developers' requirements. Additionally, this work establishes the necessary technologies that meet the construction of the proposed system.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"44 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":"122898165","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 first look into SCADA network traffic","authors":"R. Barbosa, R. Sadre, A. Pras","doi":"10.1109/NOMS.2012.6211945","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211945","url":null,"abstract":"Supervisory Control and Data Acquisition (SCADA) networks are commonly deployed to aid the operation of critical infrastructures, such as water distribution facilities. These networks provide automated processes that ensure the correct functioning of these infrastructures, in a operation much similar to those of management operations found in traditional Internet Protocol (IP), in particular the Simple Network Management Protocol (SNMP). In this paper we provide a first look into characteristics of SCADA traffic, with the goal of building an empirical foundation for future research, and investigate to what extent the SCADA traffic patterns are similar to SNMP.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"71 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":"123892818","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}
Cynthia Wagner, J. François, Radu State, T. Engel, Gérard Wagener, Alexandre Dulaunoy
{"title":"SDBF: Smart DNS brute-forcer","authors":"Cynthia Wagner, J. François, Radu State, T. Engel, Gérard Wagener, Alexandre Dulaunoy","doi":"10.1109/NOMS.2012.6212021","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6212021","url":null,"abstract":"The structure of the domain name is highly relevant for providing insights into the management, organization and operation of a given enterprise. Security assessment and network penetration testing are using information sourced from the DNS service in order to map the network, perform reconnaissance tasks, identify services and target individual hosts. Tracking the domain names used by popular Botnets is another major application that needs to undercover their underlying DNS structure. Current approaches for this purpose are limited to simplistic brute force scanning or reverse DNS, but these are unreliable. Brute force attacks depend of a huge list of known words and thus, will not work against unknown names, while reverse DNS is not always setup or properly configured. In this paper, we address the issue of fast and efficient generation of DNS names and describe practical experiences against real world large scale DNS names. Our approach is based on techniques derived from natural language modeling and leverage Markov Chain Models in order to build the first DNS scanner (SDBF) that is leveraging both, training and advanced language modeling approaches.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"12 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":"126175585","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":"xAccess: A unified user-centric access control framework for web applications","authors":"Kapil Singh","doi":"10.1109/NOMS.2012.6211948","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211948","url":null,"abstract":"With the rapid growth of Web 2.0, users are contributing more and more content on the Internet, in the form of user profiles, blogs, reviews, etc. With this increased sharing comes a pressing need for access control policies and mechanisms to protect the users' privacy. Access control has remained largely centralized and under the control of the web applications. Moreover, most web applications either provide no or very primitive and limited access control. We argue that the owner of any piece of data on the web should be able to decide how to control access to this data. This argument should hold not only for the web applications contributing data, but also for the contributing users. In other words, users should be able to choose their own access control models to control the sharing of their data independent of the underlying applications. In this work, we present a novel framework, called xAccess, for providing access control that empowers users to control how they want their data to be accessed. xAccess is analogous to the single sign-on mechanism, however, instead of providing login capability, it provides the user with a single point for defining his access control models and policies for one or multiple applications. On one hand, xAccess enables individual users to use a single unified access control across multiple web applications; and on the other hand, it allows an application to support different access control models deployed by its users with a single model abstraction. We demonstrate the viability of our design by means of a platform prototype. The usability of the platform is further evaluated by developing sample applications using the xAccess APIs.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"58 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":"126302696","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 the assessment of distributed vulnerabilities in autonomic networks and systems","authors":"Martín Barrère, Rémi Badonnel, O. Festor","doi":"10.1109/NOMS.2012.6211916","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211916","url":null,"abstract":"Vulnerability management constitutes a crucial activity within autonomic networks and systems. Distributed vulnerabilities must be assessed over a consolidated view of the network in order to detect vulnerable states that may simultaneously involve two or more devices. In this work, we present a novel approach for describing and assessing distributed vulnerabilities in such self-governed environments. We put forward a mathematical construction for defining distributed vulnerabilities as well as an extension of the OVAL language called DOVAL for describing them. We then define a framework for assessing distributed vulnerabilities in autonomic environments that exploits the knowledge provided by such descriptions. We finally show the feasibility of our solution by analyzing the behavior of the proposed algorithms and strategies through a comprehensive set of experiments.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"14 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":"129611910","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}
Changhee Cho, J. Jeon, Jong-Yul Kim, Soonman Kwon, Sungshin Kim
{"title":"Network-based synchronizing control of a practical microgrid","authors":"Changhee Cho, J. Jeon, Jong-Yul Kim, Soonman Kwon, Sungshin Kim","doi":"10.1109/NOMS.2012.6211989","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211989","url":null,"abstract":"This application track paper describes the network-based distributed control technology that is applied to practical microgrid application. The paper is dealing with network-based remote sensors, central calculation of control offset signals, and the remote control of distributed generation resources. Through the dynamic modeling and experimental test results, characteristics of the proposed control scheme is shown and the performance is verified.","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":"131120374","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}
Vinicius C. M. Borges, Erik Dimitrov, M. Curado, E. Monteiro
{"title":"Performance assessment of cluster load balancing routing methods for triple play services in Wireless Mesh Networks","authors":"Vinicius C. M. Borges, Erik Dimitrov, M. Curado, E. Monteiro","doi":"10.1109/NOMS.2012.6212017","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6212017","url":null,"abstract":"Wireless Mesh Networks (WMNs) are being called upon to improve their management policies to support a wide range of multimedia applications. As gateways towards wired networks are potential bottlenecks, cluster load balancing routing methods between multiple gateways play a central role in the routing management of the WMNs. This is especially important for demanding interactive applications, for instance triple play services which include traditional applications such as data applications, voice, and video over IP. However, the current performance assessment of these methods does not take into consideration triple play services in their traffic model and this paper seeks to fill this gap. This entails providing a detailed description of each method and carrying out a comparative evaluation by simulating a traffic model for triple play services. This performance assessment compares these cluster load balancing methods by assessing the traditional traffic performance parameters, while varying the traffic load which is the main variable factor that affects the load balancing methods. The results support that the cluster load balancing routing methods as well as the traffic load have a significant impact on each application performance when the applications are evaluated separately and moreover, they still have impact on the triple play services but it is lesser significant than when a single application is evaluated. Furthermore, the most agile and flexible method results in more scalable triple play service.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"61 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":"121896737","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":"Bussiness-driven automatic IT change management based on machine learning","authors":"Haochen Li, Zhiqiang Zhan","doi":"10.1109/NOMS.2012.6212078","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6212078","url":null,"abstract":"Growing complexity of customer needs is one of the prevailing problems faced by IT enterprises at present, leading to increasingly complex IT service management systems. At the same time, quick response to unexpected problems and externally imposed requirements are testing the IT change management. In order to solve the problems mentioned above and satisfy the customer needs timely, we consider automating the change management process with business-driven perspective so as to reduce the service interruption time and cost brings by changes. This paper proposes a solution for automation of the whole change management process and also assesses and validates the change solution we selected.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"175 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":"116460740","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":"Internet bad neighborhoods aggregation","authors":"G. Moura, R. Sadre, A. Sperotto, A. Pras","doi":"10.1109/NOMS.2012.6211917","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211917","url":null,"abstract":"Internet Bad Neighborhoods have proven to be an innovative approach for fighting spam. They have also helped to understand how spammers are distributed on the Internet. In our previous works, the size of each bad neighborhood was fixed to a /24 subnetwork. In this paper, however, we investigate if it is feasible to aggregate Internet bad neighborhoods not only at /24, but to any network prefix. To do that, we propose two different aggregation strategies: fixed prefix and variable prefix. The motivation for doing that is to reduce the number of entries in the bad neighborhood list, thus reducing memory storage requirements for intrusion detection solutions. We also introduce two error measures that allow to quantify how much error was incurred by the aggregation process. An evaluation of both strategies was conducted by analyzing real world data in our aggregation prototype.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"17 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":"121467180","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}