集成FRTCP: Ad Hoc网络公平可靠的传输控制协议

T. K. Mishra, S. Tripathi
{"title":"集成FRTCP: Ad Hoc网络公平可靠的传输控制协议","authors":"T. K. Mishra, S. Tripathi","doi":"10.1109/CSNT.2015.71","DOIUrl":null,"url":null,"abstract":"In an ad - hoc network, major challenging work is to maintain fairness among multiple flows in heterogeneous applications. The proposed solutions in the available literature are mostly based on the first come first out (FIFO) queuing which dispatch packets according to the priority of the packet, based on its type of application or region of the source node. As a result, packets having lower priority cannot reach to the destination even if they are originated from the source node since a long time, and dropped over there because of starvation in a given queue. So an efficient scheduling algorithm must be framed for achieving per flow fairness in heterogeneous applications of ad hoc network. In this paper, we propose an integrated priority measurement technique for fairness among multiple flows. In addition to this, the protocol addresses multiple flow transport events from different sources to sink nodes with overall minimum latency. Performance evaluation of this protocol moderates the end to end latency to the flows having lower priority.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Integrated FRTCP: Fair and Reliable Transmission Control Protocol for Ad Hoc Networks\",\"authors\":\"T. K. Mishra, S. Tripathi\",\"doi\":\"10.1109/CSNT.2015.71\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In an ad - hoc network, major challenging work is to maintain fairness among multiple flows in heterogeneous applications. The proposed solutions in the available literature are mostly based on the first come first out (FIFO) queuing which dispatch packets according to the priority of the packet, based on its type of application or region of the source node. As a result, packets having lower priority cannot reach to the destination even if they are originated from the source node since a long time, and dropped over there because of starvation in a given queue. So an efficient scheduling algorithm must be framed for achieving per flow fairness in heterogeneous applications of ad hoc network. In this paper, we propose an integrated priority measurement technique for fairness among multiple flows. In addition to this, the protocol addresses multiple flow transport events from different sources to sink nodes with overall minimum latency. Performance evaluation of this protocol moderates the end to end latency to the flows having lower priority.\",\"PeriodicalId\":334733,\"journal\":{\"name\":\"2015 Fifth International Conference on Communication Systems and Network Technologies\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Fifth International Conference on Communication Systems and Network Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSNT.2015.71\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Fifth International Conference on Communication Systems and Network Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNT.2015.71","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在自组织网络中,主要的挑战性工作是在异构应用程序中保持多个流之间的公平性。现有文献中提出的解决方案大多基于先进先出(FIFO)队列,该队列根据数据包的优先级,基于其应用类型或源节点的区域来分发数据包。因此,具有较低优先级的数据包无法到达目的地,即使它们从源节点发出很长时间,并且由于给定队列中的饥饿而被丢弃在那里。因此,为了在异构的自组网应用中实现每流的公平性,必须提出一种高效的调度算法。在本文中,我们提出了一种综合优先级度量技术来衡量多流量之间的公平性。除此之外,该协议还以最小的总体延迟处理来自不同源到汇聚节点的多个流传输事件。该协议的性能评估缓和了优先级较低的流的端到端延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Integrated FRTCP: Fair and Reliable Transmission Control Protocol for Ad Hoc Networks
In an ad - hoc network, major challenging work is to maintain fairness among multiple flows in heterogeneous applications. The proposed solutions in the available literature are mostly based on the first come first out (FIFO) queuing which dispatch packets according to the priority of the packet, based on its type of application or region of the source node. As a result, packets having lower priority cannot reach to the destination even if they are originated from the source node since a long time, and dropped over there because of starvation in a given queue. So an efficient scheduling algorithm must be framed for achieving per flow fairness in heterogeneous applications of ad hoc network. In this paper, we propose an integrated priority measurement technique for fairness among multiple flows. In addition to this, the protocol addresses multiple flow transport events from different sources to sink nodes with overall minimum latency. Performance evaluation of this protocol moderates the end to end latency to the flows having lower priority.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信