Network equipment layout method and device, equipment and storage medium

The invention provides a network equipment layout method and device, equipment and a storage medium, and relates to the technical field of computers. A first initial terminal and a first receiving terminal for transmitting first network traffic are determined, and then a forwarding node located between the first initial terminal and the first receiving terminal and used for forwarding the first network traffic is determined based on the determined first initial terminal and the first receiving terminal. The first shortest path for transmitting the first network flow is determined based on the shortest path routing algorithm, the first initial terminal, the first receiving terminal and the forwarding node, and the shortest path for transmitting the network flow is determined, so that the transmission rate of the network flow can be accelerated, and the transmission quality of the network flow is improved.

Methods, systems, and computer readable media for locality-based selection and routing of traffic to producer network functions (NFs)

A method for locality-based selection and routing of network traffic to producer network functions (NFs) includes registering, by producer NFs, locality information with a network function registration function (NRF). The method further includes configuring, for each of a plurality of consumer NFs, locality preference rules. The method further includes detecting, by one of the consumer NFs, a need for a service provided by a plurality of different producer NFs, at least some of which are located in data centers with different localities. The method further includes selecting, by or on behalf of the one consumer NF and using the locality information registered for the producer NFs and the locality preference rules, a producer NF for providing the service to the one consumer NF.

MULTICAST FAST FAILOVER TURNAROUND OVERLAP HANDLING

Devices, systems, methods, and techniques for multicast failover handling in a computer communication network are disclosed. The methods herein described are particularly suited to software-defined networks (SDNs), and comply with requirements for assuring delivery of network traffic to each destination from a source engaged in multicast network traffic dissemination, assured delivery of each data packet as introduced into the network by the source device and avoidance of duplicate delivery of data. The methods herein are agile and respond rapidly to changes in a network while traffic is on the network.

METHOD AND SYSTEM OF RESILIENCY IN CLOUD-DELIVERED SD-WAN

In one aspect, a computerized method includes the step of providing process monitor in a Gateway. The method includes the step of, with the process monitor, launching a Gateway Daemon (GWD). The GWD runs a GWD process that implements a Network Address Translation (NAT) process. The NAT process includes receiving a set of data packets from one or more Edge devices and forwarding the set of data packets to a public Internet. The method includes the step of receiving another set of data packets from the public Internet and forwarding the other set of data packets to the one or more Edge devices. The method includes the step of launching a Network Address Translation daemon (NATD). The method includes the step of detecting that the GWD process is interrupted; moving the NAT process to the NATD.

Link-state advertisement LSA sending method, apparatus, and system

This application discloses a link-state advertisement LSA sending method, an apparatus, and a system, to reduce a quantity of LSA sending times. The method includes: generating, by a first router, a first path table based on level location information of the first router, level location information of a second router, and level location information of at least one third router; sending, by the first router, a first link state update LSU message to the second router; receiving, by the second router, the first link state update LSU message from the first router; updating, by the second router, a link state database LSDB of the second router based on a first LSA; and sending, by the second router, the first LSA to a router corresponding to an identifier in the first path table.

METHOD AND SYSTEM TO REDUCE A NUMBER OF BORDER GATEWAY PROTOCOL NEIGHBORS CROSSED TO REACH TARGET AUTONOMOUS SYSTEMS

Route processing method and system and nonvolatile storage medium

The invention discloses a route processing method and system and a nonvolatile storage medium. The method comprises the steps that a source node sending a transaction request and a destination node to respond to the transaction request are determined, the source node and the destination node are nodes in a PCN network, and any two connected nodes in a plurality of nodes included in the PCN network are respectively provided with a trusteeship amount corresponding to the other connected node; determining at least one candidate node which mutually knows the trusteeship amount with the source node; determining a next node of the source node based on the trusteeship amount of the source node and the trusteeship amount corresponding to the at least one candidate node; and sequentially determining subsequent nodes by adopting a method for determining a next node of the source node until the next node of the determined node is a destination node, and obtaining a routing path from the source node ...

SDN (Software Defined Network) routing optimization method based on digital twinning

The invention provides an SDN (Software Defined Network) routing optimization method based on digital twinning, which comprises a physical space and a virtual space, and is characterized in that a data plane formed by a host and a switch of an SDN and a control plane formed by a controller exist in the physical space; the digital twinning constructed by using the host, the switch and the link information in the data plane exists in the virtual space; in a physical space, a control plane is responsible for completing network flow forwarding control, a controller constructs an agent for executing a DT-DRL routing algorithm, the agent is recorded as a DRL-Agent, and the DRL-Agent plans a proper forwarding path for each piece of network flow based on a routing algorithm calculation model and network state information provided by digital twinning. According to the invention, through digital twinborn sensing, network environment data analysis and routing algorithm optimization, multi-dimensional ...

MULTI-LEVEL CONSTRAINED COMMUNICATION SYSTEM

A constrained communication system may receive from a first user a plurality of constraints for a first constrained communication. A first constrained communication record is created based on the plurality of constraints. A first communication is generated based on the first constrained communication record. The first communication is provided to a second user. The second user provides response data and the underlying constrained communication is updated based on the response data.

SYSTEMS AND METHODS FOR SOCIAL GRAPH DATA ANALYTICS TO DETERMINE CONNECTIVITY WITHIN A COMMUNITY

Systems and methods for social graph data analytics to determine the connectivity between nodes within a community are provided. A user may assign user connectivity values to other members of the community, or connectivity values may be automatically assigned from third parties or based on the frequency of interactions between members. Connectivity values may represent such factors as alignment, reputation, status, and/or influence within a social graph of a network community, or the degree of trust. The paths connecting a first node to a second node may be retrieved, and social graph data analytics may be performed on the retrieved paths. Network connectivity values and/or other social graph data may be outputted to third-party processes and services for use in initiating automatic transactions or making automated network-based or real-world decisions.

Congruent bidirectional segment routing tunnels

Systems and methods provide congruent bidirectional Segment Routing (SR) tunnels, namely congruent and fate-shared traffic forwarding for bidirectional SR tunnels. A bidirectional SR tunnel, as described herein, includes two unidirectional SR tunnels where the forward and reverse traffic directions follow the same path through the network when forwarded based on prefix and adjacency Segment Identifiers (SIDs). The term “congruent” is used herein to refer to the fact that the two unidirectional SR tunnels, i.e., the forward and reverse traffic directions, follow the same path through the network but in opposite directions. The guarantee of congruency is based on modification of the Segment Identifier (SID) configuration at the source nodes of each tunnel. Accordingly, the present disclosure maintains compatibility with existing Segment Routing configurations with the modifications solely at the source nodes.

System and method for facilitating efficient address translation in a network interface controller (NIC)

A network interface controller (NIC) capable of facilitating efficient memory address translation is provided. The NIC can be equipped with a host interface, a cache, and an address translation unit (ATU). During operation, the ATU can determine an operating mode. The operating mode can indicate whether the ATU is to perform a memory address translation at the NIC. The ATU can then determine whether a memory address indicated in the memory access request is available in the cache. If the memory address is not available in the cache, the ATU can perform an operation on the memory address based on the operating mode.

UDP over HTTP loadbalancer for microservice environment

A first plurality of UDP packets corresponding to a first session and a second plurality of UDP packets corresponding to a second session can be received at a core network node. The first plurality of UDP packets and the second plurality of UDP packets have the same source five tuple. A first plurality of HTTP packets comprising first session information identifying the first session can be created based on the first plurality of UDP packets. A second plurality of HTTP packets comprising second session information identifying the second session can be created based on the second plurality of UDP packets. The first plurality of HTTP packets can be routed to a first microservice instance based at least in part on the first session information. The second plurality of HTTP packets can be routed to a second microservice instance based at least in part on the second session information.

METHODS, SYSTEMS, AND APPARATUSES FOR PRIORITY-BASED TIME PARTITIONING IN TIME-TRIGGERED ETHERNET NETWORKS

Methods, systems, and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by determining a subset of a group of bins allocated to TT traffic; restricting the subset bin groups to a specified harmonic subdivided pattern with a certain duration; allocating the subset of bin groups in accordance with bin group equated with a rate at least twice as high as a highest TT traffic rate available in the network to enable control of partitioned traffic by using a set of media reservations; checking whether a bin selected via a bin selection process for scheduling a TT Virtual Link (VL) is a valid TT bin, else proceeding to a subsequent bin until a valid TT bin is returned for the TT VL, and reserving using at least one media reservation for a TT VL to be scheduled by temporal partitioning at the restricted rate.

Method for selecting forwarding path, network equipment and storage medium

The invention provides a method for selecting a forwarding path, network equipment and a storage medium, and the method comprises the steps: head node equipment obtains a first forwarding path of a to-be-forwarded message, and obtains a plurality of first PREFIX tags corresponding to the first forwarding path; obtaining the COST value of the first forwarding path by using the plurality of first PREFIX tags and the corresponding relationship between the PREFIX tags and the COST value; the COST value of the first forwarding path is compared with a configured threshold value, a comparison result is obtained, and whether the message is forwarded through the first forwarding path or not is judged according to the comparison result. Through the method, the situation that path control needs to depend on the SDN controller can be effectively reduced.

Time-sensitive software defined networking

A system and method for determining a network path through a network that is managed by a software defined network (TsSDN) controller incorporating time management are disclosed. In some embodiments, the SDN controller can determine that a data packet originating from a transmitting device and directed to a receiving device is associated with one of: time-sensitive, timeaware or best effort characteristic. The controller can then determine a network path for transport of the data packet from the transmitting device to the receiving device with a guaranteed end to end delay to satisfy the characteristic. The end to end delay considers latency through each layer the data packet transitions through after being conjured at an application layer of the transmitting device. The data packet is then transmitted from the transmitting device via the network path to the receiving device.

Generating candidate links and candidate paths before selecting links for an optimized optical network plan

A device receives network data associated with a network that includes network devices interconnected by links, and receives parameters associated with determining a network plan for the network. The device generates candidate links for each potential network plan of multiple potential network plans for the network, based on the parameters and based on a criterion associated with generating the candidate links. The device generates candidate paths for each potential network plan based on the parameters, and selects a portion of the candidate links and a portion of the candidate paths. The device generates each potential network plan based on the portion of the candidate links and the portion of the candidate paths, and identifies a potential network plan, of the multiple potential network plans, that reduces resource usage associated with operating the network. The device causes the potential network plan to be implemented in the network.

Generating forward and reverse direction connection-tracking records for service paths at a network edge

Some embodiments provide stateful services in a chain of services identified for some data messages. The edge forwarding element receives a data message at a particular interface of the edge forwarding element that is traversing the edge forwarding element in a forward direction between two machines. The edge forwarding element identifies (1) a set of stateful services for the received data message and (2) a next hop associated with the identified set of stateful services in the forward direction and a next hop associated with the identified set of stateful services in the reverse direction. Based on the identified set of services and the next hops for the forward and reverse directions, the edge forwarding element generates and stores first and second connection tracking records for the forward and reverse data message flows, respectively used to forward data messages received subsequently for the flow.

Reliable map-reduce communications in a decentralized, self-organizing communication orbit of a distributed network

A first machine identifies, from among a non-static collection of machines, a respective set of forward contacts that comprises a set of machines. The set of forward contacts are distributed along the ordered sequence in the forward direction away from the respective machine in an order of increasing similarity between the respective channel number assigned to the first machine and a respective channel number assigned to each of the set of forward contacts. The first machine establishes a respective direct communication channel between the first machine and each of the set of forward contacts. The first machine sends a first query to a first forward contact and sends collected answers for the first query to at least a second forward contact that has a greater similarity to the first machine based on the respective channel numbers of the first machine and the first and second forward contacts.

Dynamic API gateway routing based on request metadata

An application programming interface (API) gateway device receives an API request from a client device, the API gateway to provide access to a plurality of services provided by a plurality of compute nodes. A cluster manifest is created based on metadata associated with the API request and characteristics of the plurality of services, the cluster manifest identifying a logical view of a subset of the plurality of services provided by a subset of the plurality of compute nodes. The API request is routed to one of the subset of the plurality of services based on the cluster manifest.

System and method for adding routing paths in a network

Aspects of the present disclosure involve systems, methods, computer program products, and the like, for providing multiple egress points from a telecommunications network for a client of the network. In particular, the process and system allows for multiple provider edges of the network to utilize a route reflector server to provide a border gateway protocol (BGP) route to other provider edges in the network. Further, the multiple provider edges may each announce similar interior gateway protocol (IGP) routes through the network such that a provider edge receiving a packet intended for the customer network may select from the multiple IGP routes to provide the intended packet to the customer network. In this manner, the receiving provider edge may load balance among the various connections of the customer network to the telecommunications network.

USING NETWORK INTERFACE CARDS HAVING PROCESSING UNITS TO DETERMINE LATENCY

A system is configured to compute a latency between a first computing device and a second computing device. The system includes a network interface card (NIC) of a first computing device. The NIC includes a set of interfaces configured to receive one or more packets and send one or more packets. The processing unit is configured to identify information indicative of a forward packet, compute, based on a first time corresponding to the forward packet and a second time corresponding to a reverse packet associated with the forward packet, a latency between the first computing device and a second computing device, wherein the second computing device includes a destination of the forward packet and a source of the reverse packet, and output information indicative of the latency between the first computing device and the second computing device.

METHOD FOR CERTIFYING COMPLIANCE WITH A SUSTAINABILITY CRITERION BY A TRANSMISSION OF A NETWORK PACKET, NETWORK, NETWORK DEVICE, TARGET APPLICATION AND TRAFFIC ENGINEERING DEVICE

The invention is related to a method for certifying compliance with a sustainability criterion (1) by a transmission of a network packet (2) via network devices (3) of a network (4), wherein the network packet (2) is transmitted from a first network device (7) to a final network device (8) of the network devices (3), wherein the network packet (2) is sequentially transmitted along a selected path (9) by selected network devices (10). A respective tag (12) linking to a respective profile (11) of the respective selected network device (10) is associated with the network packet (2), wherein the respective profile (11) comprises at least one predefined sustainability related value. Upon reception of the network packet (2) by a target application (5), the tags (12) linking the respective profiles (11) to the network packet (2) are checked by means of a predefined validation process by the target application (5).

IMPLEMENTING BORDER GATEWAY PROTOCOL (BGP) OPTIMAL ROUTE REFLECTION

A method for distributing an optimal path to a router using a route reflector, that includes obtaining, by the route reflector, a path location bitmask associated with the optimal path, obtaining a router location bitmask associated with the router, performing a bitwise AND operation on the path location bitmask and the router location bitmask to obtain a result bitmask, identifying a nonzero bit in the result bitmask, and in response to identifying the nonzero bit, sending the optimal path to the router.

Hybrid networking method and device based on ad hoc network

The invention relates to a hybrid networking method and device based on an ad hoc network. The method comprises the following steps: configuring a backbone link of a mesh network; backbone link network nodes needing to be accessed are determined in a preset area of the backbone link, and the backbone link network node of the shortest path when the external AP-WIFI mode equipment is accessed is calculated; after the shortest path is determined, establishing communication connection between the AP-WIFI mode equipment and the corresponding backbone link network node; and after connection, setting the AP-WIFI mode equipment as a node undertaking data transmission in the hybrid network. The hybrid networking provided by the invention can automatically and randomly select a transmission path according to a network congestion state, and particularly during multi-path and multi-route transmission, all transmitted contents are difficult to intercept from a single path, so that the data transmission ...

Routing path analysis method and device

The present disclosure discloses a routing path analysis method and device. The method includes a first step of determining a key node based on a label stack of segment routing of a data packet. The key node includes a diversion node, a next-hop working path node of the diversion node, and a next-hop protection path node of the diversion node. The diversion node is a crossed node of a working path and a protection path. The method further includes determining neighboring nodes of the key node as relevant nodes; querying for traffic information of the key node and traffic information of the relevant nodes; selecting, from the key node and the relevant nodes based on the traffic information, the nodes for the data packet to pass. The routing path of the data packet is determined based on the selected nodes.

Establishing a synchronous replication relationship between two or more storage systems

Establishing a synchronous replication relationship between two or more storage systems, including: identifying, for a dataset, a plurality of storage systems across which the dataset will be synchronously replicated; configuring one or more data communications links between each of the plurality of storage systems to be used for synchronously replicating the dataset; exchanging, between the plurality of storage systems, timing information for at least one of the plurality of storage systems; and establishing, in dependence upon the timing information for at least one of the plurality of storage systems, a synchronous replication lease, the synchronous replication lease identifying a period of time during which the synchronous replication relationship is valid.

Upgrading meshnet connections in a mesh network

A method including receiving, by a first device from a second device in a mesh network, coordination information including identification information that identifies an optimal midpath node and timing information that indicates a connection time associated with connecting with the optimal midpath node to enable utilization of the optimal midpath node for communicating meshnet data between the first device and the second device; and transmitting, by the first device, connection information to connect with the optimal midpath node based at least in part on utilizing the identification information. Various other aspects are contemplated.

Segment routing over label distribution protocol

An apparatus and method is disclosed for segment routing (SR) over label distribution protocol (LDP). In one embodiment, the method includes a node receiving a packet with an attached segment ID. In response, the node may attach a label to the packet. Thereafter, the node may forward the packet with the attached label and segment ID to another node via a label switched path (LSP).

Detecting a lack of correlation between application quality of experience and network conditions

In one embodiment, a device obtains quality of experience metrics for an online application. The device obtains network metrics for one or more network paths over which traffic for the online application was routed. The device identifies a lack of correlation between the quality of experience metrics for the online application and the network metrics for the one or more network paths over which traffic for the online application was routed. The device disables, based on the lack of correlation, explicit probing of the one or more network paths.

NETWORK DEVICE, NETWORK SYSTEM, NETWORK CONNECTION METHOD, AND PROGRAM

An object is to provide a network device and the like that enable a first network that determines a traffic communication route using the Ethernet ring protocol and a second network that determines a traffic communication route by transmitting/receiving a control frame related to the traffic communication route within the network to be connected in a redundant configuration. When the network device according to the present invention has transitioned to a state in which there is no interface that can communicate with the first network and there is an interface that can communicate with the second network, it transitions to a standby state and further transmits information indicating that communication is impossible to the second network, and when there is an interface that can communicate with the first network and there is no interface that can communicate with the second network, it transitions to the standby state and further transmits communication route change information to the first ...

Data Transmission Control Method and Apparatus

In a data transmission control method, one or more pieces of identification information are added to determine an interface resource object for forwarding a data packet on an interface of a network device. The added one or more pieces of identification information include one piece of global identification information. The global identification information may correspond to a network slice, and different network slices correspond to different values of global identification information. A global network identifier corresponds to one or more interface resource objects. One interface resource object may be occupied by one network slice alone, or one interface resource object may be jointly shared by a plurality of network slices.

Способ распространения маршрутной информации через выделенные каналы связи в IP-сетях

Изобретение относится к области систем маршрутизации. Технический результат заключается в обеспечении защищенной динамической маршрутизации через выделенную сеть на основе состояний соседства, в котором передача маршрутной информации между маршрутизаторами осуществляется через выделенные каналы связи. Такой результат достигается тем, что маршрутизаторы всем своим соседям направляют по выделенному каналу связи запросы Hello-пакеты, после получения Hello-пакета от соседа из принятого Hello-пакета извлекается информация о соседе: список IP-интерфейсов, список соседей, информация о NDB в составе ID, Size и Checksum и на основе полученной информации выполняется проверка наличия общих подсетей между подсетями подключения маршрутизатора и соседа, осуществляется сравнение NDB ID, Size и Checksum NDB отправителя и соседа, содержащихся в Hello-пакете, если NDB ID, Size и Checksum равны, то соседу присваивается состояние «synced» – соседство установлено. Состояниям соседства являются: «down» - маршрутизатор ...

Systems for route finding in networks and a network of networks

Systems and methods for route finding in networks and/or in a network of networks. A server is communicatively coupled to a datastore, which hosts a model of an industry of Internet infrastructure as a graph. Nodes of the graph represent physical components that make up various networks that, collectively, interconnect with one another, infrastructure components that house the physical components, and entities owning and/or operating any of these equipment and facilities. Edges of the graph, which are preferably directed in nature as defined by labels, represent the relationships between the physical components. The server hosts and employs a route-finding application that utilizes the graph to search for an optimal path between nodes of the graph responsive and according to user-specified criteria.

Systems and methods of discovering and controlling devices without explicit addressing

A method of discovering a device in a communication network having multiple interconnected nodes includes continuously monitoring, by a device to be discovered, any IP packets sent by a discoverer. The method further includes transmitting, by the discoverer, an IP packet destined for a downstream device and receiving, by the device to be discovered, the IP packet. The method further includes determining, by the device to be discovered, whether the IP packet is intended for the device to be discovered. If the IP packet is not intended for the device to be discovered, retransmitting, by the device to be discovered, the IP packet to the downstream device via an egress port of the device to be discovered.

METHOD, COMPUTER DEVICE, AND NON-TRANSITORY COMPUTER-READABLE RECORDING MEDIUM FOR PROVIDING OPTIMAL PATH USING EXPERT KNOWLEDGE

A method for providing an optimal path through a computer network includes predicting a subsequent action of a target user through an optimal path prediction model that is trained in a form of a graph representing a user action trajectory of a session unit and recommending a path of the predicted action as an optimal path. The recommendation includes identifying a user intent based on a previous action trajectory of the target user in a current session, and guiding a path corresponding to the user intent as one of the optimal paths.

DATA OBTAINING METHOD AND APPARATUS, DEVICE, AND STORAGE MEDIUM

This application discloses a data obtaining method and apparatus, a device, and a storage medium, and pertains to the field of communication technologies. The method includes: A first node obtains first measurement information and second measurement information, where the first measurement information is measurement information of a first SR path, the second measurement information is measurement information of a second SR path, the first SR path is an SR path from the first node to a second node, and the second SR path is an SR path from the second node to the first node; determines a bidirectional path detection result based on the first measurement information and the second measurement information, where the bidirectional path detection result indicates quality of a bidirectional SR path between the first node and the second node, and the bidirectional SR path includes the first SR path and the second SR path; and sends a notification message to a controller, where the notification ...

ROUTER WITH OPTIMIZED STATISTICAL FUNCTIONALITY

Inter-satellite clustering routing method in satellite network

The invention relates to an inter-satellite clustering routing method in a satellite network, and belongs to the technical field of communication. As an intelligent system, the satellite network system strictly follows the system principle of maximum effective comprehensive utilization of spatial information resources, and various types of satellites of different levels and orbits are integrated. The system not only delays ground broadband communication, but also derives various advantages, such as wide coverage and long communication distance. Based on this, the LSA diffusion stage of the link state in the satellite network system is researched, a weighted clustering algorithm of satellite network load balancing is adopted and optimized, network multi-clustering is achieved, mutual communication is facilitated, and the LSA diffusion stage of the link state in the satellite network system is optimized through simulation of various algorithms. The obtained load balancing weighted clustering ...

Data acquisition edge cloud deployment method considering power transmission and transformation project safety

The invention discloses an edge cloud deployment method for data acquisition considering power transmission and transformation project safety, which comprises the following steps: acquiring and storing a network structure, solving a plurality of disjoint shortest paths between a response node and a central node by using a Dijkstra algorithm, solving an edge node set on the paths according to an optional edge node number set and a path set, and selecting a combination with the maximum union set and the maximum intersection set of the managed and controlled response node sets as a final edge node set, and allocating the response tasks to the edge nodes according to the real-time load data. According to the method, the whole link of the project can be comprehensively managed through multi-path demand response distributed scheduling, the cost management and control precision is improved, the problem of precise cost management and control of whole link unit confirmation of the current power ...

OPTIMIZING NETWORK DELIVERY OF 5G EDGE APPLICATION SERVICES

A method and apparatus for optimizing network delivery of fifth generation (5G) edge application services by weighting network latency along with a load, capacity, and preference of an application server to determine where to transmit a new flow of packets. By using the weighted approach, network traffic can be equalized among multiple instances (e.g., applications) with the same address.

Bandwidth estimation and management for connected devices

A group of devices connected on a wireless local area network (WLAN) operate in conjunction with one another to present content. Devices in the group may be wirelessly connected via personal area network (PAN) to other devices, such as speakers. An election process is used to select a primary device. The primary device may receive content from an external source, such as a server, and distribute that content to other devices within the group via the WLAN. The parameters of that distribution, such as a content rate indicative of a bitrate of the content, transfer limit rate, and so forth are configured to preserve fidelity of the presentation while minimizing interruptions to presentation that may result due to frequency contention between the WLAN and the PAN, traffic on the WLAN, and so forth.

Computing forward and reverse paths and checking the liveness thereof

Systems and methods for computing forward and reverse paths and checking the liveness, keep-alive status, or continuity of the forward and reverse paths are provided. A method, according to one implementation, includes the step of creating one or more messages related to a computation of a forward path from a head-end node to a tail-end node and a computation of a reverse path from the tail-end node to the head-end node. The method also includes the step of adding a data object to the one or more messages, the data object including an intent to check the liveness of the forward path and reverse path.

Method and system for managing routing across multiple networks with separate routing masters

Novel tools and techniques are provided for implementing management of routing across multiple voice or data networks with separate routing masters. In various embodiments, in response to receiving a request to establish a call between a calling party in a first network and a called party in a second network, a computing system might receive a first set of network information from a first routing database(s) that is operated by a first service provider and a second set of network information from a second routing database(s) that is operated by a second service provider separate from the first service provider; might analyze the received first and second sets of network information to generate a unified routing model for optimizing routing of the call through the first and second networks; and might establish the call through a selected optimized route based on the generated unified routing model.

Adaptive private network asynchronous distributed shared memory services

A highly predicable quality shared distributed memory process is achieved using less than predicable public and private internet protocol networks as the means for communications within the processing interconnect. An adaptive private network (APN) service provides the ability for the distributed memory process to communicate data via an APN conduit service, to use high throughput paths by bandwidth allocation to higher quality paths avoiding lower quality paths, to deliver reliability via fast retransmissions on single packet loss detection, to deliver reliability and timely communication through redundancy transmissions via duplicate transmissions on high a best path and on a most independent path from the best path, to lower latency via high resolution clock synchronized path monitoring and high latency path avoidance, to monitor packet loss and provide loss prone path avoidance, and to avoid congestion by use of high resolution clock synchronized enabled congestion monitoring and avoidance ...

ENFORCING STRICT SHORTEST PATH FORWARDING USING STRICT SEGMENT IDENTIFIERS

Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

Telemetry data optimization for path tracing and delay measurement

Techniques for optimizing technologies related to network path tracing and network delay measurements are described herein. Some of the techniques may include using an IPv6 header option and/or segment identifier field of a segment list or a TLV of a segment routing header as a telemetry data carrier. The techniques may also include using an SRv6 micro-segment (uSID) instruction to indicate to a node of a network that the node is to perform one or more path tracing actions and encapsulating the packet and forward. Additionally, the techniques may include using short interface identifiers corresponding to node interfaces to trace a packet path through a network. Further, the techniques may include using short timestamps to determine delay measurements associated with sending a packet through a network. In various examples, the techniques described above and herein may be used with each other to optimize network path tracing and delay measurement techniques.

Session monitoring using metrics of session establishment

A first router generates session establishment metrics for use in network path selection. For example, a plurality of routers connect a client device to a network service instance hosted by a server. A first router is connected to the network service instance via first and second paths. The first router receives session performance requirements for a session between the client device and the network service instance. The first router forwards, along the first path, network traffic for the session by modifying a first packet of the session to include a session identifier for the session. The first router determines that session establishment metrics for the session do not satisfy the session performance requirements. In response, the first router forwards, along the second path, the network traffic for the session by modifying a second packet of the session to include the session identifier for the session.

Network optimisation

A system and computer-implemented method for allocating a plurality of transactions to a plurality of networks comprising: receiving from a router at a classical computer a plurality of first information associated with a respective one of the plurality of transactions; receiving from a router at the classical computer a plurality of second information associated with a respective one of the plurality of networks; determining in the classical computer a routing characteristic to be optimised by the allocation of the plurality of transactions to the plurality of networks; expressing by the classical computer in at least one expression to a quantum computer, the plurality of first information, the plurality of second information and the routing characteristic; resolving in the quantum computer the at least one expression to determine the allocation of the plurality of transactions to the plurality of networks; and providing the allocation to the router. The routing characteristic is the financial ...

Methods, devices and systems for determining a target path

Aspects of the subject disclosure may include, for example, embodiments and a method. The method includes iteratively providing messages to each Node Processor. Each Node Processor represents a node of a group of nodes. The iteratively providing of the messages comprises providing first messages. Each first message includes a cost associated with a path of nodes visited by each first message. A selected path is obtained from each node having a lowest cost of a group of common endpoint costs for paths having common endpoints. A next group of messages includes the selected path. The iteratively providing of the messages results in selected paths. Also, the method include determining a target path from a remaining path. Other embodiments are disclosed.

Geographic routing mesh network

The disclosure relates to method and system for geographic routing mesh network. The method may include determining, by a first node, a first list of nodes proximal to the first node in a mesh network. The method further includes sending, by the first node to each node on the first list of nodes, the first list of nodes proximal to the first node. The method(s) further includes receiving, by the first node in response to sending the first list of nodes, one or more second list of nodes from one or more nodes of the first list of nodes, each of the one or more second list of nodes being proximal to one of the one or more nodes of the first list of nodes and updating, by the first node in response to receiving one or more second list of nodes proximal to the one more nodes of the first list of nodes, one or more nodes of the first list of nodes.

LINK SELECTION IN AN OVERLAY NETWORK

An overlay network system includes multiple point-of-presence (POP) devices each including a path finding component and corresponding telemetry component, agent component, and routing daemon. The telemetry component generates latency measurements for the POP on which it is disposed. A centralized billboard service provides border gateway protocol (BGP) announcements and point-of-presence (POP) peering decisions to each of the agent components. On each of the POPs, the path finding component and corresponding telemetry component, agent component, and routing daemon cooperate to transform the BGP announcements, peering decisions, and latency measurements into routing tables and link selections for packet streams routed through the POPs.

Bidirectional forwarding detection control packet to indicate maintenance mode operation

A first network device may determine to transition to a maintenance mode. The first network device may transmit, to a second network device, a bidirectional forwarding detection (BFD) control packet that includes an indication that the first network device is in the maintenance mode.

MULTICAST STATE REDUCTION VIA TUNNELING IN A ROUTED SYSTEM

DATA TRANSMISSION METHOD AND DEVICE IN MULTILINK ENVIRONMENT

METHOD FOR OPERATING AN ETHERNET ON-BOARD NETWORK OF A MOTOR VEHICLE, CONTROL UNIT, AND ETHERNET ON-BOARD NETWORK

Training method and device for traffic scheduling strategy generation model

The invention discloses a traffic scheduling strategy generation model training method and device, and the method comprises the steps: obtaining the traffic information of each network node, and obtaining the link delay information of a communication link between the network nodes; obtaining a target link delay prediction model according to the flow information and the link delay information; according to preset business service quality information, a preset traffic matrix and a target link delay prediction model, training data is generated, the preset business service quality information is used for representing the service quality information of the preset business, and the training data represents traffic scheduling strategies for the preset business in different network states; and training the initial traffic scheduling strategy generation model according to the training data to obtain a target traffic scheduling strategy generation model which is used for generating a traffic scheduling ...

Service guarantee method and device, electronic equipment and storage medium

The invention discloses a service guarantee method and device, electronic equipment and a storage medium, relates to the technical field of communication, and is used for solving the problem that at the present stage, telecom operators cannot provide a guarantee mechanism for users with special requirements, and the method comprises the following steps: receiving an access request of a target user; wherein the access request is used for requesting to access target service flow; performing dial testing on each service forwarding path in the historical service forwarding paths of the target service traffic, and determining forwarding delay of each service forwarding path; determining the service forwarding path corresponding to the minimum forwarding time delay as the optimal forwarding path of the target service flow; and forwarding the target service traffic according to the optimal forwarding path of the target service traffic. The method and the device are used for providing service guarantee ...

Network quality test method and device of computing power network based on TWAMP

The invention discloses a network quality test method and device for a computing power network based on TWAMP. The method comprises the steps that a system creates a ping test based on a twamp protocol for PE equipment; according to parameter configuration, identifying all PE devices in a system designated domain; taking all the PE devices in the previous step as input parameters, calling an existing service interface, and calculating the shortest IGP path between every two PE devices based on routing data acquired by a system; calculating network quality data between each pair of PEs according to the routing data between the PEs returned in the previous step; and storing the calculation result of the previous step in a database, and realizing the display of various dimension scenes based on the source data. According to the method, the shortest path between the devices is analyzed by the acquired data, the optimal equivalence path between the PE devices in the whole network is dynamically ...

System and method of providing segment routing as a service

Disclosed is a system and method of providing a segment routing as a service application. The method includes receiving a configuration of an internet protocol environment. The configuration can be a layer 3 configuration of a single cloud environment or even across multiple cloud environments. The configuration defines routing, forwarding, and paths in the environment between different entities such as virtual machines. The method includes receiving a parameter associated with a workload of a tenant. The parameter can be a service level agreement (i.e., a best bandwidth available), a pathway requirement, a parameter associated with specific workload, and so forth. Based on the configuration and the parameter, the method includes generating tenant-defined layer 3 overlay segment routing rules that define how the workload of the tenant will route data in the internet protocol environment using segment routing.

SYSTEM AND METHOD FOR CLIENT COMMUNICATION IN A DISTRIBUTED TELEPHONY NETWORK

A system and method for selecting a client gateway device to establish a path between client devices is provided. A method includes associating a first client gateway device of a first geographic region and a second client gateway device of a second geographic region with a first communication endpoint of a first client device, and associating a third client gateway device with a second client device, wherein the third client gateway device is a gateway of the first geographic region. The method also includes receiving a communication invitation directed to the first communication endpoint from the second client device via the third client gateway device, and responsive to receiving the communication invitation, selecting one of the first client gateway device or the second client gateway device. The method further includes establishing a communication path between the second client device and the first client device via the selected client gateway device and the third client gateway device ...

Load-balancing establishment of connections among groups of connector servers

Techniques are described herein that are capable of load-balancing establishment of connections among groups of connector servers in a public computer network by performing operations that include receiving a connection request from a connector client in a private computer network, requesting establishment of a connection between the connector client and one of the connector servers in the public computer network. A number of connections between the private computer network and each group is determined. An identified group is selected from the groups based at least in part on a number of connections between the private computer network and the identified group being less than or equal to a number of connections between the private computer network and each other group. The connection request is provided toward the identified group, which enables establishment of the connection between the connector client and a connector server in the identified group.

Data request servicing using multiple paths of smart network interface cards

Data requests can be serviced by multiple paths of smart network interface cards (NICs). For example, a system can receive a request for data at a first path of a smart NIC. The first path can be a hardware-implemented path. The system can send one or more parameters of the request to a second path of the smart NIC. The second path can be a slower path than the first path and configured to execute a routing algorithm for the request. The system can receive routing information for the request from the second path based on the routing algorithm and transmit the request to a storage node based on the routing information.

Methods and apparatus for controlling and making link bundle advertisements to support routing decisions

Methods and apparatus relating to the use of aggregated links, e.g., links in a bundle, are described. A normal link metric and a limited operation mode link metric a determined for a link bundle, the normal link metric having a lower value than the limited operational mode link metric. The status of links in a link bundle are monitored. Based on the number of currently operational links in a link bundle and a switching threshold, a decision is made whether to advertise the normal link metric, advertise the limited operation mode threshold or refrain from advertising any link metric. The use of the limited operation link metric facilitates the use of a partially failed link bundle providing an alternative routing path in the network that would not otherwise be available.

Mesh agents for distributed computing

A method to broker events of event-driven application components, within a distributed computing environment and using a mesh broker, is described. The mesh broker is instantiated as several mesh agents, the mesh agents being provisioned to support mediation activities relating to a plurality of computational nodes within the distributed computing environment. The mesh agents are further deployed as a mesh network among the computational nodes of the distributed computing environment. A connectivity catalog stores cost data associated with transmission of an event notification between each of multiple pairs of computational nodes of the computational nodes. Routes across the mesh network are automatically selected, by the mesh agents and using the cost data to determine low-cost routes across the mesh network.

MALLEABLE ROUTING FOR DATA PACKETS

Various implementations disclosed herein enable malleable routing for data packets. For example, in various implementations, a method of routing a type of data packets is performed by a device. In some implementations, the device includes a non-transitory memory and one or more processors coupled with the non-transitory memory. In some implementations, the method includes determining a routing criterion to transmit a set of data packets across a network. In some implementations, the method includes identifying network nodes and communication links in the network that satisfy the routing criterion. In some implementations, the method includes determining a route for the set of data packets through the network nodes and the communication links that satisfy the routing criterion. In some implementations, the method includes configuring the network nodes that are on the route with configuration information that allows the set of data packets to propagate along the route.

Service flow scheduling method in network security resource pool based on shuffled frog leaping algorithm

The invention relates to a service flow scheduling method in a network security resource pool based on a shuffled frog leaping algorithm. The characteristics of a complete network topology structure can be obtained through a software defined network, and a target function is constructed by combining the network topology structure, the network security resource use condition and the link load condition. The method comprises the following steps: firstly, analyzing service traffic by using security hardware, and planning network security resources required by traffic processing; secondly, acquiring a service flow processing path set according to conditions such as a source address and a destination address of the service flow; and finally, providing a shuffled frog leaping-service traffic scheduling algorithm which is used for screening out an optimal scheduling path of the service traffic from the processing path set. According to the invention, the processing path of the service flow can ...

Stitching a Segment Routing (SR) policy to a local SR policy for routing through a downstream SR domain

Systems and methods for enhancing Segment Routing (SR) protocols are provided for enabling the stitching of a remote SR policy to a local SR policy. A method can include obtaining a Segment Routing (SR) policy for routing a packet along a path in a downstream domain, the SR policy including at least a destination field and a color field, the destination field defining an end-point of the path in the downstream domain, the end-point representing a destination node or service instance, the color field defining the path in the downstream domain, and storing the SR policy in the database.

SYSTEMS AND METHODS FOR ON THE FLY ROUTING IN THE PRESENCE OF ERRORS

Systems and methods are provided for “on the fly” routing of data transmissions in the presence of errors. Switches can establish flow channels corresponding to flows in the network. In response to encountering a critical error on a network link along a transmission path, a switch can generate an error acknowledgement. The switch can transmit the error acknowledgements to ingress ports upstream from the network link via the plurality of flow channels. By transmitting the error acknowledgement, it indicates that the network link where the critical error was encountered is a failed link to ingress ports upstream from the failed link. Subsequently, each ingress port upstream from the failed link can dynamically update the path of the plurality of flows that are upstream from the failed link such that the plurality of flows that are upstream from the failed link are routed in a manner that avoids the failed link.

