ترغب بنشر مسار تعليمي؟ اضغط هنا

High-Performance Routing with Multipathing and Path Diversity in Ethernet and HPC Networks

219   0   0.0 ( 0 )
 نشر من قبل Maciej Besta
 تاريخ النشر 2020
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

The recent line of research into topology design focuses on lowering network diameter. Many low-diameter topologies such as Slim Fly or Jellyfish that substantially reduce cost, power consumption, and latency have been proposed. A key challenge in realizing the benefits of these topologies is routing. On one hand, these networks provide shorter path lengths than established topologies such as Clos or torus, leading to performance improvements. On the other hand, the number of shortest paths between each pair of endpoints is much smaller than in Clos, but there is a large number of non-minimal paths between router pairs. This hampers or even makes it impossible to use established multipath routing schemes such as ECMP. In this work, to facilitate high-performance routing in modern networks, we analyze existing routing protocols and architectures, focusing on how well they exploit the diversity of minimal and non-minimal paths. We first develop a taxonomy of different forms of support for multipathing and overall path diversity. Then, we analyze how existing routing schemes support this diversity. Among others, we consider multipathing with both shortest and non-shortest paths, support for disjoint paths, or enabling adaptivity. To address the ongoing convergence of HPC and Big Data domains, we consider routing protocols developed for both HPC systems and for data centers as well as general clusters. Thus, we cover architectures and protocols based on Ethernet, InfiniBand, and other HPC networks such as Myrinet. Our review will foster developing future high-performance multipathing routing protocols in supercomputers and data centers.



قيم البحث

اقرأ أيضاً

Inter-datacenter networks connect dozens of geographically dispersed datacenters and carry traffic flows with highly variable sizes and different classes. Adaptive flow routing can improve efficiency and performance by assigning paths to new flows ac cording to network status and flow properties. A popular approach widely used for traffic engineering is based on current bandwidth utilization of links. We propose an alternative that reduces bandwidth usage by up to at least 50% and flow completion times by up to at least 40% across various scheduling policies and flow size distributions.
Reactive routing protocols are gaining popularity due to their event driven nature day by day. In this vary paper, reactive routing is studied precisely. Route request, route reply and route maintenance phases are modeled with respect to control over head. Control overhead varies with respect to change in various parameters. Our model calculates these variations as well. Besides modeling, we chose three most favored reactive routing protocols as Ad-Hoc on Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET on Demand (DYMO) for our experiments. We simulated these protocols using ns-2 for a detailed comparison and performance analysis with respect to mobility and scalability issues keeping metrics of throughput, route delay and control over head. Their performances and comparisons are extensively presented in last part of our work.
390 - D. Mahmood , N. Javaid , U. Qasim 2013
To ensure seamless communication in wireless multi-hop networks, certain classes of routing protocols are defined. This vary paper, is based upon proactive routing protocols for Wireless multihop networks. Initially, we discuss Destination Sequence D istance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR), precisely followed by mathematical frame work of control overhead regarding proactive natured routing protocols. Finally, extensive simulations are done using NS 2 respecting above mentioned routing protocols covering mobility and scalability issues. Said protocols are compared under mobile and dense environments to conclude our performance analysis.
There are several approaches to analyse the worst-case response times of sporadic packets transmitted over priority-preemptive wormhole networks. In this paper, we provide an overview of the different approaches, discuss their strengths and weaknesse s, and propose an approach that captures all effects considered by previous approaches while providing tight yet safe upper bounds for packet response times. We specifically address the problems created by buffering and backpressure in wormhole networks, which amplifies the problem of indirect interference in a way that has not been considered by the early analysis approaches. Didactic examples and large-scale experiments with synthetically generated packet flow sets provide evidence of the strength of the proposed approach.
216 - Weifeng Sun , Rong Cong , Feng Xia 2010
Even though channel assignment has been studied for years, the performance of most IEEE 802.11-based multi-hop wireless networks such as wireless sensor network (WSN), wireless mesh network (WMN), mobile ad hoc network (MANET) is limited by channel i nterference. Properly assigning orthogonal channels to wireless links can improve the throughput of multi-hop networks. To solve the dynamic channel assignment problem, a routing-based channel assignment algorithm called R-CA is proposed. R-CA can allocate channels for wireless nodes when needed and free channels after data transmission. Thus more channel resource can be explored by wireless nodes. Simulation results show that R-CA can effectively enhance the network throughput and packet delivery rate.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا