{"title":"组播错误恢复中的异或重传","authors":"Shen Yong, L. B. Sung","doi":"10.1109/ICON.2000.875810","DOIUrl":null,"url":null,"abstract":"A growing number of network applications require the use of a reliable multicast protocol to disseminate data from a source to a potentially large number of receivers. We present a new error recovery mechanism, called XOR, which is based on the selective repeat ARQ protocols. The idea is to combine several NACKed packets by XORing them. The analytical and simulative result show that XOR achieves a better throughput than both 'N1' and 'N2' do.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"XOR retransmission in multicast error recovery\",\"authors\":\"Shen Yong, L. B. Sung\",\"doi\":\"10.1109/ICON.2000.875810\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A growing number of network applications require the use of a reliable multicast protocol to disseminate data from a source to a potentially large number of receivers. We present a new error recovery mechanism, called XOR, which is based on the selective repeat ARQ protocols. The idea is to combine several NACKed packets by XORing them. The analytical and simulative result show that XOR achieves a better throughput than both 'N1' and 'N2' do.\",\"PeriodicalId\":191244,\"journal\":{\"name\":\"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2000.875810\",\"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 IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2000.875810","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A growing number of network applications require the use of a reliable multicast protocol to disseminate data from a source to a potentially large number of receivers. We present a new error recovery mechanism, called XOR, which is based on the selective repeat ARQ protocols. The idea is to combine several NACKed packets by XORing them. The analytical and simulative result show that XOR achieves a better throughput than both 'N1' and 'N2' do.