Methods and systems for transmitting information packets through tunnel groups at a network node

The present invention discloses methods and systems for sending information packets from a first network node to a second network node. An aggregated tunnel is established between the first network node and the second network node. An information packet is determined whether to be sent according to profile condition(s) of the aggregated tunnel and then according to a selected policy. When a selected policy is selected and the information packet is sent through a tunnel according to the selected policy. When no policy is selected, the information packet is sent through one of a first group of tunnels. When no profile is selected, the information packet is sent through a network interface of the first network node.

Smart routing

Techniques are provided for intelligent routing to a node in a network, such as a transport computer. A gateway server may receive authorization requests from a resource provider computer. There may be multiple potential transport computers to which to potentially route the authorization requests, depending on relationships established between the parties. A routing decision may be made automatically based on real-time network measurements and/or static rules. Real-time network measurements may be obtained by monitoring transport computers for failures, delays, or other undesirable activity. The routing decisions may further be based on expected volumes (e.g., based on analysis of historical spikes in volume). The routing decisions may further be based on user-configured rules and preferences, received via a routing administration interface.

MARKING SPOKE LINKS FOR NETWORK SEGREGATION AND SERVICE CHAINING IN HUB AND SPOKE OVERLAY NETWORKS

Techniques for a hub node to, provisioned in a network site of a hub and spoke overlay network, to receive a network advertisement from the spoke, decode network routing requirements from a border gateway protocol (BGP) large community associated with the network advertisement, and store the network routing requirements in association with a route associated with the spoke. The routing requirements may indicate one or more service(s) to be applied to the packet, a trust level associated with the spoke, and/or a trust zone associated with the spoke. The hub node may receive a packet from the spoke to be transmitted to destination spoke. The hub node may then route the packet to the destination spoke, drop the packet, or send the packet to a service node configured to apply the one or more services to the packet based on the routing requirements.

GEOGRAPHIC ROUTING

System and techniques for geographic routing are described herein. A node receives a data packet that includes map data, a sequence of geographic areas to a requestor, and a target geographic area. The node may then determine that it is within the target geographic area and start a transmit timer based on a next-hop geographic area. Here, the next-hop geographic area is determined from the sequence of geographic areas in the data packet. The node may then counts how many other nodes from the geographic area sent data packets while the transmit timer is running. When the transmit timer expires, the node may transmit a modified data packet when the number of data packets is less than a predefined threshold. Here, the modified data packet is the data packet updated to include local map data and the next-hop geographic area.

Network data continuous forwarding selection method based on centralized reinforcement learning

The invention relates to a network data connection forwarding selection method based on centralized reinforcement learning, belongs to the technical field of network path selection, and solves the problems that an existing network data connection method is low in resource utilization rate and prone to falling into a local optimal trap. The method comprises the following steps: mapping a network entity into a network digital twin; the network digital twin comprises a central controller and a network topology structure formed by a plurality of network nodes and edges. In a network digital twinborn body, a central controller performs modeling on a data continuous forwarding selection process in a network topology structure by using a centralized reinforcement learning algorithm to obtain a centralized reinforcement learning model; and when the central controller receives a data continuous forwarding selection request, the centralized reinforcement learning model is operated to realize continuous ...

Method and device for creating network resource model

The invention discloses a network resource model creation method and device, relates to the field of communication, and solves the problem of how to create a network resource model. The network resource model creation method comprises the following steps: acquiring geographical location information of to-be-accessed equipment, and creating a new node representing the to-be-accessed equipment in a network resource model; determining a node used as a network access point of the to-be-accessed device in the network resource model, and querying a target network transmission device between the to-be-accessed device and the network access device in an information database according to the geographical location information of the to-be-accessed device and the geographical location information of the network access device, the network access device is a network transmission device represented by a network access point, and the information database comprises a connection relationship and a geographic ...

Transaction route determination method and device

The invention provides a transaction route determination method and device which are applied to the financial field, and the method comprises the steps: constructing a transaction center network, the transaction center network comprises a decision center node and a plurality of execution nodes, the decision center node is connected with each execution node through an edge, and the edge is a path; according to the heartbeat data of the different execution nodes, calculating a network delay mean value of the different execution nodes; based on the historical BBO data of the different execution nodes, fitting to obtain BBO change frequencies of the different execution nodes; based on the historical transaction costs of the different execution nodes, fitting to obtain the current transaction costs of the different execution nodes; calculating the transaction network weight of the execution node; and determining the path corresponding to the execution node corresponding to the minimum transaction ...

Routing network traffic based on DNS

A method may include receiving a domain name system (DNS) query at a network device, where the DNS query may be associated with a traffic flow identified for rerouting through an alternative path utilizing an alternative network device instead of a default path. The method may also include rewriting the DNS query such that the DNS query is routed through the alternative network device along the alternative path and to a DNS server associated with the alternative path. The method may additionally include receiving a DNS response from the DNS server, where a resource identified in the DNS response may be based on the DNS query coming through the alternative network device.

Determining quality information for a route

Methods and systems for determining traffic information for devices along one or more routes are described. A content server may send a message to a plurality of devices along a route. The message may comprise an indication requesting each of the devices to send, to the content server, status information regarding the respective device. Intermediary devices may receive the message, respond with the requested information, and forward the message through the route. The message may comprise a stateless messaging protocol message such as an ICMP or UDP packet.

Bandwidth constraint for multipath segment routing

In an example, a method includes computing, by a computing device, for a segment routing policy that specifies a bandwidth constraint for the segment routing policy, first shortest paths through a network of network nodes, wherein each shortest path of the first shortest paths represents a different sequence of links connecting pairs of the network nodes from a source to a destination; in response to determining, by the computing device based on the bandwidth constraint for the segment routing policy, a link of one of the first shortest paths has insufficient bandwidth to meet a required bandwidth for the link, increasing a metric of the link; computing, by the computing device, for the segment routing policy that specifies the bandwidth constraint, based on the increased metric of the link, second shortest paths through the network of network nodes; and provisioning the second shortest paths in the network of nodes.

Systems and methods for modeling and optimizing a telecommunications network

Aspects of the present disclosure include systems, methods, computing devices, computer-implemented methods, and the like for modeling and/or simulating performance of a telecommunications network during one or more failure scenarios that reduces computational time and/or power over previous simulation techniques. Modeling and simulating the network may include generating an initial network model from network data information and applying one or more transformations to the initial network model to reduce the size of the model. Following transformation, simulation methods may be applied to the generated network model based on routing characteristics of the components of the network. To reduce the computations utilized to simulate such components and/or routing decisions in the network, one or more simulation algorithms may be applied to the transformed network model to reduce the number of routing decisions simulated.

METHOD AND APPARATUS FOR CONTROLLING NETWORK TRAFFIC PATH

The present invention discloses a method and an apparatus for controlling a network traffic path. The method includes: receiving routing advertisement information from a first network to a second network; determining all routing nodes included in a path through which data pass when flowing from the second network to the first network according to the routing advertisement information; and configuring a next hop routing node for each determined routing node, where the next hop routing node is a node in all the routing nodes included in the path and is adjacent to the routing node for which the next hop routing node is configured, and the routing node for which the next hop routing node is configured does not include a routing node of the first network or a routing node of the second network.

SHARED RISK LINK GROUP-DISJOINT ROUTING IN DATA COMMUNICATION NETWORKS

Systems and methods are disclosed for determining shared risk link group (SRLG) disjoint paths in a communications network. An original graph representing the communications network can be obtained. The original graph can include vertices and edges corresponding to nodes and communication links in the communication network. The vertices can include a source vertex and a target vertex and each edge can be associated with a set of SRLGs A reduced graph can be generated from the original graph. Generation of the reduced graph can include identification of a first edge of the edges as a dominating edge and removal of the first edge. Two SRLG-disjoint paths can then be identified on the reduced graph.

Information acquisition method and device based on shortest path of knowledge graph

The invention provides an information acquisition method and device based on a shortest path of a knowledge graph, and the method comprises the steps: initially setting an iteration starting point according to a shortest path searching strategy and a node in a user request, and determining the shortest path of the iteration starting point; forming a first node set by taking the nodes with the determined shortest path and the adjacent nodes with the undetermined shortest path as first nodes, selecting the adjacent node closest to the iteration starting point from the adjacent nodes with the undetermined shortest path of the first nodes in the first node set to determine the shortest path, and updating the first node set; the above steps are repeated until all expected shortest paths are found, and the expected shortest paths are related to the shortest path searching strategy; and obtaining information from the knowledge graph according to the shortest path of each node, and responding to ...

Message forwarding method and device, and dragonfly network

The invention discloses a message forwarding method and device and a dragonfly network, and belongs to the technical field of communication. And the first network device in the first device group receives a first message sent by the first terminal device connected with the first network device, wherein the destination address of the first message is the IP address of the second terminal device connected with the second network device in the second device group. And when a first inter-group interconnection link exists between the first network equipment and the second equipment group and the first inter-group interconnection link is not congested, the first network equipment sends a first message to the second network equipment through the first inter-group interconnection link. In the application, the first network device preferentially selects the inter-group interconnection link between the first network device and the second device group to send the message to the second network device ...

MESSAGE SENDING METHOD, MESSAGE RECEIVING METHOD, ELECTRONIC DEVICE, MESSAGE SENDING AND RECEIVING SYSTEM, AND STORAGE MEDIUM

Disclosed are a packet sending method, a packet receiving method, an electronic device, a packet sending and receiving system, and a storage medium. The packet sending method may include: acquiring a current sequence number of a current link-state packet; generating a link-state packet with a transition sequence number according to the current sequence number, the link-state packet with the transition sequence number is newer than a link-state packet with a maximum sequence number and older than a link-state packet with an initial sequence number; and sending the link-state packet with the transition sequence number.

Routing of optical signals

A method may include obtaining a topology of an optical network. The topology may indicate multiple optical links within the optical network. The method may also include determining a signal noise tolerance for each of multiple optical signal types supported by the optical network and obtaining an optical noise for each of the multiple optical links. The method may also include determining a number of the multiple optical signal types that each of the multiple optical links is able to support based on the optical noise for each of the optical links and the signal noise tolerance for each of the multiple optical signal types and ranking the multiple optical links based on the number of the multiple optical signal types that each of the optical links is able to support.

Methods, apparatuses and computer program products for generating transmission path objects based on data object transmissions in a network service cloud

Various examples herein described are directed to methods, apparatuses and computer program products configured for tracking, tracing, and/or diagnosing data object transmissions in a network service cloud. In some embodiments, a path finder server entity may transmit one or more Application Programming Interface (API) calls to one or more APIs associated with the network service cloud to obtain one or more data routing table objects, and may determine transmission paths of data objects based at least in part on the data routing table objects.

Performance-Based Prioritization For Storage Systems Replicating A Dataset

Prioritizing highly performant storage systems for servicing a synchronously replicated dataset: detecting a communication fault between two or more storage systems that are synchronously replicating a dataset; identifying a preferred storage system for winning mediation, including determining that the preferred storage system winning mediation would result in better performance than other storage systems winning mediation; and requesting, by the preferred storage system, mediation from a mediation target.

METHOD FOR SELECTING A COMMUNICATION ROUTE

Standby path deployment method and system for programmable network fault recovery

The invention discloses a standby path deployment method and system for programmable network fault recovery, and the method comprises the steps: obtaining the centrality of a switch through employing the betweenness centrality according to the requirements of a node pair in a network for time delay and reliability; calculating the network resource consumption of the standby path according to the time delay, the reliability and the bandwidth so as to obtain the weight of the standby path; obtaining an optimal standby path of important switch nodes in the network by adopting a heuristic algorithm according to the requirements of network resources and users on standby paths; and the control plane issues the optimal standby path set to a programmable computing plane to complete deployment of standby paths. According to the method, standby paths which meet the requirements of time delay and reliability and are as few as possible can be provided for the network within the polynomial time, so ...

Modified graceful restart

A network node has a graceful restart mode in which the node: sends a graceful restart notification to one or more neighbouring nodes; attempts to re-establish an adjacency with the neighbouring node(s); receives link state data from at least one of the neighbouring node(s), the received data being sent in response to said attempt; derives pre-restart link data from the received data, the derived data identifying formerly active links, including the node, for routing traffic before the restart; routes network traffic in accordance with routing information stored in the router; detects one or more links, of the formerly active links, which are currently inactive; continues with graceful restart after said detection; determines one or more links, of the formerly active links, which are currently active; and exits the graceful restart mode in response to successful re-establishment of adjacencies with a respective neighbouring node for each of the currently active link(s).

PATH SETTING SYSTEM, CONTROL DEVICE, PROGRAM AND PATH SETTING METHOD

An end-to-end path can be set without providing a hierarchy in a control device of a multi-domain network. A path setting system (10) includes an orchestrator 200 and a control device (100). The orchestrator (200) generates path candidates corresponding to a line of domains through which paths that are candidates for a path pass and transmits the path candidates to control devices (100) of domains through which the path candidates pass to request setting of the path. The control device (100) acquires, from the control devices (100) of other domains through which path candidates pass, metrics of the path candidates in the domains, calculates total metrics, selects an optimum path, and sets the optimum path.

Geo tagging for advanced analytics and policy enforcement on remote devices

Systems and methods implemented in a node in a cloud-based system include loading a data structure into memory, wherein the data structure includes cities mapped to cells where the cells cover all of the Earth; receiving a call with a given latitude and longitude of a user device; finding a closest city to the given latitude and longitude utilizing the data structure; and providing the closest city in response to the call. The systems and methods can also include utilizing the closest city for policy in the cloud-based system for the user device.

Multifunctional Telemetry Apparatus for real-time emergency support

Multifunctional telemetry apparatus for real-time emergency support comprising biosensors set of electrical biosensors set, green LEDs, red LEDs, infrared LEDs, near infrared LEDs and photodetector set and temperature biosensor, accelerometer, pressure sensor set and wireless antenna, which enables the life-support network to infer and monitor user's present condition through a plurality of real-time biological information, clinical emergency conditions, movement data and events of victimizer unstrapping the apparatus. The embodiments of the multifunctional telemetry apparatus to track emergency situations through analysis of tracking information even in moving conditions or victimizer based emergency situation without active inputs or active involvement from user. Classified clinical emergency and child tracking applications synchronized to the emergency support apparatus, and these applications operated by the life-support having classified trigger commands and tracking information displayed ...

Relay node selection method, apparatus and device, and computer readable storage medium

The embodiment of the invention relates to the technical field of Internet of Things, and discloses a relay node selection method, which is applied to a source node and comprises the following steps: sending signals to each relay node and a destination node; the relay node is any one relay node in a cooperative relay group; acquiring a first signal-to-noise ratio and a second signal-to-noise ratio of the destination node; the first signal-to-noise ratio is the signal-to-noise ratio of the destination node when the source node directly sends a signal to the destination node, and the second signal-to-noise ratio is the signal-to-noise ratio of the destination node when the source node sends a signal to the destination node through a link of the relay node; and according to the first signal-to-noise ratio and the second signal-to-noise ratio, determining an optimal relay node from the relay nodes by adopting a reinforcement learning algorithm. According to the embodiment of the invention, ...

Secure trusted path node compression method and device

The invention discloses a secure and trusted path node compression method and device. The method comprises the following steps: acquiring an SRv6 path node sequence and an SPF path node sequence from a head node S to a destination node D; traversing the SPF node sequence and the SRv6 node sequence to obtain the same node sequence on the two paths; operating an S-card algorithm, and circularly judging the position relation of adjacent nodes in the same node sequence in the SRv6 path and the SPF shortest path; corresponding operation is executed according to the relation between the SRv6 path and the shortest path; and outputting a compressed node sequence corresponding to the SRv6 path node sequence. The method has the advantages that safe and credible path selection can be provided for a user, meanwhile, the number of routes in a network is effectively reduced, and the problem that an SRv6 packet header is too long is effectively solved.

Multi-attribute multi-metric routing decision method suitable for mobile AdHoc network

The invention discloses a multi-attribute and multi-metric routing decision-making method suitable for a mobile AdHoc network, and belongs to the field of routing decision-making of the mobile AdHoc network. The existing routing protocol based on energy optimization has defects. According to the method, a model simplification method based on a vertex clustering method is adopted to simplify the topology; performing multi-attribute cluster head election based on AHP and an entropy method; decision making is carried out by adopting a subjective and objective combined weighting mode, and for a cluster head selection stage of a cluster protocol, multi-attribute decision-making cluster head election is carried out by utilizing an AHP and an entropy evaluation method; an optimal path is sought based on a weighted TOPSIS decision and a multi-metric mechanism; by using a weighted TOPSIS method, adding a corresponding parameter weight to the distance when the distance between advantages and disadvantages ...

Method and apparatus for distributed data network traffic optimization

Embodiments disclosed include a method and apparatus for global traffic control and optimization for software-defined networks. In an embodiment, data traffic is optimized by distributing predefined metrics (data traffic information) to all controllers in the network. The predefined metrics are specific to local network switches and controllers, but are distributed to all peers at configurable intervals. “Local” as used herein implies one POP and its associated switch and controller. The method of distribution of local POP metrics is strictly in band using a packet as defined by the protocol used by the data network.

SYSTEM AND METHOD FOR FAULT RECOVERY IN SPRAY BASED NETWORKS

Embodiments of the present disclosure include systems and methods for fault detection and recovery over a network. A value of a set of values is stored in packets transmitted during a data transaction between a source and destination. The value corresponds to ports used by one or more switches in the path between the source and destination. The destination includes the value in an acknowledgement packet. Logic circuits in the source device track packets and corresponding values. When a status indicates a particular packet has not received an acknowledgement, the value for the packet may be removed from the set of values. Particular ports that may be congested or down may be detected and the packets re-routed using the logic circuits in the source device.

BANDWIDTH CONSTRAINT FOR MULTIPATH SEGMENT ROUTING

In an example, a method includes computing, by a computing device, for a segment routing policy that specifies a bandwidth constraint for the segment routing policy, first shortest paths through a network of network nodes, wherein each shortest path of the first shortest paths represents a different sequence of links connecting pairs of the network nodes from a source to a destination; in response to determining, by the computing device based on the bandwidth constraint for the segment routing policy, a link of one of the first shortest paths has insufficient bandwidth to meet a required bandwidth for the link, increasing a metric of the link; computing, by the computing device, for the segment routing policy that specifies the bandwidth constraint, based on the increased metric of the link, second shortest paths through the network of network nodes; and provisioning the second shortest paths in the network of nodes.

Network system and congestion control method

A transmission terminal has a plurality of congestion control units (RPs) each controlling a frame transmission rate. A switch arranged between the transmission terminal and a reception terminal has a plurality of congestion detection units (CPs) each generating a congestion information notification frame addressed to the transmission terminal. A plurality of routes exist between the transmission terminal and the reception terminal. The management computer manages a correspondence relationship between the routes and the RPs, assigns any of the routes to a flow, selects a RP associated with a route assigned to the flow, and notifies the transmission terminal and the switch of the flow and the selected RP. When the switch receives a frame belonging to the flow, a CP associated with the selected RP generates the congestion information notification frame addressed to the selected RP. The transmission terminal transmits a frame belonging to the flow through the selected RP.

Automated traffic engineering for fat tree networks

Embodiments of a method implemented in at least one fat tree network node for improved load distribution, wherein the node is one of a plurality of fat tree network nodes in a fat tree network each of which implement a tie-breaking process to produce minimum cost trees, is described. In some embodiments, a spanning tree computation for each root node of the fat tree network in order from a lowest ranked root node to a highest ranked node is performed, a filtering database for each root node of the fat tree network, wherein the filtering database includes a set of media access control (MAC) addresses of the leaf nodes of the fat tree network generated, and link utilization for each computed tree to use as a prefix to link identifiers used for at least one tie-breaking algorithm added.

Authorizing Equipment on a Sub-Network

Systems and methods for authorizing a customer premise equipment (CPE) device to join a network through a network termination unit (NTU). The CPE device can send an encrypted connection request, and an authorization server can decrypt the connection request and provide a network membership key (NMK) associated with the CPE device to the NTU. The authorization server can encrypt the NMK associated with the CPE device using a device access key (DAK) associated with the NTU.

Methods and apparatus for hierarchical routing in communication networks

Methods and apparatus for hierarchical routing in communication networks are disclosed. An example hierarchical routing method for a communication network disclosed herein comprises determining a plurality of constrained weighted paths to connect pairs of border nodes of a cluster in the communication network, each constrained weighted path having a respective bandwidth and a respective weight, a constrained weighted path for a pair of border nodes of the cluster being selected, based on a bandwidth threshold, from a set of possible paths capable of connecting the pair of border nodes, and advertising the plurality of constrained weighted paths determined for the cluster.

Multiplexing and demultiplexing radio channels

In one embodiment, a method and apparatus of multiplexing and demultiplexing radio channels includes receiving data through at least one multicast media channel available for use in an Internet Protocol Interoperability and Communications System (IPICS) comprising multiple communication endpoints linkable to a Land Mobile Radio (LMR) in the IPICS; channel mapping the at least one multicast media channel to multiple media channels of the LMR; receiving an audio signal through the at least one multicast media channel; controlling access to the LMR by applying communication access control policies based on the received data upon reception of the audio signal; and operatively linking the LMR to a specified endpoint through the at least one multicast media channel based on the communication access control policies.

Methods and apparatuses for path selection in a packet network

Embodiments including methods, systems, and apparatuses for distributing, processing, and reacting to path information distributed via a service-agnostic packet fabric for the purpose of enabling path selection are disclosed. By configuring two ingress line cards to send path quality words to each other via the switch fabric, compare the path quality words, and determine whether to transmit traffic to an egress line card via the switch fabric based on the comparison of the path quality words, the embodiments enable a central switch fabric to be unaware of the paths that it carries, and enable both ingress and egress bandwidth of the switch fabric to be sized according to the facilities for which it is terminating. The switch fabric does not need to support working and protection paths simultaneously in some embodiments, allowing it to be scaled appropriately to termination facilities.

Server, method and system for providing node information for p2p network

The invention provides a server, a method and a system for providing node information for P2P network. A server in a peer-to-peer (P2P) network comprises: a location information storage unit which stores coordinate information indicating a coordinate of each data node in the P2P network in a coordinate system that is created based on communication delays among data nodes in the P2P network; and a node information providing unit which, upon receipt of a request for information on data nodes having a first data item, selects one or more data nodes from data nodes having the first data item based on the coordinate information, and provides information indicating the selected one or more data nodes.

Method and apparatus for path computation element and routing controller cooperation

A system, method, and node for a Routing Controller (RC) to obtain from a Path Computation Element (PCE), network resource path metrics across a plurality of domains in a communication network in which each domain includes a plurality of Border Nodes (BNs). The RC sends to the PCE, a first message requesting a first path computation between each pair of BNs. The first message contains a maximum metric-value that a path computation must not exceed for a Path Computation Client (PCC) to consider the path computation acceptable. The RC then sends a second message requesting the PCE to compute a subsequent path computation for each BN pair for which the first path computation did not exceed the maximum metric-value. The second message contains a minimum metric-value that a path metric must exceed for the PCC to consider the path metric acceptable. The RC then receives the computed subsequent path computation.

Systems and methods for distributed data routing in a wireless network

Various systems and methods described herein relate to distributed data routing over a wireless network. An exemplary method comprises receiving routing data by a routing element of a point to point wireless network, the routing data comprising routing criteria and a plurality of path identifiers which identify a plurality of paths through the wireless network, storing the routing data by the routing element, receiving a packet of data, determining a destination node of the packet of data, the destination node being identified using the routing data as accessible by two or more paths of the plurality of paths, determining, based on the routing criteria of the routing data, at least one path of the plurality of paths to transmit the packet of data to reach the destination node, and transmitting the packet of data to a first node of the determined at least one path of the wireless network.

Multi-Chassis Link Aggregation on Network Devices

A data communication network includes a client device and multiple aggregation devices coupled to each other and the client via links within a link aggregation group (“LAG”) across the aggregation devices. The aggregation devices appear to the client as a single device coupled thereto, and operate in conjunction with each other by assigning at least one different identifier to each of the plurality of separate aggregation devices and storing information including the identifiers to association tables located on each of the aggregation devices. The multiple aggregation devices can be separate switches, and the LAG can include multiple ports across the switches, with a different identifier being assigned to each of the ports in the LAG. A virtual link trunk interface can couple aggregation devices, which can reconfigure communication paths thereacross with respect to the client device using the identifiers in the stored association tables when a LAG link fails.

Topology-based consolidation of link state information

A method in a network element that forwards packets to destination nodes includes identifying groups of the destination nodes. Respective performance metrics of multiple different candidate network paths, over which the destination nodes in a given group are reachable from the network element, are estimated jointly for all the destination nodes in the given group. A network path is selected from among the candidate network paths based on the estimated performance metrics. The packets addressed to the destination nodes in the given group are forwarded over the selected network path.

Method and apparatus for selecting between multiple equal cost paths

Each equal cost path is assigned a path ID created by concatenating an ordered set of link IDs which form the path through the network. The link IDs are created from the node IDs on either set of the link. The link IDs are sorted from lowest to highest to facilitate ranking of the paths. The low and high ranked paths are selected from this ranked list as the first set of diverse paths through the network. Each of the link IDs on each of the paths is then renamed, for example by inverting either all of the high node IDs or low node IDs. After re-naming the links, new path IDs are created by concatenating an ordered set of renamed link IDs. The paths are then re-ranked and the low and high re-ranked paths are selected from this re-ranked list as the second set of diverse paths.

Method and apparatus for resilient routing of control traffic in a split-architecture system

The invention is a routing algorithm characteristic that minimizes the weight, meaning that the probability that a node is disconnected from the controller in case of a failure in the network is minimized. The first algorithm used in the invention is an approximation algorithm for finding the controller routing tree that provides maximum resilience in the network. The algorithm is referred to herein as the Maximum Resilience (MR) algorithm. The heuristic MR algorithm selects a shortest-path tree as a starting point and modifies the tree in order to improve resilience. The output of the MR algorithm is not necessarily a shortest-path tree, but provides more resilience compared to the initial tree. The RASP algorithm provides a shortest-path tree with improved network resilience compared to other possible shortest-path trees.

Multi-protocol network registration and address resolution

The functionality of communications standards and protocols that are application-layer specific are overlaid on an IP-based infrastructure, by employing an IP DNS server as the registration host for IP and other communications standards based and protocol based communications. Communication can occur at either the IP layer or the communications standards or protocol application layer. At the IP layer, a host application can interrogate network nodes. To extend this service to other communications standards or protocol communications, device registration and resolve services are implemented on the DNS server. Similar to the manner in which an IP-based service uses a native, IP-based DNS resolve request, a host can utilize a resolution request against the communications standards and protocol-enabled DNS server for standards and protocol application-layer interrogation of endpoints.

Wireless communication network system

In a wireless communication network system and on a route of a network which is being used for communication, in case a fall of transmission rate occurs depending on AMR, there is an inconvenience that, even though there exists another route with faster transmission rate, switching to it cannot be made. The route selection method of the present invention is a route selection method in a communication network using a microwave communication system, and depending on the changes in transmission capacity of each route of the network, a route with larger transmission capacity is selected as the route to communicate.

Method For Applying Macro-Controls Onto IP Networks Using Intelligent Route Indexing

Systems and methods are described that manage routing information in an IP network using extensible indexing and use the indexing to control the network. The indexing and associated controls apply to any router within the routing domain. 1. A method for managing route information in an IP network comprising:by a processor, storing in a data store, route information from the IP network for a plurality of network routes;by the processor, associating with each network route an index having at least five alpha-numeric index fields containing information from the data store, including index fields representing each one of a network route source geographic location, a network route destination geographic location, a network route priority, whether the network route has an alternate path and whether an application associated with the network route is delay tolerant;by the processor, acquiring one or more network operating conditions from the IP network;by the processor, based on the one or more network operating conditions, executing a predetermined control action modifying a plurality of the network routes having one or more matching index fields.2. The method according to wherein the network operating conditions comprise dynamic network operating conditions.3. The method according to claim 2 , wherein executing a predetermined control action modifying a plurality of the network routes having one or more matching index fields further comprises:associating a predetermined operating threshold for each dynamic network operating condition; andif a dynamic network operating condition exceeds its predetermined operating threshold, triggering the predetermined control action.4. The method according to wherein one predetermined operating threshold is time of day.5. The method according to wherein one predetermined operating threshold is IP network failure.6. The method according to wherein a route index further includes customer subscription information.7. The method according to ...

Network traffic distribution

A switch for a switching network includes a plurality of ports for communicating data traffic and a switch controller that controls switching between the plurality of ports. The switch controller selects a forwarding path for the data traffic based on at least topological congestion information for the switching network. In a preferred embodiment, the topological congestion information includes sFlow topological congestion information and the switch controller includes an sFlow client that receives the sFlow topological congestion information from an sFlow controller in the switching network.

Multi-metric routing calculations

In a Mobile Ad Hoc Network (MANET), multi-metric information is gathered and applied to a cost-based route calculation. In particular, each node gathers resource metrics from neighboring of nodes, along with data rate and reliability information for data links to and from the node. This information is applied to a costing algorithm such as Dykstra' Open Shortest Path First algorithm to obtain routes through the network. This approach may be adapted with suitable modifications to use with unicast traffic or with a multicast forwarding group.

DEVICE AND METHOD FOR EGRESS PACKET FORWARDING USING MESH TAGGING

A method for packet forwarding using a tag in a mesh network is described herein. A packet is received on a non-mesh port of a first mesh network device of the mesh network. One or more available paths between the first mesh network device and a second mesh network device are determined. A path of the one or more available paths is selected based on an egress forwarding rule associated with the path. A tag associated with the selected path is inserted into the packet. The packet is forwarded along the selected path. 1. A method for packet forwarding using a tag in a mesh network , the method comprising:receiving a packet on a non-mesh port of a first mesh network device of the mesh network;determining one or more available paths between the first mesh network device and a second mesh network device;selecting a path of the one or more available paths based on an egress forwarding rule associated with the path;inserting a tag associated with the selected path into the packet; andforwarding the packet along the selected path.2. The method of claim 1 , wherein the egress forwarding rule specifies limitations on forwarding packets on egress through mesh network devices of the mesh network.3. The method of claim 1 , wherein selecting the path comprises comparing an ingress component of the egress forwarding rule to a property of the packet.4. The method of claim 1 , further comprising:receiving the packet on a mesh port of a mesh network device of the mesh network; anddetermining whether the packet is a unicast packet.5. The method of claim 4 , wherein the packet is a unicast packet claim 4 , her comprising:determining that the path of the packet within the mesh network terminates at the receiving mesh network device;removing the tag from the packet; andforwarding the packet out of one or more non-mesh ports corresponding to the tag.6. The method of claim 4 , wherein the packet is a unicast packet claim 4 , further comprising:determining that the path of the packet within ...

Point to Multi-Point Based Multicast Label Distribution Protocol Local Protection Solution

In one aspect, the disclosure includes an apparatus comprising a processor configured to function as a merge point (MP) in a point to multi-point (P2MP) backup label switching path (LSP) for a primary LSP, receive P2MP backup LSP information originating from a protected node, wherein the P2MP backup LSP information comprises the identity of a point of local repair (PLR), determine a backup label switching router (LSR), and send a message with the identity of the backup LSR to an upstream node.

Method and a device for bulk data transfer in delay-tolerant networks

The method comprises modelling a delay-tolerant dynamic network comprising time-varying links transforming it into a static time-expanded network graph, and managing bulk data transfer on the basis of said static time-expanded network graph. The device comprises a scheduler unit with processing capabilities implementing an algorithm which processes arc costs (c ij t ) and storage costs (p i t ) as per the method of the first aspect of the invention.

METHOD AND SYSTEM FOR EXTENDING ROUTING DOMAIN TO NON-ROUTING END STATIONS

A system is provided for facilitating assignment of a virtual routing node identifier to a non-routing node. During operation, the system assigns to a non-routing node coupled to a switch a virtual routing node identifier unique to the non-routing node. In addition, the system communicates reachability information corresponding to the virtual routing node identifier to other switches in the network. 1. A switch , comprising:a processor; generating a virtual routing node identifier for a non-routing node, wherein the virtual routing node identifier indicates a multi-switch link aggregation; and', 'precluding a received multi-destination frame from being forwarded to the non-routing node when an ingress-node field of the multi-destination frame matches the virtual routing node identifier, thereby, 'a storage device coupled to the processor and storing instructions which when executed by the processor cause the processor to perform a method, the method comprisingavoiding duplication of the multi-destination frame.2. The switch of claim 1 , wherein the switch is a capable of routing layer-2 data frames without requiring the network topology to be a spanning tree topology.3. The switch of claim 1 , wherein the virtual routing node identifier is a routing bridge identifier in accordance with a Transparent Interconnection of Lots of Links (TRILL) protocol.4. The switch of claim 1 , wherein the method further comprises constructing a frame containing reachability information corresponding to the virtual routing node identifier.5. The switch of claim 1 , wherein the method further comprises marking an ingress-node field of a frame received from the non-routing node with the virtual routing node identifier.6. The switch of claim 1 , wherein the method further comprises communicating to a second switch which is part of the multi-switch link aggregation a MAC address learned from a port to which the none-routing node is coupled.7. The switch of claim 1 , wherein in response to ...

Label switching or equivalent network multipath traffic control

A method, a device, and a storage medium provide for receiving packets; determining a traffic flow rate value pertaining to the packets; comparing the traffic flow rate value to a flow rate threshold value; selecting one or more candidate paths that are not bandwidth-aware; calculating a current available bandwidth for each of the one or more candidate paths; selecting one or more of the one or more candidate paths based on the traffic flow rate value and the current available bandwidth; and transmitting the packets to a destination via the one or more of the one or more candidate paths.

SHORTEST PATH DETERMINATION FOR LARGE GRAPHS

A computer-implemented method and system are provided for determining the shortest path between two nodes in a network comprising a plurality of nodes. A non-transitory computer-readable medium is also provided that includes a plurality of instructions that, when executed by at least one electronic device, at least cause the at least one electronic device to determine the shortest path between two nodes in a network comprising a plurality of nodes. 1. A computer-implemented method for determining the shortest path between two nodes in a network comprising a plurality of nodes , the method comprising:receiving a graph comprising at least one node with each node having coordinates for locating the node in a corresponding cell when a grid is laid over thegraph; finding connection nodes that are not contained within a cell but are connected with at least one node located in a specific cell;preprocessing the graph by determining the shortest paths between connection nodes for a pair of cells; andsearching for the shortest path between any two nodes;wherein the shortest paths between the two nodes will go only through nodes that are involved in the shortest paths between the connection nodes of the two cells in which the two nodes are located.2. The method of claim 1 , wherein the preprocessing includes at least one of:searching for the shortest path from a node in one cell to a node in another cell;identifying the nodes used in the shortest paths between the connection nodes of the two cells; andstoring a list of the nodes being used in the shortest path in a record having a searchable key representing the shortest path searched for the pair of cells.3. The method of claim 2 , further comprising determining in which cells start and end points are located on the graph using the coordinates of any two nodes corresponding to the start and end points and retrieving the list of nodes identified in the shortest paths between the start and end points.4. The method of claim 3 , ...

PATH FINDING SYSTEM, COMPUTER, CONTROL METHOD, AND PROGRAM

Each node configuring a network performs a process to finding a path in an autonomously and distributed manner without knowing information of the entire network. A computer functioning as a node configuring a network includes: an adjacent-node communication unit that acquires a provisional pressure value and an approximate pressure value of an adjacent node adjacent to the node itself from the adjacent node; an approximate-pressure-value calculation unit that calculates an approximate pressure value of the node itself using a pipe diameter value and the length of each link connected to the node itself, the provisional pressure value of the adjacent node, and a previously given source or sink flux of the node itself; a flux value calculation unit that calculates a flux flowing through each link using the pipe diameter value, the length, the approximate pressure value of the adjacent node, and the approximate pressure value of the node itself; and a pipe diameter value updating unit that updates the pipe diameter value using the flux flowing through each link, the pipe diameter value, and a function representing a feature of slime mold, wherein calculation of the approximate pressure value, calculation of the flux, and updating of the pipe diameter value are iteratively performed at least until the pipe diameter value converges. 1. A computer functioning as a node configuring a network , the computer comprising:an adjacent-node communication unit that acquires a provisional pressure value and an approximate pressure value of an adjacent node adjacent to the node itself from the adjacent node;an approximate-pressure-value calculation unit that calculates an approximate pressure value of the node itself using a pipe diameter value and the length of each link connected to the node itself, the provisional pressure value of the adjacent node, and a previously given source or sink flux of the node itself;a flux value calculation unit that calculates a flux flowing through ...

Network traffic distribution

A switch for a switching network includes a plurality of ports for communicating data traffic and a switch controller that controls switching between the plurality of ports. The switch controller selects a forwarding path for the data traffic based on at least topological congestion information for the switching network. In a preferred embodiment, the topological congestion information includes sFlow topological congestion information and the switch controller includes an sFlow client that receives the sFlow topological congestion information from an sFlow controller in the switching network.

Method and system of congestion control in a mobile virtual network

An approach is provided for dynamic congestion control among mobile virtual routers. A determination is made whether a congested segment of a network of a plurality of physical routers. A temporary congestion point is created at a mobile virtual router to divert traffic away from the congested segment using logical tunnels over non-congested physical links, wherein the mobile virtual router is configured to utilize resources of at least two of the physical routers.

Method and a System for Providing a Flexible Secondary Data Path

A method and an apparatus for providing a flexible secondary data path control, said method comprising the steps of: detecting (S 1 ) a primary data path failure of a primary data path between a customer premise site ( 3 ) and a central office site ( 4 ); initiating (S 2 ) a corresponding secondary data path if a primary data path failure of said primary data path has been detected; initiating (S 3 ) a measurement of data path characteristics of said initiated secondary path or utilizing constantly monitored data path characteristics of paths for an available secondary data path; and determining (S 4 ) services to be provided via said secondary data path depending on the measured data path characteristics of said secondary data path.

Multi-Path Data Transfer Using Network Coding

Techniques, devices, systems, and protocols are disclosed herein that relate to data transfer between communication nodes via multiple heterogeneous paths. In various embodiments, network coding may he used to improve data flow and reliability in a multiple path scenario. Transmission control protocol (TCP) may also be used within different paths to further enhance data transfer reliability. In some embodiments, multiple levels of network coding may be provided within a transmitter in a multiple path scenario, with one level being applied across ail paths and another being applied within individual paths.

TRANSMISSION SYSTEM, MANAGING COMPUTER, AND LOGICAL PATH CONSTRUCTION METHOD

A transmission system that uses resources of a transmission network efficiently to a request of dynamic bandwidth guarantee from a communication network while controlling a load of a managing server, and connects a logical path of the communication network and a logical path of a transmission network. In the transmission system that has multiple transmission nodes each serving as a component of the transmission network, multiple communication nodes each serving as a component of the communication network, and a managing computer, when an available bandwidth of a default path is smaller than a guaranteed bandwidth contained in control information and then when information about the logical path already having been dynamically constructed coincides with a condition, a logical path that uses a route different from a specified default path is dynamically constructed as a logical path in the transmission network. 1. A transmission system that comprisesa plurality of transmission nodes each serving as a component of a transmission network,a plurality of communication nodes each serving as a component of a communications network, anda managing computer of when a first communication node among the communication nodes connected to one another through a transmission network establishes a session with a second communication node thereamong, constructing a first logical path showing a communication path running from the transmission node serving as a start point to the transmission node serving as a terminal point in the transmission network,wherein the managing computer constructs a default path that uses a shortest route between two arbitrary transmission nodes connected to the communication node in advance, stores default path identification information and a destination of information passing through the default path with the both mapped to each other, and sets up a condition about the first logical path dynamically constructed in the managing computer in advance,wherein ...

Mobile internet service system for long distance trains

Embodiments described herein generally relate to providing communication services to client devices in a transport system. In some examples, methods of providing communication services to client devices in a transport system are described. The methods can include exchanging, among a multiple number of routers provided in a transport system, status information of each of the multiple number of routers. The methods can also include receiving, at a given router included in the multiple number of routers, a communication addressed to a remote server accessible through a first network. The communication may be received from a client device connected to the given router through a second network different than the first network. The methods can also include, based on the status information, routing the communication to the remote server through at least the given router and the first network.

STORAGE AREA NETWORK MULTI-PATHING

Provided are a method, computer program product and system for network multi-pathing. Paths to a storage system are through a first network type and a second network type. The first network type has a higher Input/Output (I/O) per second performance characteristic than the second network type. A length is determined from a received I/O request. The I/O request is sent on one of the paths to the storage system through the first network type in response to determining that the length of the I/O request is below a threshold length. The I/O request is sent on one of the paths to the storage system through the second network type in response to determining that the length of the I/O request is above the threshold length. 1. A method for network multi-pathing , comprising:maintaining paths to a storage system through a first network type and a second network type, wherein the first network type has a higher Input/Output (I/O) per second performance characteristic than the second network type;receiving an I/O request;determining a length of the I/O request:sending the I/O request on one of the paths to the storage system through the first network type in response to determining that the length of the I/O request is below a threshold length;sending the I/O request on one of the paths to the storage system through the second network type in response to determining that the length of the I/O request is above the threshold length.2. The method of claim 1 , further comprising:determining whether a bandwidth of the second network type is full for a time period in response to determining that the length of the I/O request is above the threshold length;sending the I/O request having the length above the threshold length on one of the paths to the storage system through the first network type in response to determining that the bandwidth of the second network type is full.3. The method of claim 2 , wherein determining whether the bandwidth of the second network type is full ...

Diverse paths using a single source route in computer networks

In one embodiment, a source device determines a source route from itself to a destination device in a computer network, and forwards a first packet on the source route with the source route included within the first packet. In addition, the source device generates a second packet with the source route included within the second packet, the second packet also including an indication to cause one or more of a plurality of transit devices to forward the second packet to a reachable 1-hop neighbor of a device in the source route two hops away from the respective transit device. The source device may then forward the second packet itself, as do one the one or more transit devices on a diverse path based on the source route, to a particular reachable 1-hop neighbor of a particular device in the source route two hops away from the source (or transit) device.

Communications network

A passive optical network is provided which uses existing GPON OAM functionality and standard routing protocol messages to solve the downstream routing problem between an access service provider and one or more other communication provider networks.

Discovery technique for physical media interface aggregation

Various discovery techniques are described for physical media interface aggregation.

Methods and apparatus to determine a capacity for a network layer topology

Methods and apparatus to determine a capacity for a network topology are disclosed herein. An example method includes accessing a topology comprising a plurality of links; applying weights to the links; selecting a traffic element, the selected traffic element comprising a source node, a destination node, and a traffic demand; for each of the links: (a) determining for a selected link from the plurality of the links, whether the selected traffic element may be routed on the selected link without adding capacity to the selected link; and (b) applying penalties to the weights associated with the links that cannot support the selected traffic element without adding capacity; determining, based on the weights and penalties of the links, a routing path comprising at least one of the links between the source node and the destination node; and determining capacities of at least some of the links based on the routing path.

SYSTEM AND METHOD FOR DIRECTING CLIENTS TO OPTIMAL SERVERS IN COMPUTER NETWORKS

A communication protocol includes one or more messages passed between Web routers over a reliable transmission protocol used for inter-Web router communication. These messages include information that allows the Web routers to dynamically update mappings of client addresses or address ranges to information object repository addresses based on client-to-server distance and server load. The mappings are preferably optimal mappings of the client addresses or address ranges to the information object repository addresses and the messages report updated distances from these information object repository addresses to the client addresses or address ranges. For example, the messages may report, for each updated distance, an associated client address or address range and/or an associated anchor address of a Web router co-located with an information object repository that is the subject of the message. 131-. (canceled)32. A method , comprising receiving , at a first Web router , an inter-Web router communication message including an update for a mapping between a client and a second Web router and updating , at the first Web router , a client-to-Web router table to include the mapping between the client and the second Web router if this client-to-Web router mapping specifies a better client-to-Web router distance than is currently maintained in the client-to-Web router table for the client.33. The method of further comprising propagating the mapping between the client and the second Web router to neighbor Web routers of the first Web router.34. The method of further comprising using the mapping between the client and the second Web router to compute a client-to-server mapping.35. The method of further comprising updating claim 34 , at the first Web router claim 34 , a client-to-server table to include the client-to-server mapping if the client-to-server mapping specifies a better client-to-server distance than is currently maintained in the client-to-server table for the ...

METHODS FOR CONTROLLING ELECTIONS IN A MULTICAST NETWORK

Methods for controlling a Designated Forwarder (DF) election in a multicast network are described herein. The multicast network includes a plurality of multicast network devices, including a first network device and a second network device. A Designated Forwarder is determined. It is determined whether to initiate a Designated Forwarder election based on a comparison of a metric measuring a distance to a Rendezvous Point Address from a first network device and a metric measuring the distance to the Rendezvous Point Address from the second network device. 1. A method for controlling a Designated Forwarder (DF) election in a multicast network , the multicast network including a plurality of multicast network devices , the method comprising:detecting, by a first network device of the plurality of multicast network devices, an active state on a second network device of the plurality of multicast network devices;identifying the first network device as an acting DF to the second network device; andtransmitting a notification of a metric measuring a distance from the first network device to a Rendezvous Point Address of the multicast network, wherein a DF election is initiated based on a comparison of the metric measuring the distance from the first network device and a metric measuring the distance to the Rendezvous Point Address from the second network device.2. The method of wherein identifying the first network device comprises:generating a Protocol. Independent Multicast (PIM) hello message including a parameter specifying the Rendezvous Point Address, wherein the first network device is an acting DF for the Rendezvous Point Address; andtransmitting the PIM hello message in response to detecting the active state on the second network device.3. The method of claim 2 , wherein the parameter specifies a plurality of Rendezvous Point Addresses of the multicast network claim 2 , wherein the first network device is an acting DF for the plurality of Rendezvous Point ...

ENERGY EFFICIENT ROUTING AND SWITCHING

This invention relates to a method and a node for energy efficient routing and switching in a communication network. When determining the best path from an originating node to a destination node, current routing or switching protocols use route selection metrics based on the bandwidth of the link interface. Certain paths are however consuming more power that others which can result in traffic flowing over a high power consuming and long distance path, because this is the best path based on the existing metrics. The present invention overcomes this by introducing a node and a method to switch data also using energy consumption metrics. These metrics can be based on the power consumption in link interfaces, the links and in the node. 1211110214. A method in a first node () for switching data packets () from a source node to a destination node () in a communication network the method characterized by the steps of:{'b': 401', '2114', '211, 'allocating () route selection metrics comprising energy consumption metrics to at least one link interface () in the first node ();'}{'b': 403', '212', '213', '211, 'receiving () route selection metrics concerning link interfaces in a plurality of other nodes (,) belonging to the same routing area as the first node ();'}{'b': '404', 'determining () the best paths to all possible destination nodes in the communication network based on at least the energy consumption metrics;'}{'b': 405', '2111, 'storing () the best paths in a routing table ();'}{'b': 406', '110', '214, 'receiving () a request to send a packet () to a specific destination node ();'}{'b': 407', '2111', '2114', '232', '219', '214, 'selecting () from the routing table () a link interface () connected to a link () belonging to the best path () to the specific destination node ();'}{'b': 408', '110', '214', '2114, 'sending () the packet () towards the specific destination node () over the selected link interface ().'}2403212213212213. A method as in where the step () of ...

INTEGRATED HETEROGENEOUS SOFTWARE-DEFINED NETWORK

One embodiment of the present invention provides a switch in a software-defined network. The switch includes at least one port, a flow management module, and forwarding circuitry. The port is capable of receiving a frame belonging to a software-defined data flow and a frame belonging to a regular data flow. The flow management module logically partitions the port for the frame belonging to the software-defined data flow from the frame belonging to the regular data flow. The forwarding circuitry forwards the frame belonging to the software-defined data flow based on a flow definition in a local flow table. The flow definition indicates how the software-defined data flow is processed in a software-defined network. 1. A switch , comprising:a port capable of receiving a frame belonging to a software-defined data flow and a frame belonging to a regular data flow;a flow management module operable to logically partition the port for the frame belonging to the software-defined data flow from the frame belonging to the regular data flow; andforwarding circuitry operable to forward the frame belonging to the software-defined data flow based on a flow definition in a local flow table, wherein the flow definition indicates how the software-defined data flow is processed in a software-defined network.2. The switch of claim 1 , wherein the forwarding circuitry is further operable to forward the frame belonging to the regular data flow based on a local forwarding table.3. The switch of claim 1 , wherein the software-defined network is an OpenFlow-enabled network.4. The switch of claim 1 , wherein the flow management module logically partitions the port based on one or more of:a virtual local area network (VLAN) tag or identifier;a type of a frame; anda flag in a header of a received frame.5. The switch of claim 1 , wherein the flow management module is further configurable to divide bandwidth of the port into a plurality of logical partitions claim 1 , wherein at least one logical ...

Multipath effectuation within singly contiguous network fabric via switching device routing logic programming

Each of a network fabric controller device and a network fabric forwarder devices includes network connecting hardware and network managing logic. The network connecting hardware of the devices connects them to a singly contiguous network fabric including switching devices that route data between initiator nodes and target nodes and that have routing logic programmable by the controller device. The controller device does not directly route the data themselves. The network managing logic of the devices effects multipaths for transmission of the data through the singly contiguous network fabric from the initiator node to the target nodes via programming of the routing logic of the switching devices. 1. A method comprising , responsive to a network fabric login request initiated by a given initiator node: creating a network fabric port and a network fabric address for the given initiator node;', 'acquiring a list of one or more network fabric ports of one or more given target nodes associated with the given initiator node;', 'determining a network fabric address for the given target node of each network fabric port within the list;, 'by a network fabric forwarder device,'} determining one or more paths between the given initiator node and the given target nodes through a singly contiguous network fabric and loading the paths into a forwarding table of each switching device of a plurality of switching devices of the singly contiguous network fabric;', 'determining a path between the given initiator node and the network fabric forwarder device through the singly contiguous network fabric and loading the path into a forwarding table of each switching device within the path,, 'by a network fabric controller device, performing, using the network fabric addresses of the given initiator node and of the given target nodes, one ofsuch that multipaths for transmission of data through the singly contiguous network fabric from the given initiator node and the given target nodes ...

End-to-end multipathing through network having switching devices compatible with different protocols

A first cluster includes first switching devices that are compatible with a software-defined networking (SDN) protocol. A second cluster includes second switching devices within or partially overlapping the first cluster. Each second switching device is compatible with a protocol for an open systems interconnection (OSI) model layer. The first switching devices include one or more border switching devices located at a boundary between the first cluster and the second cluster. Each border switching device is also compatible with the protocol for the OSI model layer. The first switching devices effect first multipathing through the network except through the second cluster, and the second switching devices effect second multipathing just through the second cluster of the network. As such, the first switching devices and the second switching devices together effect end-to-end multipathing through both the first cluster and the second cluster of the network. 1. A method comprising:interfacing, at a first port of a border switching device, a first cluster of first switching devices compatible with a software-defined networking (SDN) protocol;interfacing, at a second port of the border switching device, a second cluster of second switching devices compatible with a protocol for an open systems interconnection (OSI) model layer;receiving, at the first port, data through the first cluster that is intended for a destination reachable only through the second cluster, the data formatted according to the SDN protocol; adding to the data, by the border switching device, a header formatted according to the protocol for the OSI model layer; and', 'routing the data, including the header, from the second port through the second cluster to another border switching device that is closest to the destination., 'in response to receiving the data at the first port,'}2. The method of claim 1 , further comprising effecting end-to-end multipathing claim 1 , by the border switching device in ...

End-to-end multipathing through network having switching devices compatible with different protocols

A first cluster includes first switching devices that are compatible with a software-defined networking (SDN) protocol. A second cluster includes second switching devices within or partially overlapping the first cluster. Each second switching device is compatible with a protocol for an open systems interconnection (OSI) model layer. The first switching devices include one or more border switching devices located at a boundary between the first cluster and the second cluster. Each border switching device is also compatible with the protocol for the OSI model layer. The first switching devices effect first multipathing through the network except through the second cluster, and the second switching devices effect second multipathing just through the second cluster of the network. As such, the first switching devices and the second switching devices together effect end-to-end multipathing through both the first cluster and the second cluster of the network.

Network-based hyperspeed communication and defense

This invention relates to the use of optimal (hyperspeed) paths for command and control (and other high priority) traffic and suboptimal (slower) paths for all other traffic in order to implement sophisticated network service differentiation and defensive techniques. A reaction time window is created to ensure that packets sent along hyperspeed paths can arrive sufficiently in advance of malicious traffic in order to alert network devices and initiate defensive actions. Assortments of defensive options are available to networks employing the invention and the inventive algorithms.

Information processing system, relay device, information processing device, and information processing method

An information processing system includes a plurality of computers, a plurality of relay devices having a memory which stores a first parameter combination for selecting a first transfer path from a plurality of paths for coupling to each of the plurality of computers, and a management computer which stores, in the memory, a second parameter combination for selecting a second transfer path from the plurality of paths when a traffic of any one of couplings for coupling each of the plurality of relay devices exceeds a given amount, wherein the plurality of relay devices set a transfer destination of received data by selecting information corresponding to computer combination information included in the received data from any one of the first parameter combination and the second parameter combination.

METHOD AND APPARATUS FOR PROVIDING RESILIENCY IN MULTICAST NETWORKS

Techniques for providing resilient multicast traffic processing in a network element are described herein. In one embodiment of the invention, a network element separately joins equivalent multicast traffic streams at a first and second interface respectively. During uninterrupted operation, the network element processes the packets of the multicast traffic stream it receives at the first interface and drops the packets of the equivalent multicast traffic stream it receives at the second interface. Upon an interruption of the packets of the multicast traffic stream being received at the first interface, the network element transitions to processing the packets of the equivalent multicast traffic stream it receives at the second interface. Other methods and apparatuses are also described. 1. A computer implemented method for a multicast edge network element guaranteeing resilient multicast traffic stream processing of only a last hop of the multicast traffic stream towards a multicast receiver , wherein the multicast edge network element is coupled with a first and second multicast core network element each capable of forwarding packets of an equivalent multicast traffic stream to the multicast edge network element and each is situated between a source of the multicast traffic stream and the multicast edge network element , comprising:separately joining through a first and second interface of the multicast edge network element the equivalent multicast traffic streams from the first and second multicast core network element respectively;processing packets of the multicast traffic stream received at the first interface from the first multicast core network element, and while the first interface is receiving those packets uninterrupted, dropping packets of the equivalent multicast traffic stream received at the second interface from the second multicast core network element; andupon interruption of receipt of the packets of the multicast traffic stream at the first ...

Patient-staff Acknowledgment System, Devices, and Method

A system for patient-staff acknowledgment is disclosed that includes a wireless staff member device and a wireless patient member device. The staff member device has a receiver that receives a signal from a wireless patient member device; a transmitter that transmits a signal to the wireless patient member device; and at least one switch. The wireless patient member device has at least one switch; a transmitter that transmits a signal to the wireless staff member device; and a receiver that receives a signal from the wireless staff member device. An alarm is activated by a switch on the patient member device. The staff member device causes patient member device to send, and the staff member device to receive, a signal from the patient member device within a specified range from the patient member device and within a specified time period of activation. The staff member device transmits a signal to cancel the alarm.

Implementing OSPF in Split-Architecture Networks

A method is implemented in a network element that functions as one of a plurality of controllers for one of a plurality of areas of a split architecture network. The controller provides a control plane for the area of the split architecture network where the controller is remote from a plurality of switches providing a data plane for the area of split architecture network. The controller facilitates optimized routing across the plurality of areas of the split architecture network by providing limited intra-area link cost data to other controllers of other areas of the split architecture network and to traditional routers of a network including the split architecture network. The limited intra-area link cost data provides costs of each possible shortest path traversal of the area of the controller without providing all internal link cost data. 1. A method implemented in a network element functioning as one of a plurality of controllers for one of a plurality of areas of a split architecture network , the controller to provide a control plane for the area of the split architecture network where the controller is remote from a plurality of switches providing a data plane for the area of split architecture network , the controller to facilitate optimized routing across the plurality of areas of the split architecture network by providing limited intra-area link cost data to other controllers of other areas of the split architecture network and to traditional routers of a network including the split architecture network , the limited intra-area link cost data providing costs of each possible shortest path traversal of the area of the controller without providing all internal link cost data , the method comprising the steps of:learning a topology of the area of the controller in the split architecture network including each border switch in the area of the controller, wherein each border switch in the area of the controller has at least one external port linking the area ...

Hierarchical Flow-Level Multi-Channel Communication

Embodiments herein provide systems and methods of transferring data in a communication system. An embodiment transfers data by assigning a portion of data among groups of channels coupled to a remote node, such assigning being based on the respective flows to which the portion is associated. The portion of data across is at least two channels in the assigned group of channels, and the split portions are transferred substantially simultaneously among the channels to which they are assigned. 1a first node connected to a second node via multiple channels, the first node configured to assign a portion of the data among the multiple channels based on respective flows with which the portion of the data is associated.. A system to transfer data, the system comprising: This application is a continuation to U.S. patent application Ser. No. 12/847,839, filed Jul. 30, 2010, which will issue as U.S. Pat. No. 8,537,680 on Sep. 17, 2013, which is a continuation of U.S. patent application Ser. No. 11/261,652, filed Oct. 31, 2005, now U.S. Pat. No. 7,792,034, which claims benefit to U.S. Provisional Application No. 60/622,937, filed Oct. 29, 2004, all of the which are incorporated herein by reference in its entirety.1. Field of the InventionThe present invention relates generally to communication systems, and more specifically, to managing communication over multiple channels in a communication system.2. Related ArtThe present invention addresses issues relating to communication systems, and specifically point-to-multipoint communication systems. In conventional point-to-multipoint communication systems, a network supports bidirectional data communication between a central entity and multiple customer premises equipment (CPE). Example point-to-multipoint communication systems include cable modem systems, fixed wireless systems, and satellite communication systems. In each system, the communication path from the central entity to the CPE is typically referred to as the downstream, ...

DIVERSE PATH FORWARDING THROUGH TRIAL AND ERROR

In one embodiment, a node determines an intention to transmit a diversely forwarded packet through a computer network, and as such, transmits a first version of the packet having a packet identifier (ID) and a first distinguisher value to a first next-hop node, and transmits a second version of the packet having the same packet ID and a second distinguisher value different from the first distinguisher value to a second next-hop node different from the first next-hop node. In another embodiment, a next-hop node that receives the packet determines whether any previously received packet at the next-hop node had a same packet ID and a different distinguisher value. In response to determining that no previously received packet has the same packet ID and different distinguisher value, the next-hop node stores the packet ID and the distinguisher value, and forwards the packet to a selected next-hop node. 110-. (canceled)11. A method , comprising:determining an intention to transmit a diversely forwarded packet through a computer network;transmitting a first version of the packet having a packet identifier (ID) and a first distinguisher value to a first next-hop node; andtransmitting a second version of the packet having the same packet ID and a second distinguisher value different from the first distinguisher value to a second next-hop node different from the first next-hop node;wherein nodes of the computer network are configured to determine whether any previously received packet at the respective node had a same packet ID and a different distinguisher value as a respectively received packet, and to forward the packet only in response to determining that no previously received packet at the respective node has the same packet ID and different distinguisher value.12. The method as in claim 11 , further comprising:determining whether the packet is a particular type of packet to be diversely forwarded; andtransmitting the second version of the packet only in response to the ...

Resizing a path in a connection-oriented network

An existing path in a connection-oriented network requires resizing from a first size to a second size. Nodes exchange control plane signalling with other nodes which advertises available resources on links between nodes. A node on the existing path receives a request to establish a path capable of being resized to the second size. The node determines, using information acquired by the control plane signalling with other nodes, a new path between nodes capable of supporting the second size. The node signals to establish the new path and switches traffic from the existing path to the new path. The node causes the new path to be resized to the second size. Nodes exchange control plane signalling with other nodes which advertises whether a link supports resizing, such as OSPF-TE advertisements.

Computer system and communication method

In a computer system by using an ARP response packet in which a MAC address of a physical server is set as a transmission source MAC address, the MAC address of the physical server corresponding to a target VIP address included in an ARP request packet from a terminal device, a controller executes a proxy response to the ARP request packet to notify the terminal device of the MAC address of the physical server which is the access destination of the terminal device. In addition, the controller sets a flow entry to the switch, the flow entry regulating that a reception packet, which is transmitted from the terminal device and in which the MAC address is set as a destination MAC address, is made to be forwarded to a communication route to the physical server. Accordingly, a server which is an access destination of a terminal device can be arbitrarily set while increase of costs is suppressed in a high-speed network environment.

Adaptive load balancing

Methods and systems for performing load balancing within an Ethernet network are provided. According to one embodiment, a set of paths is maintained by a first component of multiple components coupled in communication with a network. Each path is a loop-free switching path, reverse path learning network and the first component and a second component of the multiple components are connected through each path. A packet destined for the second component is received by the first component. On a packet-by-packet basis or on a per flow basis, the first component dynamically selects a particular path of the multiple of paths by selecting a virtual network of the set of virtual networks for transporting the received packet that tends to balance traffic load across the set of virtual networks. The first component causes the received packet to be transported through the network to the second component via the particular path.

Outdoor wireless modem and signal processing method thereof

Disclosure herein is related to an outdoor wireless modem and a signal processing method thereof. The outdoor wireless modem is particularly disposed in the midst of and bridging a local-area network and a wide-area network established by a mobile communication network. One of the objectives of the invention is to provide a solution replacing the present last mile connection. According to one of the embodiments, main circuit of the outdoor wireless modem includes a radio-frequency module and a baseband module. The baseband module includes at least two processing circuits for respectively processing the signals over the mobile communication network and the packets over the local-area network. The processing circuits are packaged into one module according to the design. Further in one embodiment, a bandwidth integration unit is introduced to the modem. The bandwidth integration unit serves to achieve load balance and bandwidth integration.

NETWORK, DATA FORWARDING NODE, COMMUNICATION METHOD, AND PROGRAM

A network includes a data forwarding node including: a logical network topology management unit managing a correspondence relationship among at least two different logical network topologies generated by applying different policies to a physical network topology and data traffic conditions to which the logical network topologies are applied; and a packet processing unit selecting a logical network topology corresponding to data traffic to which an incoming packet belongs, determining a packet forwarding destination, and transmitting the incoming packet. The data forwarding node selects a logical network and forwards a packet, based on data traffic. 1. A network , comprising a data forwarding node comprising:a logical network topology management unit managing a correspondence relationship among at least two different logical network topologies generated based on a physical network topology and data traffic to which the logical network topologies are applied; anda packet processing unit selecting a logical network topology corresponding to data traffic to which an incoming packet belongs, determining a packet forwarding destination, and transmitting the incoming packet.2. The network according to ;wherein the logical network topology is generated based on policy information including weight information given to links or nodes on the physical network topology.3. The network according to claim 1 , further comprising:a policy management unit associating the policy information with data traffic and managing the associated information.4. The network according to ;wherein the data forwarding node further comprises a logical network topology generation unit generating the at least two logical network topologies by using the physical network topology and the policy information.51484. The network according to any one of claims -;wherein the packet processing unit comprises:a path calculation unit referring to the logical network topologies and calculating a packet forwarding ...

ROUTING METHOD AND APPARATUS FOR SETTING OPTIMUM MULTI-HOP HYBRID V-MIMO TRANSMISSION PATH FOR WIRELESS AD HOC NETWORK

The present invention relates to a method for setting the optimum transmission path for increasing energy efficiency in a wireless ad hoc network. More particularly, the present invention relates to setting an optimized data transmission path in a multi-hop data transmission environment in a wireless network comprising machine to machine (M2M) communication devices, which operate with limited energy, based on link information of the network, such as the position of a node in the network. And to this end, the present invention relates to a wireless M2M communication network protocol minimizing energy consumption by selecting the optimum transmission method for each of the hops from the following transmission methods: a single input single output (SISO) method; a virtual single input multiple output (V-SIMO) method; and a virtual multiple input multiple output (V-MIMO) method. 1. A method for configuring a data transmission path from a first node to a second node at a predetermined node in an ad hoc network , the method comprising:{'sub': 'opt', 'calculating a number of optimal cooperative nodes, M, in the network;'}{'sub': 'opt', 'transmitting a cooperative node request message including the number of the optimal cooperative nodes, M, to all nodes in the network;'}receiving a cooperative node reply message from one or more nodes in the network;configuring an optimal transmission path from the first node to the second node and cooperative transmission nodes and cooperative reception nodes in each hop of the optimal transmission path, based on the cooperative node reply message; andtransmitting a cooperative node setup message indicating information on the cooperative transmission nodes and the cooperative reception nodes for optimal transmission path configuration to associated nodes.2. The method according to claim 1 , wherein the number of the optimal cooperative nodes claim 1 , M claim 1 , is calculated by the first node claim 1 , or the second node claim 1 , or a ...

Disjoint data path routing for integrity and availability augmentation

A method comprises transmitting a plurality of copies of a message from each of a first transmission node and a second transmission node, each copy having a respective identification and forwarding each of the plurality of copies of the message among other nodes in the network based, at least in part, on the respective identification of each copy such that each copy of the message traverses a predetermined communication path among the other nodes. A respective first received copy is compared to a respective second received copy at each of the other nodes. The integrity of the respective first and second copies is validated at each of the other nodes if the copies match and the copies traversed disjoint communication paths.

Link aggregation using digests

Methods, systems and computer readable media for link aggregation using digests are described. In some implementations, the method can include obtaining information about each port in a group of one or more ports. The method can also include computing a digest corresponding to each port in the group of one or more ports, the digest being based on the information about the corresponding port. The method can further include determining whether each port in the group of one or more ports is suitable for aggregation in a link aggregation group by comparing the digest corresponding to each port with a digest of a port in the link aggregation group.

Robust multipath routing

Implementations related to robust multipath routing are disclosed.

Relaying frames in a large layer 2 network fabric

A network fabric includes interconnected network nodes, each having access to a database containing predetermined paths from each network node to each other network node in the network fabric. Each network node determines, in response to an incoming frame, whether the frame is a fabric protocol data unit (PDU) having a header containing path attributes including a destination node address. If the frame is a fabric PDU, the node selects a first path to the destination node from the database, and forwards the fabric PDU to a next hop in accordance with the selected path. If the frame is not a fabric PDU, the node selects a second path through the network fabric to the destination node from the database, adds the header with the path attributes to the frame to produce the fabric PDU, and forwards the fabric PDU to the next hop in accordance with the second path.

Trill optimal forwarding and traffic engineered multipathing in cloud switching

In one embodiment, a plurality of leaf switches that include host facing ports are configured as a cloud switch. An indication of connectivity between the leaf switches of the cloud switch and routing bridges (RBridges) external to the cloud switch may be added to link state packets (LSPs) sent over the at least one logical shared media link. A lookup table may be generated that specifies next hop leaf switches. The generated lookup table may be used to forward frames to one or more particular nexthop leaf switches. Further, traffic engineering parameters may be collected. Equal cost multipath (ECMP) nexthop leaf switches and distribution trees to reach one or more destinations may be examined. Traffic may be distributed across ones of them based on the traffic engineering parameters.

CONTENT DISTRIBUTION TRACKING THROUGH WIRELESS MESH NETWORKS

A distribution of a content selection being distributed throughout a wireless mesh network may be tracked. A wireless device in the wireless mesh network enables the content selection to be exchanged. Wireless devices then exchange the content, and a network topology is recorded in response. Finally, the network topology is reported to a reporting agent. 121-. (canceled)22. A method of adjusting a wireless network , the method comprising the following operations performed by at least one processor:detecting a transaction on the wireless network involving at least one wireless device;recording transaction data including a total number of network hops involved in the transaction;analyzing the recorded transaction data to determine a maximum span; andadjusting the wireless network based on the determined maximum span to thereby optimize transactions on the wireless network.23. The method of claim 22 , wherein the determined maximum span represents the maximum number of hops between any two wireless devices in the wireless network.24. The method of claim 23 , wherein adjusting the wireless network comprises partitioning the wireless network into smaller networks to reduce the maximum span of the network.25. The method of claim 22 , wherein the transaction data is recorded locally to the at least one wireless device.26. The method of claim 25 , further comprising reporting the locally recorded transaction data to a remote content provider.27. The method of claim 22 , wherein the transaction data includes a description of the transaction between the at least one wireless device and another wireless device.28. The method of claim 22 , wherein the transaction data includes a recording of bandwidth utilization across one or more links in the wireless network.29. The method of claim 22 , further comprising:depicting the transaction on a user interface, the user interface including a map of the wireless network displaying details of the transaction based on the recorded ...

Network management apparatus, network management method, and network management system

A network management apparatus is designed so that when reassigning the existing address, the network management apparatus extracts a link with the largest link cost from among links comprising the network based on the network configuration information and specifies a flow routed though the extracted link based on the statistic information; when receiving a path change request and a via link request to request a via link with respect to the specified flow from an external terminal, the network management apparatus selects either one of addresses of an address pair of the specified flow as a change target address; and when changing the selected change target address, the network management apparatus changes the change target address to a candidate address to be assigned by selecting an address, which is routed through a link included in the via link request and has not been assigned, as the candidate address to be assigned.

Utilizing Betweenness to Determine Forwarding State in a Routed Network

A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified. 124-. (canceled)25. A method of limiting multicast forwarding state at a node of a routed network , the method comprising:receiving, by the node, a link state advertisement containing an indication that a multicast destination would like to join a multicast;determining respective costs of a shortest path from the node to a multicast source and of a shortest path from the node to the multicast destination;determining respective costs of a shortest path from at least one other node to the multicast source and of a shortest path from the at least one other node to the multicast destination; andnot installing forwarding state for forwarding multicast traffic from the multicast source to the multicast destination, by the node, when the sum of the cost of the shortest path from the node to the multicast source and the cost of the shortest path from the node to the multicast destination is greater than the sum of the cost of the shortest path from the at least one other node to the multicast source and the cost of the shortest path from the at least one other node to the multicast destination.26. The method of claim 25 , wherein the at least one other ...

RELAYING FRAMES IN A LARGE LAYER 2 NETWORK FABRIC

A network fabric includes interconnected network nodes, each having access to a database containing predetermined paths from each network node to each other network node in the network fabric. Each network node determines, in response to an incoming frame, whether the frame is a fabric protocol data unit (PDU) having a header containing path attributes including a destination node address. If the frame is a fabric PDU, the node selects a first path to the destination node from the database, and forwards the fabric PDU to a next hop in accordance with the selected path. If the frame is not a fabric PDU, the node selects a second path through the network fabric to the destination node from the database, adds the header with the path attributes to the frame to produce the fabric PDU, and forwards the fabric PDU to the next hop in accordance with the second path. 1. A method of relaying frames through a network fabric , the method comprising:receiving a frame at a given network node in the network fabric;determining, by the given network node, whether the frame is a fabric protocol data unit (PDU) having a header used for Layer 2 switching, the header containing path attributes including an address of a destination network node in the network fabric; andif the frame is a fabric PDU, selecting, by the given network node, a first path to the destination network node from a database of predetermined paths, and forwarding the fabric PDU to a next hop in accordance with the selected first path,otherwise, if the frame is not a fabric PDU, selecting, by the given network node, a second path to the destination network node from the database of predetermined paths, adding the header with the path attributes to the frame to produce the fabric PDU, and forwarding the fabric PDU to the next hop in accordance with the selected second path.2. The method of claim 1 , further comprising generating and maintaining the database of predetermined paths at each network node in the network ...

Computing disjoint paths for reactive routing mesh networks

In one embodiment, a reactive routing computer network may be partitioned into diverse logical topologies, and a source node may transmit route request (RREQ) messages toward a destination node on each logical topology. In response, the source node may receive route reply (RREP) messages indicating routes to the destination node in each logical topology. The source node may thus select a route for each logical topology to reach the destination node, accordingly. In another embodiment, if partitioned logical topologies do not produce two or more routes or as a standalone embodiment, the source node may transmit RREQ messages toward the destination node without any corresponding logical topology. The destination node receives RREQ messages, and two or more routes from the source node to the destination node may be determined (e.g., by the destination or source node) based on the received RREQ messages at the destination node and path selection criteria.

Maintaining load balancing after service application with a netwok device

In general, techniques are described for maintaining load balancing after service application. A network device comprising ingress and egress forwarding components and a service card may implement the techniques. An ingress forwarding component receives a packet and, in response to a determination that the service is to be applied to the packet, updates the packet to include an ingress identifier that identifies the ingress forwarding component, thereafter transmitting the updated packet to the service card. The service card applies the service to the updated packet to generate a serviced packet and transmits the serviced packet to the ingress forwarding component identified by the ingress identifier so as to maintain load balancing of packet flows across the plurality of forwarding components. The ingress forwarding component determines a next hop to which to forward the serviced packet and the egress forwarding component forwards the serviced packet to the determined next hop.

System and Method for Providing Route Information

A system and method changes a rate at which routing information is sent to increase it upon the detection of one or more events, maintaining the then current rate for an amount of time, or dropping it, otherwise. 1identifying one of a plurality of beacon rate increase events during a first period of time;responsive to identifying at least one of the plurality of beacon rate increase events during the first period of time, changing from a first rate at which routing information is provided from a device, the first rate being in effect at least before the first period of time, to a second rate, higher than the first rate, at which routing information is provided by the device at least after the first period of time; andresponsive to none of the plurality of beacon rate increase events being received during a second period of time, the second period of time following the first period of time, changing from the second rate at which routing information is provided by the device, to a third rate, lower than the second rate, at which routing information is provided by the device,wherein the routing information provided by the device indicates a cost of routing a message through a network along a path from the device to the destination,wherein the routing information is provided by the device in one or more beacons, each of the one or more beacons including an identifier of the device, an identifier of the destination, and information identifying a next-hop along a best path from the device to the destination,wherein the information identifying the next-hop allows looping, in routing from the device to the destination, to be avoided;wherein the best path is a lowest cost path from the device to the destination, andwherein the cost is a metric of distance from the device to the destination.. A method comprising: This application is a continuation of U.S. application. Ser. No. 12/290,850, filed Nov. 3, 2008, and claims the benefit of U.S. Provisional Patent Application Ser. ...

DYNAMIC MULTI-PATH FORWARDING FOR SHARED-MEDIA COMMUNICATION NETWORKS

In one embodiment, a quality of one or more links of a particular node in a communication network may be determined, and then whether the quality of the one or more links is below a threshold may also be determined. In response to determining that the quality of at least one of the one or more links is above the threshold, a select one of the at least one of the one or more links with quality above the threshold may be utilized for communication with the particular node. Conversely, in response to determining that the quality of each of the one or more links is below the threshold, multi-path forwarding over a plurality of links of the particular node may be utilized for communication with the particular node. 1. A method , comprising:determining a quality of one or more links of a particular node in a communication network;determining whether the quality of the one or more links is below a threshold;in response to determining that the quality of at least one of the one or more links is above the threshold, utilizing a select one of the at least one of the one or more links with quality above the threshold for communication with the particular node; andin response to determining that the quality of each of the one or more links is below the threshold, utilizing multi-path forwarding over a plurality of links of the particular node for communication with the particular node.210-. (canceled)11. The method as in claim 1 , wherein the communication with the particular node is from a particular source to the particular node.12. The method as in claim 11 , wherein determining whether the quality of the plurality of links is below the threshold comprises:determining that the quality of each of the one or more links is below the threshold in response to multi-path forwarding having been utilized over the plurality of links of the particular node for communication from the particular node to a particular destination.13. The method as in claim 12 , further comprising: ...

Transmitting and receiving data based on multipath

Methods, apparatuses and systems for transmitting and receiving data based on multipath for transmitting data based on multipath include: establishing WiMAX connection-based multiple paths between a first device and a second device; transmitting data frames in a data queue in the multiple paths; obtaining the quality condition of the multiple paths; and based on the quality condition, adjusting the transmission of the data frames in the data queue in the multiple paths. According to one aspect, there is provided a method for receiving data based on multipath, which includes: establishing WiMAX connection-based multiple paths between a first device and a second device; receiving a plurality of data frames in the multiple paths; processing the received plurality of data frames based on quality condition of the multiple paths. There are further provided corresponding apparatuses and systems.

COMMUNICATION SYSTEM, CONTROL DEVICE, AND PROCESSING RULE SETTING METHOD AND PROGRAM

A communication system includes: a plurality of forwarding nodes that process a packet transmitted from a user terminal, in accordance with a processing rule that has been set, and a control device that selects a forwarding node in which a processing rule is to be set, from among the plurality of forwarding nodes, such that processing rules are set so as not to be concentrated in a specific forwarding node, based on the number of processing rules that are set in each of the forwarding nodes. 1. A communication system , comprising:a plurality of forwarding nodes that process a packet(s) transmitted from a user terminal, in accordance with a processingrule(s) that has been set; andat least one control apparatus which, when a processing rule that can be set in any among said plurality of forwarding nodes is set, selects a forwarding node in which said processing rule is to be set, from among said plurality of forwarding nodes, such that processing rules are not concentrated in a specific forwarding node, based on the number of processing rules set in each of said forwarding nodes.2. The communication system according to claim 1 , wherein said control apparatus selects a setting destination for said processing rule claim 1 , giving priority to a forwarding node connected near to said user terminal or a forwarding node with the least number of processing rules that are set.3. The communication system according to claim 1 , wherein said control apparatus excludes a forwarding node in which the number of processing rules that are set is greater than or equal to a threshold claim 1 , from a setting destination of said processing rule.4. The communication system according to claim 3 , wherein said prescribed threshold can be set in each of said forwarding nodes.5. The communication system according to claim 1 , wherein claim 1 , in a case where there is a plurality of forwarding nodes that are destination candidates for setting of said processing rule claim 1 , said control ...

