WO2015048239A2 - Coexistence d'un protocole de routage distribué et d'un calcul de trajets centralisé pour les réseaux sans fil déterministes - Google Patents

Coexistence d'un protocole de routage distribué et d'un calcul de trajets centralisé pour les réseaux sans fil déterministes Download PDF

Info

Publication number
WO2015048239A2
WO2015048239A2 PCT/US2014/057381 US2014057381W WO2015048239A2 WO 2015048239 A2 WO2015048239 A2 WO 2015048239A2 US 2014057381 W US2014057381 W US 2014057381W WO 2015048239 A2 WO2015048239 A2 WO 2015048239A2
Authority
WO
WIPO (PCT)
Prior art keywords
protocol
path computation
routing
network
centralized path
Prior art date
Application number
PCT/US2014/057381
Other languages
English (en)
Other versions
WO2015048239A3 (fr
Inventor
Pascal Thubert
Eric Levy-Abegnoli
Patrick Wetterwald
Jean-Philippe Vasseur
Original Assignee
Cisco Technology, Inc.
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 Cisco Technology, Inc. filed Critical Cisco Technology, Inc.
Priority to EP14782037.7A priority Critical patent/EP3050263B1/fr
Priority to CA2924210A priority patent/CA2924210C/fr
Priority to CN201480053343.2A priority patent/CN105580331B/zh
Publication of WO2015048239A2 publication Critical patent/WO2015048239A2/fr
Publication of WO2015048239A3 publication Critical patent/WO2015048239A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/26—Connectivity information management, e.g. connectivity discovery or connectivity update for hybrid routing by combining proactive and reactive routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/42—Centralised routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/44—Distributed routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/30—Connectivity information management, e.g. connectivity discovery or connectivity update for proactive routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present disclosure relates generally to computer networks, and, more particularly, to distributed routing protocols and centralized path computation, especially their co-existence for deterministic wireless networks.
  • LLCs Low power and Lossy Networks
  • sensors networks have a myriad of applications, such as Smart Grid and Smart Cities.
  • LLNs Various challenges are presented with LLNs, such as lossy links, low bandwidth, battery operation, low memory and/or processing capability, etc.
  • deterministic networking refers to networks that can guarantee the delivery of packets within a bounded time.
  • this relates to achieving characteristics such as guaranteed delivery, fixed latency, and jitter close to zero (e.g., micro seconds to tens of milliseconds depending on application). Achieving these characteristics within the architecture of an LLN, however, is not trivial, due to the constrained nature of LLNs.
  • FIG. 1 illustrates an example communication network
  • FIG. 2 illustrates an example network device/node
  • FIG. 3 illustrates an example routing protocol message format
  • FIGS. 4-8B illustrate examples of protocol coexistence measures
  • FIG. 9 illustrates an example simplified procedure for co-existence of a distributed routing protocol and centralized path computation, particularly for deterministic wireless networks.
  • a device both communicates with a network operating a distributed proactive routing protocol, and participates in a centralized path computation protocol (where the device may be a centralized path computation element (PCE) or a device within the network (e.g., a field area router (FAR) or other device)).
  • the device communicates routing characteristics of the distributed proactive routing protocol for the network from the network to the centralized path computation protocol, and also communicates one or more computed paths from the centralized path computation protocol to the network, where the computed paths from the centralized path computation protocol are based on the routing characteristics of the distributed proactive routing protocol for the network.
  • PCE centralized path computation element
  • FAR field area router
  • a computer network is a geographically distributed collection of nodes interconnected by communication links and segments for transporting data between end nodes, such as personal computers and workstations, or other devices, such as sensors, etc.
  • end nodes such as personal computers and workstations, or other devices, such as sensors, etc.
  • LANs local area networks
  • WANs wide area networks
  • LANs typically connect the nodes over dedicated private communications links located in the same general physical location, such as a building or campus.
  • WANs typically connect geographically dispersed nodes over long-distance communications links, such as common carrier telephone lines, optical lightpaths, synchronous optical networks (SONET), synchronous digital hierarchy (SDH) links, or Powerline Communications (PLC) such as IEEE 61334, IEEE P1901.2, and others.
  • SONET synchronous optical networks
  • SDH synchronous digital hierarchy
  • PLC Powerline Communications
  • a Mobile Ad-Hoc Network is a kind of wireless ad-hoc network, which is generally considered a self-configuring network of mobile routers (and associated hosts) connected by wireless links, the union of which forms an arbitrary topology.
  • Smart object networks such as sensor networks, in particular, are a specific type of network having spatially distributed autonomous devices such as sensors, actuators, etc., that cooperatively monitor physical or environmental conditions at different locations, such as, e.g., energy/power consumption, resource consumption (e.g., water/gas/etc. for advanced metering infrastructure or "AMI" applications) temperature, pressure, vibration, sound, radiation, motion, pollutants, etc.
  • Other types of smart objects include actuators, e.g., responsible for turning on/off an engine or perform any other actions.
  • Sensor networks a type of smart object network, are typically shared-media networks, such as wireless or PLC networks.
  • each sensor device (node) in a sensor network may generally be equipped with a radio transceiver or other communication port such as PLC, a microcontroller, and an energy source, such as a battery.
  • a radio transceiver or other communication port such as PLC
  • a microcontroller such as a microcontroller
  • an energy source such as a battery.
  • smart object networks are considered field area networks (FANs), neighborhood area networks (NANs), etc.
  • FANs field area networks
  • NANs neighborhood area networks
  • size and cost constraints on smart object nodes result in corresponding constraints on resources such as energy, memory,
  • FIG. 1 is a schematic block diagram of an example computer network 100 illustratively comprising nodes/devices 110 (e.g., labeled as shown, "backbone,” “11,” “12,” ... “46,” and described in FIG. 2 below) interconnected by various methods of communication.
  • the links 105 may be wired links or shared media (e.g., wireless links, PLC links, etc.) where certain nodes 110, such as, e.g., routers, sensors, computers, etc., may be in communication with other nodes 110, e.g., based on distance, signal strength, current operational status, location, etc.
  • the backbone devices may connect the nodes of the network to a backbone network, such as via a dedicated wireless link or wired connection, where the backbone network may be proprietary and/or public (e.g., the Internet), and may contain various resources such as servers, switches, routers, etc.
  • the backbone network may be proprietary and/or public (e.g., the Internet)
  • the backbone network may contain various resources such as servers, switches, routers, etc.
  • the network is shown in a certain orientation, particularly with a "root" backbone node, the network 100 is merely an example illustration that is not meant to limit the disclosure.
  • Data packets 140 e.g., traffic and/or messages sent between the
  • a protocol consists of a set of rules defining how the nodes interact with each other.
  • FIG. 2 is a schematic block diagram of an example node/device 200 that may be used with one or more embodiments described herein, e.g., as any of the nodes 110 or servers (e.g., path computation elements or "PCEs") shown in FIG. 1 above.
  • the device 200 may comprise one or more network interfaces 210 (e.g., wired, wireless, PLC, etc.), at least one processor 220, and a memory 240 interconnected by a system bus 250, as well as a power supply 260 (e.g., battery, plug-in, etc.).
  • the network interface(s) 210 contain the mechanical, electrical, and signaling circuitry for communicating data over links 105 coupled to the network 100.
  • the network interfaces may be configured to transmit and/or receive data using a variety of different communication protocols.
  • the nodes may have two different types of network connections 210, e.g., wireless and wired/physical connections, and that the view herein is merely for illustration.
  • the network interface 210 is shown separately from power supply 260, for PLC the network interface 210 may communicate through the power supply 260, or may be an integral component of the power supply. In some specific configurations the PLC signal may be coupled to the power line feeding into the power supply.
  • the memory 240 comprises a plurality of storage locations that are addressable by the processor 220 and the network interfaces 210 for storing software programs and data structures associated with the embodiments described herein. Note that certain devices may have limited memory or no memory (e.g., no memory for storage other than for programs/processes operating on the device and associated caches).
  • the processor 220 may comprise hardware elements or hardware logic adapted to execute the software programs and manipulate the data structures 245.
  • An operating system 242 portions of which are typically resident in memory 240 and executed by the processor, functionally organizes the device by, inter alia, invoking operations in support of software processes and/or services executing on the device. These software processes and/or services may comprise routing process/services 244, a "PCE/PCC" process 246, and an illustrative "coexistence" process 248 as described herein.
  • processor and memory types including various computer-readable media, may be used to store and execute program instructions pertaining to the techniques described herein.
  • description illustrates various processes, it is expressly contemplated that various processes may be embodied as modules configured to operate in accordance with the techniques herein (e.g., according to the functionality of a similar process). Further, while the processes have been shown separately, those skilled in the art will appreciate that processes may be routines or modules within other processes.
  • Routing process (services) 244 contains computer executable instructions executed by the processor 220 to perform functions provided by one or more routing protocols, such as proactive (or reactive) routing protocols as will be understood by those skilled in the art. These functions may, on capable devices, be configured to manage a routing/forwarding table (a data structure 245) containing, e.g., data used to make routing/forwarding decisions.
  • a routing/forwarding table a data structure 245 containing, e.g., data used to make routing/forwarding decisions.
  • link state routing such as Open Shortest Path First (OSPF), or Intermediate - System-to-Intermediate-System (ISIS), or Optimized Link State Routing (OLSR).
  • OSPF Open Shortest Path First
  • ISIS Intermediate - System-to-Intermediate-System
  • OLSR Optimized Link State Routing
  • routing process 244 may consist solely of providing mechanisms necessary for source routing techniques. That is, for source routing, other devices in the network can tell the less capable devices exactly where to send the packets, and the less capable devices simply forward the packets as directed.
  • LNs Low power and Lossy Networks
  • PDR Packet Delivery Rate/Ratio
  • BER bit error rate
  • Links are generally low bandwidth, such that control plane traffic must generally be bounded and negligible compared to the low rate data traffic;
  • Constraint-routing may be required by some applications, e.g., to establish routing paths that will avoid non-encrypted links, nodes running low on energy, etc.;
  • Scale of the networks may become very large, e.g., on the order of several thousands to millions of nodes;
  • Nodes may be constrained with a low memory, a reduced processing capability, a low power supply (e.g., battery).
  • a low power supply e.g., battery
  • LLNs are a class of network in which both the routers and their interconnect are constrained: LLN routers typically operate with constraints, e.g., processing power, memory, and/or energy (battery), and their interconnects are characterized by, illustratively, high loss rates, low data rates, and/or instability.
  • constraints e.g., processing power, memory, and/or energy (battery)
  • energy battery
  • LLNs are comprised of anything from a few dozen and up to thousands or even millions of LLN routers, and support point-to-point traffic (between devices inside the LLN), point- to-multipoint traffic (from a central control point to a subset of devices inside the LLN) and multipoint-to-point traffic (from devices inside the LLN towards a central control point).
  • An example implementation of LLNs is an "Internet of Things" (or “Internet of Everything") network.
  • IoT Internet of Things
  • IoE Internet of Everything
  • IoT Internet of Things
  • IoE Internet of Everything
  • the next frontier in the evolution of the Internet is the ability to connect more than just computers and communications devices, but rather the ability to connect "objects” in general, such as lights, appliances, vehicles, HVAC (heating, ventilating, and air- conditioning), windows and window shades and blinds, doors, locks, etc.
  • the "Internet of Things” thus generally refers to the interconnection of objects (e.g., smart objects), such as sensors and actuators, over a computer network (e.g., IP), which may be the Public Internet or a private network.
  • IP computer network
  • Such devices have been used in the industry for decades, usually in the form of non-IP or proprietary protocols that are connected to IP networks by way of protocol translation gateways.
  • protocol translation gateways e.g., protocol translation gateways.
  • applications such as the smart grid, smart cities, and building and industrial automation, and cars (e.g., that can interconnect millions of objects for sensing things like power quality, tire pressure, and temperature and that can actuate engines and lights), it has been of the utmost importance to extend the IP protocol suite for these networks.
  • MP2P multipoint-to-point
  • LBRs LLN Border Routers
  • P2MP point-to-multipoint
  • RPL may generally be described as a distance vector routing protocol that builds a Directed Acyclic Graph (DAG) for use in routing traffic/packets 140, in addition to defining a set of features to bound the control traffic, support repair, etc.
  • DAG Directed Acyclic Graph
  • RPL also supports the concept of Multi-Topology-Routing (MTR), whereby multiple DAGs can be built to carry traffic according to individual requirements.
  • MTR Multi-Topology-Routing
  • a DAG is a directed graph having the property that all edges (and/or vertices) are oriented in such a way that no cycles (loops) are supposed to exist. All edges are contained in paths oriented toward and terminating at one or more root nodes (e.g., "clusterheads or "sinks"), often to interconnect the devices of the DAG with a larger infrastructure, such as the Internet, a wide area network, or other domain.
  • a Destination Oriented DAG is a DAG rooted at a single destination, i.e., at a single DAG root with no outgoing edges.
  • a "parent" of a particular node within a DAG is an immediate successor of the particular node on a path towards the DAG root, such that the parent has a lower "rank" than the particular node itself, where the rank of a node identifies the node's position with respect to a DAG root (e.g., the farther away a node is from a root, the higher is the rank of that node).
  • a sibling of a node within a DAG may be defined as any neighboring node which is located at the same rank within a DAG. Note that siblings do not necessarily share a common parent, and routes between siblings are generally not part of a DAG since there is no forward progress (their rank is the same). Note also that a tree is a kind of DAG, where each device/node in the DAG generally has one parent or one preferred parent.
  • DAGs may generally be built (e.g., by routing process 244) based on an Objective Function (OF).
  • OF Objective Function
  • the role of the Objective Function is generally to specify rules on how to build the DAG (e.g. number of parents, backup parents, etc.).
  • one or more metrics/constraints may be advertised by the routing protocol to optimize the DAG against.
  • the routing protocol allows for including an optional set of constraints to compute a constrained path, such as if a link or a node does not satisfy a required constraint, it is "pruned" from the candidate list when computing the best path. (Alternatively, the constraints and metrics may be separated from the OF.)
  • the routing protocol may include a "goal" that defines a host or set of hosts, such as a host serving as a data collection point, or a gateway providing connectivity to an external infrastructure, where a DAG's primary objective is to have the devices within the DAG be able to reach the goal.
  • a node In the case where a node is unable to comply with an objective function or does not understand or support the advertised metric, it may be configured to join a DAG as a leaf node.
  • DAG parameters As used herein, the various metrics, constraints, policies, etc., are considered "DAG parameters.”
  • example metrics used to select paths may comprise cost, delay, latency, bandwidth, expected transmission count (ETX), etc.
  • example constraints that may be placed on the route selection may comprise various reliability thresholds, restrictions on battery operation, multipath diversity, bandwidth requirements, transmission types (e.g., wired, wireless, etc.).
  • the OF may provide rules defining the load balancing requirements, such as a number of selected parents (e.g., single parent trees or multi-parent DAGs).
  • an example for how routing metrics and constraints may be obtained may be found in an IETF RFC, entitled "Routing Metrics used for Path Calculation in Low Power and Lossy Networks" ⁇ RFC 6551> by Vasseur, et al.
  • an example OF (e.g., a default OF) may be found in an IETF RFC, entitled “RPL Objective Function 0" ⁇ RFC 6552> by Thubert (March 2012 version) and "The Minimum Rank Objective Function with Hysteresis” ⁇ RFC 6719> by O. Gnawali et al. (September 2012 version).
  • Building a DAG may utilize a discovery mechanism to build a logical representation of the network, and route dissemination to establish state within the network so that routers know how to forward packets toward their ultimate destination.
  • a "router” refers to a device that can forward as well as generate traffic
  • a "host” refers to a device that can generate but does not forward traffic.
  • a "leaf may be used to generally describe a non-router that is connected to a DAG by one or more routers, but cannot itself forward traffic received on the DAG to another router on the DAG. Control messages may be transmitted among the devices within the network for discovery and route dissemination when building a DAG.
  • a DODAG Information Object is a type of DAG discovery message that carries information that allows a node to discover a RPL Instance, learn its configuration parameters, select a DODAG parent set, and maintain the upward routing topology.
  • a Destination Advertisement Object is a type of DAG discovery reply message that conveys destination information upwards along the DODAG so that a DODAG root (and other intermediate nodes) can provision downward routes.
  • a DAO message includes prefix information to identify destinations, a capability to record routes in support of source routing, and information to determine the freshness of a particular advertisement.
  • upward or “up” paths are routes that lead in the direction from leaf nodes towards DAG roots, e.g., following the orientation of the edges within the DAG.
  • downstream or “down” paths are routes that lead in the direction from DAG roots towards leaf nodes, e.g., generally going in the opposite direction to the upward messages within the DAG.
  • a DAG discovery request (e.g., DIO) message is transmitted from the root device(s) of the DAG downward toward the leaves, informing each successive receiving device how to reach the root device (that is, from where the request is received is generally the direction of the root). Accordingly, a DAG is created in the upward direction toward the root device.
  • the DAG discovery reply (e.g., DAO) may then be returned from the leaves to the root device(s) (unless unnecessary, such as for UP flows only), informing each successive receiving device in the other direction how to reach the leaves for downward routes.
  • Nodes that are capable of maintaining routing state may aggregate routes from DAO messages that they receive before transmitting a DAO message.
  • Nodes that are not capable of maintaining routing state may attach a next-hop parent address.
  • the DAO message is then sent directly to the DODAG root that can in turn build the topology and locally compute downward routes to all nodes in the DODAG.
  • Such nodes are then reachable using source routing techniques over regions of the DAG that are incapable of storing downward routing state.
  • RPL also specifies a message called the DIS (DODAG Information Solicitation) message that is sent under specific circumstances so as to discover DAG neighbors and join a DAG or restore connectivity.
  • DIS DODAG Information Solicitation
  • FTG. 3 illustrates an example simplified control message format 300 that may be used for discovery and route dissemination when building a DAG, e.g., as a DIO, DAO, or DIS message.
  • Message 300 illustratively comprises a header 310 with one or more fields 312 that identify the type of message (e.g., a RPL control message), and a specific code indicating the specific type of message, e.g., a DIO, DAO, or DIS.
  • Within the body/payload 320 of the message may be a plurality of fields used to relay the pertinent information.
  • the fields may comprise various flags/bits 321, a sequence number 322, a rank value 323, an instance ID 324, a DODAG ID 325, and other fields, each as may be appreciated in more detail by those skilled in the art.
  • additional fields for destination prefixes 326 and a transit information field 327 may also be included, among others (e.g.,
  • one or more additional sub-option fields 328 may be used to supply additional or custom information within the message 300.
  • OCP objective code point
  • OF objective function
  • sub-option fields 328 may be used to carry other certain information within a message 300, such as indications, requests, capabilities, lists, notifications, etc., as may be described herein, e.g., in one or more type-length- value (TLV) fields.
  • TLV type-length- value
  • Ethernet communication is also widely used for process and discrete manufacturing.
  • SCADA supervisory control and data acquisition
  • deterministic networking refers to networks that can guarantee the delivery of packets within a bounded time. This generally translates to the following
  • QOS Quality of Service
  • Deterministic Ethernet or Deterministic Wireless based on time-scheduled mechanisms require that all the nodes being part of a path are to be time synchronized.
  • Each packet forwarding is then regulated by a time schedule that specifies when this specific packet has to be transmitted to the wire or the radio and this continues for each node on the path. This specific time period is called a time slot.
  • An external box (called orchestrator) usually does the computation of this path and the associated timetable. When the computation is done, the path and the time table is then pushed to every node participating in the forwarding, such that they can receive and transmit the packet according to the schedule.
  • TSCH Time Slotted Channel Hopping
  • TSCH is a medium access technique, which uses time synchronization to achieve ultra low-power operation and channel hopping to enable high reliability.
  • the Time-Slotted aspect of the TSCH technology is a Time Division Multiplexing (TDM) technique, which requires all nodes in the network to be time synchronized.
  • PCEs path computation elements
  • RRC Request for Comment
  • Head-ends may send requests to PCEs (PCReq messages) using a PCEP signaling protocol (RFC 5440), and receive computed paths thanks to replies (PCRep messages).
  • PCEP supports a variety of complex messages with priority, attributes, constraints, etc., along with IGP-based PCE discovery using OSPF and ISIS of static and dynamic attributes.
  • Various algorithms (usually not standardized) have been specified for PCE selection and load balancing.
  • PCE has generally been specified for high-bandwidth networks, such as core service provider networks.
  • PCE protocols and various mechanisms e.g., signaling required for PCE discovery, PCC-PCE signaling protocols such as PCEP, etc.
  • PCEP PCC-PCE signaling protocols
  • PCEP PCEP
  • a routing protocol typically only computes a narrow subset of all the possible routes (that OSPF would have computed), and allows for stretch and temporary inconsistencies (none of which is acceptable for OSPF). In order to achieve different results (routes or route properties), certain configurations execute multiple routing protocols over a same domain.
  • the techniques herein allow the coexistence of RPL and PCE-based routes over a same set of sensor devices (where some flows would be routed over a graph computed by the RPL routing protocol whereas other flows would be routed according to the explicit path computed by the PCE).
  • the routes computed by both protocols have very different properties, and constraints, and as such, the techniques herein provide specific provisions in the way the protocols are used so as to respect the constraints of the other protocol.
  • the two protocols are not designed to interact or share common resources: PCE expects a green field to provide optimized paths, while RPL accounts for memory, bandwidth, and battery constraints, but does not expect the PCE to step in and consume some of the resources that RPL depends on for routing and forwarding.
  • a device both communicates with a network operating a distributed proactive routing protocol, and participates in a centralized path computation protocol (where the device may be a centralized PCE or a device within the network (e.g., a FAR or other device)).
  • the device communicates routing characteristics of the distributed proactive routing protocol for the network from the network to the centralized path computation protocol, and also communicates one or more computed paths from the centralized path computation protocol to the network, where the computed paths from the centralized path computation protocol are based on the routing characteristics of the distributed proactive routing protocol for the network.
  • the techniques described herein may be performed by hardware, software, and/or firmware, such as in accordance with the "coexistence" process 248, which may contain computer executable instructions executed by the processor 220 to perform functions relating to the techniques described herein, e.g., in conjunction with (or as corresponding parts of) routing process 244 and PCE/PCC process 246 (which contains computer executable instructions to operate according to one or more of the PCE and/or PCC protocols described above).
  • the techniques herein may be treated as extensions to conventional protocols, such as RPL and the various PCE protocols, and as such, may be processed by similar components understood in the art that execute those protocols, accordingly.
  • the techniques herein may apply a number of measures that can be added to the RPL and/or PCE protocols to make them more "polite.”
  • measures may fall into either of two categories, namely, protocol aware (PA) and protocol independent (PI) measures.
  • PA protocol aware
  • PI protocol independent
  • Protocol aware generally implies that protocol A understands some specific constraints in protocol B and will act based on that understanding (e.g., avoiding interference with protocol B).
  • Protocol independent measures are measures that a protocol will implement regardless of whether competition for resources comes from a same or different protocols.
  • a first protocol aware measure is based on the fact that RPL (as an example distributed proactive routing protocol) is a mesh protocol and uses P2MP and MP2P paths through a DAG directed to and from a root for both control and data.
  • RPL as an example distributed proactive routing protocol
  • the techniques herein may configure the PCE to favor routes that are orthogonal (i.e., close to or at the same rank) to the routes that lead to and from the root (along the DAG). For example, as shown in FIG. 4, while assuming that links 105 represent DAG connectivity, a path 405 may be established by the PCE that attempts to be as orthogonal as possible between two nodes (e.g., nodes 41 and 35).
  • time slot density for RPL augments with closeness to the root, so to avoid closeness to the root as much as possible, when route constraints permit, the PCE will compute paths that go away and around the root, such as path 505 shown in FIG. 5 from node 22 to 25 (e.g., rather than going via the root, or even via nodes 11, 12, or 13).
  • RPL uses multicast slots for parent-to-child control. These slots are critical for RPL operation and disrupting those may cause routing churn. For instance, these slots are agreed between parent router and all of its children, so changing them involves more cost than for unicast.
  • the amount of time slots can be evaluated from the size of the network and the reactivity to breakage that is expected. A reasonable amount of time slots may be reserved by each RPL router, and according to one or more embodiments herein, those reserved timeslots are advertised to the PCE. As such, the PCE may not use those slots in its path computation. FIG.
  • FIG. 6 illustrates an example advertisement 610 from node 22, comprising an indication of the reserved timeslots (shown as a graphical representation 615), accordingly. Note that in some networks that allow for star topologies, the fixed frequency of slow hopping channel can be used for that purpose.
  • RPL operates in the devices where PCE routes are installed, so it is possible to determine the related slot utilization. As the PCE installs more routes through a router, this router gets loaded and thus less available to carry RPL traffic.
  • the Objective Function may be made sensitive to the slot usages from alternate protocols such as PCE paths, and that usage may illustratively cause the Rank to augment, making this router less attractive as a RPL parent.
  • the techniques herein may re-inject in the RPL routing protocol information about paths computed by another engine such as the PCE. As an example, as shown in FIG. 7, assume that node 22 is a rank "2" node (two hops from the root).
  • RPL may have node 22 advertise its rank as "3", such that nodes 31, 32, and 33 may attempt to find another rank 2 node as their parent, alleviating some of the RPL use of node 22, accordingly.
  • nodes 32 and 33 select node 23, while node 31 remains with node 22 (e.g., unable to reach node 23), and thus becomes a rank 4 device (though technically only three hops away from the root).
  • children of node 31 may alter their parent selection as well, such as node 41 now selecting node 32 (since node 32 is a rank 3 device, while node 31 is showing as a rank 4 device).
  • RPL causes forwarding up to the common parent and then down, such as path 805 in FIG. 8A. It is not capable to compute the stretch between a RPL route and an optimized path as could be computed by the PCE.
  • a RPL router detects that it acts as common parent and routes a flow down that it received as going up, such as node 11, it may ask the PCE for a better route computation which will be added by the PCE in the routers along the path (i.e., detecting a knee and inferring that this means that a shortcut is probably achievable for the PCE).
  • a new path 815 may be computed that avoids using the same link in opposing directions.
  • the DAG root may start observing the number of route changes performed by the RPL protocol (topology changes can be observed by RPL upon receiving routing topology changes thanks to the RPL DAO messages). If the DAG root determines that the number of parent selection changes too often for a set of specific nodes, the techniques herein may use a newly defined message (e.g., IPv6 notification message) sent by the RPL DAG root to the PCE to inform the PCE of the set of nodes that are less or more selected by RPL nodes.
  • a newly defined message e.g., IPv6 notification message
  • Such information may be advantageously used by the PCE to potentially compute different optimized routes at the cost of being less optimal if the PCE can correspondingly increase the stability of the distributed coexistence routing protocol in the network (i.e., close loop control between two routing protocols to better optimize their mode of operation).
  • the PCE should not generally be made aware of all the routing churn in the LLN network, since that would consume too many resources (energy, bandwidth, etc.).
  • the PCE may compute unstable routes.
  • the techniques herein therefore adds hints from the RPL root about which pieces of the network are stable, such as by screening the DAO sequence number increments. Based on that, the PCE may compute longer but more stable routes.
  • TimeSlots the energy in the air
  • Each node may thus determine, by screening the radio space and considering its own allocations, how much the bandwidth is utilized (or free) in its listening range.
  • a PCE may thus include its best knowledge of the TimeSlot usage density at each node in the cost computation of new routes.
  • a routing protocol may be constrained to use a maximum amount of TimeSlots at a given node at a given cost. If that maximum is reached, then the cost of the link should be augmented for new routes.
  • protocol independent measures may be used, such as including local link information such as exponential back off usage and ETX in the cost if the link.
  • local link information such as exponential back off usage and ETX in the cost if the link.
  • RPL Radio Link Protocol
  • notions such as priority and fair share may be put in place between protocols to tell whether a protocol can obtain new slots, thus enforcing a ratio of time slots guaranteed to traffic that is managed by each protocol at a given node.
  • FIG. 9 illustrates an example simplified procedure 900 for co-existence of a distributed routing protocol and centralized path computation, particularly for deterministic wireless networks, in accordance with one or more embodiments described herein.
  • the procedure 900 may start at step 905, and continues to step 910, where, as described in greater detail above, a device (e.g., a PCE or a network node, depending upon perspective and function) communicates with a network operating a distributed proactive routing protocol.
  • the device may also participate in a centralized path computation protocol.
  • the communication with the distributed proactive routing protocol may consist in communication with a RPL DAG root, and participation with a centralized path computation protocol is acting as a PCE.
  • the communication with the distributed proactive routing protocol may consist in communication within the RPL network (e.g., as a RPL DAG root or as any node in the network), and participation with a centralized path computation protocol is acting as a PCC, or as an "informant" to the PCE (e.g., sharing RPL information with the PCE).
  • the RPL network e.g., as a RPL DAG root or as any node in the network
  • participation with a centralized path computation protocol is acting as a PCC, or as an "informant" to the PCE (e.g., sharing RPL information with the PCE).
  • the device communicates (e.g., receives or transmits) routing characteristics of the distributed proactive routing protocol for the network from the network to the centralized path computation protocol, as described above, such that in step 925, the device may communicate (e.g., compute and transmit, or request and receive) one or more computed paths from the centralized path computation protocol to the network, where the computed paths from the centralized path computation protocol are based on the routing characteristics of the distributed proactive routing protocol for the network.
  • steps 920 and 925 may consist of any one or more of the following particular embodiments:
  • g determining, by a RPL node, timeslot usage of the centralized path computation protocol (e.g., PCE routes), and reducing attractiveness of the particular RPL node for selection as a parent node within RPL based on increased timeslot usage (e.g., performed by the nodes themselves, or by the RPL root node).
  • timeslot usage of the centralized path computation protocol e.g., PCE routes
  • the simplified procedure 900 illustratively ends in step 930, though may continue to update information, request/receive new paths, etc. It should be noted that while certain steps within procedure 900 may be optional as described above, the steps shown in FIG. 9 are merely examples for illustration, and certain other steps may be included or excluded as desired. Further, while a particular order of the steps is shown, this ordering is merely illustrative, and any suitable arrangement of the steps may be utilized without departing from the scope of the embodiments herein.
  • the techniques described herein therefore, provide for co-existence of a distributed routing protocol and centralized path computation, particularly for deterministic wireless networks.
  • the techniques herein allow for establishment of an engineered deterministic LLN, mixing both RPL and PCE topologies to better optimize traffic. For instance, as described above, RPL information is communicated over the backbone from the RPL root to the PCE for the benefit of PCE routes that can be established preferably between stable nodes.

Landscapes

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

Abstract

Selon un mode de réalisation de l'invention, un dispositif communique avec un réseau régi par un protocole de routage proactif distribué, et utilise en même temps un protocole de calcul de trajets centralisé. Le dispositif transmet, du réseau au protocole de calcul de trajets centralisé, les caractéristiques de routage du protocole de routage proactif distribué du réseau, et transmet également au réseau un ou plusieurs trajets calculés par le protocole de calcul de trajets centralisé, les trajets calculés par le protocole de calcul de trajets centralisé étant basés sur les caractéristiques de routage du protocole de routage proactif distribué du réseau.
PCT/US2014/057381 2013-09-26 2014-09-25 Coexistence d'un protocole de routage distribué et d'un calcul de trajets centralisé pour les réseaux sans fil déterministes WO2015048239A2 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP14782037.7A EP3050263B1 (fr) 2013-09-26 2014-09-25 Coexistence d'un protocole de routage distribué et d'un calcul de trajets centralisé pour les réseaux sans fil déterministes
CA2924210A CA2924210C (fr) 2013-09-26 2014-09-25 Coexistence d'un protocole de routage distribue et d'un calcul de trajets centralise pour les reseaux sans fil deterministes
CN201480053343.2A CN105580331B (zh) 2013-09-26 2014-09-25 针对确定性无线网络的分布式路由协议和集中式路径计算的共存

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US14/038,253 2013-09-26
US14/038,253 US9882804B2 (en) 2013-09-26 2013-09-26 Co-existence of a distributed routing protocol and centralized path computation for deterministic wireless networks

Publications (2)

Publication Number Publication Date
WO2015048239A2 true WO2015048239A2 (fr) 2015-04-02
WO2015048239A3 WO2015048239A3 (fr) 2015-06-11

Family

ID=51688454

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2014/057381 WO2015048239A2 (fr) 2013-09-26 2014-09-25 Coexistence d'un protocole de routage distribué et d'un calcul de trajets centralisé pour les réseaux sans fil déterministes

Country Status (5)

Country Link
US (1) US9882804B2 (fr)
EP (1) EP3050263B1 (fr)
CN (1) CN105580331B (fr)
CA (1) CA2924210C (fr)
WO (1) WO2015048239A2 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10411990B2 (en) * 2017-12-18 2019-09-10 At&T Intellectual Property I, L.P. Routing stability in hybrid software-defined networking networks

Families Citing this family (102)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9456054B2 (en) 2008-05-16 2016-09-27 Palo Alto Research Center Incorporated Controlling the spread of interests and content in a content centric network
US8923293B2 (en) 2009-10-21 2014-12-30 Palo Alto Research Center Incorporated Adaptive multi-interface use for content networking
US9906439B2 (en) * 2013-11-01 2018-02-27 Futurewei Technologies, Inc. Ad-hoc on-demand routing through central control
US10098051B2 (en) 2014-01-22 2018-10-09 Cisco Technology, Inc. Gateways and routing in software-defined manets
US9954678B2 (en) 2014-02-06 2018-04-24 Cisco Technology, Inc. Content-based transport security
US9836540B2 (en) 2014-03-04 2017-12-05 Cisco Technology, Inc. System and method for direct storage access in a content-centric network
US9626413B2 (en) 2014-03-10 2017-04-18 Cisco Systems, Inc. System and method for ranking content popularity in a content-centric network
US9363179B2 (en) * 2014-03-26 2016-06-07 Palo Alto Research Center Incorporated Multi-publisher routing protocol for named data networks
US9716622B2 (en) 2014-04-01 2017-07-25 Cisco Technology, Inc. System and method for dynamic name configuration in content-centric networks
US9473576B2 (en) 2014-04-07 2016-10-18 Palo Alto Research Center Incorporated Service discovery using collection synchronization with exact names
US9992281B2 (en) 2014-05-01 2018-06-05 Cisco Technology, Inc. Accountable content stores for information centric networks
US9609014B2 (en) 2014-05-22 2017-03-28 Cisco Systems, Inc. Method and apparatus for preventing insertion of malicious content at a named data network router
US9699198B2 (en) 2014-07-07 2017-07-04 Cisco Technology, Inc. System and method for parallel secure content bootstrapping in content-centric networks
US9621354B2 (en) 2014-07-17 2017-04-11 Cisco Systems, Inc. Reconstructable content objects
US9590887B2 (en) 2014-07-18 2017-03-07 Cisco Systems, Inc. Method and system for keeping interest alive in a content centric network
US9729616B2 (en) 2014-07-18 2017-08-08 Cisco Technology, Inc. Reputation-based strategy for forwarding and responding to interests over a content centric network
US9882964B2 (en) 2014-08-08 2018-01-30 Cisco Technology, Inc. Explicit strategy feedback in name-based forwarding
US9729662B2 (en) 2014-08-11 2017-08-08 Cisco Technology, Inc. Probabilistic lazy-forwarding technique without validation in a content centric network
US9800637B2 (en) 2014-08-19 2017-10-24 Cisco Technology, Inc. System and method for all-in-one content stream in content-centric networks
US10069933B2 (en) 2014-10-23 2018-09-04 Cisco Technology, Inc. System and method for creating virtual interfaces based on network characteristics
US10499313B2 (en) * 2014-12-03 2019-12-03 Convida Wireless, Llc Efficient hybrid resource and schedule management in time slotted channel hopping networks
US9590948B2 (en) 2014-12-15 2017-03-07 Cisco Systems, Inc. CCN routing using hardware-assisted hash tables
US10237189B2 (en) 2014-12-16 2019-03-19 Cisco Technology, Inc. System and method for distance-based interest forwarding
US10003520B2 (en) 2014-12-22 2018-06-19 Cisco Technology, Inc. System and method for efficient name-based content routing using link-state information in information-centric networks
US9660825B2 (en) 2014-12-24 2017-05-23 Cisco Technology, Inc. System and method for multi-source multicasting in content-centric networks
US9946743B2 (en) 2015-01-12 2018-04-17 Cisco Technology, Inc. Order encoded manifests in a content centric network
US9832291B2 (en) 2015-01-12 2017-11-28 Cisco Technology, Inc. Auto-configurable transport stack
US9954795B2 (en) 2015-01-12 2018-04-24 Cisco Technology, Inc. Resource allocation using CCN manifests
US9916457B2 (en) 2015-01-12 2018-03-13 Cisco Technology, Inc. Decoupled name security binding for CCN objects
BR112017016467B1 (pt) 2015-02-03 2023-10-03 Telefonaktiebolaget Lm Ericsson (Publ) Métodos de computação de pecurso para uso em uma rede de comunicações, aparelhos para computação de percurso em uma rede de comunicações e meio de armazenamento não transitório legível por máquina
US10333840B2 (en) 2015-02-06 2019-06-25 Cisco Technology, Inc. System and method for on-demand content exchange with adaptive naming in information-centric networks
US10075401B2 (en) 2015-03-18 2018-09-11 Cisco Technology, Inc. Pending interest table behavior
US10075402B2 (en) 2015-06-24 2018-09-11 Cisco Technology, Inc. Flexible command and control in content centric networks
US9967184B2 (en) 2015-07-02 2018-05-08 Telefonaktiebolaget Lm Ericsson (Publ) Using border gateway protocol to expose maximum segment identifier depth to an external application
US10701038B2 (en) 2015-07-27 2020-06-30 Cisco Technology, Inc. Content negotiation in a content centric network
US9986034B2 (en) 2015-08-03 2018-05-29 Cisco Technology, Inc. Transferring state in content centric network stacks
US9832123B2 (en) 2015-09-11 2017-11-28 Cisco Technology, Inc. Network named fragments in a content centric network
US10355999B2 (en) 2015-09-23 2019-07-16 Cisco Technology, Inc. Flow control with network named fragments
US9977809B2 (en) 2015-09-24 2018-05-22 Cisco Technology, Inc. Information and data framework in a content centric network
US10313227B2 (en) 2015-09-24 2019-06-04 Cisco Technology, Inc. System and method for eliminating undetected interest looping in information-centric networks
US10454820B2 (en) 2015-09-29 2019-10-22 Cisco Technology, Inc. System and method for stateless information-centric networking
US10263965B2 (en) 2015-10-16 2019-04-16 Cisco Technology, Inc. Encrypted CCNx
US9794238B2 (en) 2015-10-29 2017-10-17 Cisco Technology, Inc. System for key exchange in a content centric network
US9807205B2 (en) 2015-11-02 2017-10-31 Cisco Technology, Inc. Header compression for CCN messages using dictionary
US9912776B2 (en) 2015-12-02 2018-03-06 Cisco Technology, Inc. Explicit content deletion commands in a content centric network
US10097346B2 (en) 2015-12-09 2018-10-09 Cisco Technology, Inc. Key catalogs in a content centric network
US10078062B2 (en) 2015-12-15 2018-09-18 Palo Alto Research Center Incorporated Device health estimation by combining contextual information with sensor data
US10257271B2 (en) 2016-01-11 2019-04-09 Cisco Technology, Inc. Chandra-Toueg consensus in a content centric network
US9949301B2 (en) 2016-01-20 2018-04-17 Palo Alto Research Center Incorporated Methods for fast, secure and privacy-friendly internet connection discovery in wireless networks
US10305864B2 (en) 2016-01-25 2019-05-28 Cisco Technology, Inc. Method and system for interest encryption in a content centric network
US11038791B2 (en) 2016-02-15 2021-06-15 Telefonaktiebolaget Lm Ericsson (Publ) Techniques for exposing maximum node and/or link segment identifier depth utilizing OSPF
US11005751B2 (en) 2016-02-15 2021-05-11 Telefonaktiebolaget Lm Ericsson (Publ) Techniques for exposing maximum node and/or link segment identifier depth utilizing IS-IS
US10043016B2 (en) 2016-02-29 2018-08-07 Cisco Technology, Inc. Method and system for name encryption agreement in a content centric network
US10003507B2 (en) 2016-03-04 2018-06-19 Cisco Technology, Inc. Transport session state protocol
US10038633B2 (en) 2016-03-04 2018-07-31 Cisco Technology, Inc. Protocol to query for historical network information in a content centric network
US10742596B2 (en) 2016-03-04 2020-08-11 Cisco Technology, Inc. Method and system for reducing a collision probability of hash-based names using a publisher identifier
US10051071B2 (en) 2016-03-04 2018-08-14 Cisco Technology, Inc. Method and system for collecting historical network information in a content centric network
US9832116B2 (en) 2016-03-14 2017-11-28 Cisco Technology, Inc. Adjusting entries in a forwarding information base in a content centric network
US10212196B2 (en) 2016-03-16 2019-02-19 Cisco Technology, Inc. Interface discovery and authentication in a name-based network
US11436656B2 (en) 2016-03-18 2022-09-06 Palo Alto Research Center Incorporated System and method for a real-time egocentric collaborative filter on large datasets
US10067948B2 (en) 2016-03-18 2018-09-04 Cisco Technology, Inc. Data deduping in content centric networking manifests
US10091330B2 (en) 2016-03-23 2018-10-02 Cisco Technology, Inc. Interest scheduling by an information and data framework in a content centric network
US10033639B2 (en) 2016-03-25 2018-07-24 Cisco Technology, Inc. System and method for routing packets in a content centric network using anonymous datagrams
US10320760B2 (en) 2016-04-01 2019-06-11 Cisco Technology, Inc. Method and system for mutating and caching content in a content centric network
US9930146B2 (en) 2016-04-04 2018-03-27 Cisco Technology, Inc. System and method for compressing content centric networking messages
US10425503B2 (en) 2016-04-07 2019-09-24 Cisco Technology, Inc. Shared pending interest table in a content centric network
US10027578B2 (en) 2016-04-11 2018-07-17 Cisco Technology, Inc. Method and system for routable prefix queries in a content centric network
US10404450B2 (en) 2016-05-02 2019-09-03 Cisco Technology, Inc. Schematized access control in a content centric network
US10320675B2 (en) 2016-05-04 2019-06-11 Cisco Technology, Inc. System and method for routing packets in a stateless content centric network
US10547589B2 (en) 2016-05-09 2020-01-28 Cisco Technology, Inc. System for implementing a small computer systems interface protocol over a content centric network
US10063414B2 (en) 2016-05-13 2018-08-28 Cisco Technology, Inc. Updating a transport stack in a content centric network
US10084764B2 (en) 2016-05-13 2018-09-25 Cisco Technology, Inc. System for a secure encryption proxy in a content centric network
US10103989B2 (en) 2016-06-13 2018-10-16 Cisco Technology, Inc. Content object return messages in a content centric network
US10305865B2 (en) 2016-06-21 2019-05-28 Cisco Technology, Inc. Permutation-based content encryption with manifests in a content centric network
US10148572B2 (en) 2016-06-27 2018-12-04 Cisco Technology, Inc. Method and system for interest groups in a content centric network
US10009266B2 (en) 2016-07-05 2018-06-26 Cisco Technology, Inc. Method and system for reference counted pending interest tables in a content centric network
US9992097B2 (en) 2016-07-11 2018-06-05 Cisco Technology, Inc. System and method for piggybacking routing information in interests in a content centric network
US10122624B2 (en) 2016-07-25 2018-11-06 Cisco Technology, Inc. System and method for ephemeral entries in a forwarding information base in a content centric network
US10069729B2 (en) 2016-08-08 2018-09-04 Cisco Technology, Inc. System and method for throttling traffic based on a forwarding information base in a content centric network
US10956412B2 (en) 2016-08-09 2021-03-23 Cisco Technology, Inc. Method and system for conjunctive normal form attribute matching in a content centric network
US10033642B2 (en) 2016-09-19 2018-07-24 Cisco Technology, Inc. System and method for making optimal routing decisions based on device-specific parameters in a content centric network
US10397733B2 (en) * 2016-10-01 2019-08-27 Intel Corporation Sharing of environmental data for client device usage
US10212248B2 (en) 2016-10-03 2019-02-19 Cisco Technology, Inc. Cache management on high availability routers in a content centric network
US10447805B2 (en) 2016-10-10 2019-10-15 Cisco Technology, Inc. Distributed consensus in a content centric network
US10135948B2 (en) 2016-10-31 2018-11-20 Cisco Technology, Inc. System and method for process migration in a content centric network
US10452974B1 (en) * 2016-11-02 2019-10-22 Jasmin Cosic Artificially intelligent systems, devices, and methods for learning and/or using a device's circumstances for autonomous device operation
US10243851B2 (en) 2016-11-21 2019-03-26 Cisco Technology, Inc. System and method for forwarder connection information in a content centric network
US10511544B2 (en) 2016-11-22 2019-12-17 At&T Intellectual Property I, L.P. Path computation element protocol response and simple network management protocol confirmation for tunnel configuration
US10607134B1 (en) 2016-12-19 2020-03-31 Jasmin Cosic Artificially intelligent systems, devices, and methods for learning and/or using an avatar's circumstances for autonomous avatar operation
US10044605B2 (en) * 2016-12-23 2018-08-07 Juniper Networks, Inc. Apparatus, system, and method for distributing routing-protocol information in clos fabrics
CN108055676B (zh) * 2017-11-06 2021-04-13 中通服咨询设计研究院有限公司 基于终端级别和节点数量的4g系统d2d路由选择方法
US10474934B1 (en) 2017-11-26 2019-11-12 Jasmin Cosic Machine learning for computing enabled systems and/or devices
US10623326B2 (en) 2018-03-07 2020-04-14 Cisco Technology, Inc. Jitter compensation along multiple-path deterministic network segment
US10813169B2 (en) 2018-03-22 2020-10-20 GoTenna, Inc. Mesh network deployment kit
US11082324B2 (en) 2018-07-27 2021-08-03 goTenna Inc. Vine: zero-control routing using data packet inspection for wireless mesh networks
EP3651485B1 (fr) 2018-09-17 2021-09-01 Shenzhen Goodix Technology Co., Ltd. Procédé et appareil de mise à niveau en ligne d'une grappe bluetooth
US11949447B2 (en) 2018-11-12 2024-04-02 Analog Devices International Unlimited Company Smart scheduling of TSCH networks to avoid self-interference
CN111263419B (zh) * 2020-01-17 2021-12-28 西安交通大学 基于无人机的应急场景下立体异构网络的动态路由方法
CN113473608B (zh) * 2020-03-31 2022-08-19 北京紫光展锐通信技术有限公司 确定保留时隙的个数的方法、装置、用户设备及存储介质
CN112787924B (zh) * 2020-09-28 2022-02-18 中兴通讯股份有限公司 时隙交叉路径配置方法、计算机设备和可读介质
CN113365227A (zh) * 2021-07-06 2021-09-07 格声智能科技(深圳)有限公司 Wi-sun网络系统、基于wi-sun网络系统的入网方法、装置及设备
CN115765988B (zh) * 2022-10-31 2024-09-20 苏州大学 Qkd光网络中时隙感知的共享路径保护方法及系统

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7366111B2 (en) 2005-04-08 2008-04-29 Cisco Technology, Inc. Arrangement for providing optimized connections between peer routers in a tree-based ad hoc mobile network
US20070153707A1 (en) 2006-01-04 2007-07-05 Pascal Thubert Ad hoc network formation and management based on aggregation of ad hoc nodes according to an aggregation hierarchy
US7701940B2 (en) * 2007-03-09 2010-04-20 Cisco Technology, Inc. Inter-domain point-to-multipoint path computation in a computer network
CN101296178B (zh) * 2007-04-29 2011-09-14 华为技术有限公司 域间流量工程路径计算方法和路径计算装置
US8259635B2 (en) 2008-01-04 2012-09-04 Cisco Technology, Inc. Automatic clustering of wireless network nodes toward selected mesh access points
US8045551B2 (en) * 2008-02-18 2011-10-25 Ciena Corporation Systems and methods for private network-to-network interface out-of-band signaling and path blocking
US7990877B2 (en) * 2008-05-15 2011-08-02 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for dynamically runtime adjustable path computation
KR101613229B1 (ko) * 2008-08-11 2016-04-19 코닌클리케 필립스 엔.브이. 인체 영역 네트워크들에서 글로벌 비콘들의 송신들을 스케줄링하기 위한 방법
US8291112B2 (en) 2008-11-17 2012-10-16 Cisco Technology, Inc. Selective a priori reactive routing
CN101860473B (zh) 2009-04-08 2012-11-07 华为技术有限公司 一种路径计算方法
CN101621721A (zh) * 2009-08-06 2010-01-06 中兴通讯股份有限公司 K优路径的计算方法及装置
WO2011035804A1 (fr) 2009-09-22 2011-03-31 Nokia Siemens Networks Gmbh & Co. Kg Procédé et dispositif de traitement de données dans un réseau
US8489765B2 (en) 2010-03-19 2013-07-16 Cisco Technology, Inc. Dynamic directed acyclic graph (DAG) adjustment
US9166908B2 (en) * 2011-12-20 2015-10-20 Cisco Technology, Inc. Assisted intelligent routing for minimalistic connected object networks
US8630177B2 (en) * 2012-02-27 2014-01-14 Cisco Technology, Inc. Dynamic directed acyclic graph (DAG) root bypass for computer networks
US9344256B2 (en) * 2013-09-18 2016-05-17 Cisco Technology, Inc. Dominating set identification for path computation based on directed acyclic graph membership
US9407559B2 (en) * 2013-09-23 2016-08-02 Mitsubishi Electric Research Laboratories, Inc. Discovering stable routes in wireless networks

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
O. GNAWALI ET AL.: "The Minimum Rank Objective Function with Hysteresis", RFC 6719, September 2012 (2012-09-01)
THUBERT: "RPL Objective Function 0", RFC 6552, March 2012 (2012-03-01)
VASSEUR ET AL.: "Routing Metrics used for Path Calculation in Low Power and Lossy Networks", RFC 6551, March 2012 (2012-03-01)
WINTER ET AL., RPL: IPV6 ROUTING PROTOCOL FOR LOW POWER AND LOSSY NETWORKS, March 2012 (2012-03-01)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10411990B2 (en) * 2017-12-18 2019-09-10 At&T Intellectual Property I, L.P. Routing stability in hybrid software-defined networking networks

Also Published As

Publication number Publication date
EP3050263B1 (fr) 2019-02-20
CN105580331A (zh) 2016-05-11
CA2924210A1 (fr) 2015-04-02
US9882804B2 (en) 2018-01-30
US20150089081A1 (en) 2015-03-26
WO2015048239A3 (fr) 2015-06-11
EP3050263A2 (fr) 2016-08-03
CA2924210C (fr) 2022-08-23
CN105580331B (zh) 2019-07-19

Similar Documents

Publication Publication Date Title
CA2924210C (fr) Coexistence d'un protocole de routage distribue et d'un calcul de trajets centralise pour les reseaux sans fil deterministes
US9515914B2 (en) Path computation element proxying for deterministic wireless networks
US9883507B2 (en) Timeslot distribution in a distributed routing protocol for deterministic wireless networks
EP3022872B1 (fr) Vérification efficace de réseau pour réseaux sans fil déterministes
US9401863B2 (en) Dynamic source route computation to avoid self-interference
US9306841B2 (en) Enabling dynamic routing topologies in support of real-time delay traffic
US10129202B2 (en) Optimizing global IPv6 address assignments
US9553796B2 (en) Cycle-free multi-topology routing
US20130219046A1 (en) Dynamic application-aware routing topologies
EP2915296B1 (fr) Requêtes push de raccourci au sein d'un graphe acyclique orienté
US9628371B2 (en) Controlling routing during scheduled node downtime
US20130028140A1 (en) Using service discovery to build routing topologies
US10904097B2 (en) Concurrent network reformation for low-power and lossy networks
US10693777B2 (en) In-situ operations, administration, and maintenance (iOAM) for software defined architectures (SDAs)
US20190317749A1 (en) Upgrading network firmware
US10917196B2 (en) Efficient transmission of small packets in low power and lossy networks

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 201480053343.2

Country of ref document: CN

ENP Entry into the national phase

Ref document number: 2924210

Country of ref document: CA

REEP Request for entry into the european phase

Ref document number: 2014782037

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2014782037

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE

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

Ref document number: 14782037

Country of ref document: EP

Kind code of ref document: A2