{"title":"通过应用级流量整形降低自相似性","authors":"Kenneth J. Christensen, Varaprasad Ballingam","doi":"10.1109/LCN.1997.631021","DOIUrl":null,"url":null,"abstract":"Recent work has demonstrated that network traffic has self similar properties. These properties make short term control of traffic very difficult. Heavy tailed distributions of burst sizes contribute to traffic self similarity. The effects of heavy tailed file transfer traffic on queueing behavior are demonstrated using a simulated traffic source based on empirical Unix file size data. A method of application level traffic shaping, whereby selected large traffic bursts are shaped, is developed. This shaping method is shown to dramatically decrease ATM cell loss at a bottleneck queue. At the expense of a few large file transfers being increased in time duration, many smaller file transfers are decreased in time duration and cell loss is decreased for all file transfers.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Reduction of self-similarity by application-level traffic shaping\",\"authors\":\"Kenneth J. Christensen, Varaprasad Ballingam\",\"doi\":\"10.1109/LCN.1997.631021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recent work has demonstrated that network traffic has self similar properties. These properties make short term control of traffic very difficult. Heavy tailed distributions of burst sizes contribute to traffic self similarity. The effects of heavy tailed file transfer traffic on queueing behavior are demonstrated using a simulated traffic source based on empirical Unix file size data. A method of application level traffic shaping, whereby selected large traffic bursts are shaped, is developed. This shaping method is shown to dramatically decrease ATM cell loss at a bottleneck queue. At the expense of a few large file transfers being increased in time duration, many smaller file transfers are decreased in time duration and cell loss is decreased for all file transfers.\",\"PeriodicalId\":286255,\"journal\":{\"name\":\"Proceedings of 22nd Annual Conference on Local Computer Networks\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 22nd Annual Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.1997.631021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 22nd Annual Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1997.631021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reduction of self-similarity by application-level traffic shaping
Recent work has demonstrated that network traffic has self similar properties. These properties make short term control of traffic very difficult. Heavy tailed distributions of burst sizes contribute to traffic self similarity. The effects of heavy tailed file transfer traffic on queueing behavior are demonstrated using a simulated traffic source based on empirical Unix file size data. A method of application level traffic shaping, whereby selected large traffic bursts are shaped, is developed. This shaping method is shown to dramatically decrease ATM cell loss at a bottleneck queue. At the expense of a few large file transfers being increased in time duration, many smaller file transfers are decreased in time duration and cell loss is decreased for all file transfers.