TRILL SHORTEST PATH FIRST IMPLEMENTATION

A shortest path first (SPF) computation in a distributed network may be performed efficiently by performing the SPF computation in stages. Rather than perform a new SPF computation every time a change occurs affecting a link state within the distributed network, a routing protocol may identify the change and determine if the impact to the link state necessarily needs the new SPF computation. For example, a predetermined list of events may identify changes that may not necessarily impact the SPF value(s) currently associated with the distributed network. Embodiments disclosed may avoid computation of the new SPF for changes to the link state thus managing network system resources more efficiently. 1. A method of implementing a Shortest Path First (SPF) computation , comprising:identifying a plurality of network elements connected together as a distributed network;identifying one or more predetermined events occurring in the distributed network under a link state protocol (LSP); andimplementing, by a processor, the SPF computation in the distributed network except when the identified predetermined events trigger a change in the LSP.2. The method of claim 1 , wherein the distributed network operates under a Transparent Interconnect of Lots of Links (TRILL) standard.3. The method of claim 1 , wherein the distributed network operates under an Intermediate System to Intermediate System (IS-IS) routing protocol.4. The method of claim 1 , wherein the one or more identified predetermined events includes a neighbor identification change.5. The method of claim 1 , wherein the one or more identified predetermined events includes a change in a distribution tree.6. The method of including implementing the SPF computation only for a multicast distribution.7. The method of claim 1 , wherein the one or more identified predetermined events includes a name change among the network elements. The present continuation application claims the benefit of priority of U.S. application Ser. No ...

Mechanism to control resource utilization with adaptive routing

Methods and apparatus relating to techniques for controlling resource utilization with adaptive routing are described. In one embodiment, an output port for transmission of an incoming message that is to be received at an input port is determined at routing logic. The routing logic selects the output port from a first output port and a second output port based on congestion information that is detected at one or more other routing logic communicatively coupled to the routing logic. The first output port provides a deterministic route for the incoming message and the second output port provides an adaptive route for the incoming message. Other embodiments are also disclosed.

Probe Packet Discovery of Entropy Values Causing Specific Paths to be Taken Through a Network

In one embodiment, probe-packet discovery of entropy values causing specific paths to be taken through a network is performed. One embodiment sends, from a first network node to a second network node in a network, a plurality of Equal Cost Multipath (ECMP) path-taken probe packets, each with a different entropy label, to determine a particular entropy label for each particular ECMP path of a plurality of different ECMP paths between the first network node and the second network node that will cause a packet including the particular entropy label to traverse said particular ECMP path. The ECMP paths taken by the plurality of ECMP path-taken probe packets is analyzed to determine one or more entropy labels for each different ECMP path of the plurality of different ECMP paths that will cause a packet including one of said one or more entropy labels to traverse said different ECMP path. 1. A method , comprising:sending, from a first network node to a second network node in a network, a plurality of Equal Cost Multipath (ECMP) path-taken probe packets, each with a different entropy label, to determine a particular entropy label for each particular ECMP path of a plurality of different ECMP paths between the first network node and the second network node that will cause a packet including the particular entropy label to traverse said particular ECMP path; andanalyzing the ECMP paths taken by the plurality of ECMP path-taken probe packets to determine one or more entropy labels for each different ECMP path of the plurality of different ECMP paths that will cause a packet, including one of said one or more entropy labels, to traverse said different ECMP path; wherein one or more other nodes along said particular ECMP path perform ECMP forwarding based on an entropy label included in a packet.2. The method of claim 1 , comprising adding to an ordered list within each particular ECMP path-taken probe packet an identification of each traversed network node between the first ...

Adaptive wireless sensor network and method of routing data in a wireless sensor network

A method of routing data in a wireless sensor network, a program product and a wireless sensor network. The method, includes: (a) detecting a temporal event by a source sensor node of a wireless sensor network comprising a multiplicity of sensor nodes; (b) identifying multiple paths from the source sensor node to a sink of the wireless sensor network, the multiple paths consisting of sensor node to sensor node hops; and after (b), (c) using a processor of the source sensor node, optimizing a distribution of data packets to each path of the multiple paths by simultaneously reducing (i) power consumed by sensor nodes in each path of the multiple paths and (ii) a time to transmit the data packets from the source sensor node to the sink.

SYSTEM AND METHOD FOR ACCEPTING INFORMATION FROM ROUTING MESSAGES INTO A LIST

A system and method adds and manages entries on a list of entries of routing information to allow the top entry to be used for routing to a destination corresponding to the list. Costs of a wireless link may be a function of the success rate experienced on that wireless link. 1. (canceled)2. A method , comprising:storing, at a computing device in a network, data indicative of a set of next hop candidate nodes and path costs associated with the next hop candidate nodes;receiving, at the computing device, a beacon message from a beacon originator, wherein the beacon message identifies the beacon originator, a path cost associated with a network path between the beacon originator and a destination node, and one or more nodes along the network path;determining, by the computing device, that the set of next hop candidate nodes is full and that the beacon originator is not in the set of next hop candidate nodes based on the beacon message;determining, by the computing device, a total cost associated with the beacon originator based on the path cost associated with the network path and on a signal quality of the received beacon message; andreplacing, by the computing device, a particular next hop candidate node in the stored set of next hop candidate nodes with the beacon originator, in response to determining that the total cost associated with the beacon originator is less than the stored path cost associated with the particular next hop candidate node.3. The method as in claim 2 , wherein the stored path cost associated with the particular next hop candidate node is greater than the stored path costs associated with the other nodes in the set.4. The method as in claim 2 , wherein the total cost associated with the beacon originator is calculated in response to determining that the signal quality of the received beacon message is below a threshold value.5. The method as in claim 2 , further comprising:determining, by the computing device, that the beacon originator is a ...

METHOD FOR SELECTING A COMMUNICATION ROUTE

Selecting a communication route between a first and a second node device of a mesh electrical supply network using powerline and/or radio-frequency communications is described. A route cost is obtained for each possible communication route. A communication route of the lowest route cost is selected. For a given route, the route cost is the sum of the link costs between successive node devices on the route, the link cost between two successive node devices is a weighted sum between a maximum value from a link cost in a forward direction and a link cost in a backward direction and a ratio between a number of active routes and a maximum number of active routes. A link cost in a given direction depends on the cost of the link, in the given direction, calculated for each frequency band of frequency bands used by the two successive node devices for communicating. 6. Method according to claim 1 , wherein said set of frequency bands comprises:the CENELEC A frequency band;the CENELEC B frequency band;the FCC frequency band or the ARIB frequency band; andthe RF channel of G3-PLC Hybrid RF.8. A mesh electrical supply network using powerline and/or radio-frequency communications claim 7 , comprising a node device according to .9. A storage medium storing instructions for implementing claim 1 , by a node device claim 1 , the method according to claim 1 , when said instructions are executed by a processor of the node device. At least one embodiment relates to a method for selecting a communication route between a first node device and a second node device of a mesh electrical supply network using powerline communications, said second node device being able to be reached from the first node device by at least two different communication routes.Powerline communications (PLC) are developing, in particular in the context of electrical supply networks of the AMM (Automated Meter Management) type. Communication networks are thus implemented on top of electrical supply networks for the ...

SYSTEM AND METHOD FOR MULTI-PATH MESH NETWORK COMMUNICATIONS

The disclosed invention provides system and method for multi-path mesh network communications. The network system utilizes multiple communication paths and linearly encoded and disassembled packets through mathematical coding techniques that respectively travel the communication paths. The system includes an encoder, a transmitter, a decoder and a receiver. The encoder receives data from an external source and linearly encodes and simultaneously disassembles the data to generate copackets. None of the individual copackets contain decodable information of the data. The transmitter is coupled to the multiple communication paths and respectively transmits the copackets through different communication paths. The receiver receives the copackets transmitted through the communication paths. The decoder decodes available copackets and reassembles the data from the available copackets if a number of the available copackets are no less than a mathematically calculated number. The reassembled data has the complete information of the data originally transmitted. 1. A network system for multi-path mesh network communications , comprising: an encoder that receives data from an external source and encodes the data by linearly encoding and simultaneously disassembling the data into copackets to generate a plurality of copackets, wherein none of the copackets individually contain useable information or the ability to decode any part of the data; and', 'a transmitter coupled to a plurality of communication paths, wherein the transmitter respectively transmits the copackets through different communication paths; and, 'a first host comprising a receiver that receives the copackets transmitted through the communication paths from the transmitter of the first host; and', 'a decoder that decodes available copackets and reassembles the data from the available copackets if a number of the available copackets is no less than a mathematically preset number, wherein the reassembled data has ...

Relaxed Ordering Network

A system, method and a computer readable medium for processing packets transmitted using relaxed order in an ordered multi-path network are provided. Packets associated with a data flow from the ordered multi-path network are received out of order. The received packets are reassembled into a sequential order, without gaps, prior to being delivered to a protocol stock for sequential processing. 1. A system , comprising: receive the packets associated with a data flow from the ordered multi-path network, wherein the packets are transmitted using relaxed order; and', 'reassemble the received packets into a sequential packet order without gaps, prior to delivering reassembled packets to a protocol stack for sequential processing., 'a network interface controller configured to process packets transmitted over an ordered multi-path network, the network interface controller configured to2. The system of claim 1 , wherein to reassemble the received packets claim 1 , the network interface controller includes a packet reassembly module configured to:identify a sequence number gap in sequence numbers of the received packets, wherein the sequence number gap indicates one or more packets in the data flow that have not arrived from the ordered multi-path network;store the received packets in a memory buffer according to the sequence numbers of the received packets leaving a gap for the one or more packets with sequence numbers in the sequence number gap; anddeliver the received packets in the memory buffer to the protocol stack when the sequence number gap is eliminated.3. The system of claim 1 , wherein the network interface controller further comprises a negotiation module configured to negotiate packet transmission of the data now in the ordered multi-path network using the relaxed order claim 1 , wherein the packets in the data flow are transmitted out of sequence in the ordered multi-path network.4. The system of claim 3 , wherein the negotiation module is configured to ...

System And Method For Electronic Voting Network

A local electronic voting network configured as a daisy chain network is provided. Each network device may include a switch for routing and propagating voting network communications. A TCP/IP protocol over Ethernet based connections may be used. Voting devices may include a relay configured such that in case of power down of a voting device the relay shunts the communications down the network. Multiple input/output ports may be provided on network devices and a physical port blocker is provided to block unused ports. A network controller may include a display screen which utilizes a graphical user interface to display status information regarding individual ones of the voting devices that are coupled to the voting network. 1. An election voting system network comprising:a plurality of voting devices, the voting devices being network connectable and being configured to process a voter's ballot selections;a voting network controller, the controller network being connectable to at least one of the plurality of voting devices, the voting network controller providing control over the plurality of voting devices;a communication network coupling the voting devices and the network controller, the communication network being configured as a serial daisy chain connection of the voting network controller and the plurality of voting devices; andwherein at least two of the plurality of voting devices each contain at least one multi-port switch, the multi-port switch routing and propagating network communications among the voting devices of the voting system network according a network address scheme, the multi-port switch receiving network communications on at least a first port, for network communications intended for another of the plurality of voting devices the multi-port switch retransmitting through a second port network communications to a next voting device in the serial daisy chain connections of the plurality of voting devices.2. The election voting system network of ...

Demultiplexing Bonded GRE Tunnels

A Hybrid Access (HYA) network for communicating between a Hybrid Access Gateway (HAG) and a Hybrid Access Customer Premises Equipment (HCPE) using a fixed wired connection and a wireless connection is presented. The HAG demultiplexes messages of bonded Generic Routing Encapsulation (GRE) tunnels using a bonding key value, which is provided to the HCPE during bonded tunnel establishment. Communications through the bonded tunnels insert at least a portion of the bonding key value in a GRE Header, using the different bonding key values for the fixed wired connection and the corresponding wireless connection. The HAG groups messages from multiple connections of multiple HCPEs using the bonding key value in the GRE Header. 1. A Hybrid Access Gateway (HAG) , comprising:a receiver configured to receive a set-up request message from a Hybrid Access Customer Premises Equipment (HCPE);a processor coupled to the receiver and configured to generate a bonding key value to correspond to a connection of a plurality of connections to the HCPE, wherein the bonding key value comprises a first portion and a second portion; anda transmitter coupled to the processor and configured to transmit a set-up acceptance message to the HCPE, wherein the set-up acceptance message comprises an attribute having the bonding key value.2. The HAG of claim 1 , wherein the first portion of the bonding key value is set by the HAG to identify the connection of the plurality of connections to the HCPE.3. The HAG of claim 2 , wherein the first portion of the bonding key value currently corresponding to a first connection to a HCPE is set to not conflict with the first portion of a second bonding key value currently corresponding to a second connection to the HCPE.4. The HAG of claim 1 , wherein the second portion of the bonding key value is a random number.5. The HAG of claim 1 , wherein the HAG is in communication with the HCPE via a fixed wired connection and a wireless connection.6. The HAG of claim 5 , ...

INCREASED DATA TRANSFER RATE METHOD AND SYSTEM FOR REGULAR INTERNET USER

Method for increasing data transfer rates for regular net-work users, including the procedures of generating a WAN optimization network (WANON), in a network, defining a client, for requesting data, and an origin, from which data is requested, the WANON determining a best requesting node for the client based on a data request, configuring the client to forward the data request to the WANON, the client requesting data by forwarding the data request to the requesting node, the WANON determining a best origin node for retrieving the requested data from the origin according to a network identifier resolution of the origin, the requesting node forwarding the data request to the origin node using WAN optimization, the origin node retrieving the requested data from the origin and transferring the retrieved data to the requesting node using WAN optimization, the requesting node transferring the retrieved data to the client, and updating the WANON. 1. Method for increasing a data transfer rate for a regular network user , comprising the procedures of:generating a WAN optimization network of at least two server nodes;in a network, defining at least two nodes, at least one of said nodes being a client, for requesting data, and at least another one of said nodes being an origin, from which said data is requested from;said generated WAN optimization network determining a best requesting node for said client based on a data request, said best requesting node being selected from said at least two server nodes which can communicate most efficiently with said client;establishing a configuration to forward said data request of said client to said generated WAN optimization network;said client requesting data from said origin by forwarding said data request to said determined best requesting node;said generated WAN optimization network determining a best origin node, from said at least two server nodes, for retrieving said requested data from said origin according to at least one ...

Distributed Control System and Control Method Thereof

In a distributed control system including a central communication device, terminal communication devices to which target devices to be controlled are connected, and a network including multiple communication paths connecting the central communication device and terminal communication devices, each terminal communication device includes a calculation input/output performance storage unit storing input/output performance of a calculation unit for controlling the target devices to be controlled and a control input/output performance storage unit storing the performance of the input/output control units of the target devices to be controlled, and the central communication device collects input/output performance information previously stored in these storage units, determines communication paths of the terminal communication units and a packet division method in such a manner that an amount of a communication data of a network and response performance requested of the distributed control system are satisfied, on the basis of the collected input/output performance information and sets the determination results in the terminal communication devices. 1. A distributed control system in which a central communication device and a plurality of terminal communication devices connected to target devices to be controlled are connected through a network ,wherein in response to receiving input/output performance of the terminal communication devices previously set in input/output performance storage tables of the terminal communication devices, the central communication device generates communication paths between the central communication device and the terminal communication devices through the network on the basis of the received input/output performance and sets the generated communication paths in communication path setting units of the terminal communication devices, andwherein the terminal communication devices transmit or receive data to or from the central communication ...

BI-DIRECTIONAL FLOW STICKINESS IN A NETWORK ENVIRONMENT

An example method for bi-directional flow stickiness in a network environment is provided and includes receiving a packet of a flow from a source address in a network, and destined to a destination address outside the network, looking up a flow table for an entry corresponding to the flow, and caching a forward flow entry and a reverse flow entry in the flow table if the look up results in a miss, the forward flow entry indicating a routing lookup, and the reverse flow entry indicating a previous hop from which the packet was received to maintain a bi-directional flow stickiness. Some embodiments also include receiving another packet from the destination address outside the network destined to the source address in the network, and forwarding it to the previous hop listed in the reverse flow entry. 1. A method executed at a forwarder in a network , the method comprising:receiving a packet of a flow from a source address in the network, and destined to a destination address outside the network;looking up a flow table for an entry corresponding to the flow; andcaching a forward flow entry and a reverse flow entry in the flow table if the look up results in a miss, the forward flow entry indicating a routing lookup, and the reverse flow entry indicating a previous hop from which the packet was received to maintain a bi-directional flow stickiness.2. The method of claim 1 , wherein the forward flow entry comprises an action to look up a forwarding table claim 1 , wherein the forwarding table includes a result of the routing lookup.3. The method of claim 2 , further comprising looking up the forwarding table.4. The method of claim 2 , wherein the forwarding table comprises an action to forward the packet to a gateway of the network.5. The method of claim 1 , wherein each entry in the flow table comprises at least a source address field claim 1 , a destination address field claim 1 , and a next action field.6. The method of claim 5 , wherein the forward flow entry ...

METHOD AND SYSTEM FOR CONTROLLING MESSAGES BETWEEN COMMUNICATING ENTITIES

A method for controlling messages between communicating entities (CE) having computing devices, each CE sending messages to other neighboring CE with a entity-dependent message rate (CEMR), and with an entity-dependent transmission power, the messages being transmitted via one or more channels having a maximum channel capacity, and the CEMR defining a rate interval between a minimum and maximum rate, includes determining the CEMR within the rate interval by: (a) using a utility function for each CE; b) assigning an initial price for each CE; (c) adjusting the CEMR of each CE accounting for received prices of other CE; (d) computing a new price for each CE based on difference between initial price and available channel load for respective CEs; and (e) checking a termination condition for the difference and if unfulfilled, use the new price as initial price and repeat (c)-(e) until a termination condition is fulfilled. 1. A method for controlling messages between communicating entities , the communicating entities (CE) , including computing devices , the method being performed in a memory available to a computing device; each CE sending messages to other neighboring CE with a communicating entity-dependent message rate (CEMR) , and with an communicating entity-dependent transmission power; the messages being transmitted via one or more channels having a maximum channel capacity; and the CEMR defining a rate interval between a minimum and maximum rate , the method comprising:determining the CEMR within the rate interval by employing a combination of two or more of the following:a) using a utility function for each CE being at least dependent on the CEMR and at least one parameter including a fairness parameter;b) assigning an initial price for each CE, wherein the price is calculated as a difference between the maximum channel capacity and the number of messages received per time unit;c) adjusting the CEMR of each CE taking into account received prices of the other CE, ...

Secure Remote Computer Network

Systems and methods to provide improved secure, high speed networking between two or more computers is disclosed. The invention provides a robust and flexible means to readily establish a secure connection between two or more computers using insecure public or private network connections, while eliminating most of the difficulties and issues a user typically experiences with varying virtual private networks (“VPN”) and firewall configurations. The inventive system can be adapted to route traffic across multiple network connections based on a variety of criteria, including without limitation, the importance of any given data, the cost of each means of connection, and/or the performance of each possible means of connecting to the client system. 1. A computer communications network system , comprising:(a) at least one switchboard computer in a hub mode in communication connectivity with an external network;(b) at least one switchboard computer in a client mode in communication connectivity with an external network; and(c) a directory service in communication connectivity with an external network;wherein said at least one switchboard computer in a hub mode initiates a connection with said directory service to be registered and made available for said at least one switchboard computer in a client mode to dynamically communicate with said at least one switchboard computer in a hub mode through an external network.2. The computer communications network system claim 1 , as described in claim 1 , wherein the external network is a global communications network.3. The computer communications network system claim 1 , as described in claim 1 , wherein the external network is the Internet.4. The computer communications network system claim 1 , as described in claim 1 , wherein the directory service is an Extensible Messaging and Presence Protocol (“XMPP”).5. The computer communications network system claim 1 , as described in claim 1 , wherein the directory service is a Light ...

WIRELESS COMMUNICATIONS DEVICE, WIRELESS COMMUNICATIONS SYSTEM, AUTOMATIC SETTING METHOD, AND PROGRAM

[Problem] To provide a wireless communications device, a wireless communications system, an automatic setting method, and a program, whereby settings for communications via a network can be efficiently set between wireless communications devices connected by a wireless link. [Solution] A wireless communications device (1) having a reception unit (12) and a generation unit (14). The reception unit (12) receives, via the wireless link and from other wireless communications devices, data including setting information relating to the other wireless communications devices and for communicating via the network. The generation unit (14) uses the setting information relating to other wireless communications devices and generates setting information relating to the local device. 1. A wireless communications device comprising:a reception unit configured to receive, via a wireless link and from other wireless communications devices, data including setting information relating to the other wireless communications devices and for communicating via a network; anda generation unit configured to generate the setting information relating to an own device using the setting information relating to the other wireless communications devices.2. The wireless communications device according to claim 1 , wherein a layer relating to the setting information is superior to a layer relating to the wireless link.3. The wireless communications device according to claim 2 , wherein the wireless link relates to Layer 2 protocol claim 2 , and the setting information relates to Layer 3 protocol.4. The wireless communications device according to claim 1 , whereinthe generation unit generates address information of the setting information relating to the own device so as to be different from address information of the setting information relating to the other wireless communications devices.5. The wireless communications device according to claim 4 , whereinthe generation unit generates, on the basis ...

MULTI-CONTROLLER CONTROL TRAFFIC BALANCING IN SOFTWARE DEFINED NETWORKS

A method includes determining a number and placement of multiple controllers in a software defined network (SDN) such that each controller controls a different set of software controlled switches in the SDN and finding optimal forwarding paths for control traffic between the switches and controllers to minimize delay of control traffic over the software defined network. 1. A method comprising:determining a number and placement of multiple controllers in a software defined network (SDN) such that each controller controls a different set of software controlled switches in the SDN; andfinding optimal forwarding paths for control traffic between the switches and controllers to minimize delay of control traffic over the software defined network.2. The method of wherein the optimal forwarding paths comprise a traffic assignment matrix denoting the amount of control traffic on links that originate from each switch to each controller claim 1 , and wherein finding the optimal forwarding paths comprises using an iteration between a primal-dual update algorithm using a modified alternating direction method of multipliers (ADMM).3. The method of wherein the traffic on the links is obtained to minimize the network delay.4. The method of wherein minimizing the network delay comprises minimizing an average network delay among all links.5. The method of wherein minimizing the network delay is subject to constraints comprising controller locations claim 3 , control flow conservation claim 3 , link capacity constraints claim 3 , and traffic bandwidth guarantees.6. The method of wherein links are selected for control traffic as a function of residual capacity of available links.7. The method of wherein links having a highest residual capacity as a function of data flows on the links are selected for control traffic.8. The method of wherein the control traffic comprises a first packet of a new data flow.9. The method of wherein the control traffic comprises switch flow table ...

METHOD, APPARATUS AND SYSTEM FOR TRANSMITTING AND RECEIVING DATA PACKETS

A method and an apparatus for routing data packets. The solution in a communication network including a set of nodes, storing information regarding nodes of the network; and when transmitting a data packet to a destination node in the network, determining and including in the data packet the recipient identification; determining and including in the data packet the direction of the destination node in the network; determining and including in the data packet a hop count indicator indicating the number of node-to-node hops to the destination node; setting in the data packet the transmission direction indicator equal to a value corresponding to direction down and transmitting the packet. 130.-. (canceled)31. An apparatus in a first communication network comprising a set of apparatuses , the apparatus comprising:at least one processor; andat least one memory storing computer program code and information on the number of child nodes of the apparatus, control communication with apparatuses operationally connected to the apparatus by transmitting and receiving data packets, the data packets comprising a recipient identification, a transmission direction indicator, and depending on the transmission direction indicator, a hop count indicator, wherein the apparatus is configured to receive a data packet;', 'determine the transmission direction indicator of the data packet;', 'determine if the apparatus is the recipient of the data packet and process the packet if so;', 'otherwise, if the transmission direction indicator equals a value corresponding to the direction down, determine whether the hop count indicator equals zero and if so, discard the data packet;', 'otherwise, if the transmission direction indicator equals a value corresponding to direction up, transmit the data packet;', 'otherwise, reduce the hop count indicator by one; and', 'if the transmission direction indicator equals a value corresponding to direction down and the number of child nodes is larger than one ...

Network management based on assessment of topological robustness and criticality of assets

A system and method of managing a network that includes assets are described. The method includes modeling the network as a directed graph with each of the assets represented as a node and determining alternative paths to each node from each available corresponding source of the node. The method also includes computing upstream robustness of each node, computing upstream robustness of the network, and computing downstream criticality of each node. Managing the network and each asset of the network is based on the upstream robustness and the downstream criticality of each node.

Discovering cross-domain links based on traffic flow

A method for discovering a cross-domain link between ports in a network implements different compensation algorithms based on differences in the intervals used to obtain traffic flow information at the ports. A first compensation algorithm discovers the cross-domain link when the intervals have different sizes. A second compensation algorithm discovers the cross-domain link when the intervals are misaligned. The algorithms may be implemented by a cross-domain coordinator which recites count information from network devices that include the ports.

HIGH PERFORMANCE SOFTWARE-DEFINED CORE NETWORK

A system of nodes configured to form a network comprising virtual links in an overlay network provisioned over an underlay network including servers of a public network. The system includes virtual routers (VRs) at each node. Each VR is coupled to the network and to a tenant of the node, and configured to form in the network a set of virtual links corresponding to the tenant. One or more VRs includes a feedback control system comprising an objective function that characterizes the network. The VR is configured to receive link state data of the set of virtual links and control routing of a tenant traffic flow of each tenant according to a best route of the network determined by the objective function using the link state data. 181-. (canceled)82. A system comprising:a plurality of nodes configured to form a network comprising a plurality of virtual links in an overlay network provisioned over an underlay network including servers of a public network;a plurality of virtual routers (VRs) at each node, wherein each VR is coupled to the network and to a tenant of a plurality of tenants of the node, and configured to form in the network a set of virtual links corresponding to the tenant, wherein at least one VR includes a feedback control system comprising at least one objective function that characterizes the network, wherein the at least one VR is configured to receive link state data of the set of virtual links and control routing of a tenant traffic flow of each tenant according to a best route of the network determined by the at least one objective function using the link state data; anda virtual gateway coupled to a corresponding VR and tenant, and configured to control tenant traffic flows incoming to the VM from the corresponding tenant.83. The system of claim 82 , wherein each node includes a plurality of virtual machines (VMs) claim 82 , wherein each VM includes a VR of the plurality of VRs and corresponds to the tenant.84. The system of claim 83 , wherein each ...

TECHNIQUES FOR POLICY MANAGEMENT OF MULTI-CONNECTIVITY NETWORK PROTOCOLS

A multipath device for processing multipath data traffic includes: a multipath network access interface comprising at least one access interface for receiving multipath data traffic; and a host processor configured to operate at least one multi-connectivity network protocol and a multipath protocol policy manager (MPPM). The at least one multi-connectivity network protocol is configured to process data traffic of the multipath data traffic that is related to the at least one multi-connectivity network protocol and received via multiple paths of the multipath network access interface. The MPPM is configured to manage the multiple paths of the multipath network access interface and/or the at least one access interface of the multipath network access interface according to a multipath network protocol policy. The multipath network protocol policy depends on feedback from other multi-connectivity network protocols running on the host processor. 1. A multipath device for processing multipath data traffic , the multipath device comprising:a multipath network access interface comprising at least one access interface for receiving multipath data traffic; anda host processor configured to operate at least one multi-connectivity network protocol and a multipath protocol policy manager (MPPM);wherein the at least one multi-connectivity network protocol is configured to process data traffic of the multipath data traffic that is related to the at least one multi-connectivity network protocol and received via multiple paths of the multipath network access interface;wherein the MPPM is configured to manage the multiple paths of the multipath network access interface and/or the at least one access interface of the multipath network access interface according to a multipath network protocol policy;wherein the multipath network protocol policy depends on feedback from other multi-connectivity network protocols running on the host processor; andwherein the at least one multi- ...

ENHANCED DYNAMIC ENCRYPTION PACKET SEGMENTATION

A communication session may be broken up into many smaller packet bundles over many tunnels and over different routes in order to obfuscate the entire data stream. Apparatuses may dynamically build hop-by-hop tunnels in a backbone telecommunications network, segment data into packet bundles at the customer edge, or break up data traffic of a communication session along multiple routing or switching paths in order to obfuscate the data traffic of the communication session. 1. An apparatus comprising:a processor; and detecting a communication session established using at least a first address, wherein the communication session comprises a first plurality of data packets and a second plurality of data packets;', 'obtaining an indication for packet segmentation for the communication session;', 'based on the indication for packet segmentation, determining a plurality of routes to the first address, wherein the plurality of routes comprise a first route and a second route;', sending the first plurality of data packets of the communication session to the first route; and', 'sending the second plurality of data packets of the communication session to the second route., 'based on the determined plurality of routes and the indication for packet segmentation,'}], 'a memory coupled with the processor, the memory storing executable instructions that when executed by the processor cause the processor to effectuate operations comprising2. The apparatus of claim 1 , wherein the first route comprises a first plurality of routers claim 1 , and the second route comprises a second plurality of routers claim 1 , wherein the first plurality of routers and the second plurality of routers are different.3. The apparatus of claim 1 , wherein the first route comprises a first plurality of routers claim 1 , and the second route comprises a second plurality of routers claim 1 , wherein the first plurality of routers and the second plurality of routers are different virtual routers.4. The ...

DYNAMIC RULE-BASED FLOW ROUTING IN NETWORKS

The disclosed embodiments provide a system for performing flow routing in a network. The system may include one or more nodes in the network. Each of the nodes may obtain a dynamic rule that includes a flow definition and a routing action specifying an ECMP group in the network. When a flow in the network matches the flow definition, the node routes traffic in the flow to the ECMP group based on the routing action. The node then performs subsequent routing of the network traffic in the flow to reflect changes in membership in the ECMP group. 1. A method , comprising: a flow definition; and', 'a routing action specifying an equal-cost multi-path (ECMP) group;, 'upon detecting an imbalance in link usage within a network, based on telemetry data collected from multiple nodes in the network, automatically generating a dynamic rule to redistribute flows in the network across a set of links, wherein the dynamic rule compriseswhen a flow in the network matches the flow definition, routing, by a node in the network based on the routing action, network traffic in the flow to the ECMP group; andperforming subsequent routing of the network traffic in the flow to reflect changes in membership in the ECMP group.2. The method of claim 1 , wherein performing subsequent routing of the network traffic in the flow to reflect changes in membership in the ECMP group comprises:discontinuing routing of the network traffic in the flow to a link after the link is removed from the ECMP group.3. The method of claim 1 , wherein performing subsequent routing of the network traffic in the flow to reflect changes in membership in the ECMP group comprises:routing the network traffic in the flow according to a default routing action when the ECMP group is empty.4. The method of claim 1 , wherein performing subsequent routing of the network traffic in the flow to reflect changes in membership in the ECMP group comprises:dropping the network traffic in the flow when the ECMP group is empty.5. ( ...

Distributed antenna system providing redundancy

A method of configuring a distributed antenna system (“DAS”) having digital remote units configured to provide a DAS interface to wireless communication devices connecting to the DAS, and at least one digital master unit configured to provide a DAS interface to base stations connecting to the DAS. The method includes connecting digital remote units such that each digital remote unit is connected either to at least another digital remote unit and the digital master unit or to at least two other digital remote units. The method further includes connecting at least one of the digital remote units either to other the digital remote units and the digital master unit, or to at least three other digital remote units, and connecting the digital master unit to at least two of the digital remote units, thereby providing at least one path for redundant data transport.

METHOD AND APPARATUS PROVIDING SINGLE-TIER ROUTING IN A SHORTEST PATH BRIDGING (SPB) NETWORK

A method, apparatus and computer program product for providing Virtual Routing and Forwarding (VRF) and gateway Media Access Controller (MAC) distribution is presented. At least one subnet associated with a Layer 2 Virtual Switching Network (L2VSN) is provided on a network device. A message is propagated to a distributed Datapath. Network devices install the message as a routable MAC address on the L2VSN for the Layer 3 Virtual Switching Network/Virtual Routing and Forwarding (L3VSN/VRF) associated with the message. Edge devices route packets on the L2VSN addressed to the gateway MAC address. 1. A computer-implemented method providing Virtual Routing and Forwarding (VRF) and gateway Media Access Controller (MAC) distribution , in which a computer system performs operations comprising:providing at least one subnet associated with a Layer 2 Virtual Switching Network (L2VSN) on a network device;propagating a message to a distributed datapath;installing, by devices in said distributed datapath, said message as a routable MAC address on the L2VSN for the Layer 3 Virtual Switching Network/Virtual Routing and Forwarding (L3VSN/VRF) associated with said message; androuting, by edge devices, packets on said L2VSN addressed to the gateway MAC address.2. The method of wherein said network device is positioned as an L3 controller.3. The method of wherein said L2VSN is associated with a VRF/L3VSN.4. The method of wherein said message includes a L2VSN identifier (ID) claim 1 , a L3VSN ID and a MAC address.5. The method of wherein said propagating a message is only applied to predetermined subnets of a plurality of subnets.6. The method of wherein said controller is implemented on a server with a software Datapath claim 2 , and plugged into a Network-to-Network Interface (NNI) in a Shortest Path Bridging (SPB) network.7. The method of wherein said controller is one of at least two redundant controllers.8. The method of further comprising using application controllers for Layer 4 ( ...

QUEUE MANAGEMENT IN A FORWARDER

A queue management method, system, and recording medium include Selective Acknowledgments (SACK) examining to examine SACK blocks of a forwarder to selectively drop packets in a forward flow queue based on a reverse flow queue and MultiPath Transmission Control Protocol (MPTCP) examining configured to perform a first examining to examine multipath headers to recognize MPTCP flows based on a comparison between two subflows being a part of a same superflow and a second examining to examine the reverse flow queue to determine if redundant data has been sent based on a result of the first examining, a packet in the forward flow queue from a prior transmission being dropped from the forward flow queue sent from the forwarder to a receiver if a metadata of the packet does not match a metadata of an acknowledged packet in the reverse flow queue. 1. A queue management system , comprising:a processor; and Selective Acknowledgments (SACK) examining to examine SACK blocks of a forwarder to selectively drop packets in a forward flow queue based on a reverse flow queue; and', a first examining to examine multipath headers to recognize MPTCP flows based on a comparison between two subflows being a part of a same superflow; and', 'a second examining to examine the reverse flow queue to determine if redundant data has been sent based on a result of the first examining,, 'MultiPath Transmission Control Protocol (MPTCP) examining configured to perform], 'a memory, the memory storing instructions to cause the processor to executewherein a packet in the forward flow queue from a prior transmission is dropped from the forward flow queue sent from the forwarder to a receiver if a metadata of the packet does not match a metadata of an acknowledged packet in the reverse flow queue.2. A queue management method , comprising:Selective Acknowledgments (SACK) examining to examine SACK blocks of a forwarder to selectively drop packets in a forward flow queue based on a reverse flow queue; and a ...

METHOD AND APPARATUS FOR TARGET INTEGRATED ACCESS AND BACKHAUL NODE SELECTION

Embodiment of the present application is directed to a method and apparatus for target IAB node selection. According to an embodiment of the present application, the method includes receiving hop number information and end-to-end link quality information associated with a plurality of IAB nodes, wherein the plurality of IAB nodes include serving IAB nodes of an IAB node and at least one neighbor IAB node of the IAB node, and each of the serving IAB nodes and the at least one neighbor IAB node is associated with at least one active route. The method may further include reporting end-to-end link quality information associated with each of the at least one neighbor IAB node. 1. A method comprising:receiving hop number information and end-to-end link quality information associated with a plurality of integrated access and backhaul nodes, wherein the plurality of integrated access and backhaul nodes include serving integrated access and backhaul nodes of an integrated access and backhaul node and at least one neighbor integrated access and backhaul node of the integrated access and backhaul node, and each of the serving integrated access and backhaul nodes and the at least one neighbor integrated access and backhaul node is associated with at least one active route; andreporting end-to-end link quality information associated with each of the at least one neighbor integrated access and backhaul node.2. The method of claim 1 , wherein the received hop number information comprises:the hop number of each of a plurality of routes of the integrated access and backhaul node.3. The method of claim 1 , wherein the received hop number information comprises:a minimum of the hop number of a plurality of active routes of the integrated access and backhaul node.4. The method of claim 1 , comprising:receiving at least one of a coefficient related to calculation of hop number, a coefficient related to calculation of load and a coefficient related to calculation of end-to-end link ...

NETWORK STOCHASTIC CROSS-LAYER OPTIMIZATION FOR MEETING TRAFFIC FLOW AVAILABILITY TARGET AT MINIMUM COST

The present disclosure describes system and methods for network planning. The systems and methods can incorporate network traffic demands, availability requirements, latency, physical infrastructure and networking device capability, and detailed cost structures to calculate a network design with minimum or reduced cost compared to conventional methods. In some implementations, the method include providing an initial, deterministic set of failures, and then successively performing a network optimization and a network availability simulation to determine which failures most impact the performance of the network model. The high impact failures can then be provided back into the system, which generates an improved network design while still maintaining minimum cost. 1. A method for designing a network , the method comprising:generating a minimum monetary cost network model capable of satisfying a traffic demand and responsive to a set of variables each defining one of a network cost, a physical layer feature, or a logical layer feature, a set of constraints defining a relationship between at least two variables from the set of variables, and an objective to reduce the monetary cost of a network defined by the minimum monetary cost network model;{'sub': 'o', 'generating an optimization set of network failures F;'}{'sub': 'R', 'claim-text': [{'sub': 'o', 'updating the minimum monetary cost network model capable of satisfying the traffic demand given Fand generated responsive to the set of variables, the set of constraints, and the objective to reduce the monetary cost of the network;'}, {'sub': 'R', 'generating a random set of failures F;'}, {'sub': 'R', 'determining whether the minimum cost monetary network model satisfies the traffic demand given F;'}, {'sub': R', 'R', 'R', 'o, 'in response to determining that the minimum cost network does not satisfy the traffic demands given F, selecting a subset of failures from Fand adding the subset of failures from Fto F; and'}, ...