Shigeki Takeuchi, H. Koga, K. Iida, Y. Kadobayashi, S. Yamaguchi
{"title":"实时应用中突发流量的DCCP性能评价","authors":"Shigeki Takeuchi, H. Koga, K. Iida, Y. Kadobayashi, S. Yamaguchi","doi":"10.1109/SAINT.2005.51","DOIUrl":null,"url":null,"abstract":"The Datagram Congestion Control Protocol (DCCP) has been proposed as a transport protocol which supports real-time traffic using window-based flow control. We investigate the DCCP performance for various traffic flows, focusing on how DCCP flows affect TCP flows and vice versa. Through those simulations, we examine an unfair bandwidth distribution problem caused by the incompatibility of DCCP with the fast recovery algorithm of TCP.","PeriodicalId":169669,"journal":{"name":"The 2005 Symposium on Applications and the Internet","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Performance evaluations of DCCP for bursty traffic in real-time applications\",\"authors\":\"Shigeki Takeuchi, H. Koga, K. Iida, Y. Kadobayashi, S. Yamaguchi\",\"doi\":\"10.1109/SAINT.2005.51\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Datagram Congestion Control Protocol (DCCP) has been proposed as a transport protocol which supports real-time traffic using window-based flow control. We investigate the DCCP performance for various traffic flows, focusing on how DCCP flows affect TCP flows and vice versa. Through those simulations, we examine an unfair bandwidth distribution problem caused by the incompatibility of DCCP with the fast recovery algorithm of TCP.\",\"PeriodicalId\":169669,\"journal\":{\"name\":\"The 2005 Symposium on Applications and the Internet\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2005 Symposium on Applications and the Internet\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SAINT.2005.51\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2005 Symposium on Applications and the Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAINT.2005.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance evaluations of DCCP for bursty traffic in real-time applications
The Datagram Congestion Control Protocol (DCCP) has been proposed as a transport protocol which supports real-time traffic using window-based flow control. We investigate the DCCP performance for various traffic flows, focusing on how DCCP flows affect TCP flows and vice versa. Through those simulations, we examine an unfair bandwidth distribution problem caused by the incompatibility of DCCP with the fast recovery algorithm of TCP.