US9906439B2 - Ad-hoc on-demand routing through central control - Google Patents

Ad-hoc on-demand routing through central control Download PDF

Info

Publication number
US9906439B2
US9906439B2 US14/069,699 US201314069699A US9906439B2 US 9906439 B2 US9906439 B2 US 9906439B2 US 201314069699 A US201314069699 A US 201314069699A US 9906439 B2 US9906439 B2 US 9906439B2
Authority
US
United States
Prior art keywords
network
route
routing
response
central controller
Prior art date
Legal status (The legal status 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 status listed.)
Active, expires
Application number
US14/069,699
Other languages
English (en)
Other versions
US20150124625A1 (en
Inventor
Sam K. Aldrin
Charles Perkins
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
FutureWei Technologies Inc
Original Assignee
FutureWei Technologies 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 FutureWei Technologies Inc filed Critical FutureWei Technologies Inc
Priority to US14/069,699 priority Critical patent/US9906439B2/en
Assigned to FUTUREWEI TECHNOLOGIES, INC. reassignment FUTUREWEI TECHNOLOGIES, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ALDRIN, SAM K., PERKINS, CHARLES
Priority to CN201480057340.6A priority patent/CN105659529B/zh
Priority to PCT/CN2014/089513 priority patent/WO2015062452A1/en
Priority to EP14857640.8A priority patent/EP3055950B1/en
Publication of US20150124625A1 publication Critical patent/US20150124625A1/en
Application granted granted Critical
Publication of US9906439B2 publication Critical patent/US9906439B2/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

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/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/02—Topology update or discovery
    • H04L45/10—Routing in connection-oriented networks, e.g. X.25 or ATM
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/16—Flow control; Congestion control in connection oriented networks, e.g. frame relay
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality

Definitions

  • Ad hoc and on-demand routing is an important and critical aspect of networking, whereby network devices need not populate all of the routes and route computation is by way of on-demand requests. It is fundamentally useful as the network elements can be dynamic, mobile and simple.
  • Ad-hoc On-demand Distance Vector Version 2 (AODVv2) routing protocol is one conventional protocol designed for ad hoc mobile networks where the routes are learned by way of on-demand requests and routing tables are populated only when needed. The protocol provides a mechanism and message types to request and respond during route discovery.
  • RREQ route request
  • RREP route reply
  • RERR route error
  • RREQ carries the message to query for a route and is broadcast over the network with a link local multicast address and with a time-to-live field value. e.g., 255.
  • an intermediate router receives the RREQ, it processes that message and, if it is not the owner of destination address, it rebroadcasts the RREQ.
  • RREP is used as a reply from the destination device and is typically sent back to the source device via unicast.
  • an RERR message is sent back to the source.
  • S may or may not have a route for D. If the route is unknown by S for example, S can broadcast a RREQ packet with a link local multicast address. Other network devices that retransmit the request packet from S will at least temporarily maintain a route back to S.
  • D can unicast a RREP packet, back towards S. It can be assumed that each network device receiving the RREP has received the RREQ which triggers the RREP, and so already has a route to S. Given the information included in the RREP, the receiving devices can update or create a route to D by retransmitting the RREP to the next stop along the way to S. If a device receiving the RREP (e.g., for S's discovery of a route to D) doesn't have a route for the source S, it can reply with a RERR message back to the destination D.
  • a device receiving the RREP e.g., for S's discovery of a route to D
  • route maintenance is performed in order to avoid prematurely expunging routes from the routing table and causing interruption to data traffic.
  • an intermediate forwarding device X does not have an active link/route to forward the packet, X also needs to respond back to the source with a RERR message, so that the nodes could re-learn the routes. Receipt of RERR will typically cause the route discovery operation to be initiated by the network element which was unsuccessful in transmitting the packet triggering the RERR message.
  • Each network router maintains a routing table, where the router stores its route entries which may be populated by various IGP and EGP protocols for example.
  • the routing table In fixed networks, where the network is stable and static, the routing table is traditionally huge in size, and requires the node to have a high storage capacity.
  • a network node To reduce size of routing tables and thus increase the mobility of the network, in a conventional AODV model, a network node only keeps active paths in its routing table. However, this leads to a large number of route requests in case of the frequent network changes and disparate traffic, e.g., frequent addition of new network nodes. The broadcast of a large number of route requests tends to aggravate network traffic, increase interference and consume more power, which are highly undesirable.
  • Embodiments of the present disclosure employ a centralized control entity of a network to communicate directly with a route-requesting network device, or a source device, in order to discover a data transmission path and to perform offline route computation in a centralized manner.
  • the centralized control entity, or central controller has access to topology information of the network and thereby can often determine a route for a node comprehensively and efficiently without relying on transmission of messages among intermediate network nodes.
  • a source network device may query the central controller with a unicast route request without triggering a broadcast to the network.
  • the central controller can identify a feasible route linking the source device and the specified destination device based on the topology information of the network, and sends back the route response to the source device.
  • the central controller may also receive a broadcast route request along with other network nodes.
  • the source device can be offered to select from two resultant routes, one computed by the central controller in a centralized manner and another provided by the destination device.
  • the central controller can be used specifically for computation of constrained routes by incorporating global constraints.
  • the central controller may be implemented as software or hardware logic, and physically can be either distributed or centralized in a network.
  • the central controller may be a control manager in a software defined network (SDN).
  • FIG. 1A is a diagram illustrating an exemplary network in which a data transmission path can be determined by a central controller in response to a unicast route request in accordance with an embodiment of the present disclosure.
  • FIG. 1B is a flow chart depicting an exemplary process for a network node to discover a route in an ad hoc on-demand network by sending a unicast route request to a central controller in accordance with an embodiment of the present disclosure.
  • FIG. 2A is a diagram illustrating an exemplary network in which a data transmission path can be determined by a central controller in response to a broadcast route request in accordance with an embodiment of the present disclosure.
  • FIG. 2B is a flow chart depicting an exemplary process for a network node to discover a route in an ad hoc on-demand network by broadcasting a route request to a central controller and the other network nodes in accordance with an embodiment of the present disclosure.
  • FIG. 3A is a diagram illustrating an exemplary network in which a data transmission path that satisfies route constraints can be determined by a central controller in accordance with an embodiment of the present disclosure.
  • FIG. 3B is a flow chart depicting an exemplary process for a network node to discover a route with constraints in an ad hoc on-demand network by unicasting a special route request to a central controller with an embodiment of the present disclosure.
  • FIG. 5 is a block diagram illustrating an exemplary configuration of a central controller capable of performing on-demand routing in an ad hoc network in accordance with an embodiment of the present disclosure.
  • Embodiments of the present disclosure pertain to systems and methods of ad hoc on-demand routing by use of a central controller of a network to determine efficient data transmission routes while reduce communication traffic during route discovery processes.
  • a central controller can communicate directly with a route-requesting network device regarding discovery of a data transmission path and perform route computation.
  • a source device may query the central controller with a unicast route request.
  • the central controller can identify a feasible route comprehensively and efficiently based on the topology information of the network without relying on transmission of messages among intermediate network nodes.
  • the central controller may also receive a broadcast route request as long with other network nodes.
  • the source device can be offered to select from two resultant routes, one provided by the central controller in a centralized manner and the other provided by the destination device.
  • the central controller can be used specifically for computation of constrained routes by incorporating global constraints.
  • the central controller may be a software defined network (SDN) controller.
  • SDN software defined network
  • FIG. 1A is a diagram illustrating an exemplary network 100 in which a data transmission path can be determined by a central controller in response to a unicast route request in accordance with an embodiment of the present disclosure.
  • the network 100 is in a simplified form and includes a central controller 110 and a plurality of network nodes, e.g., R 1 , R 2 , R 3 , R 4 and R 5 .
  • the central controller 110 is connected to all the network nodes R 1 -R 5 and has the access to the topology information of the network which can be used to determine a transmission path, e.g., between a pair of network nodes.
  • a route-requesting device or a source device, e.g., R 5
  • R 5 can send a route request, e.g., for a data transmission route between R 5 and R 4 , directly to the central controller by virtue of unicast and thus without triggering a broadcast to all network nodes, advantageously reducing the frequency of request and response message transmission among the network 100 .
  • the central controller can identify the network elements R 4 , and R 5 and their location in the network, and compute a suitable route for data transmission.
  • the route computation is performed in a centralized and offline manner at the central controller, which advantageously eliminates the need for engaging other network devices to retransmit the route request, and thereby reduces the communication traffic during the computation process. Further, with the capability of utilizing the topology information comprehensively for route computation, the central controller can effectively yield a superior route.
  • the identified route can then communicated to R 5 through a unicast route response. Accordingly, R 5 can update its routing table to transmit a data packet.
  • the requesting device R 5 may be a newly added network element to the network 100 for example, and can be configured by the central controller 110 with respect to various network element properties and setups.
  • the present disclosure is not limited to any specific mechanism that can be used by the central controller to configure and communicate with a network element.
  • the OpenFlow methodology can be used.
  • a route table may include various attributes that are well known in the art, such as route address, route prefix, next stop address, next hop interface, expiration time, route metric/cost, and/or state of route.
  • the route messages e.g., route request (RREQ), route response (RREP), route error (RERR), in accordance with the present disclosure may be in any suitable format and communicated between a central controller and a network device in any suitable means.
  • the communication between the central controller and a network device is compliant with the OpenFlow protocol.
  • Table 1 provides an exemplary route table format that can be used by a network device to transmit data in accordance with an embodiment of the present disclosure.
  • a route table associated with a source device can be programmed, configured and/or updated according to communication between the source device and the central controller.
  • topology information referred herein can include physical and/or logical topology information, such as the placement of the network's various components. e.g., device location and cable installation, logical connections among the elements within a network, distances between nodes, physical interconnections, transmission rates, and/or signal types, etc.
  • the central controller 110 may compute and identify a route in accordance with any routing algorithm that is well known in the art, such as adaptive routing, deflection routing, edge disjoint shortest pair algorithm, Dijkstra's algorithm, fuzzy routing, geographic routing, Heuristic routing, hierarchical routing, IP forwarding algorithm, etc.
  • routing algorithm such as adaptive routing, deflection routing, edge disjoint shortest pair algorithm, Dijkstra's algorithm, fuzzy routing, geographic routing, Heuristic routing, hierarchical routing, IP forwarding algorithm, etc.
  • An SDN in which a path can be discovered on an ad hoc on-demand basis may be structured in accordance with any suitable SDN architecture model that is well known in the art, e.g., a centralized SDN model, a distributed SDN model, or a hybrid SDN model.
  • a centralized manager with a single controller can communicate with distributed data planes.
  • a centralized manger interface can communicates with combined distributed controller and data planes.
  • a centralized manager communicates with separate distributed controller and data planes.
  • the central controller capable of determining a route may be the centralized manager, or SDN controller, in any of the foregoing network models.
  • the central controller in accordance with the present disclosure can implemented as a software program in the control plane of the SDN.
  • the central controller may be implemented as hardware logic, or a combination of hardware and software in the control plane.
  • the central controller may be a logically centralized entity but physically distributed among multiple components in the network.
  • the network devices, or nodes may include routers, switches, or any devices that act as routers or switches, e.g., servers, desktops, mobile computing devices, etc.
  • FIG. 1B is a flow chart depicting an exemplary process 150 for a network node to discover a route in an ad hoc on-demand network by sending a unicast route request to a central controller in accordance with an embodiment of the present disclosure.
  • the process 150 may be implemented as a software program, hardware logic, or a combination thereof, in a network device, e.g., a router.
  • a source node decides to forward a data packet at 151 , it first determines at 152 whether there is a route to the desired destination node currently known or available.
  • the source node may be a device that joins the network as a new or temporary element and thus has no information as to a viable route to send a data packet.
  • the packet can be transmitted accordingly at 157 . If it is determined that a route is not available, the source node can generate a route request message (RREQ) and send it to the central controller via unicast.
  • RREQ route request message
  • the route request message may be in the similar format as the RREQ used in a conventional AODV model.
  • the route request message is to be processed by a central controller which can identify a feasible route between the source and destination nodes, as described with reference to FIG. 1A .
  • a route response message (RREP) is received at the source device, as determined at 154 , the route information provided in the response is used to update the route table at 155 so that the incoming data packet can be transmitted between the source and the destination node in the identified route at 157 .
  • a route response message is not received by the source node within a predetermined interval, and if timeout occurs at 156 , a failure code can be returned. However, if timeout has not occurred at 156 , a retry counter RETRIES can be incremented by 1 at 158 and then compared with the predetermined maximum number of retries MAX_RREQ_RETRIES at 159 .
  • FIG. 2A is a diagram illustrating an exemplary network in which a data transmission path can be determined by a central controller in response to a broadcast route request in accordance with an embodiment of the present disclosure.
  • the network 200 may have a similar composition and configuration as network 100 in FIG. 1 .
  • the source node R 5 broadcasts a route request message to the network 200 with link local multicast address.
  • the route request is delivered to the other network nodes, e.g., R 1 -R 4 , as well as the central controller 210 .
  • a feasible route can discovered in accordance with a conventional AODV model.
  • the destination node e.g., R 4
  • R 4 can unicast a response packet back to the node R 5 with the recorded node.
  • the process of route request propagation, route recoding and route maintenance can be similar as in the AODV model.
  • the central controller 210 can determine another route in a centralized manner, as described in greater detail with reference to FIG. 1A , and unicast a response message to R 5 with the route. If the two routes provided from R 4 and the central controller are different, R 5 can select a route from the two options and program the route table accordingly for following data transmission.
  • FIG. 2B is a flow chart depicting an exemplary process for a network node to discover a route in an ad hoc on-demand network by broadcasting a route request to a central controller and the other network nodes in accordance with an embodiment of the present disclosure.
  • the process 250 may be implemented as a software program, hardware logic, or a combination thereof, in a network device, e.g., a router.
  • a source node decides to forward a data packet at 251 , it first determines at 252 whether there is a route to the desired destination node currently available or known to the source node.
  • the source node can generate a route request message and broadcast it to the network at 253 .
  • the route request message may be in the similar format as the RREQ used in a conventional AODV model.
  • the route request message is to be processed by a central controller as well as other devices receiving the broadcast request.
  • Two feasible routes linking the source and the destination nodes can be identified and provided by the destination node and the central controller in respective mechanisms, as described above with reference to FIG. 2A .
  • the source device can select a route in accordance with any suitable criteria at 255 and program the route table accordingly at 256 . If a route response message is not received by the source node within a predetermined interval, time out occurs at 257 and the foregoing 252 - 254 can be repeated.
  • routing can be subject to a set of constraints with respect to at least one of Quality of Service (QoS), priority, policy, price, and etc.
  • QoS Quality of Service
  • the central controller can be utilized for constraint-based path computation based on any suitable algorithm that is well known in the art, for example upon receiving a route request message that specifies routing constraints.
  • the central controller in accordance with the present disclosure has access to comprehensive information of the overall network, it can take into consideration of global constrains for route computation which can be performed along the lines of path computation elements (PCE).
  • PCE path computation elements
  • FIG. 3A is a diagram illustrating an exemplary network 300 in which a data transmission path that satisfies route constraints can be determined by a central controller in accordance with an embodiment of the present disclosure.
  • the network 300 may have a similar composition and configuration as network 100 in FIG. 1A .
  • a source device e.g., a newly joined device
  • R 5 may also send constraints like bandwidth for certain time period, and etc.
  • the controller When the controller receives this request, it computes the route from R 5 to R 4 and sends out a unicast route response to R 5 .
  • R 5 can then update the route if the route determined by the central controller is different from a route determined by R 4 based on a conventional AODV model.
  • FIG. 3B is a flow chart depicting an exemplary process 350 for a network node to discover a route with constraints in an ad hoc on-demand network by unicasting a special route request to a central controller with an embodiment of the present disclosure.
  • the process 350 may be implemented as a software program, hardware logic, or a combination thereof, in a network device, e.g., a router.
  • a source node when a source node decides to forward a data packet to a destination node at 351 , it first determines at 352 whether there is a route to the desired destination node currently known or available to the source node.
  • the source node can generate a route request message and broadcast it to the network at 353 .
  • the route request message may be in the similar format as the RREQ used in a conventional AODV model.
  • the route request message propagated through the other network devices and a route can be discovered in accordance with a conventional AODV model.
  • the source can also unicast a request to the central controller with constraints for the route at 354 .
  • the central controller can identify the source node and its location in the network, perform constrained route computation, and send back a route response to the source with the identified route with constraints.
  • the source device can update the route table accordingly at 356 . If a route response message is not received by the source node within a predetermined interval, time out occurs at 357 and the foregoing 352 - 355 can be repeated.
  • FIG. 4 is a block diagram illustrating an exemplary architecture of an SDN 400 in which a central controller can be used for offline route determination in an ad hoc on-demand network in accordance with an embodiment of the present disclosure.
  • the SDN 400 includes three logic layers, the application layer 410 , the control layer 420 , and the infrastructure layer 430 , with the control layer 420 acting as the interface between the application layer 410 and the infrastructure layer 430 .
  • the infrastructure layer 430 includes the network hardware devices 431 - 435 coupled in the network, e.g., SDN switches or SDN routers.
  • the control layer 420 or the SDN controller, can offer proprietary programming interfaces to network devices and management.
  • the control layer 420 may include one or more control software programs, e.g., 421 - 423 , wherein one control manager program 421 , when executed by a processing unit, can perform the central controller function as discussed with reference to FIGS. 1A, 1B, 2A, 2B, 3A, and 3B .
  • the control layer 420 may communicate with the network devices in the OpenFlow protocol.
  • the application layer 410 may include application programs 411 - 413 and can deliver network functions or services in software on a virtual machine or only creating an overly network.
  • the application programs 411 - 413 can be related to virtual cloud, load balancing, business applications, network security, burst transmission, to name a few.
  • the application layer 410 may communicate with the control layer application program interfaces 414 - 416 corresponding to respective application programs 411 - 413 .
  • FIG. 5 is a block diagram illustrating an exemplary configuration of a central controller 500 capable of performing on-demand routing in an ad hoc network in accordance with an embodiment of the present disclosure.
  • Different components illustrated in the central controller 500 may be implemented as software programs, hardware logic, or a combination thereof.
  • the central controller may be a control manager in a control layer of a SDN, as illustrated in FIG. 4 .
  • the central controller 500 includes an input interface 510 , a route computation module 520 , a message generation module 530 , an output interface 540 , a storage module 550 and a network circuit 560 .
  • the input interface can operate to receive route requests from a network device within the network.
  • the route computation module 520 is configured to determine transmission paths, e.g., based on topology information of the network, in accordance with any suitable algorithm or routing model.
  • the message generation module 530 can generate a route response that identifies the computed route in accordance with any suitable format recognizable by the pertinent network devices.
  • the output interface 540 is configured to send the route response to a network device.
  • the storage module 550 may store the topology information of the network that can be used for route computation.
  • the network circuit 560 can render a network connection between the controller and the network devices in the network.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
US14/069,699 2013-11-01 2013-11-01 Ad-hoc on-demand routing through central control Active 2034-02-20 US9906439B2 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
US14/069,699 US9906439B2 (en) 2013-11-01 2013-11-01 Ad-hoc on-demand routing through central control
CN201480057340.6A CN105659529B (zh) 2013-11-01 2014-10-25 通过中央控制的ad-hoc按需路由
PCT/CN2014/089513 WO2015062452A1 (en) 2013-11-01 2014-10-25 Ad-hoc on-demand routing through central control
EP14857640.8A EP3055950B1 (en) 2013-11-01 2014-10-25 Ad-hoc on-demand routing through central control

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US14/069,699 US9906439B2 (en) 2013-11-01 2013-11-01 Ad-hoc on-demand routing through central control

Publications (2)

Publication Number Publication Date
US20150124625A1 US20150124625A1 (en) 2015-05-07
US9906439B2 true US9906439B2 (en) 2018-02-27

Family

ID=53003330

Family Applications (1)

Application Number Title Priority Date Filing Date
US14/069,699 Active 2034-02-20 US9906439B2 (en) 2013-11-01 2013-11-01 Ad-hoc on-demand routing through central control

Country Status (4)

Country Link
US (1) US9906439B2 (zh)
EP (1) EP3055950B1 (zh)
CN (1) CN105659529B (zh)
WO (1) WO2015062452A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170324584A1 (en) * 2014-10-31 2017-11-09 Hangzhou H3C Technologies Co., Ltd. Forwarding Path Link Table Packet In Software Defined Network
US10411990B2 (en) * 2017-12-18 2019-09-10 At&T Intellectual Property I, L.P. Routing stability in hybrid software-defined networking networks
US11811642B2 (en) 2018-07-27 2023-11-07 GoTenna, Inc. Vine™: zero-control routing using data packet inspection for wireless mesh networks

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108183861B (zh) * 2013-10-26 2021-09-07 华为技术有限公司 Sdn交换机获取精确流表项方法及sdn交换机、控制器、系统
US9602394B2 (en) * 2014-03-20 2017-03-21 Texas Instruments Incorporated Routing frame propagation in power line networks
US9838271B2 (en) 2015-05-07 2017-12-05 Ciena Corporation Network service pricing and resource management in a software defined networking environment
WO2016184531A1 (en) * 2015-05-19 2016-11-24 Telefonaktiebolaget Lm Ericsson (Publ) Connectivity management mechanism for multi-hop capillary networks
EP3381140B1 (en) 2015-11-26 2020-04-08 Signify Holding B.V. Dynamical light channel assignment
US10111127B2 (en) 2016-02-26 2018-10-23 At&T Intellectual Property I, L.P. Enhanced software-defined network controller to support ad-hoc radio access networks
US10080224B2 (en) * 2016-02-29 2018-09-18 Cisco Technology, Inc. Insertion slots along deterministic track for movable network device in a deterministic network
US10360514B2 (en) 2016-03-03 2019-07-23 At&T Intellectual Property I, L.P. Method and system to dynamically enable SDN network learning capability in a user-defined cloud network
EP3607777A1 (en) * 2017-04-07 2020-02-12 Nokia of America Corporation Ad hoc service switch-based control of ad hoc networking
US11165697B2 (en) 2018-11-16 2021-11-02 Juniper Networks, Inc. Network controller subclusters for distributed compute deployments
US20230074222A1 (en) * 2021-09-03 2023-03-09 Cisco Technology, Inc. Techniques for allowing software defined (sd) network fabrics to accept network devices from other fabric technologies

Citations (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040228323A1 (en) * 2003-05-15 2004-11-18 Swarup Acharya Route precomputation method and apparatus for bandwidth guaranteed traffic
US20050157661A1 (en) * 2004-01-20 2005-07-21 Lg Electronics Inc. Mobile ad hoc network system and operating method thereof
US20060002368A1 (en) * 2004-07-01 2006-01-05 Honeywell International Inc. Latency controlled redundant routing
US20060007882A1 (en) * 2004-07-07 2006-01-12 Meshnetworks, Inc. System and method for selecting stable routes in wireless networks
US20060040670A1 (en) * 2002-09-13 2006-02-23 Hui Li Method for routing a connection from a first mobile station to a second mobile station, wireless communication system, central routing device, and mobile station
US7047316B2 (en) * 2000-03-24 2006-05-16 Nec Corporation Link state routing techniques
CN1910857A (zh) 2004-01-20 2007-02-07 Lg电子株式会社 移动自组织网络系统及其工作方法
US20070111732A1 (en) * 2003-10-31 2007-05-17 Siemens Aktiengesellschaft Method for determining a routing in an ad-hoc radio communications system
US20070110024A1 (en) * 2005-11-14 2007-05-17 Cisco Technology, Inc. System and method for spanning tree cross routes
US20070211786A1 (en) * 1998-02-12 2007-09-13 Steve Shattil Multicarrier Sub-Layer for Direct Sequence Channel and Multiple-Access Coding
US20080084856A1 (en) * 2006-10-06 2008-04-10 Motorola, Inc. System and method to facilitate path selection in a multihop network
US20080151811A1 (en) * 2006-12-20 2008-06-26 Hersham El-Damhougy Interplanetary communications network, interplanetary communications network backbone and method of managing interplanetary communications network
US20080304485A1 (en) * 2007-06-06 2008-12-11 Santanu Sinha Centrally controlled routing with tagged packet forwarding in a wireless mesh network
US20080317047A1 (en) * 2007-06-20 2008-12-25 Motorola, Inc. Method for discovering a route to a peer node in a multi-hop wireless mesh network
US20090129376A1 (en) * 2006-09-15 2009-05-21 S&C Electric Co. Power distribution system communication system and method
CN101772122A (zh) 2008-12-26 2010-07-07 中国移动通信集团公司 移动终端自组织网络建立方法及设备
US20100322141A1 (en) * 2008-03-11 2010-12-23 Hang Liu Joint association, routing and rate allocation in wireless multi-hop mesh networks
US20110286418A1 (en) * 2009-02-03 2011-11-24 Hang Liu Method and apparatus for dynamic channel assignment and stream control in multi-hop wireless networks
CN102550118A (zh) 2009-08-31 2012-07-04 富士通株式会社 收集节点关联信息的系统、节点装置及帧处理方法
US20120195431A1 (en) * 2009-10-14 2012-08-02 Koninklijke Philips Electronics N.V. Method for operating a node in a wireless sensor network
US20130013125A1 (en) * 2011-07-07 2013-01-10 Cellnet Innovations, Inc. Methods and systems for determining an association between nodes and phases via a smart grid
US20130028091A1 (en) 2011-07-27 2013-01-31 Nec Corporation System for controlling switch devices, and device and method for controlling system configuration
US20130094398A1 (en) * 2011-09-10 2013-04-18 Arnab Das Methods systems, and devices for robustness improvement in a mobile ad hoc network using reputation-based routing
US20130250809A1 (en) * 2012-03-23 2013-09-26 Cisco Technology, Inc. Region-based route discovery in reactive routing networks
US20140023074A1 (en) * 2012-07-17 2014-01-23 Cisco Technology, Inc. System and method for layer-2 network routing
US20140086080A1 (en) * 2012-09-26 2014-03-27 Telefonaktiebolaget L M Ericsson (Publ) Metric computation for interference-aware routing
US20140126410A1 (en) * 2012-09-25 2014-05-08 Parallel Wireless Inc. Heterogeneous Self-Organizing Network for Access and Backhaul
US20140376530A1 (en) * 2013-06-25 2014-12-25 Nest Labs, Inc. EFFICIENT NETWORK LAYER FOR IPv6 PROTOCOL
US20150046074A1 (en) * 2012-03-28 2015-02-12 Koninklijke Philips N.V. System and method for traffic management using lighting networks
US20150055506A1 (en) * 2013-08-23 2015-02-26 Airties Kablosuz Iletisim San. Ve Dis Tic. A.S. Hybrid mesh network
US20150063112A1 (en) * 2013-08-30 2015-03-05 Futurewei Technologies Inc. Dynamic priority queue mapping for qos routing in software defined networks
US20150089081A1 (en) * 2013-09-26 2015-03-26 Cisco Technology, Inc. Co-existence of a distributed routing protocol and centralized path computation for deterministic wireless networks
US20150117451A1 (en) * 2013-10-30 2015-04-30 International Business Machines Corporation Communication between hetrogenous networks

Patent Citations (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070211786A1 (en) * 1998-02-12 2007-09-13 Steve Shattil Multicarrier Sub-Layer for Direct Sequence Channel and Multiple-Access Coding
US7047316B2 (en) * 2000-03-24 2006-05-16 Nec Corporation Link state routing techniques
US20060040670A1 (en) * 2002-09-13 2006-02-23 Hui Li Method for routing a connection from a first mobile station to a second mobile station, wireless communication system, central routing device, and mobile station
US20040228323A1 (en) * 2003-05-15 2004-11-18 Swarup Acharya Route precomputation method and apparatus for bandwidth guaranteed traffic
US20070111732A1 (en) * 2003-10-31 2007-05-17 Siemens Aktiengesellschaft Method for determining a routing in an ad-hoc radio communications system
CN1910857A (zh) 2004-01-20 2007-02-07 Lg电子株式会社 移动自组织网络系统及其工作方法
US20050157661A1 (en) * 2004-01-20 2005-07-21 Lg Electronics Inc. Mobile ad hoc network system and operating method thereof
US20060002368A1 (en) * 2004-07-01 2006-01-05 Honeywell International Inc. Latency controlled redundant routing
US20060007882A1 (en) * 2004-07-07 2006-01-12 Meshnetworks, Inc. System and method for selecting stable routes in wireless networks
US20070110024A1 (en) * 2005-11-14 2007-05-17 Cisco Technology, Inc. System and method for spanning tree cross routes
US20090129376A1 (en) * 2006-09-15 2009-05-21 S&C Electric Co. Power distribution system communication system and method
US20080084856A1 (en) * 2006-10-06 2008-04-10 Motorola, Inc. System and method to facilitate path selection in a multihop network
US20080151811A1 (en) * 2006-12-20 2008-06-26 Hersham El-Damhougy Interplanetary communications network, interplanetary communications network backbone and method of managing interplanetary communications network
US20080304485A1 (en) * 2007-06-06 2008-12-11 Santanu Sinha Centrally controlled routing with tagged packet forwarding in a wireless mesh network
US20080317047A1 (en) * 2007-06-20 2008-12-25 Motorola, Inc. Method for discovering a route to a peer node in a multi-hop wireless mesh network
US20100322141A1 (en) * 2008-03-11 2010-12-23 Hang Liu Joint association, routing and rate allocation in wireless multi-hop mesh networks
CN101772122A (zh) 2008-12-26 2010-07-07 中国移动通信集团公司 移动终端自组织网络建立方法及设备
US20110286418A1 (en) * 2009-02-03 2011-11-24 Hang Liu Method and apparatus for dynamic channel assignment and stream control in multi-hop wireless networks
CN102550118A (zh) 2009-08-31 2012-07-04 富士通株式会社 收集节点关联信息的系统、节点装置及帧处理方法
US20120195431A1 (en) * 2009-10-14 2012-08-02 Koninklijke Philips Electronics N.V. Method for operating a node in a wireless sensor network
US20130013125A1 (en) * 2011-07-07 2013-01-10 Cellnet Innovations, Inc. Methods and systems for determining an association between nodes and phases via a smart grid
US20130028091A1 (en) 2011-07-27 2013-01-31 Nec Corporation System for controlling switch devices, and device and method for controlling system configuration
US20130094398A1 (en) * 2011-09-10 2013-04-18 Arnab Das Methods systems, and devices for robustness improvement in a mobile ad hoc network using reputation-based routing
US20130250809A1 (en) * 2012-03-23 2013-09-26 Cisco Technology, Inc. Region-based route discovery in reactive routing networks
US20150046074A1 (en) * 2012-03-28 2015-02-12 Koninklijke Philips N.V. System and method for traffic management using lighting networks
US20140023074A1 (en) * 2012-07-17 2014-01-23 Cisco Technology, Inc. System and method for layer-2 network routing
US20140126410A1 (en) * 2012-09-25 2014-05-08 Parallel Wireless Inc. Heterogeneous Self-Organizing Network for Access and Backhaul
US20140086080A1 (en) * 2012-09-26 2014-03-27 Telefonaktiebolaget L M Ericsson (Publ) Metric computation for interference-aware routing
US20140376530A1 (en) * 2013-06-25 2014-12-25 Nest Labs, Inc. EFFICIENT NETWORK LAYER FOR IPv6 PROTOCOL
US20150055506A1 (en) * 2013-08-23 2015-02-26 Airties Kablosuz Iletisim San. Ve Dis Tic. A.S. Hybrid mesh network
US20150063112A1 (en) * 2013-08-30 2015-03-05 Futurewei Technologies Inc. Dynamic priority queue mapping for qos routing in software defined networks
US20150089081A1 (en) * 2013-09-26 2015-03-26 Cisco Technology, Inc. Co-existence of a distributed routing protocol and centralized path computation for deterministic wireless networks
US20150117451A1 (en) * 2013-10-30 2015-04-30 International Business Machines Corporation Communication between hetrogenous networks

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
"Dynamic MANET On-Demand (AODVv2) Routing draft-ietf-manet-aodvv2-00" C, Perkins, et al. Mobile Ad hoc Networks Working Group Internet-Draft Intended State: Standards Track Expires: Sep. 13, 2013 pp. 1-60.
"Generalized Mobile Ad Hoc Network (MANET) Packet/Messaeg Format" Clausen, et al. Network Working Group Request for Comments: 5444 Category: Standard Track, pp. 1-60.
IETF RFC3561, Jul. 2003. *
Perkins, Charles; Royer, Elizabeth; Ad-hoc On-Demand Distance Vector Routing. *
Search Report dated Aug. 12, 2016 in European Patent Application No. 14857640.8, 8 pages.
Vaios, Athanasios; Oikonomou, Konstantinos; Pellati, Pietro; Simoens, Sebastien; and Stavrakakis, Ioannis; A Dual-Band HiperLAN/2-based Architecture for Indoor Hotspot Applications (2004). *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170324584A1 (en) * 2014-10-31 2017-11-09 Hangzhou H3C Technologies Co., Ltd. Forwarding Path Link Table Packet In Software Defined Network
US10887132B2 (en) * 2014-10-31 2021-01-05 Hewlett Packard Enterprise Development Lp Forwarding path link table packet in software defined network
US10411990B2 (en) * 2017-12-18 2019-09-10 At&T Intellectual Property I, L.P. Routing stability in hybrid software-defined networking networks
US11811642B2 (en) 2018-07-27 2023-11-07 GoTenna, Inc. Vine™: zero-control routing using data packet inspection for wireless mesh networks

Also Published As

Publication number Publication date
US20150124625A1 (en) 2015-05-07
CN105659529A (zh) 2016-06-08
WO2015062452A1 (en) 2015-05-07
EP3055950A1 (en) 2016-08-17
EP3055950A4 (en) 2016-09-14
CN105659529B (zh) 2019-08-16
EP3055950B1 (en) 2018-01-03

Similar Documents

Publication Publication Date Title
US9906439B2 (en) Ad-hoc on-demand routing through central control
US11411853B2 (en) Link-state advertisement LSA sending method, apparatus, and system
US10097469B2 (en) Network traffic shaping for low power and lossy networks
US8064416B2 (en) Route selection in wireless networks
US9154407B2 (en) Maintained message delivery during routing domain migration
US9325626B2 (en) Method and apparatus to reduce cumulative effect of dynamic metric advertisement in smart grid/sensor networks
US8392541B2 (en) Distributed control technique for RPL topology
US8291112B2 (en) Selective a priori reactive routing
US10931530B1 (en) Managing routing resources of a network
US8717943B2 (en) Peer-to-peer communications in AMI with source-tree routing
US11095553B2 (en) Method, apparatus and system for controlling routing information advertising
Abane et al. A lightweight forwarding strategy for named data networking in low-end IoT
US20040233847A1 (en) Routing system for establishing optimal route in wireless personal area network (WPAN) and method thereof
US20190273633A1 (en) Link state packet transmission method and routing node
US8238314B2 (en) Method and apparatus for providing a distributed forwarding plane for a mobility home agent
US6615273B1 (en) Method for performing enhanced target identifier (TID) address resolution
WO2023173989A1 (zh) 转发表的生成方法及装置、存储介质、电子装置
US20230261982A1 (en) Node configuration method, controller, and node
CA2817659C (en) Route selection in wireless networks
CA2896911C (en) Route selection in wireless networks
Farooq Binary State Distance Vector Routing: A Protocol for Near-unicast Forwarding in Partitioned Networks
Culler et al. HYDRO: A hybrid routing protocol for lossy and low power networks draft-tavakoli-hydro-01

Legal Events

Date Code Title Description
AS Assignment

Owner name: FUTUREWEI TECHNOLOGIES, INC., TEXAS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ALDRIN, SAM K.;PERKINS, CHARLES;REEL/FRAME:031528/0725

Effective date: 20131031

STCF Information on status: patent grant

Free format text: PATENTED CASE

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 4