M. Shevertalov, E. Stehle, C. Rorres, S. Mancoridis, M. Kam
{"title":"一种通过类比理解网络应用的方法","authors":"M. Shevertalov, E. Stehle, C. Rorres, S. Mancoridis, M. Kam","doi":"10.1109/CONIELECOMP.2007.55","DOIUrl":null,"url":null,"abstract":"Distributed applications rely on packet-switched networks to connect their various elements. This paper describes a technique that can help software engineers and network administrators characterize unfamiliar networked applications by matching them to a single, or a combination of several, analogous and familiar networked applications). This matching is based on the size distribution of the packets sent and received by the application undergoing scrutiny.","PeriodicalId":288478,"journal":{"name":"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Approach to Comprehending Networked Applications through Analogy\",\"authors\":\"M. Shevertalov, E. Stehle, C. Rorres, S. Mancoridis, M. Kam\",\"doi\":\"10.1109/CONIELECOMP.2007.55\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distributed applications rely on packet-switched networks to connect their various elements. This paper describes a technique that can help software engineers and network administrators characterize unfamiliar networked applications by matching them to a single, or a combination of several, analogous and familiar networked applications). This matching is based on the size distribution of the packets sent and received by the application undergoing scrutiny.\",\"PeriodicalId\":288478,\"journal\":{\"name\":\"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)\",\"volume\":\"138 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONIELECOMP.2007.55\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Autonomic and Autonomous Systems (ICAS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONIELECOMP.2007.55","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Approach to Comprehending Networked Applications through Analogy
Distributed applications rely on packet-switched networks to connect their various elements. This paper describes a technique that can help software engineers and network administrators characterize unfamiliar networked applications by matching them to a single, or a combination of several, analogous and familiar networked applications). This matching is based on the size distribution of the packets sent and received by the application undergoing scrutiny.