Increasingly minimal bias routing

Title: Increasingly minimal bias routing

A system and algorithm configured to generate diversity at the traffic source so that packets are uniformly distributed over all of the available paths, but to increase the likelihood of taking a minimal path with each hop the packet takes. This is achieved by configuring routing biases so as to prefer non-minimal paths at the injection point, but increasingly prefer minimal paths as the packet proceeds, referred to herein as Increasing Minimal Bias (IMB).

Inventors:: Bataineh, Abdulla; Court, Thomas; Roweth, Duncan

Issue Date:: 2017-02-21

OSTI Identifier:: 1344415

Assignee:: Cray Inc. OSTI

Patent Number(s):: 9,577,918

Application Number:: 13/681,058

Contract Number:: B580786

Resource Relation:: Patent File Date: 2012 Nov 19

Research Org:: Cray Inc. Seattle, WA (United States)

Sponsoring Org:: USDOE

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING

Full Text
View Full Text

Have feedback or suggestions for a way to improve these results? !

Save / Share this Record no
Export Metadata
- Endnote
- RIS
- Excel
- CSV
- XML
Send to Email

Send to Email

Email address:

Content:

Works referenced in this record:

Architecture and mechanism for forwarding layer interfacing for networks
patent, October 2006

Tasman, Mitchell; Redi, Jason; Pearson, David
US Patent Document 7,116,640
URL: http://patft.uspto.gov/netacgi/nph-Parser?Sect2=PTO1&Sect2=HITOFF&p=1&u=/netahtml/PTO/search-bool.html&r=1&f=G&l=50&d=PALL&RefSrch=yes&Query=PN/7116640

Detection of load balanced links in internet protocol netwoks
patent, September 2008

Bardzil, Timothy; Rankine, Alastair; Hill, Bruce
US Patent Document 7,426,577
URL: http://patft.uspto.gov/netacgi/nph-Parser?Sect2=PTO1&Sect2=HITOFF&p=1&u=/netahtml/PTO/search-bool.html&r=1&f=G&l=50&d=PALL&RefSrch=yes&Query=PN/7426577

Load-balanced routing
patent, December 2009

Singh, Arjun; Dally, William
US Patent Document 7,633,940
URL: http://patft.uspto.gov/netacgi/nph-Parser?Sect2=PTO1&Sect2=HITOFF&p=1&u=/netahtml/PTO/search-bool.html&r=1&f=G&l=50&d=PALL&RefSrch=yes&Query=PN/7633940

Efficiently decoupling reservation and data forwarding of data flows in a computer network
patent, March 2015

Thubert, Pascal; Levy-Abegnoli, Eric; Le Faucheur, Francois
US Patent Document 8,976,672
URL: http://patft.uspto.gov/netacgi/nph-Parser?Sect2=PTO1&Sect2=HITOFF&p=1&u=/netahtml/PTO/search-bool.html&r=1&f=G&l=50&d=PALL&RefSrch=yes&Query=PN/8976672

Similar Records

Similar records in DOepatents and OSTI.GOV collections:

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamically adjusting local routing strategies

Patent Archer, Charles Jens ; Musselman, Roy Glenn ; Peters, Amanda ; Pinnow, Kurt Walter ; Swartz, Brent Allen ; Wallenfelt, Brian Paul

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Each node implements a respective routing strategy for routing data through the network, the routing strategies not necessarily being the same in every node. The routing strategies implemented in the nodes are dynamically adjusted during application execution to shift network workload as required. Preferably, adjustment of routing policies in selective nodes is performed at synchronization points. The network may be dynamically monitored, and routing strategies adjusted according to detected network conditions.
Full Text Available March 2010
Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by semi-randomly varying routing policies for different packets

Patent Archer, Charles Jens ; Musselman, Roy Glenn ; Peters, Amanda ; Pinnow, Kurt Walter ; Swartz, Brent Allen ; Wallenfelt, Brian Paul

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Nodes vary a choice of routing policy for routing data in the network in a semi-random manner, so that similarly situated packets are not always routed along the same path. Semi-random variation of the routing policy tends to avoid certain local hot spots of network activity, which might otherwise arise using more consistent routing determinations. Preferably, the originating node chooses a routing policy for a packet, and all intermediate nodes in the path route the packet according to that policy. Policies may be rotated on a round-robinmore »« less
Full Text Available November 2010
Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by routing through transporter nodes

Patent Archer, Charles Jens ; Musselman, Roy Glenn ; Peters, Amanda ; Pinnow, Kurt Walter ; Swartz, Brent Allen ; Wallenfelt, Brian Paul

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. An automated routing strategy routes packets through one or more intermediate nodes of the network to reach a destination. Some packets are constrained to be routed through respective designated transporter nodes, the automated routing strategy determining a path from a respective source node to a respective transporter node, and from a respective transporter node to a respective destination node. Preferably, the source node chooses a routing policy from among multiple possible choices, and that policy is followed by all intermediate nodes. The use of transporter nodes allowsmore » greater flexibility in routing.« less
Full Text Available November 2010
System for routing messages in a vertex symmetric network by using addresses formed from permutations of the transmission line indicees

Patent Faber, Vance ; Moore, James W.

A network of interconnected processors is formed from a vertex symmetric graph selected from graphs .GAMMA..sub.d (k) with degree d, diameter k, and (d+1)!/(d-k+1)! processors for each d.gtoreq.k and .GAMMA..sub.d (k,-1) with degree 3-1, diameter k+1, and (d+1)!/(d-k+1)! processors for each d.gtoreq.k.gtoreq.4. Each processor has an address formed by one of the permutations from a predetermined sequence of letters chosen a selected number of letters at a time, and an extended address formed by appending to the address the remaining ones of the predetermined sequence of letters. A plurality of transmission channels is provided from each of the processors, wheremore »« less
Full Text Available January 1992
Eliminating livelock by assigning the same priority state to each message that is inputted into a flushable routing system during N time intervals

Patent Faber, Vance

Livelock-free message routing is provided in a network of interconnected nodes that is flushable in time T. An input message processor generates sequences of at least N time intervals, each of duration T. An input register provides for receiving and holding each input message, where the message is assigned a priority state p during an nth one of the N time intervals. At each of the network nodes a message processor reads the assigned priority state and awards priority to messages with priority state (p-1) during an nth time interval and to messages with priority state p during an (n+1)more »« less
Full Text Available January 1994