Rafael Bosse Brinhosa, C. Westphall, Carlos Becker Westphall
{"title":"Proposal and development of the Web services input validation model","authors":"Rafael Bosse Brinhosa, C. Westphall, Carlos Becker Westphall","doi":"10.1109/NOMS.2012.6211976","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211976","url":null,"abstract":"The SOA architecture primarily based on Web services is experiencing a steady adoption, although its growth was lower than expected when it was launched, mainly because of security related concerns. Web services inherited many well-known security problems of Web applications and brought new ones. Major data breaches today are consequences of bad input validation at the application level. This paper presents a way to implement an input validation model for Web services which can be used to prevent cross-site scripting and SQL injection through the use of predefined models which specify valid inputs. The proposed WSIVM (Web Services Input Validation Model) consists of an XML schema, an XML specification, and a module for performing input validation according to the schema. A case study showing the effectiveness and performance of this mechanism is also presented.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"22 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":"132461127","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}
Hendrik Moens, E. Truyen, Stefan Walraven, W. Joosen, B. Dhoedt, F. Turck
{"title":"Feature placement algorithms for high-variability applications in cloud environments","authors":"Hendrik Moens, E. Truyen, Stefan Walraven, W. Joosen, B. Dhoedt, F. Turck","doi":"10.1109/NOMS.2012.6211878","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211878","url":null,"abstract":"While the use of cloud computing is on the rise, many obstacles to its adoption remain. One of the weaknesses of current cloud offerings is the difficulty of developing highly customizable applications while retaining the increased scalability and lower cost offered by the multi-tenant nature of cloud applications. In this paper we describe a Software Product Line Engineering (SPLE) approach to the modelling and deployment of customizable Software as a Service (SaaS) applications. Afterwards we define a formal feature placement problem to manage these applications, and compare several heuristic approaches to solve the problem. The scalability and performance of the algorithms is investigated in detail. Our experiments show that the heuristics scale and perform well for systems with a reasonable load.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"82 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":"132145574","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":"Converged network and device management for data offloading","authors":"A. Hadjiantonis, G. Ellinas","doi":"10.1109/NOMS.2012.6211938","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211938","url":null,"abstract":"The rapid adoption of the Internet and the ubiquitous coverage of cellular/wireless technologies, all concur to the fusion of networks' physical boundaries. At the same time, the proliferation of mobile and wireless devices changes our expectations as users, forcing providers to rethink their network and device management (NDM) approaches. Our work contributes to the convergence of NDM, with an early prototype of a resource-oriented cloud-based management service, using YANG data modeling language and JSON notation to model and encode policies. A proof-of-concept prototype implementation on a Linux-based smartphone demonstrates how policies achieve data offloading between wireless and mobile networks, for the benefit of users and operators.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"146 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":"123356703","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":"Estimating the number of active flows from sampled packets","authors":"Guang Cheng","doi":"10.1109/NOMS.2012.6211984","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211984","url":null,"abstract":"A flow is active during a measurement period if it sends at least one packet. It is essential to control resource consumption in network monitoring by traffic sampling, so most high-end routers provide sampling network traffic function. The number of original flow is an important metrics to many network applications such as congestion control and network security. In this paper, we present a EUF algorithm that can accurately infer the number of original flow from the sampled packet traffic. Using the EUF algorithm, the number of unsampled flows can be estimated by an iteration method based on random sampling, and then the number of original flows can be precisely estimated according to both the number of the sampled flows and the unsampled flow. The EUF algorithm is also compared with the EM algorithm using multiple traffic traces collected from a Tier-1 ISP backbone networks. The result shows that the EUF algorithm is superior to EM and can provide highly accurate estimation on the number of the original flow.","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":"132654268","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":"Multi-task overlapping coalition formation mechanism in wireless sensor network","authors":"Xiao-fei Bao, Yang Yang, Xue-song Qiu","doi":"10.1109/NOMS.2012.6211974","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211974","url":null,"abstract":"Coalition formation is an essential component for in wireless sensor network (WSN). Most of current coalition formation algorithms have focused on disjoint coalitions. We develop an improved ant colony algorithm to solve the overlapping coalition formation(OCF) problem in multiple coalitions in WSN domain. In this improved ant colony algorithm, we bring in mutation operation and elite strategy from genic algorithm. By doing this, it will improve the pheromone update strategy and allow sensors to allocate different parts of their resources to serve different coalitions simultaneously.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"104 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":"132223470","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":"Hercules: Integrated control framework for datacenter traffic management","authors":"Wonho Kim, P. Sharma","doi":"10.1109/NOMS.2012.6211884","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211884","url":null,"abstract":"The large scale and high performance requirements of Cloud computing pose many challenges to the data center network operators. These networks typically require high bisection bandwidth, strict performance isolation, and power-efficient operation. Recently, many researchers have proposed various network controller systems for programming networks, each of them to individually address only one of these challenges. In this paper, however, we show that running multiple controllers in a shared network fabric independently is not only inefficient but conflicting control decisions by different controllers can also lead to serious network performance degradation. We present HERCULES, an integrated control framework, to enable coexistence and operation of multiple controllers. As an initial proof of concept, we have integrated four existing controllers into HERCULES framework. Our evaluation of the integrated controller shows that it can enable multiple controllers to leverage each other and collectively achieve the multiple goals of the controllers simultaneously.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"59 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":"134193148","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}
Kevin Mets, M. Strobbe, Tom Verschueren, Thomas Roelens, F. Turck, Chris Develder
{"title":"Distributed multi-agent algorithm for residential energy management in smart grids","authors":"Kevin Mets, M. Strobbe, Tom Verschueren, Thomas Roelens, F. Turck, Chris Develder","doi":"10.1109/NOMS.2012.6211928","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211928","url":null,"abstract":"Distributed renewable power generators, such as solar cells and wind turbines are difficult to predict, making the demand-supply problem more complex than in the traditional energy production scenario. They also introduce bidirectional energy flows in the low-voltage power grid, possibly causing voltage violations and grid instabilities. In this article we describe a distributed algorithm for residential energy management in smart power grids. This algorithm consists of a market-oriented multi-agent system using virtual energy prices, levels of renewable energy in the real-time production mix, and historical price information, to achieve a shifting of loads to periods with a high production of renewable energy. Evaluations in our smart grid simulator for three scenarios show that the designed algorithm is capable of improving the self consumption of renewable energy in a residential area and reducing the average and peak loads for externally supplied power.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"7 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":"123020234","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 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}
E. Kissel, Ahmed El-Hassany, Guilherme Fernandes, D. M. Swany, D. Gunter, T. Samak, J. Schopf
{"title":"Scalable integrated performance analysis of multi-gigabit networks","authors":"E. Kissel, Ahmed El-Hassany, Guilherme Fernandes, D. M. Swany, D. Gunter, T. Samak, J. Schopf","doi":"10.1109/NOMS.2012.6212056","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6212056","url":null,"abstract":"Monitoring and managing multi-gigabit networks requires dynamic adaptation to end-to-end performance characteristics. This paper presents a measurement collection and analysis framework that automates the troubleshooting of end-to-end network bottlenecks. We integrate real-time host, application, and network measurements with a common representation (compatible with perfSONAR) within a flexible and scalable architecture. Our measurement architecture is supported by a light-weight eXtensible Session Protocol (XSP), which enables context-sensitive adaptive measurement collection. We evaluate the ability of our system to analyze and detect bottleneck conditions over a series of high-speed and I/O intensive bulk data transfer experiments and find that the overhead of the system is very low and that we are able to detect and understand a variety of bottlenecks.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"18 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":"132047308","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}