12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops最新文献_第9页

Chargeback model for resource pools in the cloud 云中的资源池的退款模型

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops Pub Date : 2011-05-23 DOI: 10.1109/INM.2011.5990586

D. Gmach, J. Rolia, L. Cherkasova

引用次数: 3

An efficient parallel TCAM scheme for the forwarding engine of the next-generation router 一种用于下一代路由器转发引擎的高效并行TCAM方案

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops Pub Date : 2011-05-23 DOI: 10.1109/INM.2011.5990546

Bin Zhang, Jiahai Yang, Jianping Wu, Qi Li, Donghong Qin

引用次数: 4

Mining unstructured log files for recurrent fault diagnosis 挖掘非结构化日志文件用于经常性故障诊断

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops Pub Date : 2011-05-23 DOI: 10.1109/INM.2011.5990536

Thomas Reidemeister, Miao Jiang, Paul A. S. Ward

{"title":"Mining unstructured log files for recurrent fault diagnosis","authors":"Thomas Reidemeister, Miao Jiang, Paul A. S. Ward","doi":"10.1109/INM.2011.5990536","DOIUrl":"https://doi.org/10.1109/INM.2011.5990536","url":null,"abstract":"Enterprise software systems are large and complex with limited support for automated root-cause analysis. Avoiding system downtime and loss of revenue dictates a fast and efficient root-cause analysis process. Operator practice and academic research have shown that about 80% of failures in such systems have recurrent causes; therefore, significant efficiency gains can be achieved by automating their identification. In this paper, we present a novel approach to modelling features of log files. This model offers a compact representation of log data that can be efficiently extracted from large amounts of monitoring data. We also use decision-tree classifiers to learn and classify symptoms of recurrent faults. This representation enables automated fault matching and, in addition, enables human investigators to understand manifestations of failure easily. Our model does not require any access to application source code, a specification of log messages, or deep application knowledge. We evaluate our proposal using fault-injection experiments against other proposals in the field. First, we show that the features needed for symptom definition can be extracted more efficiently than does related work. Second, we show that these features enable an accurate classification of recurrent faults using only standard machine learning techniques. This enables us to identify accurately up to 78% of the faults in our evaluation data set.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131276787","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}

引用次数: 41

Online traffic classification based on sub-flows 基于子流的在线流分类

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops Pub Date : 2011-05-23 DOI: 10.1109/INM.2011.5990541

Victor Pasknel de Alencar Ribeiro, R. H. Filho, J. Maia

{"title":"Online traffic classification based on sub-flows","authors":"Victor Pasknel de Alencar Ribeiro, R. H. Filho, J. Maia","doi":"10.1109/INM.2011.5990541","DOIUrl":"https://doi.org/10.1109/INM.2011.5990541","url":null,"abstract":"Traffic classification by application class provides useful information for various tasks of network engineering and administration. However, offline classification of flows has limited its practical application to auditing tasks, long-term planning and other analytical issues. Therefore, research on traffic classification now moves towards the search for accurate and efficient methods of classification in order to meet online tasks such as traffic monitoring and shaping and other specific-application operations. In this work we apply the One-Against-All Approach (OAA) for two online classification strategies based on statistical features of TCP sub-flows. One uses the first N packets of the bi-directional TCP session and the other applies to sub-flows of the N packets starting at a random position in the flow. In our variant of the OAA approach, the problem of classifying an object in one of M classes is reduced to M binary classification problems with an associated decision rule, with each of them possibly using a different subset of features and sub-flow size. We investigated the effect of variation in the amount of N on the results of classification and the smaller set of variables in each of the above problems. This study used the Naïve Bayes classifier.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127320782","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}

引用次数: 6

Adaptive and self-configurable honeypots 自适应和自配置蜜罐

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops Pub Date : 2011-05-23 DOI: 10.1109/INM.2011.5990710

G. Wagener, R. State, T. Engel, A. Dulaunoy

引用次数: 33

Run-time performance optimization and job management in a data protection solution 数据保护解决方案中的运行时性能优化和作业管理

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops Pub Date : 2011-05-23 DOI: 10.1109/INM.2011.5990675

L. Cherkasova, R. Lau, Harald Burose, Subramaniam Kalambur, Bernhard Kappler, Kuttiraja Veeranan

{"title":"Run-time performance optimization and job management in a data protection solution","authors":"L. Cherkasova, R. Lau, Harald Burose, Subramaniam Kalambur, Bernhard Kappler, Kuttiraja Veeranan","doi":"10.1109/INM.2011.5990675","DOIUrl":"https://doi.org/10.1109/INM.2011.5990675","url":null,"abstract":"The amount of stored data in enterprise Data Centers quadruples every 18 months. This trend presents a serious challenge for backup management and sets new requirements for performance efficiency of traditional backup and archival tools. In this work, we discuss potential performance shortcomings of the existing backup solutions. During a backup session a predefined set of objects (client filesystems) should be backed up. Traditionally, no information on the expected duration and throughput requirements of different backup jobs is provided. This may lead to an inefficient job schedule and the increased backup session time. We analyze historic data on backup processing from eight backup servers in HP Labs, and introduce two additional metrics associated with each backup job, called job duration and job throughput. Our goal is to use this additional information for automated design of a backup schedule that minimizes the overall completion time for a given set of backup jobs. This problem can be formulated as a resource constrained scheduling problem which is known to be NP-complete. Instead, we propose an efficient heuristics for building an optimized job schedule, called FlexLBF. The new job schedule provides a significant reduction in the backup time (up to 50%) and reduced resource usage (up to 2–3 times). Moreover, we design a simulation-based tool that aims to automate parameter tuning for avoiding manual configuration by system administrators while helping them to achieve nearly optimal performance.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"27 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120822746","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 semantic monitoring and management framework for end-to-end services 端到端服务的语义监视和管理框架

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops Pub Date : 2011-05-23 DOI: 10.1109/INM.2011.5990649

J. Keeney, Owen Conlan, V. Holub, Miao Wang, Laetitia Chapel, M. Serrano, S. Meer

引用次数: 9

The node-centric formulation for network utility maximization of multihop wireless networks with elastic and inelastic traffic 弹性和非弹性多跳无线网络中网络效用最大化的节点中心公式

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops Pub Date : 2011-05-23 DOI: 10.1109/INM.2011.5990517

P. L. Vo, M. Siddiqui, C. Hong

{"title":"The node-centric formulation for network utility maximization of multihop wireless networks with elastic and inelastic traffic","authors":"P. L. Vo, M. Siddiqui, C. Hong","doi":"10.1109/INM.2011.5990517","DOIUrl":"https://doi.org/10.1109/INM.2011.5990517","url":null,"abstract":"We consider a network with two kinds of traffic: inelastic and elastic. The inelastic traffic requires fixed throughput and high priority, while the elastic traffic has the rate that can be controlled and low priority. Given the fixed rate of inelastic traffic, the problem of how to inject the elastic traffic into the network to achieve the maximum utility of elastic traffic is solved in this paper. The node-centric formulation in cross-layer design framework is applied. By using Lagrange duality method, the congestion control, back-pressure routing and Max-weight scheduling are integrated naturally when decomposing the Larangian. The Greedy Distributed scheduling is introduced to not only decentralize scheduling, but also decrease the complexity of the Max-weight scheduling. The Back-pressure routing has presented the poor performance at the light load, the packets take an unnecessary long route from the source node to the destination node. As the result, the delay is excessively large at light load. The enhancement algorithm is implemented to maximize the utility while minimizing the resource usage. An admission control scheme is also introduced to check if the new inelastic flow is admissible.","PeriodicalId":433520,"journal":{"name":"12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123892198","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}

引用次数: 0

Distributed inter-domain SLA negotiation using Reinforcement Learning 使用强化学习的分布式域间SLA协商

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops Pub Date : 2011-05-23 DOI: 10.1109/INM.2011.5990671

Tristan Groléat, Hélia Pouyllau

引用次数: 20

An event management communication system for Wireless Sensor Networks 面向无线传感器网络的事件管理通信系统

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops Pub Date : 2011-05-23 DOI: 10.1109/INM.2011.5990588

Björn Stelte

引用次数: 2