دانلود رایگان مقاله روش مسیر دوگانه مبتنی بر حلقه برای کاهش ترافیک زائد در شبکه HSR

عنوان فارسی
روش جدید مسیر دوگانه مبتنی بر حلقه برای کاهش ترافیک زائد در شبکه های HSR
عنوان انگلیسی
A novel ring-based dual paths approach for reducing redundant traffic in HSR networks
صفحات مقاله فارسی
0
صفحات مقاله انگلیسی
13
سال انتشار
2016
نشریه
الزویر - Elsevier
فرمت مقاله انگلیسی
PDF
کد محصول
ث864
رشته های مرتبط با این مقاله
مهندسی کامپیوتر و مهندسی فناوری اطلاعات
گرایش های مرتبط با این مقاله
شبکه های کامپیوتری
مجله
شبکه های کامپیوتر - Computer Networks
دانشگاه
مهندسی اطلاعات و ارتباطات، دانشگاه Myongji، یونگین، جمهوری کره
کلمات کلیدی
افزونگی یکپارچه بالا در دسترس بودن (HSR)، حلقه مبتنی بر مسیر دوگانه (RDP)، اترنت با قابلیت تحمل خطا
۰.۰ (بدون امتیاز)
امتیاز دهید
چکیده

Abstract


In this paper, we propose a novel dual paths-based approach, called ring-based dual paths (RDP), to significantly reduce redundant unicast traffic in high-availability seamless redundancy (HSR) networks. RDP establishes dual paths for forwarding unicast frames between nodes in HSR networks. Unlike existing dual paths-based approaches, such as dual virtual paths (DVP) that establish dual paths for each connection pair of HSR terminal nodes, RDP sets up dual paths for each connection pair of HSR rings. Therefore, RDP significantly reduces the number of established dual paths, which, in turn, reduces the overhead in discovering and establishing dual paths, as well as the memory space required to store these paths compared with the existing dual paths-based approaches. The performance of RDP has been analyzed, evaluated, and compared to that of the standard HSR protocol and the DVP approach. Various simulations were conducted to validate the traffic performance analysis. Analytical and simulation results showed that for the sample networks RDP reduced network unicast traffic by 80–88% compared with the standard HSR protocol, thus freeing up network bandwidth and improving network traffic performance.

نتیجه گیری

7. Conclusions


In this paper, we proposed a novel approach called RDP for reducing network unicast traffic in HSR networks. Unlike DVP, which establishes node-based dual paths for each connection pair of HSR terminal nodes, our RDP approach discovers and sets up ring-based dual paths for each connection pair of HSR rings. Additionally, unlike the DVP under which each terminal node broadcasts an additional frame to learn MAC addresses and build neighbor tables, the RDP learns and builds MAC tables based on the existing HSR_Supervision frames of the standard HSR protocol sent periodically by HSR terminal nodes. Therefore, RDP significantly reduces the control overhead for discovering and establishing dual paths, as well as the memory space required to store these dual paths in networks compared to existing dual paths-based methods, such as DVP. RDP forwards unicast frames based on predefined dual paths, instead of duplicating and forwarding to all parts of HSR networks. Therefore, RDP significantly reduces unicast traffic compared with standard HSR protocol. Analytical and simulation results showed that, for our sample network, RDP reduced network unicast traffic by 80%−88% compared with the standard HSR protocol, thus saving network bandwidth and improving network traffic performance. Our future work will involve developing and applying the RDP approach for all network traffic types: unicast as well as multi-broadcast.


بدون دیدگاه