+

WO2018195520A1 - Implémentation classique d'enchevêtrement - Google Patents

Implémentation classique d'enchevêtrement Download PDF

Info

Publication number
WO2018195520A1
WO2018195520A1 PCT/US2018/028709 US2018028709W WO2018195520A1 WO 2018195520 A1 WO2018195520 A1 WO 2018195520A1 US 2018028709 W US2018028709 W US 2018028709W WO 2018195520 A1 WO2018195520 A1 WO 2018195520A1
Authority
WO
WIPO (PCT)
Prior art keywords
link
protocol
entl
information
alice
Prior art date
Application number
PCT/US2018/028709
Other languages
English (en)
Inventor
Paul L. Borrill
Original Assignee
Borrill Paul L
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Borrill Paul L filed Critical Borrill Paul L
Publication of WO2018195520A1 publication Critical patent/WO2018195520A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • the present invention generally relates to systems and methods for communication between networking systems, and, more particularly, relates to a mesh networked system formed with multiple networking nodes connected each other via one to one connection via multiple ports on each node.
  • a state of temporal intimacy may be constructed on a link by taking the arrival of a packet containing an "Element of Shared Information" (ESI) and sending it back down a link
  • bipartite communication channel (bipartite communication channel) . If the other side does the same, then we have a symmetric "timeless" link: a classical implementation of the correlated states of a bipartite entangled system. From an engineering perspective, we are interested in properties that can be derived from temporal intimacy; such as its potential to replace heartbeats and timeouts in distributed algorithms, enable atomic (all or nothing) transactions, and to establish non-cloneable states which may be used to securely transfer private information (secrets) across classical systems.
  • LOV Local Observer View
  • GOV God' s-Eye View
  • Ethernet interfaces to send packets between two computers connected by a common cable, or back to back connected PCIe interfaces.
  • a special ENTL packet is used to signal this timeless state.
  • Computational nodes are connected to each other via multiple point to point communication ports to form a mesh network. It provides flexible generic communication path between nodes within the mesh network. A unique routing index
  • Route ID is used to represent a communication path between nodes within the mesh network.
  • higher level routing mechanism provides the path for the routing.
  • a simple case is a pair of ⁇ source, destination ⁇ . This can also be a path for multicast, which gives a set of destinations ⁇ destinationl , destination2 , ... ⁇ .
  • the Route ID and necessary forwarding information is passed to the source, destination nodes, as well as the nodes in between. The calculation of such path is assumed to be done in the upper routing protocol/mechanism and is not a subject of this invention .
  • a node When a node receives such a routing information, it will be a set of ⁇ Route ID, Forwarding Ports ⁇ pair, where the ports can be multiple targets including the node itself. When all the nodes within the routing path received such
  • the mesh system can handle the packet transfer for the given Route ID.
  • Each node looks up the table with Route ID and determines where to forward the packet.
  • each node uses a linear table to store the routing information entries.
  • the new entry is indexed directly as the memory offset within the table. This index is called the LookUp ID.
  • the Forwarding Port to the destination is recorded.
  • this LookUp ID is passed to the source side of the next neighbor on this routing path.
  • the neighbor receives the LookUp ID of next forwarding neighbor and records it into the entry associated to Route ID, as the next Lookup ID of the forwarding port. So, each node has an entry for the Route ID with ⁇ Forwarding Port, Next LookUp ID ⁇ pair according to the routing path.
  • the sender looks up the entry in the lookup table. At the very beginning of the transfer, it uses a mapping mechanism to determine the table entry from the Route ID. Then, it forwards the packet to the port specified in the table entry. At this point, the sender updates a field in the packet header with the Next LookUp ID corresponding to the forwarding port. Thus, the next neighbor node will receive the packet header with the LookUp ID of its own, and it can directly lookup the
  • Each node updates the LookUp ID field in the packet header with the value associated with the forwarding port when it forwards the packet to the next node. So, all nodes can use direct table lookup, without the need for a more complex and thus slower mapping mechanism between Routing ID and the table entry .
  • the forwarding port information can be more than one, to support multi-cast information.
  • the table entry also can holds Child port and Parent port with corresponding LookUp IDs to support bidirectional path with a single entry.
  • Figure 1 shows a link, according to an embodiment.
  • Figure 2 shows a ENTL hidden events, according to an embodiment .
  • FIG. 3 shows an AIT send, according to an
  • Figure 4 shows an AIT receive, according to an embodiment .
  • Figure 5 shows transform equipment, according to an embodiment .
  • Figure 6 shows a Rx-Tx transform, according to an embodiment .
  • Figure 7 shows a 2x2 transform matrix, according to an embodiment .
  • Figure 8 shows bipartite information relationships, according to an embodiment.
  • Figure 9 shows a shared state machine for Alice, according to an embodiment.
  • Figure 10 shows a shared state machine for Bob, according to an embodiment.
  • Figure 10 shows a link computation entity, according to an embodiment.
  • Figure 11 shows an embodiment of a computing environment configured according to the present disclosure, according to an embodiment.
  • This disclosure generally discloses computer- implemented methods, non-transitory computer-readable media, and devices for packet forwarding in a distributed computer system.
  • One of ordinary skill in the art will recognize various alternatives within the spirit of this disclosure, even if not specifically discussed herein.
  • Tx/Rx media blue bar
  • Half Links on either side.
  • the recirculating arrows inside the media indicate that these events and shared (recirculating)
  • Figure 1 shows a link, according to an embodiment.
  • the agent on either side of the link does a push to the register in the half link.
  • the counter in this ⁇ lock' is constrained to modulo (e.g. 2) addition.
  • the receipt of an ENTL packet is treated as a TICK, and the retransmission of the (transformed) packet may be treated as a TOCK.
  • Alice's TICK may therefore be Bob's TOCK.
  • the arrangement is symmetric: each side of the link thinks it is Alice from its LOV, and the other side is Bob. This is one of several possible protocols.
  • ENTL is a "timeless" protocol that nonetheless maintains temporal intimacy through the exchange (causal circulation) of packets: a basic resource we can hang higher level operations on in a system of distributed nodes (cells) .
  • This "hot-potato" packet is circulated at the lowest possible level in the link between two parties: Alice and Bob.
  • Alice and Bob Ideally, on the very edge of the hardware that recognizes the packet types as they arrive. If the type is ENTL, it sends it back down the link to the sender. The sender is now the receiver, and it recognizes ENTL, and does the same. This continues until an agent on either side wishes to send an Atomic
  • AIT Information Transfer
  • ENTL The hidden ( self-circulating ) ENTL packet mechanism is shown in fig. 1.2.
  • ENTL is organized to be as free as possible from any clocks on both sides of the link.
  • the link is a clockl, with its own characteristic period depending on the length of the cable and the amount of "mechanism" needed to receive and recognize the packet, and to send it back out again.
  • This ENTL mechanism is self-generating (once started) , and isakily sensitive to packet loss (c.f. the FLP result) .
  • a Network Interface Controller synchronizes its registers and buffer memory with its local CPU (i.e. the Cell Agent), and independently, synchronizes the bits it sends on the wire with a separate clock associated with the Ethernet Standard it wishes to conform to (e.g. 10/25/100 Gbit transfer rate) .
  • a separate clock associated with the Ethernet Standard it wishes to conform to (e.g. 10/25/100 Gbit transfer rate) .
  • the preferred implementation would have NO synchronization whatsoever (i.e. It would not cross any clock domains) .
  • the only synchronization signal would be the leading edge (change) in the signal on the media indicating the arrival of information at Alice's receiver. The same would be true on the opposite end on Bob's receiver.
  • Figure 2 shows a ENTL hidden events, according to an embodiment .
  • a link comprises two Half-Edges, each Half-Edge comprises a Half-Link and connection to media.
  • the link is equipped with basic mechanisms to hide the state of internal packet exchanges on the media (entanglement) .
  • Figure 3 shows an AIT send, according to an
  • Figure 4 shows an AIT receive, according to an embodiment .
  • EI Error Information
  • Time (change that we can count) is represented by a modulo counter. Different moduli will yield different properties in the link which may be exploited at higher levels in the system. Because the modulo counter "rolls over", it will bound the amount of evolution that can occur before the recurrence of the count.
  • a modulo 1 counter is timeless (no perceived change in state on either side of the link) .
  • a modulo 2 counter (as used in ENTL) provides only 2 states
  • a modulo-4 counter allows the expression of 4 states, and is the minimum configuration which enables a distinction in the forward and backward evolution of the protocol, and thus, the minimum mechanism for atomically transferring an AIT token from one side of the link to another. Larger moduli allow greater spans of counts; allowing extension to, for example, chains of cells and links in a datacenter environment. [048] The basic mechanism in the link, is to exchange the
  • a single logical bit can be swapped, or 2 or more bits can be swapped.
  • One approach is to combine a pair of bits on one side, with a
  • the ESI is designed to represent half of this information, a positive (+1) state on one side, and the other half of the information (-1) on the other side and arrange through the protocol for this to always be complimentary.
  • the pair of states represents a "complete" ESI.
  • Liveness (The ENTL protocol) is established by the perpetual exchange of the contents of the registers on each side of the link.
  • combining the registers e.g. merging two 32-registers into a single 64-bit register, and atomically swapping two halves of the register using a swap (or compare and swap) instruction in a processor or other (e.g. gate array) logic on each side.
  • Atomic Information transfer can be achieved by atomically exchanging information from the w register with the contents of the x register (at any time) . The next time the ENTL packet arrives, it will then carry this (ENTT) information onto the wire to the other side. When the other side receives it, the "compare” part of the “compare and swap” discovers this is no longer an ENTL state, it can extract the information by doing a swap into the z register on that side, and the transfer is in progress.
  • link media can be more easily guaranteed to be a single segment (without intermediate elements or repeaters), it can also be used in long-haul links
  • the ENTL mechanism provides the fastest physically possible way for two sides of a link to "know" what is going on the other side of the link. In principle, only the speed of light (in whatever medium) is the limiting factor to this "temporal intimacy”.
  • the ENTT mechanism provides the
  • the link represents a bipartite relationship4 , in which individual "Elements of Shared Information" (ESI) are maintained with an appropriate protocol to ensure their conserved property. State (bits) on either side of the link are maintained to keep track of (a) whether this side of the link has the ESI or not, and (b) what the value of the ESI is. If Alice' s Half-Link holds 0, then Alice may also keep track of the last or most recent value. This plays an important role in the function of the link. If we no longer have the ESI, but we remember the old value, then we can compare what the new value is when it comes back from the other side. i.e. we can determine if it is a surprise or not.
  • ESI Simple Identifier
  • the ESI represents a shared state.
  • One way to implement this is for Alice to combine her (local) state, with what she sees as Bobs (remote) state and combine them into a single state that fits in the register.
  • 2 bits on each side to emulate a qubit provides 4 bits in total that can be sent back and forth.
  • Alice exchange one of her 2 bits with Bob and Bob does the same.
  • the underlying mechanism is very simple, so it should be easy to map out the state space for a 1, 2, 4, or higher number of "total" bits in the system.
  • the key is that the information is shared, it is not a separate "bits" of information on each side. This is achieved by a protocol which constantly, and atomically, exchanges a portion of the state on one side, with a portion of the state on the other side.
  • AIT is like a compare and swap operation, but on the message instead of in shared memory.
  • TICK-TOCK This implies a change (either Tx or Rx Transform is active, but not both, on each side) .
  • Alice receives TICK (0) into a register (or memory) and does a Tx Transform (TxT) to (1), which goes out on the wire as a TOCK.
  • Bob receives the TOCK (1) and reads this into his register (or memory) and does a TxT to 0, which goes out on the wire as a TICK, and the cycle completes.
  • Symmetry is broken because Alice always sends TICKs and Bob always Sends TOCKs8.
  • ENTT switches coherently from the 2-phase protocol to the 4-state protocol, transfers the AIT token, allowing for failures to accept the token in the destination, and return it to the sender, i.e. reversibility when "little failures" occur.
  • AIT tokens are distinguished either by symmetry breaking, or some higher level of unique identifier.
  • Multiple ESI Each side (Alice, Bob) can pipeline multiple AIT tokens. Each Token must be unique, so that recovery can occur independently on each token.
  • each link may support multiple concurrent AIT tokens 10 , and the modulus of the counter will be set equal to the number of links in the chain.
  • the protocol may use a transform
  • PROT TxR, TxT Do not transform on Rx . Do not transform on Tx.
  • PROT TxR, TxT Do not transform on Rx .
  • PROT TxR, TxT Transform on Rx . Do not transform on Tx.
  • PROT TxR, TxT Transform on Rx . Transform on Tx .
  • the link is equipped with a mechanism to specify and enable these transforms. If the Rx transform is empty (an identity operator), then no transform is performed.
  • Transforms are typically implemented as a lookup table in the Half-Link.
  • Figure 5 shows transform equipment, according to an embodiment .
  • Figure 6 shows a Rx-Tx transform, according to an embodiment .
  • Quantities /Exchanged Quantities property. Observation does not mean copying information, it means removing it. Once observed, the information is no longer part of the link, and the temporal intimacy is broken. When one side of the link takes this information, the temporal intimacy will be broken - for both sides of the link - (or at least “stalled") until this (or a new) piece of information is given back.
  • Presense bit pbit
  • vbit value bit
  • the implementation "transfers" a "small number" of bits (e.g. a standard 8-, 16-, 32- or 64-bit integer) between the registers w, x, y and z (see figures 1.2, 1.3 and 1.4) .
  • the register x will hold a "value" of empty (0) as long as there are no AIT tokens to be sent. Note that this is different to the binary representation of Zero. This means we now have (at least) three states that need to be
  • One bit represents presence (pbit) : whether the information is there or not, the other bit represents the value if it was therel4.
  • register w overwrites register x when it wishes to send an AIT token. It could mean that our "shared" information is
  • ENTL can express a TICK/TICK, protocol, or a TICK/TOCK, protocol; depending on whether we are looking at each side with a Local Observer View (from within each end of the link), or a God' s-Eye-View, for the link as a wholel5.
  • the link is equipped with a property we call Equal Quantities / conserveed Quantities (EQ/CQ) . Because the transfer of an AIT token requires an ENTL packet to be replaced by an ENTT packet in order to trigger the transfer, and after the transfer, the ENTT packet to be replaced by an ENTL packet, we have a EQ/CQ system.
  • the ENTL/ENTT protocol facilitates recovery and maintenance of these conserved quantities . This in turn enables applications in the layers above to, for example, enjoy exactly once semantics, in their distributed algorithms.
  • EQ/CQ also enables a classical implementation of the no-cloning theorem, which in-turn, supports the properties needed for Network Assisted
  • NAT Transactions
  • ENTL is the "liveness" protocol, that provides a mechanism to emulate entanglement 18 . It does this by trapping the simplest possible Element of Shared Information ESI, between two Cells (nodes on a computer) over a single link 19 . This property is achieved by:
  • EII Electronic Information
  • ⁇ Bob responds to Alice's proposal by sending back an Element of Shared Information (ESI), which is Alice's EII merged with his own ESI (another 2-bit vector) .
  • ESI shared Information
  • This pair of combined EII' s now forms a 2 x 2 matrix of Alice' s and Bob' s 2-bit vectors which we call an ESI.
  • the goal (in the
  • ⁇ Alice combines her full awareness of the ESI (both halves) and sends that back and forth with Bob.
  • TICK TOCK 2-Party Atomic Swap
  • SMA Shared Memory Atomicity
  • MPA Message Passing Atomicity
  • the goal is a protocol that, using the minimum possible number of roundtrips, and bits required in the packet, to provide the maximum physically realizable "common knowledge" between the two ends.
  • ENTL is the "liveness" protocol
  • ENTT is the
  • the ENTL protocol is a basic resource to maintain what is called “liveness” in the computer science literature, but which we call “temporal intimacy” here because of its ability to atomically transition to a 4-phase protocol and maintain coherence while AIT tokens are transferred with local reversibility property.
  • AIT AIT
  • ENTL ESI is an event which depending on a local trigger, will continue that event into an ENTT ESI, to transfer the AIT token (along with any logical bits associated with it) , and then the final ESI event of the ENTT protocol is carried back into an ENTL ESI to complete the transfer, and terminate (flush) the last transaction .
  • AIT token owned by the sender.
  • the ENTT protocol sends the AIT token in the first phase of the protocol, without a prepare ("are you ready") phase - which is implicit in the ENTL TICK-TOCK liveness protocol.
  • the response from the receiver on receipt of the first ENTT packet is to store the AIT token, and any logical variables associated
  • the protocol proceeds through the 4 states in the shared state machine (SSM) , with each transition representing an event sent over the wire in a packet. If any one of the packets are lost, the SSM will stall, with both sides of the link off by at most one.
  • a hazard analysis of the loss of each transition is matched to a specific mitigation in the recovery protocol (which may simply be re-establishing temporal intimacy on the same link, or routing around via other cells to retrieve the state that was stalled in the other Half-Link) .
  • Figure 9 shows a shared state machine for Alice, according to an embodiment.
  • Figure 10 shows a shared state machine for Bob, according to an embodiment.
  • the owner no longer has any control of it (a higher level protocol may in a different design) , particularly after the ENTT protocol is finally flushed by a cycle of ENTL.
  • the receiver has a problem, such as failure of its local application, it can "push" the AIT token back to the sender as unprocessed. This resets the link, for that AIT token, back to the state it was in before the transfer, i.e., it reverses time on that link. Whatever can happen in the AIT protocol, can unhappen.
  • AIT Tokens may be pipelined, i.e. while only one may be concurrently active on each link, multiple tokens can be sent over a link before the first one is processed at the receiving end as shown in fig. 1.11. Multiple AIT tokens may also be in transit over a chain of links
  • each AIT token In order to pipeline, each AIT token must have its own identity. This enables an unlimited number of AIT tokens to be transferred (limited only by local capacity of the Half- Links), and it enables recovery should the link fail and the healing algorithms route around the failure and need to
  • the sending side can no longer retrieve the AIT token.
  • the receiving side can still send the AIT token back, if it discovers a reason to do so before it is processed by the application layer.
  • Figure 10 shows a link computation entity, according to an embodiment.
  • ⁇ Send a single AIT token with a "count”, allowing each cell to decrement the count. If the count does not go down to zero, then either an error occurred, or one or more members departed from the group. Either way, this provides a highly efficient way to do reliable multicast, and an integrated group membership protocol on our stacked tree implementation .
  • ⁇ Send a single AIT token on each port (branch) of the sender (root for that tree) . When the outgoing token reaches another cell, it branches (replicates) into the number of children of that cell. It does this until each of the AIT token replicas reaches a leaf. At the leaf, a return AIT token is reflected back, and accumulates information on each cell
  • Each intermediate cell waits until all its children have responded, and then sends a "summary" token rootward. When the root finally has all response AIT tokens, it now has a complete picture of the cells which responded22.
  • CQ/EQ conserved quantities
  • ENTL packets can carry additional information, such as the amount of buffer space available in the
  • subvirtualization layer the layer which contains the mechanisms we trust and manage to achieve the EQ/CQ properties of the SVL.
  • the ENTL packet is "equipped” with a mechanism (state machine and fields within the packets) to provide an infrastructure capability, such credit-based flow control, or some other function intrinsic the mechanisms already in the SVL 23 .
  • ENTL packets can carry even higher-level
  • the ENTL packet is decorated with a mechanism (state machine and fields within the packets) to provide an application capability, such as load balancing. [Ref Google Maglev] .
  • the first node handles the request, if it has capacity it processes the packet, if not it passes it round robin to one of its children. This proceeds recursively through the tree, automatically. Fault detection is implicit in the ENTL protocol, and atomic transfer of packet can be "assisted" by the AIT mechanism (ENTT protocol) . Alternatives other than round robin may be exploited by decorating the link with artifacts such as: load, available capacity, error state, and, ultimately, the processing "capacity" of the entire branch of descendants further down the tree.
  • Another use case is Strong Serializability for Replicated Storage Systems. For example, an update (for a file, or a KV " store) comes into the root of the tree. It propagates the writes down a tree, and the readers are assigned to be the leaves. If a failure is detected (For example, by the ENTL or ENTT protocol) , they are redirected to the closest parent cell on the path to that leaf. This guarantees they will never see an out of order read.
  • FIG 11 shows an embodiment of a computing environment configured according to the present disclosure, according to an embodiment.
  • a computing device 900 is an exemplary device that is implementable for the authentication server 520A. Additionally, the computing device 900 is merely an example implementation itself, since the system 500A can also be fully or partially implemented with laptop computers, tablet computers, smart cell phones, Internet appliances, and the like.
  • the computing device 900 includes a memory 910, a processor 920, a hard drive 930, and an I/O port 940. Each of the components is coupled for electronic communication via a bus 999. Communication can be digital and/or analog and use any suitable protocol.
  • the memory 910 further comprises network
  • the network applications 912 can include a web browser, a mobile
  • an application an application that uses networking, a remote application executing locally, a network protocol application, a network management application, a network routing
  • the operating system 914 can be one of the Microsoft WindowsTM, family of operating systems (e.g., Windows 95, 98, Me, Windows NT, Windows 2000, Windows XP, Windows XP x64 Edition, Windows Vista, Windows CE, Windows Mobile) , Windows 7, Windows 8, Linux, HP-UX, UNIX, Sun OS, Solaris, Mac OS X, Alpha OS, AIX, IRIX32, or IRIX64. Other operating systems may be used.
  • Microsoft Windows is a trademark of Microsoft
  • the processor 920 can be a network processor (e.g., optimized for IEEE 802.11), a general-purpose processor, an application-specific integrated circuit (ASIC) , a field programmable gate array (FPGA), a reduced instruction set controller (RISC) processor, an integrated circuit, or the like. Qualcomm Atheros, Broadcom Corporation, and Marvell Semiconductors manufacture processors that are optimized for IEEE 802.11 devices.
  • the processor 920 can be single core, multiple core, or include more than one processing elements.
  • the processor 920 can be disposed on silicon or any other suitable material.
  • the processor 920 can receive and execute instructions and data stored in the memory 910 or the storage device 930.
  • the storage device 930 can be any non-volatile type of storage such as a magnetic disc, EEPROM, Flash, or the like.
  • the storage device 930 stores code and data for applications .
  • the I/O port 940 further comprises a user interface
  • the user interface 942 can output to a display device and receive input from, for example, a keyboard.
  • the network interface 944 connects to a medium such as Ethernet or Wi-Fi for data input and output.
  • the network interface 944 includes IEEE 802.11 antennae .
  • Computer software products e.g., non-transitory computer products storing source code
  • the computer software product may be an independent application with data input and data display modules.
  • the computer software products may be classes that are
  • the computer software products may also be component software such as Java Beans
  • the computer that is running the previously mentioned computer software may be connected to a network and may interface to other computers using this network.
  • the network may be on an intranet or the Internet, among others.
  • the network may be a wired network (e.g., using copper) , telephone network, packet network, an optical network
  • Wi-Fi IEEE standards 802.11,
  • signals from a computer may be transferred, at least in part,
  • a user accesses a system on the World Wide Web (WWW) through a network such as the Internet.
  • WWW World Wide Web
  • the Web browser is used to download web pages or other content in various formats including HTML, XML, text, PDF, and postscript, and may be used to upload information to other parts of the system.
  • the Web browser may use uniform resource identifiers (URLs) to identify resources on the Web and hypertext transfer protocol (HTTP) in transferring files on the Web.
  • URLs uniform resource identifiers
  • HTTP hypertext transfer protocol

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne des nœuds informatiques sont connectés les uns aux autres par l'intermédiaire de multiples ports de communication point à point pour former un réseau maillé. Lorsqu'un nœud reçoit de telles informations de routage, il s'agira d'un ensemble de paires {ID de route, Ports de réacheminement}, les ports pouvant être des cibles multiples qui comprennent le nœud lui-même. Lorsque tous les noeuds à l'intérieur du trajet de routage ont reçu de telles informations, le système maillé peut traiter le transfert de paquets pour l'ID de route donné Chaque nœud réalise une recherche dans la table avec l'ID de route et détermine l'endroit où le paquet doit être réacheminé.
PCT/US2018/028709 2017-04-20 2018-04-20 Implémentation classique d'enchevêtrement WO2018195520A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201762488025P 2017-04-20 2017-04-20
US62/488,025 2017-04-20

Publications (1)

Publication Number Publication Date
WO2018195520A1 true WO2018195520A1 (fr) 2018-10-25

Family

ID=63856458

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2018/028709 WO2018195520A1 (fr) 2017-04-20 2018-04-20 Implémentation classique d'enchevêtrement

Country Status (1)

Country Link
WO (1) WO2018195520A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115865333A (zh) * 2022-11-24 2023-03-28 北京百度网讯科技有限公司 量子纠缠建立方法、装置及电子设备

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090046732A1 (en) * 2007-04-13 2009-02-19 Hart Communication Foundation Routing Packets on a Network Using Directed Graphs
US20100085916A1 (en) * 2007-01-31 2010-04-08 Noosphere Communications, Inc. Systems and Methods for Hybrid Wired and Wireless Universal Access Networks
US20100165886A1 (en) * 2008-12-31 2010-07-01 Paul Borrill Self-Healing Communication Trees
US20140022948A1 (en) * 2005-02-09 2014-01-23 Piccata Fund Limited Liability Company Wireless mesh architecture
US20140347975A1 (en) * 2013-05-22 2014-11-27 Fujitsu Limited Data transmitting device, data transmitting method and non-transitory computer-readable storage medium

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140022948A1 (en) * 2005-02-09 2014-01-23 Piccata Fund Limited Liability Company Wireless mesh architecture
US20100085916A1 (en) * 2007-01-31 2010-04-08 Noosphere Communications, Inc. Systems and Methods for Hybrid Wired and Wireless Universal Access Networks
US20090046732A1 (en) * 2007-04-13 2009-02-19 Hart Communication Foundation Routing Packets on a Network Using Directed Graphs
US20100165886A1 (en) * 2008-12-31 2010-07-01 Paul Borrill Self-Healing Communication Trees
US20140347975A1 (en) * 2013-05-22 2014-11-27 Fujitsu Limited Data transmitting device, data transmitting method and non-transitory computer-readable storage medium

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115865333A (zh) * 2022-11-24 2023-03-28 北京百度网讯科技有限公司 量子纠缠建立方法、装置及电子设备
CN115865333B (zh) * 2022-11-24 2023-09-26 北京百度网讯科技有限公司 量子纠缠建立方法、装置及电子设备

Similar Documents

Publication Publication Date Title
US11930107B2 (en) Entangled links, transactions and trees for distributed computing systems
US11546189B2 (en) Access node for data centers
US11799836B2 (en) Classical implementation of quantum entanglement in datacenter network design
Chen et al. Commentaries on" Active networking and end-to-end arguments"
US7627759B2 (en) End-to-end reliable messaging with complete acknowledgement
CN106537880A (zh) 在信息中心网络架构中缓存数据
US8751655B2 (en) Collective acceleration unit tree structure
US6990528B1 (en) System area network of end-to-end context via reliable datagram domains
US20250112707A1 (en) Classical implementation of entanglement
Costa et al. Camcubeos: a key-based network stack for 3d torus cluster topologies
Censor-Hillel et al. Making asynchronous distributed computations robust to noise
Olexandr et al. Routing method based on the excess code for fault tolerant clusters with InfiniBand
KR20050002604A (ko) 데이터 전송 관리 시스템 및 방법
de Beaudrap et al. Quantum linear network coding for entanglement distribution in restricted architectures
WO2018195520A1 (fr) Implémentation classique d'enchevêtrement
US20240223360A1 (en) Entangled links, transactions and trees for distributed computing systems
Low et al. On anycast routing with bandwidth constraint
Garcia-Molina et al. Aggressive transmissions over redundant paths
Zafar et al. Deadlock-free dynamic reconfiguration over InfiniBand™ NETWORKS
Tixeuil On a space-optimal distributed traversal algorithm
Li et al. Mirrored K‐Ary N‐Tree and its efficiency of fault tolerance
CRICHLOW DISTRIBUTED SYSTEMS COMPUTING OVER NETWORKS
Michael et al. Towards causal datacenter networks
roy Beauquiery et al. Self-stabilization in Eulerian Networks with Cut-through Constraints
Marcoullis Self-stabilizing state machine replication in static and reconfigurable asynchronous message-passing systems

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18787542

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18787542

Country of ref document: EP

Kind code of ref document: A1

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载