{"title":"A framework to leverage domain expertise to support novice users in the visual exploration of Home Area Networks","authors":"Yuqian Song, J. Keeney, Owen Conlan","doi":"10.1109/NOMS.2012.6211953","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211953","url":null,"abstract":"Advances in modern technologies have afforded end-users increased convenience in performing everyday activities. However, even seemingly trivial issues can cause great annoyance for the ordinary user who lacks domain expertise of the often complex systems that underpin these advances. A key challenge lies in assisting non-expert users to express their requirements of an obscure and complex system. This research proposes a semantic approach by using domain expert knowledge to enable real time semantic up-lift in supporting novice end-users to understand and control the complex dynamic systems they must manage. This presents a significant opportunity to increase user satisfaction and reduce associated support costs. This semantic approach has been designed and implemented in an early prototype of our Home Area Network Monitoring System (HANMS). This paper presents a detailed description of the current state of the research, an initial evaluation, and future work.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"78 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":"117245448","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}
D. Loewenstern, F. Pinel, L. Shwartz, M. Gatti, R. Herrmann, Victor F. Cavalcante
{"title":"A learning feature engineering method for task assignment","authors":"D. Loewenstern, F. Pinel, L. Shwartz, M. Gatti, R. Herrmann, Victor F. Cavalcante","doi":"10.1109/NOMS.2012.6212015","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6212015","url":null,"abstract":"Multi-domain IT services are delivered by technicians with a variety of expert knowledge in different areas. Their skills and availability are an important property of the service. However, most organizations do not have a consistent view of this information because creation and maintenance of a skill model is a difficult task, especially in light of privacy regulations, changing service catalogs and worker turnover. We propose a method for ranking technicians on their expected performance according to their suitability for receiving the assignment of a service request without maintaining an explicit skill model describing which skills are possessed by each technician. We find appropriate assignees by making use of similarities between the assignees and previous tasks performed by them.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"28 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":"114491460","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}
K. Viswanathan, C. Lakshminarayan, V. Talwar, Chengwei Wang, Greg Macdonald, W. Satterfield
{"title":"Ranking anomalies in data centers","authors":"K. Viswanathan, C. Lakshminarayan, V. Talwar, Chengwei Wang, Greg Macdonald, W. Satterfield","doi":"10.1109/NOMS.2012.6211885","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211885","url":null,"abstract":"Data centers are growing in size and complexity driven by trends such as cloud computing and on-line services. Such large data centers pose several challenges for system management. Key among them is anomaly detection which is required to monitor and analyze metrics across several thousands servers and across multiple layers of abstractions to detect anomalous system behavior. In practice, multiple anomaly detection tools are used to continuously raise alarms across multiple metrics and servers. These alarms include both true positives and false alarms. Administrators and management tools act on these alarms for diagnosis and deeper root cause analysis and take appropriate management actions to mitigate the anomalous behaviors. Given the scale and scope of the system, the administrators and management tools are overwhelmed with the large number of alarms at any given instant, many of which are false alarms. It is therefore necessary to prioritize and rank these alarms, so as to take timely actions that maintain the service level agreements for the data center. Existing techniques for such ranking are ad-hoc and not scalable. We propose ranking windows of monitored metrics based on their probability of occurrence. We explain how these probabilities can be computed based either on the false positive rates for which the accompanying anomaly detectors were designed, or, when available, on the probability models underlying the false positive rates. In the simplest case, the ranking procedure reduces to computing the Z-score of the observed measurements and computing a statistic from a window of Z-scores to use as a basis for ranking. The proposed techniques are reliable, lightweight and easy to deploy in the modern data center. We have validated these techniques on synthetic data containing injected anomalies and on data acquired from production data centers.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"29 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":"116117635","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}
K. Bhaskaran, Milton Hernandez, Jim Laredo, Laura Z. Luan, Yaoping Ruan, M. Vukovic, Paul Driscoll, Daniel Miller, Alan Skinner, Girish Verma, P. Vivekanandan, Leanne Chen, Gregory Gaskill
{"title":"Privileged identity management in enterprise service-hosting environments","authors":"K. Bhaskaran, Milton Hernandez, Jim Laredo, Laura Z. Luan, Yaoping Ruan, M. Vukovic, Paul Driscoll, Daniel Miller, Alan Skinner, Girish Verma, P. Vivekanandan, Leanne Chen, Gregory Gaskill","doi":"10.1109/NOMS.2012.6211991","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211991","url":null,"abstract":"IAM needs will only grow as devices, servers, and end points continue to increase . Current schemes are not sustainable as the number of IDs will explode. Environment is heterogeneous, and constantly adding new systems including Cloud. Our solution offers a platform where a user gets an individual user ID on a system - but only if they need it, when they need it, for only as long as they need it . Reusable ID scheme reduces the number of IDs in the system yielding cost savings on lifecycle management activities, improved security compliance . A compliance readiness platform can be enabled to prevent, flag, or monitor questionable access in or near real-time . Provide easily accessible logs to prove compliance policies.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"237 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":"124295371","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":"Prediction of failure occurrence time based on system log message pattern learning","authors":"Masataka Sonoda, Yukihiro Watanabe, Y. Matsumoto","doi":"10.1109/NOMS.2012.6211960","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211960","url":null,"abstract":"In order to avoid failures or diminish the impact of them, it is important to deal with them before its occurrence. Some existing approaches for online failure prediction are insufficient to handle the upcoming failures beforehand, because they cannot predict the failures early enough to execute workaround operations for failure. To solve this problem, we have developed a method to estimate the prediction period (the time period when a failure is expected to occur). Our method identifies the message patterns showing predictive signs of a certain failure through Bayesian learning from log messages and past failure reports. Using these patterns it predicts the occurrence of failures and their prediction period with sufficient interval. We conducted the evaluation of our approach with log data obtained from an actual system. The results shows that our method predicted the occurrence of failure with sufficient interval (60 minutes before the occurrence of failures) and sufficient accuracy (precision: over 0.7, recall: over 0.8).","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"84 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":"121580759","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}
Adler Hoff Schmidt, Rodolfo Stoffel Antunes, M. Barcellos, L. Gaspary
{"title":"Characterizing dissemination of illegal copies of content through monitoring of BitTorrent networks","authors":"Adler Hoff Schmidt, Rodolfo Stoffel Antunes, M. Barcellos, L. Gaspary","doi":"10.1109/NOMS.2012.6211915","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211915","url":null,"abstract":"BitTorrent networks are nowadays the most employed method of Peer-to-Peer (P2P) file sharing in the Internet. Recent monitoring reports reveal that content copies being shared are mostly illegal and movies are the most popular media type. Research efforts carried out to understand the dynamics of content production and sharing in BT networks have been unable to provide precise information regarding the dissemination of illegal copies. In this paper we perform an extensive experimental study in order to characterize the behavior of producers, publishers and providers of copyright-infringing files. The study is based on four months of traces obtained by monitoring swarms sharing movies via one of the most popular BT public communities. Traces were obtained with an extension of a BitTorrent “universe” observation architecture, which allowed the collection of a database with information about more than 40,000 torrents, 900 trackers and 1.3 million IPs. Our analysis not only shows that a small group of active users is responsible for the majority of disseminated illegal copies, as well as unravels existing relationships among these actors.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"135 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":"121617727","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 energy-efficient data storage scheme in wireless sensor networks","authors":"Wen-Hwa Liao, Hung-Chun Yang","doi":"10.1109/NOMS.2012.6211935","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211935","url":null,"abstract":"In wireless sensor network (WSN), much literature focuses on developing energy-efficient protocols. In addition, many papers propose data storage schemes but they do not take power saving into consideration. Hence, these data storage schemes cannot perform well based on energy-efficient protocols. Therefore, it is very critical to propose a data storage scheme to support energy-efficient mechanism. In this paper, we propose an energy-efficient data storage scheme in WSN. Our scheme adopts a grid-base architecture, in which each grid guarantees that two sensors will stay in active mode while the other sensors stay in sleep mode to save energy. Simulations have shown that our energy-efficient data storage scheme can reduce energy consumption.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"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":"126318397","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":"Rethinking network management: Models, data-mining and self-learning","authors":"Stefan Wallin, C. Åhlund, J. Nordlander","doi":"10.1109/NOMS.2012.6212003","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6212003","url":null,"abstract":"Network Service Providers are struggling to reduce cost and still improve customer satisfaction. We have looked at three underlying challenges to achieve these goals; an overwhelming flow of low-quality alarms, understanding the structure and quality of the delivered services, and automation of service configuration. This thesis proposes solutions in these areas based on domain-specific languages, data-mining and self-learning. Most of the solutions have been validated based on data from a large service provider. We look at how domain-models can be used to capture explicit knowledge for alarms and services. In addition, we apply data-mining and self-learning techniques to capture tacit knowledge. The validation shows that models improve the quality of alarm and service models, and enables automatic rendering of functions like root cause correlation, service and SLA status, as well as service configuration. The data-mining and self-learning solutions show that we can learn from available decisions made by experts and automatically assign alarm priorities.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"29 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":"128266905","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 Future Internet architecture supporting multipath communication networks","authors":"M. Becke, T. Dreibholz, Hakim Adhari, E. Rathgeb","doi":"10.1109/NOMS.2012.6211975","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211975","url":null,"abstract":"The classic layered OSI reference model has reached its limits for the Internet of today. In this paper, we propose a clean-slate conceptual design of a new architecture as a contribution to the ongoing discussion on the Future Internet. We address the shortcomings of the layered model by redesigning the classical model. Our approach differs from the concepts found in prior work, which focus on special parts of the problems (such as the application, the service or the event) by staggering back a couple of steps and trying to see the requirements from a different perspective. Our concept - which is denoted as Encapsulated Responsibility-Centric Architecture Model (ERiCA) - focuses on determining the responsibilities by using different planes in addition to a partitioning of the network into different decision domains. With this partitioning, we can reduce the complexity of providing a certain service.","PeriodicalId":364494,"journal":{"name":"2012 IEEE Network Operations and Management Symposium","volume":"172 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":"129774983","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}
Yun Li, Lili Zhao, Chonggang Wang, A. Daneshmand, Qin Hu
{"title":"Aggregation-based spectrum allocation algorithm in cognitive radio networks","authors":"Yun Li, Lili Zhao, Chonggang Wang, A. Daneshmand, Qin Hu","doi":"10.1109/NOMS.2012.6211942","DOIUrl":"https://doi.org/10.1109/NOMS.2012.6211942","url":null,"abstract":"In cognitive radio networks, the idle spectrum bands that cognitive users sensed are usually discontinuous. Only one idle spectrum band may not be able to fulfill cognitive users' bandwidth requirements. In order to let cognitive users access allocated spectrum bands successfully and further improve the efficiency of spectrum utilization, we propose spectrum aggregation-based graph coloring algorithm (SAGCA), a spectrum allocation algorithm in cognitive radio networks. SAGCA considers bandwidth requirements of cognitive users and limitation of spectrum range that equipment can utilize due to hardware constraint. Numerical results show that the proposed algorithm can achieve greater performance in total bandwidth and percentage of cognitive users that networks can support compared to the original algorithm.","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":"130222342","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}