Abstract
This paper presents a new adaptive prioritization and fail-over mechanism for ring network adapters (RNA). Owing to the use of a shared medium in the structure of ring networks, management of network resources is very important and cannot completely be fulfilled by fixed priority strategies. An adaptive prioritization mechanism for efficient utilization of network resources is proposed in this paper. Hop-Count and the distance between source and destination are the key parameters that are included in the priority assignment procedure. Unlike the conventional ones, the arrived traffic is not put blindly into the queues thanks to the awareness of stations form status of each other. The newly introduced fail-over mechanism is based on the Power over Ethernet concept. Each station monitors the heartbeat of its neighbors and tries to keep them alive by providing their minimum required electrical power whenever a fault occurs. By doing so, not only single failure but also any successive double failure scenarios cannot disrupt data path continuity. Several simulations are carried out to assess the behavior and performance of the proposed methods in OPNET Modeler. Moreover, a high-speed USB test board is designed using Xilinx-Spartan6-lx9 FPGA to experimentally verify the performance of the proposed mechanisms.
Highlights
As resources are getting scarcer in modern networks, optimum resource allocation and congestion control have become a challenging issue [1]
OPNET SIMULATION RESULTS There are different tools for designing and evaluating network structures. Some of these tools are suitable for analytical modeling while others are appropriate for simulating the overall behavior of the design
OPNET Modeler [33], [34] is the leading and powerful general-purpose network simulator which is widely used by researchers, protocol designers, university teachers and students in the fields of electronic engineering and computer science for realistic simulation, modeling, and analysis of computer networks [35]–[37]
Summary
As resources are getting scarcer in modern networks, optimum resource allocation and congestion control have become a challenging issue [1]. There is a risk of discarding a packet at a congested node near the destination, compared to a recently transmitted packet with only one unit greater priority value This functionality is not so fair and leads to waste the network resources. Based on the fact that whatever the data packet passes through the network, it consumes network resources and its worthiness is increased, a new adaptive prioritization mechanism is proposed in this paper to overcome this problem. Stations have a clear vision about the status of the other nodes thanks to the information that is obtained from discovery messages and data packets This method is very beneficial for dual-ring networks in which data packets are transmitted in clockwise or counterclockwise ringlets.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
