开放最短路径优先中基于队列的有效路径选择与数据传输

J. Kavitha, S. Palaniammal
{"title":"开放最短路径优先中基于队列的有效路径选择与数据传输","authors":"J. Kavitha, S. Palaniammal","doi":"10.14355/IJCSA.2014.0304.01","DOIUrl":null,"url":null,"abstract":"In network, information apportioning occurs between one communication points to another using TCP protocol. The collected data are shared among many users via Single Router or Access Point (AP). During routing, traffic is occurred in the network and that is known as Random Early Detection (RED). In order to overcome this, an alternative path must be preferred by using Alternative Path Selection method which utilizes the Queue Process (FIFO). In case the queue is full, it chooses an alternative queue by using channel sensing mode of path selection. Here, we use OSPF (Open Shortest Path First) which selects the shortest path in short period of time and also it delivers the data to the particular destination. However, delay is reduced in OSPF. Hence, efficiency and overall network lifetime is increased. Finally, the network performance is evaluated.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"8 1","pages":"139"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Efficient Path Selection and Data Transmission Using Queue in Open Shortest Path First\",\"authors\":\"J. Kavitha, S. Palaniammal\",\"doi\":\"10.14355/IJCSA.2014.0304.01\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In network, information apportioning occurs between one communication points to another using TCP protocol. The collected data are shared among many users via Single Router or Access Point (AP). During routing, traffic is occurred in the network and that is known as Random Early Detection (RED). In order to overcome this, an alternative path must be preferred by using Alternative Path Selection method which utilizes the Queue Process (FIFO). In case the queue is full, it chooses an alternative queue by using channel sensing mode of path selection. Here, we use OSPF (Open Shortest Path First) which selects the shortest path in short period of time and also it delivers the data to the particular destination. However, delay is reduced in OSPF. Hence, efficiency and overall network lifetime is increased. Finally, the network performance is evaluated.\",\"PeriodicalId\":39465,\"journal\":{\"name\":\"International Journal of Computer Science and Applications\",\"volume\":\"8 1\",\"pages\":\"139\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Science and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14355/IJCSA.2014.0304.01\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14355/IJCSA.2014.0304.01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 2

摘要

在网络中,使用TCP协议在一个通信点与另一个通信点之间进行信息分配。收集的数据通过单个路由器或接入点(AP)在许多用户之间共享。在路由过程中,网络中发生流量,称为RED (Random Early Detection)。为了克服这一点,必须使用利用队列处理(FIFO)的备选路径选择方法来优选备选路径。在队列已满的情况下,采用路径选择的通道感知模式,选择一个备选队列。在这里,我们使用OSPF(开放最短路径优先),它在短时间内选择最短的路径,并将数据传递到特定的目的地。但是,OSPF可以减少延迟。因此,提高了效率和整体网络生命周期。最后,对网络性能进行了评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Efficient Path Selection and Data Transmission Using Queue in Open Shortest Path First
In network, information apportioning occurs between one communication points to another using TCP protocol. The collected data are shared among many users via Single Router or Access Point (AP). During routing, traffic is occurred in the network and that is known as Random Early Detection (RED). In order to overcome this, an alternative path must be preferred by using Alternative Path Selection method which utilizes the Queue Process (FIFO). In case the queue is full, it chooses an alternative queue by using channel sensing mode of path selection. Here, we use OSPF (Open Shortest Path First) which selects the shortest path in short period of time and also it delivers the data to the particular destination. However, delay is reduced in OSPF. Hence, efficiency and overall network lifetime is increased. Finally, the network performance is evaluated.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Computer Science and Applications
International Journal of Computer Science and Applications Computer Science-Computer Science Applications
自引率
0.00%
发文量
0
期刊介绍: IJCSA is an international forum for scientists and engineers involved in computer science and its applications to publish high quality and refereed papers. Papers reporting original research and innovative applications from all parts of the world are welcome. Papers for publication in the IJCSA are selected through rigorous peer review to ensure originality, timeliness, relevance, and readability.
期刊最新文献
Prediction of Mental Health Instability using Machine Learning and Deep Learning Algorithms Prediction of Personality Traits and Suitable Job through an Intelligent Interview Agent using Machine Learning MultiScale Object Detection in Remote Sensing Images using Deep Learning People Counting and Tracking System in Real-Time Using Deep Learning Techniques Covid-19 Chest X-ray Images: Lung Segmentation and Diagnosis using Neural Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1