Deadlock-free routing of data packets in fat tree networks

A fat tree network and routing technology, applied in data exchange networks, digital transmission systems, electrical components, etc., to solve problems such as poor performance and failure to utilize tree multipath capabilities

Active Publication Date: 2014-06-18
IBM CORP
View PDF4 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

These various techniques for arbitrary topologies lead to poor performance in fat tree networks because they fail to exploit the multipathing capabilities of the tree

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Deadlock-free routing of data packets in fat tree networks
  • Deadlock-free routing of data packets in fat tree networks
  • Deadlock-free routing of data packets in fat tree networks

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] figure 2 It is a simplified schematic diagram of a network switch 1, and the network switch 1 is used to realize the routing method embodying the present invention in a fat tree network. In this example, Switch 1 has four ports for figure 1 Connections of binary fat tree topologies in . The two upward facing ports are labeled u1 and u2, while the two downward facing ports are labeled d1 and d2. The switch includes the usual network interface circuitry (I / F) 2 for sending and receiving data packets via the network links connected to the ports. The switch fabric 3 includes the usual buffers and connections via which received packets pass through the switch between an input port and a corresponding output port for its routing across the network. This process is controlled by the switch controller 4. Switch fabric 3 supports two virtual channels, designated VC0 and VC1 , for transporting data packets in the network. Thus, by logical partitioning of buffers etc., under...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

Deadlock-free routing of data packets between source and destination switches in a fat tree network is provided. For each packet, a route is selected having three or less routing phases such that the route follows a shortest path across the network between the source and destination switches. The data packet is transmitted from the source switch to the destination switch, via the route, on one of first and second virtual channels unless the route includes a predetermined one of a down-up turn and an up-down turn (see e.g. figures 7 and 8). If the route includes the predetermined turn, the data packet is transmitted, via the route, on the first virtual channel up to the switch at which the turn occurs and on the second virtual channel from that switch. Direct fat tree networks, in which end nodes are connected to switches in a plurality of levels of the fat tree topology, are also provided.

Description

technical field [0001] The present invention generally relates to deadlock-free routing in fat tree networks. Background technique [0002] A fat tree network is a hierarchically recursive network consisting of multiple switches connected in a multi-rooted tree topology. These networks are widely pervasive and are used in many modern high-performance computing systems and commercial data center infrastructures. There are numerous variations of fat tree topologies, but from the attached figure 1 The fundamentals of these networks can be understood in . It shows an example of a specific very regular fat tree network called a "k-ary n-tree". In this designation, k is the base of the tree (ie, the number of children and / or parents at each level), and n is the number of levels. A k-ary n-tree has n levels of switches, each of which has radix 2k, with half of the ports connected downwards and the other half connected upwards. (The switches in the top level (i.e. the root of t...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/733H04L12/703H04L45/122H04L45/28
CPCH04L45/12H04L45/48
Inventor C·J·明肯伯格G·罗德里格赫雷拉M·格撒特
Owner IBM CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap