ВЫЧИСЛЕНИЕ ДОЛГОСРОЧНЫХ РАСПИСАНИЙ ДЛЯ ПЕРЕДАЧ ДАННЫХ ПО ГЛОБАЛЬНОЙ ВЫЧИСЛИТЕЛЬНОЙ СЕТИ

Изобретение относится к передаче данных и предназначено для передачи больших объемов данных между вычислительными устройствами в WAN. Технический результат – повышение эффективности использования сети за счет обеспечения сглаживания объема трафика в сети во времени. Изобретение описывает различные технологии, связанные с диспетчеризацией сетевого трафика в сети. Запрос передать данные из первого вычислительного устройства во второе вычислительное устройство включает в себя данные, которые идентифицируют объем данных, которые должны передаваться в крайний срок, причем данные должны передаваться до крайнего срока. Долгосрочное расписание вычисляется на основе запроса, при этом долгосрочное расписание задает поток трафика через сеть для относительно долгосрочного временного горизонта. Краткосрочное расписание вычисляется на основе долгосрочного расписания, причем устройства в сети сконфигурированы на основе краткосрочного расписания. 3 н. и 17 з.п. ф-лы, 10 ил.

СПОСОБ И СИСТЕМА ПЕРЕДАЧИ АУДИОДАННЫХ И ВИДЕОДАННЫХ НА ТРАНСПОРТНОМ СРЕДСТВЕ, ТЕРМИНАЛ ТРАНСПОРТНОГО СРЕДСТВА И СЕРВЕР

СИСТЕМА И СПОСОБ ОСУЩЕСТВЛЕНИЯ СВЯЗИ С ВЫСОКОЙ ПРОПУСКНОЙ СПОСОБНОСТЬЮ В СЕТИ С ГИБРИДНОЙ ЯЧЕИСТОЙ ТОПОЛОГИЕЙ

... 1. Сеть с гибридной ячеистой топологией, содержащая множество физических сред и множество узлов, соединенных через указанные физические среды с образованием, по меньшей мере, одного маршрута наивысшей пропускной способности сети с гибридной ячеистой топологией (маршрут UTMH), содержащего множество узлов ретрансляции, каждый из которых соединен через первую физическую среду с соответствующим первым узлом и через вторую физическую среду с соответствующим вторым узлом,причем между первым узлом и вторым узлом отсутствует соединение через какую-либо из указанных физических сред,а каждые два узла указанного, по меньшей мере, одного маршрута UTMH, которые соединены через одну из указанных физических сред, не имеют каких-либо соединений через ту же самую физическую среду с любым другим из указанных узлов в указанном, по меньшей мере, одном маршруте UTMH.2. Сеть по п.1, отличающаяся тем, что указанные узлы ретрансляции выполнены с возможностью начала ретрансляции сообщения, принятого из первого ...

VERFAHREN ZUR STEUERUNG DER LEITWEGLENKUNG IN EINEM PAKETVERMITTLUNGSNETZWERK.

Selecting routes between nodes in a network based on node processing gain and lifetime

A marginal processing gain is calculated to determine the best communication link, from a selection of candidate links, to use for a communication from a first node to a second node in a multi-node communications network. The marginal processing gain is the difference between a node processing gain with the potential link added to the node and the node processing gain without the link added. The processing gain is the difference between the total input traffic and output traffic at a node, divided by the total input traffic. The marginal processing gain is used as part of an objective function which also includes a local lifetime gain using a local lifetime defined as the minimum value out of all nodes of the residual energy at a node divided by its total energy consumption. Applications include sensor networks.

STRUCTURE OF LOCALCONSCIOUS OVERLAPPING NETS ON THE BASIS OF MEASUREMENTS

PROCEDURE FOR THE IMPROVEMENT OF THE TOTAL OUTPUT ABILITY OF A WIRELESS COMMUNICATIONS NETWORK

Methods and 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 infrastructure components that make up various networks that, collectively, interconnect with one another, infrastructure components that house the physical infrastructure 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 infrastructure 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.

Method for optimal path selection for data traffic undergoing high processing or queuing delay

Described embodiments provide systems and methods for path selection proportional to a penalty delay in processing packets. A server-side intermediary may identify a delay penalty for processing packets of a server destined for a client. The server-side intermediary may be in communication via links of different latencies with a client-side intermediary. The server-side intermediary may select a second link with a latency that deviates from the lowest latency of a first link by the delay penalty. The server-side intermediary may transmit, to the client-side intermediary, duplicates of the packets via the selected second link with information indicating to hold the duplicates at the client-side intermediary. The server-side intermediary may receive an indication to drop or send the duplicates to the client. The server-side intermediary may transmit the indication to the client-side intermediary to drop or send the duplicates according to the indication.

Computing long-term schedules for data transfers over a wide area network

A method comprising: receiving a request to transfer data from a first computing device in a network to a 5 second computing device in the network, the request identifying: the second computing device; a volume of data to be transferred from the first computing device to the second computing device in accordance with the request; and a deadline, the transfer of the data from the first computing device to the 10 second computing device to be completed prior to the deadline; responsive to receiving the request and based upon the request, executing an optimization process to compute a long-term schedule that covers a plurality of time units, the long-term schedule generated to facilitate completion of the transfer of the data from the first computing device to the second computing device prior to the deadline, the long 15 term schedule identifies, for a time unit in the plurality of time units, at least one path in the network over which the data is to be transferred from the first computing ...

METHOD FOR FASTER MOBILITY HANDOFF OF A MOBILE NODE

SYSTEMS AND METHODS FOR ADAPTIVE LOAD BALANCED COMMUNICATIONS, ROUTING, FILTERING, AND ACCESS CONTROL IN DISTRIBUTED NETWORKS

The disclosure provides examples of systems and methods for adaptive load balancing, prioritization, bandwidth reservation, and/or routing in a network communication system. In various embodiments, the disclosed methods can provide reliable multi-path load-balancing, overflow, and/or failover services for routing oyer a variety of network types. In some embodiments, disconnected routes can be rebuilt by selecting feasible connections. The disclosure also provides examples of methods for filtering information in peer-to-peer network connections and assigning permission levels to nodes in peer-to-peer network connections. Certain embodiments described herein may be applicable to mobile, low-powered, and/or complex sensor systems.

Target-oriented computing unloading method

METHOD FOR OPTIMIZING A SERVICE INFORMATION DISSEMINATION QOS NETWORK

L'invention concerne un procédé d'optimisation de monitoring et de la dissémination d'informations de qualité de liens dans un réseau overlay comportant plusieurs nœuds Ni, Nj, dont plusieurs nœuds sont des rendez-vous serveurs Rs, au moins un nœud client A et au moins un nœud client B, dans lequel chaque nœud client « monitore » les liens qu'il possède avec les nœuds du réseau en utilisant plusieurs valeurs de fréquence, la liste des liens à monitorer à une valeur de fréquence donnée étant établie par les nœuds rendez-vous serveurs.

PROCESS Of ESTIMATE OF TRANSFER TIME OF PACKAGES VIA a Wireless networking, AND MOBILE TERMINAL FOR the IMPLEMENTATION Of SUCH a PROCESS

Au moins un des commutateurs de paquets (32) d'un réseau de communication sans fil (20) constitue une passerelle de ce réseau avec un réseau fixe de transmission de paquets (12). Selon le procédé, on transmet un ou plusieurs messages de mesure à un terminal mobile (23) en réponse à une requête d'indication de temps de transfert de paquet issue de ce terminal mobile, et on détermine, à l'aide du message de mesure reçu par le terminal mobile, un temps de transfert de paquet entre le terminal mobile et une passerelle (32) du réseau de communication sans fil avec le réseau de transmission de paquets, et éventuellement un temps de transfert de paquet entre la passerelle (32) et une unité distante (35, 36).

METHOD FOR ASSIGNING MASTER CONTROLLER IN SOFTWARE DEFINED NETWORK

A method of assigning a master controller is disclosed. The method of allocating a master controller includes a step of setting an objective function with a decision variable as the number of flows via switches having different master controllers among the flows introduced for a unit time, wherein it is implemented by one of a plurality of controllers included in a software defined network system, a step of setting at one or more constraints, and a step of obtaining a solution that satisfies the one or more constraints and minimizes a decision variable. It is possible to minimize an average flow setup delay time. COPYRIGHT KIPO 2018 (AA) Start (BB) End (S100) Allow a controller to measure D_S and D_M (S300) Set an objective function (S500) Set at least one constraint (S700) Satisfy the constraint and determine x^c_i which minimizes a decision making variable (S900) Determine a master controller according to the determined x^c_i ...

SYSTEMS AND METHODS FOR ADAPTIVE LOAD BALANCED COMMUNICATIONS, ROUTING, FILTERING, AND ACCESS CONTROL IN DISTRIBUTED NETWORKS

The disclosure provides examples of systems and methods for adaptive load balancing, prioritization, bandwidth reservation, and/or routing in a network communication system. In various embodiments, the disclosed methods can provide reliable multi-path load-balancing, overflow, and/or failover services for routing oyer a variety of network types. In some embodiments, disconnected routes can be rebuilt by selecting feasible connections. The disclosure also provides examples of methods for filtering information in peer-to-peer network connections and assigning permission levels to nodes in peer-to-peer network connections. Certain embodiments described herein may be applicable to mobile, low-powered, and/or complex sensor systems.

ROUTING METHOD AND ROUTING DEVICE FOR A PACKET-ORIENTED COMMUNICATION NETWORK

For routing a data packet in a packet-oriented communication network, a transmission delay probability distribution, defined by a probability density function, is determined (S21) for any link between adjacent nodes of a path from a source node to a destination node. For the different possible paths, from the source node to the destination node, determined are in each case a total transmission delay probability distribution (S22) through convolution of the probability density functions of the links between the adjacent nodes of the respective path. The preferred path for routing the data packet is selected (S3) from the different possible paths, based on the total transmission delay probability distributions determined for the different possible paths.

Multiple topology routing architecture in computer networks

In a multiple interface, low power and lossy network comprising a plurality of nodes, a low transmission power and medium transmission power topology are defined for the network and a channel-hopping schedule is defined for the devices operating in each topology. A sender determines that data is capable of being transmitted via a link on the low transmission power topology. The sender determines the transmission parameters for the transmission of the data over the link on the low transmission power topology and determines a low transmission power channel for transmission of the data. The sender transmits the determined channel and the transmission parameters to the receiver. The sender transmits the data via the determined channel in the low transmission power topology.

Method and apparatus for reducing delay jitter

Elastic buffering takes place within a head end terminal (200). An elastic buffer (206) has the effect of shifting time at its output frame-of-reference backward by a fixed amount to compensate for unknown time differences between time at its input frame-of-reference and time at the frame-of-reference of a remote node (150). The amount of time that the elastic buffer (206) shifts data is determined by a time-stamping technique, where data packets are time stamped at the remote node (150) and the time stamp is analyzed at the head end terminal (200) to determine the time shift.

DATA TRANSPORT USING GEOGRAPHICAL LOCATION

A public network links a plurality of nodes, each associated with at least one network address. A transport network connects a plurality of routers, each of which is also connected to the public network. A database holds geographical location information associated with respective network addresses on the public network. The database is used to determine which of the routers is closest to geographical locations associated with the network addresses. Information is stored that identifies these closest routers. The information is suitable for use in a routing protocol for routing data packets through the transport network to a destination outside the transport network.

System and method for computing cost metrics for wireless network links

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.

Maximum Transmission Unit Size Reporting Using AT Commands

A method of control Maximum Transmission Unit (MTU) reporting and discovery using AT commands is proposed. In communications networks, the MTU of a communication protocol of a layer is the size (in bytes or octets) of the largest protocol data unit that the layer can pass onwards. In an IP network, IP packets may be fragmented if the supported MTU size is smaller than the packet length. In accordance with one novel aspect, the packet data protocol (PDP) context of a packet data network (PDN) connection comprises MTU information. By introducing MTU information to the PDP contexts, TE can use AT commands to query MTU parameters from the network and thereby avoid fragmentation. TE can also use AT command to set MTU parameters and thereby control MTU discovery. 1. A method , comprising:establishing a packet data network (PDN) connection by a terminal equipment (TE) in a mobile communication network;providing an Attention (AT) command by the TE, wherein the AT command is related to maximum transmission unit (MTU) information of the PDN connection, and wherein the AT command is a set AT command initiated by the TE for setting a list of Packet Data Protocol (PDP) context parameters including an MTU discovery option that indicates whether the TE prefers to discover an MTU size through a Non-Access-Stratum (NAS) signaling;obtaining the MTU size from a mobile termination (MT); andprocessing application data associated with the PDN connection and generating packets based on the MTU size obtained from the MT.2. The method of claim 1 , wherein the list of PDP context parameters comprises a context identification (CID) claim 1 , an EPS bearer ID claim 1 , an access point name (APN) claim 1 , a local IP address claim 1 , and the MTU size.3. The method of claim 1 , wherein the application data is encapsulated in transport layer and then segmented in IP layer based on the MTU size.4. The method of claim 1 , wherein the application data is segmented in transport layer based on a ...

ENERGY-BALANCED AND LATENCY-CONSTRAINED ROUTING METHODS IN WIRELESS NETWORK

A method of operating an access control system comprising a plurality of access controls, the method comprising: determining an energy metric of each of the plurality of access controls; determining a latency metric of each of the plurality of access controls; transmitting the energy metric of each of the plurality of access controls; transmitting the latency metric of each of the plurality of access controls; collecting the energy metric and the latency metric at a head node or collecting energy metric at each of the plurality of access controls from a 1-hop transmission distance; and determining a data route through the plurality of access controls in response to the energy metric of each of the plurality of access controls and the latency metric of each of the plurality of access controls.

MINIMIZATION OF RADIO RESOURCE USAGE IN MULTI-HOP NETWORKS WITH MULTIPLE ROUTINGS

Packets in a multi-hop wireless network are routed based on the available link throughputs, network node congestion and the connectivity of the network in a manner that minimizes the use of radio resources and minimizes delay for packets in multi-hop system. The routing method also avoids congestion in the access network, especially near the network access points as provided by network access nodes. Each wireless network node maintains a link table for storing link conditions and associated route costs. Packets are routed according to the low cost route. Subsequent wireless network nodes evaluate whether a lower cost route is available and, if so, route the data packet according to the lower cost route. Every wireless network node transmits the data packet, a specified route and a time stamp indicated a time of the last data entry in the link table that was used to calculate the low cost route.

TECHNIQUES FOR SMART DATA ROUTING

Techniques for smart data routing are described. A system may include a storage module configured to store network conditions for a plurality of networks and locations and a server device. The server device may be configured to determine network conditions for each of a plurality of networks and locations based upon detected usage of at least one mobile application being accessed via each of the plurality of networks and in each of the locations. Determined network conditions may be stored at the storage module. The server may be further configured to receive a request for a communication from a client device. Based upon at least the determined network conditions, the server may be configured to determine routing information for the communication. Once determined, the server may be configured to provide the routing information for the communication to the client device.

Method and apparatus for improving network performance in a communication system

A method and apparatus is disclosed for improving network performance in a communication system. A system that incorporates teachings of the present disclosure may include, for example, a network management system (NMS) that manages operations of a communication system including a mobile telephone switching office (MTSO) coupled to a plurality of wireless base terminals (WBTs) by way of a corresponding plurality of network elements, having a network configuration element that identifies for each of the plurality of WBTs a resultant communication path to the MTSO according to a plurality of performance characteristics calculated from alternative communication paths connecting combinations of the WBTs to the MTSO. Additional embodiments are disclosed.

Providing recommendations for implementing virtual networks

Some embodiments provide a novel method for deploying different virtual networks over several public cloud datacenters for different entities. For each entity, the method (1) identifies a set of public cloud datacenters of one or more public cloud providers to connect a set of machines of the entity, (2) deploys managed forwarding nodes (MFNs) for the entity in the identified set of public cloud datacenters, and then (3) configures the MFNs to implement a virtual network that connects the entity's set of machines across its identified set of public cloud datacenters. In some embodiments, the method identifies the set of public cloud datacenters for an entity by receiving input from the entity's network administrator. In some embodiments, this input specifies the public cloud providers to use and/or the public cloud regions in which the virtual network should be defined. Conjunctively, or alternatively, this input in some embodiments specifies actual public cloud datacenters to use.

Network latency measurement and analysis system

Deploying a point of presence (PoP) changes traffic flow to a cloud service provider. To determine if the PoP improves the performance of a cloud service to a client, actual network latencies between the client and the cloud service are measured. In more complex scenarios, multiple PoPs are used. The client sends multiple requests for the same content to the cloud provider. The requests are sent via different routes. The cloud provider serves the requests and collates the latency information. Based on the latency information, a route for a future request is selected, resources are allocated, or a user interface is presented. The process of determining the latency for content delivered by different routes may be repeated for content of different sizes. A future request is routed along the network path that provides the lowest latency for the data being requested.

Reclaiming transmission priority following network topology formation

In one embodiment, a method comprises: joining, by a network device, a network topology rooted by a root network device in a data network, and in response transmitting an advertisement indicating a position of the network device in the network topology; suppressing a second transmission based on initiating a deferred transmission operation in response to transmitting the advertisement; maintaining the deferred transmission operation to enable a prescribed minimum number of other network devices to join the network topology at respective identified lower positions than the position of the network device; and changing, by the network device, from the deferred transmission operation to an accelerated operation in response to expiration of a prescribed deferral interval or detecting the prescribed minimum number of other network devices having the respective identified lower positions, the accelerated operation enabling the network device to initiate transmission of a data packet before the ...

METHOD AND SYSTEM FOR PROVIDING RESILIENCY IN INTERACTION SERVICING ACROSS DATA CENTERS

A system and a method for overcoming a partial failure of an application in a telephony communication system are provided. The method includes: receiving information indicating that a first application has experienced a partial failure; receiving, from each of a plurality of applications, metadata that relates to a corresponding ordered priority of partitions, a corresponding Availability Zone from among a plurality of Availability Zones in which the respective application is located, and a corresponding instance index within the corresponding Availability Zone; sorting the received metadata with respect to the corresponding Availability Zone and with respect to the corresponding instance index; and reassigning, based on a result of the sorting, the first application to an instance index within the Availability Zone in which the first application is located such that a number of the partitions within instance indexes in the corresponding Availability Zone is balanced.

Distributed data grid routing for clusters managed using container orchestration services

A cloud-native architecture for containerized systems using consistent hashing routing is described. A reverse proxy server executing on a container-based cluster of compute nodes managed using a container orchestration service may determine a current data grid topology. The reverse proxy server may receive a first request from a first client device to retrieve first data from the container-based cluster of compute nodes. The request may be parsed to determine a key of a key-value pair and a hash value may be computed using the key. A consistent hashing algorithm may be executed to determine a node associated with the hash value. The first data may be retrieved from the node using the hash value. The first data may be sent to the first client device.

METHOD FOR DISTRIBUTING MESSAGES TO DESTINATION NODES

Equalized network latency for multi-player gaming

A method is provided for equalizing latency among a group of connections that are being used by the same latency-sensitive application, such as for multi-player network gaming. Delay is added to the packet flow in each connection as necessary at the provider edge router connecting the application server to the network. An NMS connected to the provider edge router continuously monitors the round-trip delay of each connection, determines the additional delay of each connection required to equalize the delays, and informs the provider edge router. The provider edge router buffers traffic on each connection for the respective duration as indicated by the NMS. The NMS may also reroute some of the connections over higher latency resources to reduce the amount of buffering required, which provides the additional advantage of using what might otherwise be less used or economically less valued resources.

MESSAGE SENDING METHOD, NETWORK NODE AND SYSTEM

This application discloses a packet sending method, a node, and a system. A controller obtains a forwarding latency requirement of a service flow and a destination address of the service flow, and determines a forwarding path that meets the forwarding latency requirement. The controller determines that an ingress node forwards a first cycle time number of a packet and an intermediate node forwards a second cycle time number of the packet, and separately determines a corresponding adjacent segment identifier. A label stack generated by the controller includes the adjacent segment identifier corresponding to the ingress node and the adjacent segment identifier corresponding to the intermediate node. The controller sends the label stack to the ingress node, to trigger the ingress node to forward the packet within a period of time corresponding to the first cycle time number, where the packet belongs to the service flow. The controller determines the forwarding path based on the forwarding ...

Multimedia communcation and collaboration system and protocols

A system is described that includes a real-time routing server to route and process multimedia sessions over a network. The system also includes a group server to manage the multimedia communications sessions over the network. The group server is coupled to the routing server. The system further includes a plurality of end-point processing devices to schedule and conduct multimedia communications sessions over the network. The plurality of end-point processing devices are coupled to the routing server and the group server. Protocols determine the topology of the network, reserve bandwidth, reserve media processing resources, and find the best route and the best real-time routing server to transfer and process multimedia data.

Content centric and load-balancing aware dynamic data aggregation

Communication method

Routing according to transmission delay in an ad hoc network

A method of determining a route in an ad hoc network includes the steps of sending, from a source node, a routing request message to other nodes in the network, measuring message transmission delay associated with the sending of said message, and determining, on the basis of message transmission delays, a suitable route for transmission of a packet of data. The route may be determined in accordance with the MAC delay and may be normalised with respect to packet size.

Optimising communications

PROCEDURE AND SYSTEM FOR THE CONTROLLING OF THE DATA TRAFFIC IN A NETWORK

DISTRIBUTED PLANNING

PROCEDURE FOR DISTRIBUTING MESSAGES AT GOAL KNOTS

PROCEDURE FOR CALL CONTROL AROUND DELAYS WHEN STARTING MULTIMEDIA OR LANGUAGE CALLS IN AN PACKAGE-OBTAINED RADIO COMMUNICATIONS NETWORK TO MINIMIZING

Method and system for controlling data traffic in a network

Method and system for controlling data traffic in a network

Intelligent adaptive transport layer to enhance performance using multiple channels

A set of connections is established, continuously evaluated and maintained between hosts on a computer network for use in transmitting information flows in a more efficient and controlled manner. New connections are established and existing connections are terminated in a continual search for connections with better and/or different performance characteristics. Each connection may utilize the same or a different path through the network and may have performance characteristics that change over time. Several paths can be used simultaneously for a given information flow to improve network metrics including: throughput, transaction time, data consistency, latency and packet loss. Flows of information can be broken into one or more sub-flows and subflows can be assigned to one or more active connections. Furthermore, dynamic decisions regarding how flows are broken up and how they are assigned to connections can be made in response to network conditions. Through the use of these connections ...

On-demand overlay routing for computer-based communication networks

SIGNAL PROPAGATION DELAY ROUTING

A method of routing a message from a source node to a destination node in an adhoc wireless network comprising a plurality of nodes, comprising the steps of; transmitting a first message from the source node to the destination node, receiving said first message at said destination node, transmitting a second message from said destination node in response to the first message and, wherein at least one of said first message and said second message is sent between the source and destination nodes via a plurality of paths comprising at least one intermediate node,selecting a path for communication between the source node and the destination node using an indication of the time taken for at least one of said second and first messages to propagate between each node on each path.

NETWORK PATH SELECTION METHOD AND NETWORK NODE DEVICE USING THE SAME

ABSTRACT A network path selection method and a network node device using the same are disclosed. The network path selection method includes: determining whether a first uplink time parameter table is received from the first relay node device and whether a second uplink time parameter table is received from the second relay node device; when the first uplink time parameter table is received from the first relay node device and the second uplink time parameter table is received from the second relay node device, calculating a first estimated uplink time parameter according to the first uplink time parameter table and a second estimated uplink time parameter according to the second uplink time parameter table; and determining to connect to a gateway via one of the first relay node device and the second relay node device according to the first estimated uplink time parameter and the second estimated uplink time parameter. Date recue/Date Received 2020-08-28 ...

RESOURCE SELECTION IN A COMMUNICATION NETWORK

A communication system comprising an end device (101), a location server (105), and a plurality of resources (115, 116), each resource for providing individual instances of a first application. The end device (101) is configured to transmit a first test message for the first application to a first resource of the plurality of resources (115, 116) using a first access method, receive a first response message from the first resource, process the first response message to determine first performance information for the first application, generate a first update message indicating the first performance information, and transmit the first update message to a location server (105).

NETWORK ROUTING AND CONGESTION CONTROL

In a communications network of nodes (110) connected by links (115), routing of traffic is done according to routing tables available to the nodes (110). The routing table for each node shows fi elds for destination nodes (210) and for next hop nodes (205) towards those destination nodes, and traffic is routed at each node according to values entered in those fields. The nodes modify the values in the fields according to messages received from neighbouring nodes. This controls traffic flow in that values are raised on receipt of messages from neighbouring nodes. If messages are received less frequently from a node, for instance because of congestion in the network or failure of a node, the values for that node will be relatively depressed and the network will tend to route traffic away from the node.

INTELLIGENT ADAPTIVE TRANSPORT LAYER TO ENHANCE PERFORMANCE USING MULTIPLE CHANNELS

A set of connections is established, continuously evaluated and maintained between hosts on a computer network for use in transmitting information flows in a more efficient and controlled manner. New connections are established and existing connections are terminated in a continual search for connections with better and/or different performance characteristics. Each connection may utilize the same or a different path through the network and may have performance characteristics that change over time. Several paths can be used simultaneously for a given information flow to improve network metrics including: throughput, transaction time, data consistency, latency and packet loss. Flows of information can be broken into one or more sub-flows and subflows can be assigned to one or more active connections. Furthermore, dynamic decisions regarding how flows are broken up and how they are assigned to connections can be made in response to network conditions. Through the use of these connections ...

SYSTEM, METHOD AND COMPUTER PROGRAM FOR INTELLIGENT PACKET DISTRIBUTION

The present invention provides a system, method and computer program for intelligent packet distribution over a plurality of potentially diverse links. The system includes an intelligent packet distribution engine ("IPDE") that incorporates or is linked to means for executing a decision tree. The IPDE, in real time, obtains data traffic parameters and, based on the data traffic parameters and performance criteria, selectively applies one or more techniques to alter the traffic over selected communication links to conform to the data traffic parameters.

Mobile node and mobile communication method

METHOD FOR SELECTING A PATH IN A ROUTING PROTOCOL, CAPABLE OF MAXIMIZING AN OPTIMUM PATH EFFECT BY REFLECTING A STATE OF A NETWORK THAT CHANGES OVER TIME

PURPOSE: A method for selecting a path in a routing protocol is provided to enhance transmission efficiency of a network. CONSTITUTION: Each message reachable time among a plurality of path information management units that manage path information on a network is measured and a reachable time table for managing the message reachable time is configured(S110). When a reception path information management unit receives the same path information from different adjacent path information management units, it checks the number of hops of the adjacent path information management units(S120,S130). If the number of hops of each adjacent path information management units is the same, the reception path information management unit selects an optimum path based on the reachable time table(S140). © KIPO 2006 ...

METHOD AND SYSTEM TO OPTIMIZE THE GUIDANCE THROUGH MULTIPLE SUPPLIERS OF GUIDANCE AVAILABLE IN INTERNET

Un método y sistema (100) para optimizar el tráfico de encaminamiento a un destino cuando se dispone de múltiples encaminamientos. Un componente de monitoreo e inferencia de rendimiento (102) mide el rendimiento de los senderos disponibles respecto a un gran juego de subredes, y utiliza esas mediciones para inferir el rendimiento de todos los senderos disponibles respecto a un juego aún más grande de subredes. Un componente de optimización de encaminamiento (104) utiliza una función de costo que asigna un costo a una tabla de encaminamiento basándose en la información proveniente del componente (102), y las características de otro sendero, y además utiliza una metodología de minimización para encontrar una tabla de encaminamiento con un costo muy bajo, tal como lo define la función de costo. Un puente BGP (106) toma la tabla de encaminamiento generada por el componente de optimización (104) y comunica esa información a los encaminadores (116) utilizando BGP, garantizando que los encaminadores ...

IMPROVED MANAGEMENT OF A NETWORK WITH CENTRALISED DISPATCHING

The invention relates to an optimum allocation of resources in a wireless network comprising a plurality of entities (MBSi) emitting/receiving beams. The invention includes: a) drawing up a table of radiofrequency links (/, y) which can be activated between the entities, and b) activating one or more links of the table for resource allocation, taking into account the capacity of the active links. In particular, the active links are selected according to: a first criterion relating to a signal transmission quality by the active links, and a second criterion relating to a quality of service.

LOAD-BALANCED ANYCASTING AND ROUTING IN A NETWORK

A method for determining the cost of routing data is described herein, where a communication cost for routing data from a current node to a successor node over a communication channel is computed, and then a processing node cost for processing data at the current node is computed, where the processing node cost represents a ratio of data input rates to data output rates at the current node. The two computations are combined to formulate a link for the current node, or the cost of routing data through that node. The link cost can then be used in a routing algoritzm for routing data.

MULTIHOP RADIO HAZARD REPORTING SYSTEM

The invention relates to a method and a system for the propagation of a message in a radio-operated communication network, comprising a base unit (A) and a plurality of members (B through T), wherein the base unit (A) and the members (B through T) each comprise a transmitter and a receiver, the receiver being activated at cyclical switch-on times for a certain respective receiving period. According to the invention, a message to be sent from a member (C) to the base unit (A) is transmitted by the member (C) to at least one adjacent member (D, B, I) as a function of at least one rule, and the message is transmitted by the at least one adjacent member (D, B, I), according to the at least one rule, to at least one member (T, B, K, J, D) adjacent thereto, in the direction of the base unit (A). Said process is repeated such that the message is transmitted from at least one adjacent member (T, B, K, J, D) receiving the message according to the at least one rule to at least one member (T, B, K ...

Visibility packets with inflated latency

Nodes within a network are configured to adapt to changing path states, due to congestion, node failures, and/or other factors. A node may selectively convey path information and/or other state information to another node by annotating the information into packets it receives from the other node. A node may selectively reflect these annotated packets back to the other node, or other nodes that subsequently receive these annotated packets may reflect them. A weighted cost multipathing selection technique is improved by dynamically adjusting weights of paths in response to feedback indicating the current state of the network topology, such as collected through these reflected packets. In an embodiment, certain packets that would have been dropped may instead be transformed into “special visibility” packets that may be stored and/or sent for analysis. In an embodiment, insight into the performance of a network device is enhanced through the use of programmable visibility engines.

Optimizing Communications

A method of transmitting a data stream to end-user nodes of a network, and a corresponding communication system, program, and distribution system for distributing the program. The method comprises: for each of a plurality of possible combinations of routes of the stream to a plurality of consuming end-user nodes, evaluating a utility function for each of the consuming end-user nodes, the utility function being dependent on route and defining a quantitative measure of end-user benefit that would be experienced at the respective end-user node by consumption of the stream; for each of the plurality of possible combinations of routes, determining an overall utility value based on the respective evaluation of the utility functions of each of the plurality of consuming end-user nodes; and selecting a preferred combination of routes for the stream based on the overall utility values of the different possible combinations.

ADVERTISING TRAFFIC ENGINEERING INFORMATION WITH THE BORDER GATEWAY PROTOCOL

In general, techniques are described for distributing traffic engineering (TE) link information across network routing protocol domain boundaries using a routing protocol. In one example, a network device logically located within a first routing protocol domain includes a routing protocol module executing on a control unit to execute an exterior gateway routing protocol. The routing protocol module of the network device receives an exterior gateway routing protocol advertisement from a router logically located within a second routing protocol domain and decodes traffic engineering information for a traffic engineering link from the exterior gateway routing protocol advertisement. A path computation module of the network device computes a traffic engineered path by selecting the traffic engineering link for inclusion in the traffic engineered path based on the traffic engineering information.

Signal propagation delay routing

A method of routing a message from a source node to a destination node in an adhoc wireless network comprising a plurality of nodes, comprising the steps of; transmitting a first message from the source node to the destination node, receiving said first message at said destination node, transmitting a second message from said destination node in response to the first message and, wherein at least one of said first message and said second message is sent between the source and destination nodes via a plurality of paths comprising at least one intermediate node, selecting a path for communication between the source node and the destination node using an indication of the time taken for at least one of said second and first messages to propagate between each node on each path.

METHOD AND DEVICE FOR THE MODULAR ORIENTATION OF AN AVB STREAM

The invention relates to methods and to a device for the modular orientation of an AVB stream. The introduction of a new attribute (L_BRIDGE) into the reservation protocol that has been further developed for TSN allows to better use the existing mechanisms in the Ethernet Standard. To this end, each receiver and each transmitter has to announce himself in the network (already existing for the transmitters).

Data neural network system and method

This application discloses a neural network that also functions as a packet data network using an MPLS-type label switching technology. The neural network uses its intelligence to build and manage label switched paths (LSPs) to transport user packets and solve complex mathematical problems. This architecture is well suited to interconnect large numbers of processors or computers into a neural network exhibiting advanced intelligence which can be used for complex activities such as managing the power grid. However, the methods taught here can be applied to other data networks including ad-hoc, mobile, Information Centric, Content Centric, Sensor, and traditional IP packet networks, cell or frame-switched networks, time-slot networks and the like.

Method and apparatus for providing a route recommendation

A method and apparatus for providing a route recommendation are disclosed. For example, the method obtains network topology information, wherein the network topology information comprises a plurality of underlying subnetwork types for a network. The method creates a cost model for the network, and receives a request from a user for a connection to be supported by the network. The method provides the route recommendation for supporting the connection by applying the cost model.

LINK PATH CALCULATION METHOD, APPARATUS, TERMINAL AND COMPUTER-READABLE STORAGE MEDIUM

A link path calculation method, device, terminal device and non-transitory computer-readable storage medium are disclosed. The method may include: acquiring a topology containing a TSN bridge, the TSN bridge comprising a 5GS TSN virtual bridge and a common TSN bridge; acquiring a latency parameter of a link of the TSN bridge; acquiring a minimum latency Tmin achievable by the 5GS-TSN-VB and a maximum latency MaxLatency in service requirements; calculating an optimal path and determining a sum Tc of all link latencies on the optimal path; determining a maximum latency Tmax tolerated by the 5GS-TSN-VB; determining an optimal value Tmax−O of the Tmax; and sending service flow information and the Tmax−O as latency requirements to a 5GS system corresponding to the 5GS-TSN-VB, and sending the service flow information to a corresponding TSN bridge in response to path calculation being successful.

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.

Hybrid method for node organization and data routing in a peer-to-peer computer network

A method for autonomously routing data using in a peer-to-peer computer network is disclosed. The method includes identifying multiple paths from a source node to a destination node, wherein each of the multiple paths includes two or more routing segments each comprising a sending node and a receiving node. The receiving node is selected among a plurality of nodes in the peer-to-peer computer network based on round-trip times measured between the sending node and the plurality of nodes. Path packages are sent along the multiple paths from the source node to the destination node. Total one-way latencies (OWLs) associated with the multiple paths are measured using path packages from the source node to the destination node. A relayed data path is selected from the multiple paths at least in part based on the total OWLs respectively associated with the multiple paths from the source node to the destination node.

DISTRIBUTED DATA GRID ROUTING FOR CLUSTERS MANAGED USING CONTAINER ORCHESTRATION SERVICES

A cloud-native architecture for containerized systems using consistent hashing routing is described. A reverse proxy server executing on a container-based cluster of compute nodes managed using a container orchestration service may determine a current data grid topology. The reverse proxy server may receive a first request from a first client device to retrieve first data from the container-based cluster of compute nodes. The request may be parsed to determine a key of a key-value pair and a hash value may be computed using the key. A consistent hashing algorithm may be executed to determine a node associated with the hash value. The first data may be retrieved from the node using the hash value. The first data may be sent to the first client device.

COMMUNICATION DEVICE AND COMMUNICATION METHOD

A source apparatus writes, in a route request packet, the number of routes requested by the source apparatus. When a relay apparatus receives a route request packet for the first time, the relay apparatus determines a waiting time period, based on a route evaluation value that indicates a state of a route through which the route request packet has passed, and starts a timer. The relay apparatus selects route request packets having as high route evaluation values as possible, among route request packets that have been received until the timer expires, the number of route request packets to be selected being equal to the number of routes requested by the source apparatus, and then broadcasts the selected route request packets.

METHODS AND SYSTEMS FOR DETERMINING A SET OF COSTS OF ROUTES IN A NETWORK

СИСТЕМА И СПОСОБ ОСУЩЕСТВЛЕНИЯ СВЯЗИ С ВЫСОКОЙ ПРОПУСКНОЙ СПОСОБНОСТЬЮ В СЕТИ С ГИБРИДНОЙ ЯЧЕИСТОЙ ТОПОЛОГИЕЙ

Изобретение относится к технологиям сетевой связи. Технический результат заключается в повышении скорости передачи данных в сети. Сеть содержит две общие физические среды различных типов и множество узлов, соединенных через указанные физические среды с образованием по меньшей мере одного маршрута наивысшей пропускной способности сети с гибридной ячеистой топологией (маршрут UTMH), содержащего множество узлов ретрансляции, причем каждый из узлов ретрансляции соединен через первую физическую среду с соответствующим первым узлом и через вторую физическую среду с соответствующим вторым узлом и выполнен с возможностью начала ретрансляции сообщения, принятого через одну из физических сред, через другую физическую среду до завершения приема указанного сообщения, причем между первым узлом и вторым узлом отсутствует соединение через какую-либо из указанных физических сред. 2 н. и 7 з.п. ф-лы, 6 ил., 1 табл.

УСТОЙЧИВОЕ К ОТКАЗАМ АВТОМАТИЧЕСКОЕ ВОЖДЕНИЕ

СПОСОБ, РЕАЛИЗУЕМЫЙ В УСТРОЙСТВЕ, ВЫПОЛНЕННОМ С ВОЗМОЖНОСТЬЮ ПОДСОЕДИНЕНИЯ С АБОНЕНТСКОМУ ОБОРУДОВАНИЮ СЕТИ ПЕРВОГО ТИПА, СООТВЕТСТВУЮЩЕЕ УСТРОЙСТВО

ВЫЧИСЛЕНИЕ ДОЛГОСРОЧНЫХ РАСПИСАНИЙ ДЛЯ ПЕРЕДАЧ ДАННЫХ ПО ГЛОБАЛЬНОЙ ВЫЧИСЛИТЕЛЬНОЙ СЕТИ

Virtual networks on vehicles with redundant bridges providing load sharing and or failover

A system of relays (communication control units (CCU)) between on board wireless LANs and cellular phone networks, primarily for trains, is proposed (see Fig. 12 for instance). Wireless access points (50-53a/b) on the train may be assigned to virtual LANs VL1-4. Different CCU 2a/b may be assigned as masters for different VLANs to achieve load sharing. Other CCUs may be assigned a standby role to achieve redundancy. Claims specify on vehicle network nodes wherein VLAN traffic is directed to one node or another. Separate claims specify selecting amongst virtual connection passing through different intermediate nodes en route to a destination node. Selection may be on the basis of connection latency.

Signal propogation delay routing

Feedback mechanism for multicast protocols

SIGNALAUSBREITUNGSVERZÖGERUNGS ROUTING

DISTRIBUTED PLANNING

PROCEDURE FOR FASTER MOBILITY HAND OFF OF A MOBILE KNOT

SYSTEM AND PROCEDURE FOR THE IDENTIFICATION OF NETWORK PATH ACHIEVEMENT

PASSIVE ROUTE CONTROL OF DATA NETWORKS

Distributed antenna system providing redundancy

The invention relates to a distributed antenna system (DAS) and methods of configuring the DAS. In a first aspect of the invention, a method of configuring a digital DAS (100) is provided comprising a plurality of digital remote units (101-106) configured to provide a DAS interface to wireless communication devices connecting to the DAS and at least one digital master unit (110) configured to provide a DAS interface to base stations connecting to the DAS. The method comprises connecting (S101) at least a subset of the digital remote units such that each digital remote unit in the subset is connected either to at least another one of the digital remote units and the at least one digital master unit or to at least two other of the digital remote units. The method further comprises connecting (S102) at least one of the subset of digital remote units either to at least two other of the digital remote units and the at least one digital master unit or to at least three other of the digital remote ...

Computing long-term schedules for data transfers over a wide area network

A method comprising: receiving a request to transfer data from a first computing device in a network to a 5 second computing device in the network, the request identifying: the second computing device; a volume of data to be transferred from the first computing device to the second computing device in accordance with the request; and a deadline, the transfer of the data from the first computing device to the 10 second computing device to be completed prior to the deadline; responsive to receiving the request and based upon the request, executing an optimization process to compute a long-term schedule that covers a plurality of time units, the long-term schedule generated to facilitate completion of the transfer of the data from the first computing device to the second computing device prior to the deadline, the long 15 term schedule identifies, for a time unit in the plurality of time units, at least one path in the network over which the data is to be transferred from the first computing ...

TOPOLOGICAL DESIGN OF SURVIVABLE MESH-BASED TRANSPORT NETWORKS

A method of designing a telecommunications network, the method comprising the steps of A) for all working demand flows required to be routed in the telecommunications network, finding an initial topology of spans between nodes in the telecommunications network that is sufficient for routing all working demand flows, while attempting to minimize the cost of providing the spans; B) given the initial topology of spans identified in step A, finding a set of additional spans that ensures restorability of working demand flows that are required to be restored in case of failure of any span in the initial topology of spans, while attempting to minimize the cost of providing additional spans; and C) starting with the initial topology of spans and the additional spans identified in step B, finding a final topology of spans between nodes in the telecommunications network that attempts to minimize the total cost of the final topology of spans, while routing all working demand flows and ensuring restorability ...

METHOD AND DEVICE FOR ROUTING A PACKET-SWITCHED COMMUNICATION NETWORK

A routing method and device for a packet-switched communication network having m nodes controlled by a computer are disclosed, the method based on the inspection length of queues containing packets of data and on an estimate of the derivative of the packet flow with respect to the delay caused by the packets in the queues. The method and device herein are distinguished over known methods and devices by being less complex by estimating the incremental delay at each queue with formulae having a higher recursivity than existing formulae.

METHODS OF AND SYSTEMS FOR REMOTE OUTBOUND CONTROL

The present invention is directed to a system for and a method of selecting a combination of resources for transmitting data from a remote site to a destination site. The method comprises generating a list of combinations of resources at a regional site and transmitting the list to the remote site. Data is transmitted from the remote site to the regional site using each combination of resources and statistics for each transmission are stored. Metrics, based on the application at hand, are computed for each set of statistics corresponding to each transmission, and a preferred combination of resources is selected at the regional site based on the metrics. The regional site then transmits to the remote site information corresponding to the preferred combination of resources. The remote site is then configured to transmit data to the destination site using the selected combination of resources. Resources include links with a specified bandwidth, VPN and GRE tunnels, and routers configured to ...

DATA GATHERING TO ENABLE THE OPTIMIZATION OF DISTRIBUTED WI-FI NETWORKS

Systems and methods for gathering data by an access point in a Wi-Fi system for optimization include periodically or based on command from a cloud-based system performing one or more of i) obtaining on-channel scanning data while operating on a home channel and ii) switching off the home channel and obtaining off-channel scanning data for one or more off-channels; and providing measurement data based on one or more of the on-channel scanning data and the off- channel scanning data to the cloud-based system for use in the optimization of the Wi-Fi system, wherein the measurement data comprises one or more of raw data and processed data.

SYSTEM AND METHOD FOR A SELF-ORGANIZING, RELIABLE, SCALABLE NETWORK

This network system enables individual nodes in the network to coordinate their activities such that the sum of their activities allows communication between nodes in the network. This network is similar to existing ad-hoc networks used in a wireless environment. The principle limitation of those networks is the ability to scale past a few hundred nodes. This method overcomes that scaling problem.

ESTABLISHING AND MAINTAINING A VOIP CALL

A system, apparatus, and methods are provided for establishing and supporting a VOIP (Voice Over Internet Protocol) call from one computing/communication device to another. The system receives a call offer from a caller, forwards it to the callee, and identifies to each party multiple candidate relay entities for relaying their digitized voice communications. Each device binds with one or all relays, and either or both of them select one of the relays to use in a relay mode of operation of the call, if necessary. One or more of the relays inform the devices of their external network addresses, and each device passes its (internal and external) addresses to each other, through the system. The devices attempt to establish a direct connection to conduct their call in a peer-to-peer mode of operation, but may dynamically switch between peer-to-peer and relay modes as necessary.

SYSTEMS AND METHODS FOR USING GRAPH MODELING TO MANAGE, MONITOR, AND CONTROL BROADCAST AND MULTIMEDIA SYSTEMS

The present disclosure describes systems and methods for dynamic graph-based modeling and analysis system for broadcast environments. The graph model provides index-free adjacency for relationships between nodes, unlike relational databases, and is ideal for large volume, highly variable, semi structured and densely connected data. In particular, and unlike other graph-based modeling systems, the systems and methods discussed herein provide a modeling system that is aware of signal flow between components and through the graph model, from sources through processing and routing to destinations. Simultaneously, the system may be aware of signal types and formats and can enforce interconnection rules. The system may also execute in real-time, to provide dynamic and frame-accurate control of multiple routers throughout the broadcast environment.

ROUTER WITH PRECEDENCE CONTROL FUNCTION AND MACHINE-READABLE RECORDING MEDIUM RECORDING PROGRAMS

In the event of receiving the communications IP packet (packet) from the terminal directly connected to own router 1, means for collecting empty band related information 106 collects empty band related information of all routes available for the above-mentioned packet and stores the route determining information including the collected empty band related information, routes and precedence of the above- mentioned packet in the route storing portion 107. In the event of receiving the communications IP packet (packet) from the terminal directly connected to own router 1,the route specifying portion 108 finds all of the route determining information having precedence equal to above-mentioned communications IP packet and a route matching one of the route available for said IP packet. Then, the route specifying portion 108 selects a route having no overlapping with the route used by other packet with higher precedence and the largest empty band among the found route determining information as ...

SYSTEMS AND METHODS FOR PEER TO PEER COMMUNICATION

Systems, methods, and computer program products for transmitting data between devices are disclosed. A device may utilize a standardized communication system ("SCS") to transmit data directly between devices including an SCS. The SCS may discover available devices. The SCS may determine available transmission paths between a first device and a second device. The SCS may select a transmission path between the first device and the second device, and the SCS may transmit data from the first device to the second device using a standardized communication protocol ("SCP").

MECHANISM FOR NETWORK ROUTING

This invention relates to improvements in the manner in which data is routed through a data network. Specifically, an improved method for updating the status of nodes and thereby determining an optimal data route in a network is defined, where a cost is associated with each node, optimal routes are already known and there are only one or a few links which change. The method of determining the optimum path between a source node and all destination nodes comprises: assigning an infinite cost to nodes whose optimal path runs through a disconnected link or through a link whose cost has increased; and starting an expansion process with any of: (i) the nodes which are neighbors with those that have an infinite cost; (ii) the starting nodes of links whose cost has either increased or decreased; and (iii) the starting nodes of new links. In this way a new set of optimum paths to the source node is determined.

The shortest path bridging network load balancing in

Server, method and system for providing node information for P2P (Peer-to-Peer) network

The invention provides a server, a method and a system for providing node information for a P2P (Peer-to-Peer) network. The server in the P2P network comprises a location information storage unit and a node information offering unit, wherein the location information storage unit can store coordinate information for indicating coordinates of each data node in the PPN network in a coordinate system, and the coordinate system is established based on the communication time delay among data nodes in the PPN network; and the node information offering unit can select one or a plurality of data nodes from a data node containing a first data item and provide information for indicating one or a plurality of the selected data nodes based on the coordinate information, after receiving a request for the information on the data node containing the first data item.

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.

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.

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 ...

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.

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. ...

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 ...

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.

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 ...

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 ...

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 ...

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.

Context-aware pattern matching accelerator

Methods and systems for improving accuracy, speed, and efficiency of context-aware pattern matching are provided. According to one embodiment, a packet stream is received by a first stage of a hardware accelerator of a network device. A pre-matching process is performed by the first stage to identify a candidate packet that matches a string or over-flow pattern associated with access control (e.g., IPS or ADC) rules. A candidate rule is identified based on a correlation of results of the pre-matching process. The candidate packet is tokened to produce matching tokens and corresponding locations. A full-match process is performed on the candidate packet by a second stage of the hardware accelerator to determine whether it satisfies the candidate rule by performing one or more of (i) context-aware pattern matching, (ii) context-aware string matching and (iii) regular expression matching based on contextual information, the matching tokens and the corresponding locations.

SYSTEMS AND METHODS FOR PEER-TO-PEER COMMUNICATION

Systems, methods, and computer program products for transmitting data between devices are disclosed. A device may utilize a standardized communication system (“SCS”) to transmit data directly between devices including an SCS. The SCS may discover available devices. The SCS may determine available transmission paths between a first device and a second device. The SCS may select a transmission path between the first device and the second device, and the SCS may transmit data from the first device to the second device using a standardized communication protocol (“SCP”). 1. A method comprising:implementing, by a processor, a standardized communications protocol (“SCP”) on a first device, wherein the first device comprises a first chip;discovering by the first device available second devices; transmitting, using the first chip, the first packet to a second chip on a second device over a first transmission path; and', 'transmitting, using the first chip, the second packet to the second chip on the second device over the first transmission path,', 'wherein the second device uses a one time cypher to decrypt at least one of the first packet or the second packet,', 'wherein the second device assembles the first packet and the second packet into the message., 'attaching an SCP header to a first packet in a message, wherein the SCP header identifies a datagram as an SCP datagram, wherein the message is defined by the first packet and a second packet;'}2. The method of claim 1 , further comprising determining claim 1 , by the processor claim 1 , available hardware for communication between the first device and the second device.3. The method of claim 1 , further comprising:determining a fastest transmission path between the first device and the second device; andselecting the first transmission path based on determining the fastest transmission path.4. The method of claim 3 , further comprising transmitting a first portion of the message over the first transmission path and a ...

PACKET SENDING METHOD, NETWORK NODE, AND SYSTEM

A controller obtains a forwarding latency requirement of a service flow and a destination address of the service flow, and determines a forwarding path that meets the forwarding latency requirement. The controller determines that an ingress node forwards a first cycle time number of a packet and an intermediate node forwards a second cycle time number of the packet, and separately determines a corresponding adjacent segment identifier. A label stack generated by the controller includes the adjacent segment identifier and the adjacent segment identifier. The controller sends the label stack to the ingress node, to trigger the ingress node to forward the packet within a period of time corresponding to the first cycle time number. The controller determines the forwarding path based on the forwarding latency requirement of the service flow, and generates a label stack corresponding to a forwarding time point. 1. A packet sending method , comprising:obtaining, by a controller, a forwarding latency requirement of a service flow and a destination address of the service flow, and determining, based on the forwarding latency requirement and the destination address, a forwarding path for forwarding the service flow, wherein a latency of the forwarding path meets the forwarding latency requirement of the service flow, the forwarding path passes through a first network node and a second network node, the first network node is an ingress node of the forwarding path, and the second network node is an intermediate node of the forwarding path;determining, by the controller, a first cycle time number at which the first network node forwards a packet and a second cycle time number at which the second network node forwards the packet, and determining a first adjacent segment identifier corresponding to the first cycle time number and a second adjacent segment identifier corresponding to the second cycle time number, wherein the packet is a packet in the service flow;generating, by the ...

SYSTEMS AND METHODS FOR PEER-TO-PEER COMMUNICATION

Systems, methods, and computer program products for transmitting data between devices are disclosed. A device may utilize a standardized communication system (“SCS”) to transmit data directly between devices including an SCS. The SCS may discover available devices. The SCS may determine available transmission paths between a first device and a second device. The SCS may select a transmission path between the first device and the second device, and the SCS may transmit data from the first device to the second device using a standardized communication protocol (“SCP”). 1. A method comprising:implementing, by a processor for transmitting data in a peer-to-peer system, a standardized communications protocol (“SCP”) on a first device, wherein the first device comprises a first chip;transmitting, by the processor, a one time cypher to a second device comprising a second chip;selecting, by the processor, a first transmission path;dividing, by the processor, a message into a plurality of packets;transmitting, using the first chip, a first packet in the plurality of packets to the second chip on the second device over the first transmission path; andtransmitting, using the first chip, a second packet in the plurality of packets to the second chip on the second device over the first transmission path,wherein the second device uses the one time cypher to decrypt at least one of the first packet or the second packet,wherein the second device assembles the first packet and the second packet into the message.2. The method of claim 1 , wherein the implementing the SCP comprises attaching an SCP header to the first packet.3. The method of claim 2 , wherein the SCP header identifies a datagram as an SCP datagram.4. The method of claim 1 , further comprising determining claim 1 , by the processor claim 1 , available hardware for communication between the first device and the second device.5. The method of claim 1 , wherein the selecting the first transmission path comprises ...

Buffer-Less Virtual Routing

A network includes a plurality of endpoint routers and intermediate routers. When a new data stream is detected at any endpoint router, the first packet is sent to a virtual routing server with knowledge of the entire network topology. Based on the topology, current usage, and historical usage, the virtual routing server determined a path for the data stream and begins to update the routing tables of the intermediate routers to reflect the determined path. Until the update is complete, all packets in the data stream are routed first to the virtual routing server and then to their destination. Once the update is complete, packets in the data stream are routed directly along the determined path. 1. A computer-implemented method for virtually routing a first data stream from a source to a destination through a plurality of interconnected routers , comprising:(a) receiving a first packet in the first data stream at a virtual router;(b) transmitting the first packet to the destination on a pre-computed path from the virtual router to the destination;(c) determining a first path through the plurality of interconnected routers from the source to the destination; and(d) configuring each router in the first path to route data from the first data stream along the first path.2. The computer-implemented method of claim 1 , wherein the configuring in (d) is performed repeatedly starting with configuring a last router in the first path and ending with configuring a first router in the first path claim 1 , wherein the last router is closest to the destination claim 1 , and the first router is closest to the source.3. The computer-implemented method of claim 1 , further comprising:(e) receiving, at the virtual routing server, a second packet from the first data stream from the source at the virtual router; and(f) transmitting the second packet over the pre-computed path from the virtual router to the destination.4. The computer-implemented method of claim 1 , wherein the ...

System and method of delivering data that provides service differentiation and monetization in mobile data networks

An exemplary system according to the present disclosure comprises a lower tier Radiolet™ that is in communication with a local switching office of a mobile data network, and an upper tier Radiolet™ that is in communication with the lower tier Radiolet™ and an Internet datacenter. In operation, the upper tier Radiolet™ receives data extracted from the Internet datacenter and distributes at least a portion of the received data to the lower tier Radiolet™. At the lower tier Radiolet™, the portion of received data is stored. The lower tier Radiolet™ then receives a data request (relating to a portion of received data) and in turn, transmits data from the portion of received data to a source of the data request. The lower tier Radiolet™ is located closer to the source of the data request than the Internet datacenter to improve application performance and efficiency of network as well as datacenter.

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. 1. An apparatus for transmitting data based on multipath , comprising:an establishing module configured to establish Worldwide Interoperability for Microwave Access (WiMAX) connection-based multiple paths between a first device and a second device;a transmitting module configured to transmit data frames in a data queue in the multiple paths;an obtaining module configured to obtain a quality condition of the multiple paths; andan adjusting module configured to adjust the transmission of the data frames in the data queue in the multiple paths based on the quality condition.2. The apparatus according to claim 1 , wherein the apparatus is implemented on a Medium Access Control (MAC) layer.3. The apparatus according to claim 1 , wherein the adjusting module comprises:a data transmitting module configured to, in response to the quality condition of each of the multiple paths satisfying a first threshold range, transmit same data frames in the data queue in each of the multiple paths;wherein the first threshold range is a range of values associated with the quality condition.4. The ...

MULTIPLE TOPOLOGY ROUTING ARCHITECTURE IN COMPUTER NETWORKS

In a multiple interface, low power and lossy network comprising a plurality of nodes, a low transmission power and medium transmission power topology are defined for the network and a channel-hopping schedule is defined for the devices operating in each topology. A sender determines that data is capable of being transmitted via a link on the low transmission power topology. The sender determines the transmission parameters for the transmission of the data over the link on the low transmission power topology and determines a low transmission power channel for transmission of the data. The sender transmits the determined channel and the transmission parameters to the receiver. The sender transmits the data via the determined channel in the low transmission power topology. 1. A method , comprising:in a low power and lossy network (LLN) comprising a plurality of devices, creating a first routing topology, wherein the first routing topology maps one or more receiver devices that can receive transmissions from a sender device using a first type of channel;creating a second routing topology, wherein the second routing topology maps one or more receiver devices that can receive transmissions from the sender device using a second type of channel; andmapping types of data to the first and second routing topologies based at least in part on a latency characteristic and network diameter for each routing topology.2. The method of claim 1 , wherein creating the first routing topology comprises:transmitting, by a sender device to one or more receiving devices, a first router advertisement message via the first type of channel;receiving, from the one or more receiving devices, one or more response messages via the first type of channel; andmapping a link between the sender device and the receiver device to a first type of channel topology instance.3. The method of claim 1 , wherein creating the second routing topology comprises:transmitting, by a sender device linked to a receiver ...

DISTRIBUTED CONSTRAINED TREE FORMATION FOR DETERMINISTIC MULTICAST

In one embodiment, a multicast listener device floods a path lookup request to search for a multicast tree, and may then receive path lookup responses from candidate nodes on the multicast tree, where each of the path lookup responses indicates a unicast routing cost from a respective candidate node to the multicast listener device, and where each of the candidate nodes is configured to suppress a path lookup response if a total path latency from a source of the multicast tree to the multicast listener device via that respective candidate node is greater than a maximum allowable path latency. The multicast listener device may then select a particular candidate node as a join point for the multicast tree based on the particular node having a lowest associated unicast routing cost to the multicast listener device from among the candidate nodes, and joins the multicast tree at the selected join point. 1. A method , comprising:flooding, from a multicast listener device in a network, a path lookup request into the network to search for nodes on a multicast tree;receiving, at the multicast listener device, one or more path lookup responses from one or more candidate nodes on the multicast tree, wherein each of the one or more path lookup responses indicates a unicast routing cost from a respective candidate node to the multicast listener device, and wherein each of the one or more candidate nodes is configured to suppress a path lookup response if a total path latency from a source of the multicast tree to the multicast listener device via that respective candidate node is greater than a maximum allowable path latency;selecting, by the multicast listener device, a particular node of the one or more candidate nodes as a join point for the multicast tree based on the particular node having a lowest associated unicast routing cost to the multicast listener device from among the one or more candidate nodes; andjoining, by the multicast listener device, the multicast tree at ...

Methods and systems for dynamic policy based traffic steering over multiple access networks

Methods and systems for individual forward-link and return-link policies for network communication are disclosed. In some aspects, the individual forward-link and return-link policies define how data is routed over a plurality of access networks between a client-side enforcement unit and a provider-side enforcement unit. In some aspects, the individual policies may be based on metrics collected by the client-side and provider-side enforcement units, which may be positioned on each end of one or more access networks.

PROPAGATING AN INTELLIGENT WALKER AGENT IN A NETWORK TO PERFORM A COMPUTATION

In one embodiment, a device in a network receives a path computation agent configured to determine a path in the network that satisfies an objective function. The device executes the path computation agent to update state information regarding the network maintained by the path computation agent. The device selects a neighbor of the device in the network to execute the path computation agent based on the updated state information regarding the network. The device instructs the selected neighbor to execute the path computation agent with the updated state information regarding the network. The device unloads the path computation agent from the device after selecting the neighbor of the device to execute the path computation agent. 1. A method comprising:determining, by a device in a network, that the device is incapable of performing a particular computation;generating, by the device, an executable agent configured to perform the particular computation;sending, by the device, the executable agent to one or more other devices in the network to be propagated within the network until the executable agent is received by the one or more other devices capable of executing the executable agent, wherein the one or more other devices in the network execute the executable agent to perform the particular computation and determine a result of the particular computation; andreceiving, at the device, the result of the particular computation from at least one of the one or more other devices in the network that execute the executable agent.2. The method as in claim 1 , wherein determining that the device is incapable of performing the particular computation comprises:determining, by the device, that the device does not have sufficient resources available to perform the particular computation or does not satisfy a policy associated with the computation.3. The method as in claim 1 , wherein generating the executable agent configured to perform the particular computation comprises: ...

Method and apparatus for reducing response time in information-centric networks

A method for reducing response times in an information-centric network includes receiving an indication from an ingress node of a content object entering a network, the content object associated with a new delivery flow through the network. An egress node in the network for the content object and a size of the content object are identified. A backlog and bandwidth for the new delivery flow is determined based in part on the size of the content object. Backlogs and bandwidths for existing delivery flows in the network are determined. A set of candidate paths in the network for the new delivery flow from the ingress node to the egress node is determined. For each candidate path, a total response time is estimated for completion of all delivery flows for each candidate path based on the backlog and bandwidth. The candidate path having the lowest total response time is selected for the new delivery flow.

NETWORK SERVICE METHOD AND SYSTEM BASED ON SOFTWARE DEFINED NETWORKING

A network service method based Software Defined Networking (SDN) assigns forwarding devices according to network addresses and identification of a client and provides the client with an optimum route according to user requirements and current network states. A continuous monitoring process is continuously performed for route optimization based on network states, topology variations, and user feedbacks. 1. A network service method based on Software Defined Networking (SDN) , the method comprising:registering a first client and a second client to a conference manager;transmitting Internet Protocol (IP) addresses of the first client and the second client, video receiver addresses, and service requirements of the first client and the second client to an SDN controller;analyzing the received IP addresses, video receiver addresses, and service requirements to generate first forwarding information for the first client and second forwarding information for the second client;replying the first forwarding information and the second forwarding information to the first client, the second client and the conference manager;generating a first optimum route based on the first forwarding information and the second forwarding information and deploying first routing rules corresponding to the first optimum route on multiple forwarding devices;informing the first client and the second client addresses of the forwarding devices and a conference start notification;directing first data streams from the first client and second data streams from the second client to the forwarding devices and, in the meanwhile, directing data streams from other clients to the first client and the second client;obtaining a set of source and destination forwarding devices based on the first forwarding information and the second forwarding information;calculating route combinations of the set of source and destination forwarding devices to discover a backup route, between the first client and the second client ...

Method and apparatus for data network traffic control optimization

Alternate data packet routing includes employing an existing enterprise MPRS network that includes an edge enterprise network and a core network as defined by an internet service provider to the enterprise. Data is more optimally routed using multipath routing algorithms, rather than traditional single path routing as typical in MPRS networks. In an embodiment, if a particular path is experiencing delays, any alternative path can be used provided the alternative path has a round-trip time less than a predefined performance requirement time. Embodiments include collecting packet traffic data and generating routing tables that may indicate more efficient routes not available through the ISP routing procedures.

HEURISTICS FOR SELECTING NEAREST ZONE BASED ON ICA RTT AND NETWORK LATENCY

Described embodiments provide systems and methods for zone selection for distributed services. A device records latency data measured for interactions between each of a plurality of clients and a service hosted by servers in two or more zones. The device directs network communications from each of the plurality of clients to respective servers hosting the service based on zones assigned to each of the plurality of clients. The device assigns clients to zones based on the recorded latency data. For example, the device identifies a grouping for a client, determines whether the recorded latency data indicates that latency for clients in the grouping is increasing faster than a threshold rate, and selects, responsive to the determination, a zone indicated by a selected set of recorded latency data as lowest in latency. 1. A method of zone selection for distributed services , the method comprising:recording, by a device comprising a processor, latency data measured for interactions between each of a plurality of clients and a service hosted by servers in two or more zones;directing, by the device, network communications from each of the plurality of clients to respective servers hosting the service based on zones assigned to each of the plurality of clients; identifying a first grouping for the first client,', 'determining, for the first client, that the recorded latency data indicates that latency for clients in the first grouping is not increasing faster than a threshold rate, and', 'selecting, responsive to the determining for the first client, a first zone indicated by a first set of recorded latency data as lowest in latency; and, 'assigning, by the device, a first client to a first zone by identifying a second grouping for the second client,', 'determining, for the second client, that the recorded latency data indicates that latency for clients in the second grouping is increasing faster than the threshold rate, and', 'selecting, responsive to the determining for ...

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. 1. 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; anda 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.2. The system of claim 1 , wherein each node includes a plurality of virtual machines (VMs) claim 1 , wherein each VM includes a VR of the plurality of VRs and corresponds to the tenant.3. The system of claim 2 , wherein each VM is configured to isolate at least one of a control plane and a data plane of each tenant from each other tenant of the plurality of tenants.4. The system of claim 2 , wherein ...

Method for Switching a Communication Connection from a First Connection Path to a Second Connection Path

There are described packets transmitted via the first connection path comprise a first packet propagation time. Said packets are temporarily stored in a first intermediate memory of a receiver unit. The packets transmitted via the second connection path comprise a second packet propagation time and are temporarily stored in a second intermediate memory of the receiver unit. All packets stored in the first step in the first intermediate memory are emitted. Subsequently, packets stored in the second intermediate memory are emitted. According to a first embodiment, each xpacket stored in the second intermediate memory is rejected. According to a second embodiment, the output of the packets stored in the second intermediate memory is carried out in a compressed manner. 19.-. (canceled)10. A method for switching a packet-oriented communication connection between a receiver unit and a transmitter unit from a first connection path to a second connection path , data packets transmitted via the first connection path having a first packet propagation time being temporarily stored in a first intermediate memory of the receiver unit before transmission along the first connection path and data packets transmitted over the a second connection path having a second packet propagation time that is shorter than the first packet propagation time being temporarily stored in a second intermediate memory of the receiver unit prior to being transmitted along the second connection path , the method comprising:outputting all the data packets stored in the first intermediate memory;outputting the data packets stored in the second intermediate memory after all the data packets stored in the first intermediate memory are outputted, the outputting of the data packets stored in the second intermediate memory occurring such that each nth data packet stored in the second intermediate memory is discarded until a time between a transmission of the data packets at the transmitter unit and an output ...

APPARATUS AND METHOD FOR OPTIMIZED ROUTE INVALIDATION USING MODIFIED NO-PATH DAO SIGNALING

The present disclosure relates to apparatus and methods for route invalidation. In one example method, a common ancestor node of a network determines switching of a parent node of a node based on an update message received from the node using a new routing path established based on the switching of the parent node. The common ancestor node generates a No-Path message based on the update message. The No-Path message is for invalidating a previous routing path associated with the node on the switching of the parent node. The update message comprises at least one bit authorizing generation of the No-Path message by the common ancestor node. The at least one bit is placed in a transit information option in the update message. 1. A method comprising:determining, by a common ancestor node of a network, switching of a parent node of a node based on an update message received from the node using a new routing path established based on the switching of the parent node; andgenerating, by the common ancestor node, a No-Path message based on the update message, wherein the No-Path message is for invalidating a previous routing path associated with the node on the switching of the parent node, wherein the update message comprises at least one bit authorizing generation of the No-Path message by the common ancestor node, and wherein the at least one bit is placed in a transit information option in the update message.2. The method as claimed in claim 1 , wherein the common ancestor node is an upstream node common on both of a new routing path and a previous routing path in a Destination Oriented Directed Acyclic Graph (DODAG) representing the network claim 1 , and wherein the common ancestor node is a node having at least two nodes as descendants in the DODAG.3. The method as claimed in claim 1 , wherein the previous routing path associated with the node is a path established before the switching of the parent node of the node.4. The method as claimed in claim 1 , wherein the ...

Method for Controlling a Multi-Hop Transmission

Method for controlling a multi-hop transmission it is described a method for controlling a multi-hop transmission of a data packet between a base station and a user equipment via at least one relay node. A maximum allowable time period for transmitting the data packet between the base station and the user equipment via the at least one relay node is specified. The method includes calculating, based on a time information associated with a time period, which has been needed for a transmission of the data packet to the at least one relay node, and the maximum allowable time period, a remaining time period being available for the at least one relay node for transmitting the data packet, and controlling the transmission of the data packet from the at least one relay node to the base station or the user equipment based on the calculated remaining time period. 1. A method for controlling a multi-hop transmission of a data packet between a base station and a user equipment via at least one relay node ,wherein a maximum allowable time period for transmitting the data packet between the base station and the user equipment via the at least one relay node is specified, the method comprisingcalculating, based on a time information associated with a time period, which has been needed for a transmission of the data packet to the at least one relay node, and the maximum allowable time period, a remaining time period being available for the at least one relay node for transmitting the data packet, andcontrolling the transmission of the data packet from the at least one relay node to the base station or the user equipment based on the calculated remaining time period.2. The method as set forth in claim 1 , wherein calculating the remaining time period being available for the at least one relay node for transmitting the data packet is further based on a time information associated with a predicted time period claim 1 , which will be needed for a transmission of the data packet ...

System and method for message routing in a network

A transmitting end-point computes a current transmission rate for each respective outbound half-route of outbound half-routes of a route set between transmitting and receiving end-points. The transmitting end-point receives, from the receiving end-point via a respective inbound half-route of the route set, a transmission rate limit for each respective outbound half-route, the transmission rate limit computed by the receiving end-point from routing headers of messages received by the receiving end-point on the respective outbound half-route, wherein the transmission rate limit for each respective outbound half-route places an upper bound on the current transmission rate for transmissions issued on the respective outbound half-route.

Data Transmission Method and Apparatus

The method includes, when a first data packet of a data stream is received and the first data packet is not the first data packet of the data stream, determining a time interval between a first receiving time and a second receiving time, where the first receiving time is when the first data packet is received, and the second receiving time is when a second data packet is received, obtaining a sent data amount of the data stream, and determining a transmission path of the first data packet from a plurality of available transmission paths based on the time interval and the sent data amount, and transmitting the first data packet through the determined transmission path. 1. A data transmission method , implemented by a transmit end , comprises:determining a time interval between a first receiving time and a second receiving time when the transmit end receives a first data packet of a data stream, wherein the first data packet is not an initial packet of the data stream, wherein the first receiving time is when the transmit end receives the first data packet and the second receiving time is when the transmit end receives a second data packet, wherein the first data packet and the second data packet are adjacent in the data stream, and wherein the second data packet is before the first data packet;obtaining a data amount of the data stream, wherein the data amount is sent before the first receiving time;determining a first transmission path of the first data packet from available transmission paths based on the time interval and the data amount; andtransmitting the first data packet to a receive end through the first transmission path, wherein the available transmission paths can be used by the transmit end to transmit the data stream to the receive end.2. The data transmission method of claim 1 , wherein the determining comprises:selecting a second transmission path with a maximum available bandwidth from the available transmission paths when the time interval is less ...

SYSTEM AND PROCESS FOR GENERALIZED REAL-TIME TRANSPORT PROTOCOL STREAM SEGMENTATION AND RECONSTRUCTION

There is provided a network device comprising at least one processor, and a memory storing instructions which when executed by the at least one processor configure the processor to perform a method. The method comprises segmenting packets of an original data stream into at least two partial data streams, and transmitting the at least two partial data streams to a downstream receiver configured to consolidate the at least two partial data streams based on the sequence numbers of the original data stream to reconstruct the original data stream. Each of the at least two partial data streams has an identifier in a header. The at least two partial data streams maintain sequence numbers of the original data stream. 1. A network device comprising:at least one processor; and segment packets of an original data stream into at least two partial data streams, each of the at least two partial data streams having an identifier in an Internet protocol (IP) header, the at least two partial data streams maintaining sequence numbers of the original data stream; and', 'transmit the at least two partial data streams to a downstream receiver configured to consolidate the at least two partial data streams based on the sequence numbers of the original data stream to reconstruct the original data stream., 'a memory storing instructions which when executed by the at least one processor configure the processor to2. The network devised as claimed in claim 1 , wherein the at least one processor is configured to:differentiate the partial streams by at least one of a source port, a destination port, a source address, a destination address, or a combination thereof.3. The network device as claimed in claim 1 , wherein the at least one processor is configured to: packet selection packets based on fair loading across available network links;', 'packet selection and duplication based on creating redundant source packets and distributed across diverse network links;', 'sending packets across ...

TIMESLOT DISTRIBUTION IN A DISTRIBUTED ROUTING PROTOCOL FOR DETERMINISTIC WIRELESS NETWORKS

In one embodiment, a particular node operates a distributed routing protocol in a shared-media communication network, and distributes timeslot allocations using the routing protocol, where the particular node as a parent node allocates a pool of timeslots available to child nodes of the parent node. The parent node specifically allocates particular timeslots from the pool to particular child nodes according to particular flows from a source to a target in the shared-media communication network in order to meet a defined time budget for a resultant time-synchronized path from the source to the target. 1. A method , comprising:operating, at a particular node, a distributed routing protocol in a shared-media communication network;distributing timeslot allocations using the routing protocol, where the particular node as a parent node allocates a pool of timeslots available to child nodes of the parent node; andallocating particular timeslots from the pool to particular child nodes according to particular flows from a source to a target in the shared-media communication network in order to meet a defined time budget for a resultant time-synchronized path from the source to the target.2. The method as in claim 1 , further comprising:determining a hop-distance (N) of the parent node from a root node of the shared-media communication network; and{'sup': 'th', 'determining the pool of timeslots available to child nodes of the parent node as timeslots that are multiples of an (N+2)prime number.'}3. The method as in claim 1 , further comprising:determining whether a particular timeslot is clear prior to allocating that particular timeslot.4. The method as in claim 1 , further comprising:resolving timeslot collisions with another node based on an amount of traffic at the parent node and the other node.5. The method as in claim 4 , wherein the amount of traffic is based on a number of child nodes of the parent node and the other node claim 4 , respectively.6. The method as in ...

CONTEXT-AWARE PATTERN MATCHING ACCELERATOR

Methods and systems for improving accuracy, speed, and efficiency of context-aware pattern matching are provided. According to one embodiment, a packet stream is received and pre-matched by an acceleration device with one or more conditions to identify packets meeting the one or more conditions. The acceleration device then correlates at least one identified packet based on the one or more conditions to generate matching tokens of the packet that meet the one or more conditions and sends, to one or more processors of the acceleration device, the matching tokens along with identifiers of the one or more conditions so that the processors can process the matching tokens and the identifiers of the one or more conditions based on one or more of context aware string matching, regular expression matching, and packet field value matching to extract packets that match context of the one or more conditions. 1. A method comprising:receiving, by a network interface of a network device, a packet stream;identifying one or more packets within the packet stream that satisfy one or more conditions of a plurality of predefined conditions by pre-matching, by an acceleration device of the network device, the packet stream with the plurality of predefined conditions;generating matching tokens of a packet of the one or more identified packets by correlating, by the acceleration device, the packet based on the one or more satisfied conditions; andextracting information from the packet, by the acceleration device, performing context and pattern matching processing on the packet, wherein the context and pattern matching processing includes one or more of context aware string matching, regular expression matching and packet field value matching based on the matching tokens and information regarding the one or more satisfied conditions.2. The method of claim 1 , further comprising the steps of:determining locations within the packet of the matching tokens; andsending the determined locations ...

Push-based short-cut requests within a directed acyclic graph

In one embodiment, a root of a directed acyclic graph (DAG) may determine transmission of critical traffic from a first device to a second device in a computer network using the DAG, and may also determine a maximum tolerable delay of the critical traffic. As such, the root may compute, based on a known topology of the computer network, a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay. The root may then inform the first device of the P2P path to the second device to cause the first device to use the P2P path for the critical traffic.

OPTIMIZATION FRAMEWORK FOR MULTI-TENANT DATA CENTERS

Systems and methods for decoupled searching and optimization for one or more data centers, including determining a network topology for one or more networks of interconnected computer systems embedded in the one or more data center, searching for routing candidates based on a network topology determined, and updating and applying one or more objective functions to the routing candidates to determine an optimal routing candidate to satisfy embedding goals based on tenant requests, and to embed the optimal routing candidate in the one or more data centers. 1. A computer implemented method for decoupled searching and optimization for one or more data centers , comprising:determining a network topology for one or more networks of interconnected computer systems embedded in the one or more data centers;searching for routing candidates based on a network topology determined; andupdating and applying one or more objective functions to the routing candidates to determine an optimal routing candidate to satisfy embedding goals based on tenant requests, and to embed the optimal routing candidate in the one or more data centers.2. The method of claim 1 , further comprising determining Virtual Terminal Network (VTN) information claim 1 , wherein the VTN information includes a list of Virtual Machines (VMs) in the VTN and a hypervisor hosting each of the VMs.3. The method of claim 1 , further comprising refining a search space for the searching for routing candidates using a scaled exhaustive search.4. The method of claim 3 , wherein the scaled exhaustive search further comprises searching only selected switches and/or hypervisors for all spanning trees that satisfy a pre-determined size constraint specified during the refining a search space.5. The method of claim 1 , wherein the searching further comprises:determining all common nodes for a hypervisor set;locating one downward path from each common node to each hypervisor in the hypervisor set for each common node in a ...

SYSTEMS AND METHODS FOR USING GRAPH MODELING TO MANAGE, MONITOR, AND CONTROL BROADCAST AND MULTIMEDIA SYSTEMS

The present disclosure describes systems and methods for dynamic graph-based modeling and analysis system for broadcast environments. The graph model provides index-free adjacency for relationships between nodes, unlike relational databases, and is ideal for large volume, highly variable, semi structured and densely connected data. In particular, and unlike other graph-based modeling systems, the systems and methods discussed herein provide a modeling system that is aware of signal flow between components and through the graph model, from sources through processing and routing to destinations. Simultaneously, the system may be aware of signal types and formats and can enforce interconnection rules. The system may also execute in real-time, to provide dynamic and frame-accurate control of multiple routers throughout the broadcast environment. 1. A method of managing broadcast resources via a graph-based model , comprising:identifying, by a management system of a broadcast environment, characteristics of each of a plurality of broadcast resources, the characteristics including at least an input or output;generating, by the management system, a graph-based model of the plurality of broadcast resources based on the identified characteristics;receiving, by the management system, a request to route a signal from a first broadcast resource of the plurality of broadcast resources to a second broadcast resource of the plurality of resource;selecting, by the management system, a path from the first broadcast resource to the second broadcast resource via at least one additional broadcast resource, based on the identified characteristics of each of the plurality of broadcast resources; andcommanding, by the management system, the first broadcast resource, second broadcast resource, and at least one additional broadcast resource to send and receive signals along the selected path.2. The method of claim 1 , wherein the characteristics further include at least one input signal ...

SYSTEM FOR AUTO-COMMISSIONING OF LUMINAIRES AND ASSET TRACKING

A system includes luminaires at a premises, where each luminaire has a light source, processor and radio frequency (RF) transceiver. The processor is configured to control the RF transceiver of the respective luminaire to transmit ranging signals to neighboring luminaires and receive response signals from neighboring luminaires. The processor computes time of flight (ToF) values relative to the neighboring luminaires. The system also includes a location solving server having a processor configured to receive the ToF values from the luminaires, compute relative distances between the luminaires based on the ToF values, and determine relative locations of the luminaires within the premises based on the computed relative distances between luminaires. Knowledge of the relative locations of the luminaires, for example, may be used in personnel or asset tracking, e.g. based on data sent via light from the luminaires or by ranging and response signals exchanged with RF enabled assets. 1. A system , including:a plurality of luminaires for location at a premises, each luminaire among the plurality of luminaires including a light source, a processor and a radio frequency (RP) transceiver, control the RF transceiver of the respective luminaire to transmit ranging signals to neighboring luminaires,', 'receive, through the RF transceiver of the respective luminaire. a response signal transmitted by the RF transceiver of each of the neighboring luminaires, and', 'for each respective neighboring luminaire, compute a time of flight (ToF) value[s] relative to the respective neighboring luminaire[s] indicating a time delay between transmitting a ranging signal[s] and receiving the response signal[s] from the respective neighboring luminaire; and, 'wherein the processor of each respective one of the plurality of luminaires is configured toa location solving server including a processor and coupled, to communicate with the luminaires, receive the ToF values from each respective one of ...

Method and Network Device for Computing Forwarding Path

A method includes receiving, by a network device, notification packets separately sent by a plurality of forwarding nodes, where each notification packet includes interface forwarding delay information of the forwarding node that sends the notification packet, device forwarding delay information of the forwarding node, and a transmission delay of a link connected to the forwarding node; obtaining the interface forwarding delay information and the device forwarding delay information of each of the plurality of forwarding nodes, and obtaining a transmission delay of a link between the plurality of forwarding nodes; and computing a forwarding path between a first forwarding node and a second forwarding node, where a forwarding delay of the forwarding path meets a delay requirement of a service.

SWITCH-CONNECTED DRAGONFLY NETWORK

A switch-connected dragonfly network and method of operating. A plurality of groups of row switches is organized according to multiple rows and columns, each row including multiple groups of row switches connected to form a two-level dragonfly network. A plurality of column switches interconnect groups of row switches along respective columns, a column switch associated with a corresponding group of row switches in a row. A switch port with a same logical port on a row switch at a same location in each group along the respective column connects to a same column switch. The switch-connected dragonfly network is expandable by adding additional rows, an added row comprising a two-level dragonfly network. A switch group of said added row associated with a column being connects to an available port at an existing column switch of said column by corresponding added S path link with no re-cabling of the switched network required. 1. A switching network comprising:a plurality of groups of row switches organized according to multiple rows and columns, each row comprising multiple groups of row switches connected to form a two-level dragonfly network;a plurality of column switches for interconnecting groups of row switches along columns, one or more column switches associated with a corresponding group of row switches in a row,wherein for each group of row switches along a column, a switch port on each row switch at a same logical location in each group connects to a same column switch over a corresponding switch S path link.2. The switching network of claim 1 , wherein each group of said plurality of groups of row switches comprises:a plurality of multi-port switches, each switch enabling routing of packets between any switch within said group over a local L path link interconnecting said multi-port switches within the group, each multi-port switch enabling routing of packets between any group among the plurality of groups along a row over a global D path link ...

UNIFIED RADIO ACCESS NETWORK (RAN)/MULTI-ACCESS EDGE COMPUTING (MEC) PLATFORM

A device can receive, from a node in a core network, application identifiers associated with applications accessible by a first user device. The application identifiers can be associated with latency requirements. The device can obtain, from the first user device, a first packet associated with a first packet flow. The device can compare information regarding the first packet flow, and the application identifiers to determine that the first packet is destined for a low-latency application having a specified latency range. The device can identify a first low-latency bearer that satisfies the specified latency range associated with the low-latency application. The device can map the first packet flow to the first low-latency bearer, and communicate packets, associated with the first packet flow, using the first low-latency bearer. The packets can include data packets communicated between an entity hosting the low-latency application and the first user device, while bypassing the core network. 1. A method , comprising: 'wherein the application identifiers are associated with latency requirements;', 'obtaining, by a device and from a node in a core network, application identifiers associated with applications accessible by a first user device,'} wherein the first packet is associated with included in a first packet flow, and', 'wherein the first packet flow is a request communication session associated with the first user device;, 'obtaining, by the device and from the first user device, a first packet,'}comparing, by the device, information regarding the first packet flow and the application identifiers;determining, by the device, that the first packet is destined for a low-latency application having a specified latency range based on a first result of comparing the information regarding the first packet flow and the application identifiers;identifying, by the device, a first low-latency bearer configured to satisfy the specified latency range associated with the low- ...

ROUTING PACKETS IN DIMENSIONAL ORDER IN MULTIDIMENSIONAL NETWORKS

Examples relate to routing packets in dimensional order in multidimensional networks. A packet is received at a network device in a fully connected multidimensional network and all possible candidate output ports for the packet to be routed to the destination network device with a dimensional order are determined. The candidate output ports correspond to candidate minimal paths and candidate non-minimal paths between the network device and the destination network device. An optimal output port among all the candidate output ports is selected and the packet is routed to a next hop of the network though the optimal output port using a first resource class when the optimal output port corresponds to a candidate minimal path and a second resource class when the optimal output port corresponds to a candidate non-minimal path. 1. A method , comprising:receiving a packet at a network device of a plurality of network devices in a fully connected multidimensional network, wherein the packet is to be routed to a destination network device;determining, by a routing engine of the network device, all possible candidate output ports for the packet to be routed to the destination network device in a dimensional order, the candidate output ports corresponding to candidate minimal paths and candidate non-minimal paths between the network device and the destination network device;selecting, by the routing engine, an optimal output port among all the candidate output ports; androuting, by the routing engine, the packet to a next hop of the network though the optimal output port using a first resource class when the optimal output port corresponds to a candidate minimal path and a second resource class when the optimal output port corresponds to a candidate non-minimal path.2. The method of claim 1 , wherein the first resource class is a first virtual channel (VC) and the second resource class is a second VC.3. The method of claim 1 , wherein the first resource class is a first packet ...

MOBILE RELAY NETWORK INTELLIGENT ROUTING

A method for determining a route for communication across a network in real-time, said method including: collecting a set of network delay information at a caller device; storing the set of network delay information at the caller device; based on a stored set of network delay information at the caller device and the callee device, determining, by the caller device, in cooperation with the callee device, a set of relay server candidates to be used to relay data packets between the caller device and the callee device; and based on calculated round trip times for probing data packets set out and sent back, selecting, by the caller device in cooperation with the callee device, a shortest routing path as an active routing path for use for transporting a first data packet between the caller device and the callee device. 1. A computer-implemented method for determining a route for communication across a network in real-time , said computer-implemented method comprising:collecting a set of network delay information at a caller device, wherein said set of network delay information comprises distance information relating to a distance between said caller device, a callee device and relay servers of a set of relay servers within said network;storing said set of network delay information at said caller device;based on a stored set of network delay information at said caller device and said callee device, determining by said caller device in cooperation with said callee device, a set of relay server candidates of said set of relay servers to be used to relay data packets between said caller device and said callee device;calculating, by said caller device in cooperation with said callee device, a round trip time for probing data packets sent out and sent back by said caller device and said callee device and to each other through relay server candidates of said set of relay server candidates; andbased on said calculating, selecting, by said caller device in cooperation with said ...

COMMUNICATION SYSTEM, CONTROL APPARATUS, AND STORAGE MEDIUM

A communication system including: a control apparatus configured to: for each combination of communication protocols that are used in communication networks respectively, estimate each transferring time length based on a size of a specified data and each overall throughput of the communication networks to which each combination of communication protocols is applied, each transferring time length being a time length taken for transferring the specified data in the communication networks except for time length taken for relay processing performed by at least one of relay communication apparatus, estimate each total transmission time length taken for transmission of the specified data from a source communication apparatus to a destination communication apparatus based on each stored relay processing time length and each estimated transferring time length, and select a combination of communication protocols that are to be used in the communication networks respectively, based on each estimated total transmission time length. 1. A communication system comprising:a plurality of communication apparatus including a source communication apparatus, a destination communication apparatus, and at least one relay communication apparatus, the source communication apparatus being configured to transmit data to the destination communication apparatus via the at least one relay communication apparatus, each adjacent pair of the plurality of communication apparatus being coupled by each of a plurality of communication networks, each of the plurality of communication networks in which each communication protocol selected from each protocol set is used for transmitting data, each protocol set including at least one communication protocol, each of the at least one relay communication apparatus being configured to perform each relay processing, each relay processing including each conversion of communication protocol applied to the data when a prior communication protocol applied to the ...

SATELLITE COMMUNICATION SYSTEM FOR DIVERSITY GATEWAY SWITCHING AND SATELLITE COMMUNICATION METHOD FOR DIVERSITY GATEWAY SWITCHING

A satellite communication system includes a communication terminal, and a ground station. The ground station is configured to communicate with the communication terminal through a satellite communication path between the ground station and the communication terminal via a satellite. The ground station includes a diversity switch, and an electronic controller. The diversity switch is configured to switch the satellite communication path from a first satellite communication path to a second satellite communication path different from the first satellite communication path. The electronic controller is configured to determine whether a predetermined switching condition is satisfied based on signal attenuations of the first and second satellite communication paths. The electronic controller is further configured to control the diversity switch to switch the satellite communication path upon elapsing a first predetermined time period after determining that the predetermined switching condition is satisfied. 1. A satellite communication system comprising:a communication terminal; and a diversity switch configured to switch the satellite communication path from a first satellite communication path to a second satellite communication path different from the first satellite communication path, and', 'an electronic controller configured to determine whether a predetermined switching condition is satisfied based on signal attenuations of the first and second satellite communication paths, the electronic controller being further configured to control the diversity switch to switch the satellite communication path upon elapsing a first predetermined time period after determining that the predetermined switching condition is satisfied., 'a ground station configured to communicate with the communication terminal through a satellite communication path between the ground station and the communication terminal via a satellite, the ground station including'}2. The satellite ...

NETWORK CONTROL DEVICE, NETWORK CONTROL METHOD, AND RECORDING MEDIUM FOR PROGRAM

In order to make it possible for an upper layer to receive the supply of a desired resource from a lower layer, this network control device is provided with: a database that receives a request for connection between node ports included in an upper layer network; and a hierarchical control unit that determines a link for connection between ports via a lower layer network and the performance of the link and associates and retains the results. The database receives a flow between nodes included in the upper layer network, said flow being selected in accordance with the link and the performance. The hierarchical control unit sets a flow corresponding to the link in the lower layer network when the link is included in the path of the flow. 1. A network control device comprising:a database that accepts a request for connecting ports on nodes included in an upper layer network; anda hierarchical controller configured to obtain a link connecting the ports through a lower layer network and performance of the link, and holding the link and the performance in an associated manner, whereinthe database accepts a flow between nodes included in the upper layer network, the flow being selected depending on the link and the performance, and,when a route of the flow includes the link, the hierarchical controller sets a flow related to the link to the lower layer network.2. The network control device according to claim 1 , whereinthe performance includes at least one of a bandwidth, a delay, reliability, and priority of the link.3. The network control device according to claim 1 , whereinthe hierarchical controller obtains the link and the performance, based on topology information about a layer boundary between the upper layer network and the lower layer network, and topology information about the lower layer network.4. The network control device according to claim 1 , whereinthe hierarchical controller obtains a route of the flow, based on topology information about the upper layer ...

ROUTING WITH FLOW OVER SHARED RISK LINK GROUPS

A network topology is analyzed to identify shared risk link groups, the edge diversities of paths, and maximally diverse edges for paths. During operation of the network for conveying data packets between two end points, data flows are routed in the network by prioritizing the use of resources that do not belong to a shared risk group and are maximally diverse with other edges already being used. Various load balancing techniques can be used to minimize the risk of serious disruption in the event an underlying resource of a shared risk link group goes down. 1. In a data communication network in which multiple paths exist for transmitting data from a source node to a destination node , a method of allocating data flows , comprising:receiving, at the source node, a flow request for transmitting data from the source node to the destination node;determining, from a plurality of paths from the source node to the destination node, a number of paths that have a least path weight, wherein a path comprises a communication resource, and a corresponding path weight for each path is a measure of communication resource sharing by the path with other paths in the data communication network;in an event there is a single path corresponding to the lowest path weight, assigning the single path to fulfil the flow request;in an event there is more than one path corresponding to the lowest path weight, tie-breaking in the more than one path using a performance criterion, to decide a winning path; andassigning the winning path to fulfil the flow request; andupdating, based on the assigning, path weights for paths in the data communication network.2. The method of claim 1 , wherein the path weight for each path is calculated using a number of shared resources link groups (SRLG) to which that path belongs claim 1 , wherein nodes in an SRLG share at least one communication resource in common.3. The method of claim 2 , wherein the updating includes:increasing by a unit, the path weight of ...

MULTI-SPOKE CONNECTIVITY OF PRIVATE DATA CENTERS TO THE CLOUD

A hybrid computing system includes an on-premise data center and a cloud computing system. To connect between an organization's multiple data centers, a gateway may instead utilize the connections between the private data center and the cloud computing system rather than a direct connection to the other of the organizations' data centers. 1. A method of providing connectivity between data centers in a hybrid cloud system , the method comprising:determining a first latency between first and second data centers managed by a first organization;determining a second latency between the first data center and a cloud computing system managed by a second organization, the first organization being a tenant in the cloud computing system;establishing a path-optimized connection between the first and second data centers based on the first latency and the second latency, wherein the path-optimized connection travels between a gateway of the first data center through a gateway of the cloud computing system and to a gateway of the second data center.2. The method of claim 1 , wherein the cloud computing system comprises a first cloud data center communicatively coupled to the first data center and a second cloud data center communicatively coupled to the second data center claim 1 , wherein the first and second cloud data centers are communicatively coupled together.3. The method of claim 1 , wherein the path-optimized connection through the gateway of the cloud computing system comprises the path-optimized connection through a gateway of the first cloud data center to a gateway of the second cloud data center and to the gateway of the second data center.4. The method of claim 1 , wherein the path-optimized connection between the first and second data centers is established responsive to determining that the second latency is less than the first latency.5. The method of claim 1 , further comprising:probing a wide area network (WAN) with test packets by varying an Internet Protocol ...

Bi-directional co-shared sessions

Methods and systems for a resource reservation network that supports bi-directional co-shared sessions. A session creation module (SCM) creates a bi-directional parent session (S p ), between first and second session partners, by: allocating co-shared network resources over a first network hop, and allocating network resources over a second network hop. The SCM further creates a bi-directional derivative session (S d ) between the first session partner and a third session partner, by: allocating network resources to the S d over a third network hop, and not allocating specifically for the S d all the network resources required for the S d over the first network hop.

Creating bi-directional co-shared sessions and switching bi-directional co-shared sessions

Methods and systems for creating bi-directional co-shared sessions and switching between bi-directional co-shared sessions. Embodiment of one method includes the following steps: Sending a first message over a bi-directional parent session network path (P p ) to indicate allocation of network resources along the P p , including co-shared network resources. Creating the parent session (S p ) by sending a first session creation message. Sending a second message over a bi-directional derivative session network path (P d ) to indicate allocation of non-co-shared network resources along the P d . And creating the S d by sending a second session creation message.

Resource reservation network that maintains low latency and latency variation of co-shared sessions

Methods and systems for resource reservation networks configured to maintain low latency and latency variation of co-shared sessions. A session creation module (SCM) creates a bi-directional parent session (S), between first and second session partners, by: allocating co-shared network resources over a first network hop, and allocating network resources over a second network hop; wherein the network resources allocated to the Sguarantee a maximum end-to-end latency variation (e2eLV) below 100 usec. The SCM further calculates a maximum e2eLV of a potential bi-directional derivative session (S) between the first session partner and a third session partner; wherein the potential Sutilizes network resources over a third network hop and the co-shared network resources over the first network hop. And the SCM creates the Sresponsive to determining that the maximum e2eLV of the Sbeing below 100 usec. 1. A resource reservation network configured to maintain low latency variation of co-shared sessions , comprising:{'sub': p', 'p, 'a session creation module (SCM) configured to create a bi-directional parent session (S), between first and second session partners, by: allocating co-shared network resources over a first network hop directly connected to the first session partner, and allocating network resources over a second network hop directly connected to the second session partner; wherein the network resources allocated to the Sguarantee a maximum end-to-end latency variation (e2eLV) below 100 microseconds;'}{'sub': d', 'd, 'the SCM is further configured to calculate a maximum e2eLV of a potential bi-directional derivative session (S) between the first session partner and a third session partner; wherein the potential Sutilizes network resources over a third network hop directly connected to the third session partner, and utilizes the co-shared network resources over the first network hop; and'}{'sub': d', 'd, 'the SCM is further configured to create the Sresponsive to ...

Communication Method

A method of determining suitable communication paths between a first device and a second device, the first device being connected to a plurality of third devices to which the second device is also connected. The method comprises, at the first device: for each of the third devices, obtaining first information indicating a characteristic of communications between the first device and the second device via the third device, obtaining second information associated with first data to be transmitted from the first device to the second device, and determining, based upon the first and second information, whether any of the third devices should receive the first data for communication of the first data to the second device.

Control of Maximum Transmission Unit Size Discovery Using AT Commands

A method of control Maximum Transmission Unit (MTU) reporting and discovery using AT commands is proposed. In communications networks, the MTU of a communication protocol of a layer is the size (in bytes or octets) of the largest protocol data unit that the layer can pass onwards. In an IP network, IP packets may be fragmented if the supported MTU size is smaller than the packet length. In accordance with one novel aspect, the packet data protocol (PDP) context of a packet data network (PDN) connection comprises MTU information. By introducing MTU information to the PDP contexts, TE can use AT commands to query MTU parameters from the network and thereby avoid fragmentation. TE can also use AT command to set MTU parameters and thereby control MTU discovery. 1. A method , comprising:obtaining an Attention (AT) command by a mobile termination (MT) from a terminal equipment (TE) in a mobile communication network, wherein the AT command is related to maximum transmission unit (MTU) information of a packet data network (PDN) connection, and wherein the AT command is a set AT command initiated by the TE for setting a list of Packet Data Protocol (PDP) context parameters including an MTU discovery option;discovering an MTU size of the PDN connection based on an MTU discovery option that indicates whether the TE prefers to discover the MTU size through a Non-Access-Stratum (NAS) signaling; andproviding the MTU size from the MT to the TE.2. The method of claim 1 , wherein the list of PDP context parameters comprises a context identification (CID) claim 1 , an EPS bearer ID claim 1 , an access point name (APN) claim 1 , a local IP address claim 1 , and the MTU size.3. The method of claim 1 , wherein the MT provides the MTU size in response to a second AT read command from the TE.4. The method of claim 1 , wherein the MTU discovery option is set to a first value for the MT to discover the MTU size via a Path-MTU-Discovery mechanism.5. The method of claim 1 , wherein the MTU ...

Communication Method

A method of transmitting data from a first device. The method comprises: at the first device, establishing a connection with a first one of a plurality of second devices and establishing a first virtual connection, the first virtual connection being between the first device and a third device through the first one of a plurality of second devices; and receiving details of a second virtual connection, the second virtual connection being between a fourth device and the third device through a second one of the plurality of second devices, the fourth device being connected to the first device. The method further comprises selecting one of said first or second virtual connections for transmission of a data packet to said third device and transmitting data to said third device using said selected connection.

ROUTING AGGREGATED CARRIERS IN A DAS

A method performed by a digital Distributed Antenna System (“DAS”) for routing aggregated carriers received by at least one digital master unit of the DAS to at least one digital remote unit of the DAS. The method includes identifying the received aggregated carriers to be transmitted to a wireless communication device located in a coverage area served by the at least one digital remote unit, and routing the identified aggregated carriers through the DAS such that the carriers are transported to said at least one digital remote unit for transmission to the wireless communication device. 1. A method performed by a digital Distributed Antenna System (“DAS”) of routing aggregated carriers received by at least one digital master unit of the DAS to at least one digital remote unit of the DAS , comprising:identifying the received aggregated carriers to be transmitted to a wireless communication device located in a coverage area served by the at least one digital remote unit;determining to which said at least one remote unit the identified aggregated carriers should be transported;grouping the identified aggregated carriers; androuting the identified aggregated carriers through the DAS such that the carriers are transported to said at least one digital remote unit for transmission to the wireless communication device.2. The method of claim 1 , wherein the routing of the identified aggregated carriers through the DAS comprises:routing the aggregated carriers via a same routing path through the DAS to said at least one digital remote unit for transmission to the wireless communication device.3. The method of claim 1 , wherein in case the routing of the identified aggregated carriers through the DAS comprises routing the identified aggregated carriers via different routing paths claim 1 , the method further comprises: 'controlling a delay element arranged in at least a first of the routing paths having a smaller processing delay than at least a second of the routing paths, to ...

NETWORK DESIGN DEVICE, NETWORK DESIGN METHOD, AND NETWORK DESIGN PROCESSING PROGRAM

With a network design apparatus, a network design method, and a network design processing program, a network configuration is designed for a network in which a transfer apparatus is disposed at each of a plurality of communication hubs and the communication hubs are connected via a link by a link portion apparatus in the transfer apparatus. In design of a network configuration, a threshold value of an inter-end delay and the number of redundant paths are calculated for each line on the basis of topology information, line information, and design parameter information. A path candidate set is calculated for each line on the basis of the threshold value of the inter-end delay and the number of redundant paths. 1. A network design apparatus for designing a network configuration for a network in which a transfer apparatus is disposed at each of a plurality of communication hubs and the communication hubs are connected via links by a link portion apparatus in the transfer apparatus , the network design apparatus comprising:an input reception unit configured to receive an input of topology information on a connection state between the communication hubs, line information regarding a plurality of lines accommodated in the network, apparatus information regarding the transfer apparatus disposed at the communication hub and the link portion apparatus in the transfer apparatus, and design parameter information regarding parameters used in the design;a first processing unit including a calculation unit configured to calculate a threshold value of an inter-end delay and the number of redundant paths for each of the lines on the basis of the topology information, the line information, and the design parameter information and calculate a path candidate set for each of the lines on the basis of the threshold value of the inter-end delay and the number of redundant paths, the calculation unit configuring the path candidate set with path candidates including paths each with an inter- ...

USER- AND APPLICATION-BASED NETWORK TREATMENT POLICIES

Systems, methods, and devices are disclosed for personalizing quality of service for network traffic. A user priority is assigned to a specific user and an application priority is assigned to a type of application. A header including an identifier is added to a packet from a client device associated with the type of application and the specific user in order to generate a modified packet. The identifier is based on a combination of the user priority associated with the specific user and an application priority. The modified packet is forwarded end to end through a network that is personalized to the specific user and the type of application by mapping a treatment policy to the identifier. 1. A method for personalizing quality of service for network traffic comprising:assigning a user priority to a specific user and an application priority to a type of application;adding, to a packet from a client device associated with the specific user and the type of application, a header comprising an identifier to generate a modified packet, wherein the identifier is based on a combination of the user priority associated with the specific user and an application priority; andforwarding the modified packet end to end through a network that is personalized to the specific user and the type of application by mapping a treatment policy to the identifier.2. The method of claim 1 , wherein the user priority of the specific user is assigned based on the specific user falling within one of a plurality of tiers of users claim 1 , wherein a higher tier is given priority over a lower tier.3. The method of claim 2 , wherein the specific user is identified through scalable group tags associated with the assigned one of the plurality of tiers of users.4. The method of claim 1 , the method further comprising:adding a Differentiated Services Code Point value to the header of the packet;based on the Differentiated Services Code Point value, sorting the modified packet by the specific user; ...

Method and System for Symmetric Transmit and Receive Latencies in an Energy Efficient PHY

Aspects of a method and system for symmetric transmit and receive latencies in an energy efficient PHY are provided. In this regard, a delay introduced by a PHY of a network device for outbound traffic and a delay introduced by the PHY for inbound traffic may be controlled such that a transmit delay of the network device is equal, within a tolerance, to a receive latency of the network device. The delays may be controlled based on whether one or more energy efficiency features are enabled in the PHY. The delay introduced by the PHY for outbound traffic may be controlled based on an amount of buffered inbound traffic. The delay introduced by the PHY for inbound traffic may be controlled based on an amount of buffered outbound traffic. The delays may be controlled such that said receive latency and the transmit latency are approximately constant regardless of a mode of operation of the network device. 1. A method performed by a network device , comprising:modifying, by an energy efficiency control policy module that controls energy efficient network features of a physical layer device of the network device, an amount of delay in a first path through the physical layer device in a first direction, the modified amount of delay reducing a difference between a first amount of latency in the first path and a second amount of latency in a second path through the physical layer device in a second direction.2. The method of claim 1 , wherein the first path is a transmit path and the second path is a receive path.3. The method of claim 1 , wherein the first path is a receive path and the second path is a transmit path.4. The method of claim 1 , wherein the energy efficiency control policy module controls entry by the physical layer device into one of low power idle and sub-rating.5. The method of claim 1 , wherein the modifying comprises controlling a size of one or more buffers claim 1 , controlling one or more thresholds of the one or more buffers;and/or controlling a rate ...

Systems and methods of routing ip telephony data packet communciations

Systems and methods performed by a telephony device allow the telephony device to test the quality of multiple potential paths which can be used to conduct a telephony communication. By testing the conditions that presently exist, the telephony device can choose the path that is presently offering the best quality. A telephony communication may be setup over an initial path, and then subsequent testing may determine that it is best to switch to an alternate path offering better call quality. The initial path used for the telephony communication may be the one that offers the fastest initial connection. When multiple potential paths exist, the telephony communication may be conducted over a first path while keep alive messages are communicated over a second path so that the telephony communication can be quickly switched to the second path.

Creating bi-directional co-shared sessions and switching bi-directional co-shared sessions

Methods and systems for fast switching between bi-directional co-shared sessions having different network paths over a resource reservation network. Embodiment of one method includes: creating a bi-directional parent session (S) between first and second session partners, creating a bi-directional derivative session (S) between the first session partner and a third session partner, and reassigning a predetermined amount of co-shared network resources (PA-CSNR) assigned to the Susing the following steps: (i) sending a first message to request the second session partner to stop using the PA-CSNR, (ii) sending a second message to register whether the PA-CSNR are assigned to the S, and (iii) sending a third message to allow the third session partner to utilize at least some of the PA-CSNR for the S. 1. A method for fast switching between bi-directional co-shared sessions having different network paths over a resource reservation network , comprising:{'sub': 'p', 'creating a bi-directional parent session (S) between first and second session partners, by: allocating co-shared network resources over a first network hop directly connected to the first session partner, and allocating network resources over a second network hop directly connected to the second session partner;'}{'sub': d', 'd', 'd', 'd, 'creating a bi-directional derivative session (S) between the first session partner and a third session partner, by: allocating network resources to the Sover a third network hop directly connected to the third session partner, and not allocating specifically for the Sall the network resources required for the Sover the first network hop; and'}{'sub': p', 'p', 'd', 'd, 'reassigning a predetermined amount of the co-shared network resources (PA-CSNR) assigned to the Susing the following steps: (i) sending a first message, from the first session partner to the second session partner, to request the second session partner to stop using the PA-CSNR, (ii) sending a second message ...

ADAPTIVE TRAFFIC ROUTING IN COMMUNICATION NETWORKS

The present invention relates to the field of re-routing packet data in a data communication network, where it is desired to maintain the original packet order at the receiver end without significantly increasing system complexity, processing latency or related costs. For this purpose, the present invention suggests a method of re-routing at least one data-stream and a network element for re-routing at least one data-stream. A first part and a second part of a data-stream received at a first node and are transmitted to a second node via two different network paths, respectively. The first part of the at least one data-stream is transmitted from the first node to the second node via a first network path. A second network path for transmitting the second part to the second node is determined, and the difference between latencies of the first and second network paths is also determined. If the latency of the first network path is larger than the latency of the second network path, the at least one data-stream at the first node is re-routed from the first network path to the second network path provided that the time gap between data packets of the at least one data-stream received by the first node exceeds said difference between latencies. 1. A method of re-routing at least one data-stream in a communication network comprising the steps of:receiving at least one data-stream of packets at a first node,transmitting a first part of the at least one data-stream from the first node to a second node via a first network path,determining a second network path for transmitting a second part of the at least one data-stream from the first node to the second node,determining the difference between latencies of the first and second network paths for transmitting data from the first node to the second node, andif the latency of the first network path is larger than the latency of the second network path, re-routing the at least one data-stream at the first node from the first ...

NETWORK DEVICE, CONTROL DEVICE AND METHODS THEREIN

The present disclosure provides a method in a network device. The method includes: determining a node delay associated with the network device and/or a link delay associated with a link between the network device and a neighboring network device; and transmitting to the neighboring network device a Link Layer Discovery Protocol Data Unit, LLDPDU, containing the node delay and/or the link delay. 1. A method in a network device , comprising:determining a node delay associated with the network device and/or a link delay associated with a link between the network device and a neighboring network device; andtransmitting to the neighboring network device a Link Layer Discovery Protocol Data Unit, LLDPDU, containing the node delay and/or the link delay.2. The method of claim 1 , wherein said determining the link delay comprises measuring the link delay as a unidirectional delay from the network device to the neighboring network device claim 1 , a unidirectional delay from the neighboring network device to the network device claim 1 , or a bidirectional delay between the network device and the neighboring network device.3. The method of claim 2 , wherein the link delay is measured using Precision Time Protocol claim 2 , PTP.4. The method of claim 1 , wherein the LLDPDU comprises a first Type-Length-Value claim 1 , TLV claim 1 , indicating the node delay and/or a second TLV indicating the link delay.5. The method of claim 4 , whereinthe first TLV comprises a type or subtype field indicating that the first TLV is for node delay advertisement and a value field indicating a numerical value of the node delay, and/orthe second TLV comprises a type or subtype field indicating that the second TLV is for link delay advertisement and a value field indicating a numerical value of the link delay.6. The method of claim 5 , wherein each of the first TLV and the second TLV further comprises a unit field indicating a time unit of the numerical value in its value field.7. The method of ...

UNIFIED RADIO ACCESS NETWORK (RAN)/MULTI-ACCESS EDGE COMPUTING (MEC) PLATFORM

A device can determine, based on a first packet flow associated with a first user device and application identifiers associated with applications accessible by the first user device, that a first packet associated with the first packet flow is destined for a low-latency application having a specified latency range. The device can identify a first low-latency bearer that satisfies the specified latency range associated with the low-latency application. The device can map the first packet flow to the first low-latency bearer. 1. A method comprising:determining, by a device and based on a first packet flow associated with a first user device and application identifiers associated with applications accessible by the first user device, that a first packet associated with the first packet flow is destined for a low-latency application having a specified latency range;identifying, by the device, a first low-latency bearer configured to satisfy the specified latency range associated with the low-latency application; andmapping, by the device, the first packet flow to the first low-latency bearer.2. The method of claim 1 , further comprising: 'wherein the second packet flow is associated with a second user device;', 'determining that a second packet associated with a second packet flow is destined for the low-latency application having the specified latency range,'}identifying a second low-latency bearer configured to satisfy the specified latency range associated with the low-latency application; andcommunicating a plurality of packets between the first user device and the second user device.3. The method of claim 2 , wherein the method further comprises:mapping the second packet flow to the second low latency bearer, andmapping the first low-latency bearer to the second low-latency bearer; andwherein communicating the plurality of packets between the first user device and the second user device is based on mapping the first low latency bearer to the second low-latency ...

HEURISTICS FOR SELECTING NEAREST ZONE BASED ON ICA RTT AND NETWORK LATENCY

Described embodiments provide systems and methods for zone selection for distributed services. A device records latency data measured for interactions between each of a plurality of clients and a service hosted by servers in two or more zones. The device directs network communications from each of the plurality of clients to respective servers hosting the service based on zones assigned to each of the plurality of clients. The device assigns clients to zones based on the recorded latency data. For example, the device identifies a grouping for a client, determines whether the recorded latency data indicates that latency for clients in the grouping is increasing faster than a threshold rate, and selects, responsive to the determination, a zone indicated by a selected set of recorded latency data as lowest in latency. 1. A method comprising:monitoring, by a device, latency data of interactions between a plurality of clients and a service provided via a plurality of zones of one or more networks, each of the plurality of clients assigned to a respective group of clients selected for each zone of the plurality of zones;identifying, by the device responsive to monitoring, a latency trend value for each of the plurality of zones;determining, by the device that a rate of change in the latency trend value of a first zone of the plurality of zones used by a first group of clients exceeds a threshold;selecting, by the device responsive to the determination, for a client of the plurality of clients a second zone of the plurality of zones having a lower latency over a trailing time span than other zones of the plurality of zones; androuting, by the device, network communications from the first client to a respective server of the second zone hosting the service.2. The method of claim 1 , further comprising identifying the latency trend value for each of the plurality of zones based at least on monitoring latency data of each of the plurality of clients assigned to the respective ...

COMMUNICATION SYSTEM AND METHOD FOR APPLYING QUANTUM KEY DISTRIBUTION SECURITY FOR A TIME SENSITIVE NETWORK

A method includes identifying connections between plural components of a time sensitive network (TSN) that are interconnected via a predetermined connection plan. The method also includes determining quantum key distribution (QKD) information of the components. Also, the method further includes scheduling flows for the TSN based on the QKD information of the components. 1. A method comprising:identifying connections between plural components of a time sensitive network (TSN) that are interconnected via a predetermined connection plan;determining quantum key distribution (QKD) information of the components; andscheduling flows for the TSN based on the QKD information of the components.2. The method of claim 1 , further comprising specifying QKD control parameters for QKD devices associated with the components.3. The method of claim 2 , wherein specifying QKD control parameters comprises specifying at least one privacy amplification setting for at least one QKD device.4. The method of claim 1 , wherein determining QKD information comprises determining an amount of delay associated with QKD along at least one path between at least some of the components.5. The method of claim 1 , wherein at least some of the QKD information is determined between end-points of at least one path.6. The method of claim 1 , wherein at least some of the QKD information is determined for at least one component interposed between end-points of at least one path.7. The method of claim 1 , wherein the QKD information comprises key rate generation information corresponding to a rate at which keys are generated by at least one QKD device associated with the TSN.8. A scheduler configured for use with a time sensitive network (TSN) claim 1 , the scheduler including one or more processors configured to:identify connections between plural components of the TSN that are interconnected via a predetermined connection plan;determine quantum key distribution (QKD) information of the components; ...

Packet Processing Method and Apparatus

Embodiments of the present invention provide a packet processing method, which is applied to a first node. The method includes: obtaining N first packets, where N is an integer greater than or equal to 1, and each of the first packets includes a first label; and sending the N first packets in a sending period corresponding to the first label.

METHOD AND APPARATUS FOR PREFERRED PATH ROUTE INFORMATION DISTRIBUTION AND MAINTENANCE

A method implemented in a domain in a multi-domain network, comprising maintaining a link state database (LSDB) comprising information describing a topology of the domain, receiving, from a network element (NE) in an area of the domain, preferred path route (PPR) information describing a PPR from a source to a destination in the area, the PPR information comprising a PPR identifier (PPR-ID) and a plurality of PPR description elements (PPR-PDEs) each representing an element on the PPR, and constructing an end-to-end path between the source and the destination based on the PPR information. 1. A method implemented in a domain in a multi-domain network , comprising:maintaining a link state database (LSDB) comprising information describing a topology of the domain;receiving, from a network element (NE) in an area of the domain, preferred path route (PPR) information describing a PPR from a source to a destination in the area, the PPR information comprising a PPR identifier (PPR-ID) and a plurality of PPR description elements (PPR-PDEs) each representing an element on the PPR; andupdating the LSDB based on the PPR information describing the PPR.2. The method of claim 1 , further comprising:receiving, from a second NE in a second area of the multi-domain network, second PPR information describing a second PPR provisioned in the second area; andupdating the LSDB based on the second PPR information describing the second PPR.3. The method of claim 1 , wherein the PPR information is received from the NE in an update encoded as a Border Gateway Protocol (BGP) Network Layer Reachability Information (NLRI).4. The method of claim 3 , wherein the NLRI is a BGP Link State (BGP-LS) NLRI.5. The method of claim 1 , wherein the LSDB stores information associated with the PPR and a predetermined shortest path between the source and the destination claim 1 , wherein the PPR deviates from the predetermined shortest path between the source and the destination based on a network ...

Dynamic link state routing protocol

A router and methods for routing packets in a network are described. The router and methods are implemented with a dynamic link state routing protocol (DLSP). The router dynamically computes a best path from one or more paths by periodically probing links of peer nodes to determine link metrics associated with a link. The one or more link metrics include a link bandwidth to a peer node and a link latency to the peer node. Further, the router can dynamically recalculate the one or more link metrics associated with the link every 10 seconds. The router can also monitor one or more link state changes based on the one or more link metrics, wherein the link state changes are monitored every 60 second. The router can further determine a single link metric based on the link bandwidth to the peer node and the link latency to the peer node.

Path establishment method and controller

A path establishment method and a controller are disclosed. The method includes: when detecting a path establishment request for establishing P2MP TE, computing a P2MP TE path by using head node information and tail node information included in the path establishment request; identifying a target branch node in the P2MP TE path, and obtaining a label of the target branch node; and when a third node corresponding to the head node information and the target branch node are not a same node, sending first information to the third node, and sending second information to the target branch node, where the second information is used to instruct the target branch node to generate a multicast forwarding entry. Embodiments of this application can reduce complexity of establishing the P2MP TE path.

SOFTWARE DRIVEN LONG-TERM-EVOLUTION CORE NETWORK FOR MOBILE ACCESS

Systems and methods for managing network resources, including managing a generated virtualized data plane network using a central controller. Virtual machine (VM) resources are assigned to two or more different network functions at a local data center. Traffic is dynamically optimized based on at least one of aggregate traffic demands and quality of service (QoS) goals, and resource allocations and inter-data center (DC) bandwidth resources are determined for VMs for a plurality of services. VMs for each middlebox function and a routing plane for each service are configured based on the determined resource allocation, and flows are routed based on the resource allocation and one or more configured network paths using an overlay-routing framework. 1. A computer implemented method for managing network resources , comprising: assigning virtual machine (VM) resources to two or more different network functions at a local data center;', 'dynamically optimizing traffic based on at least one of aggregate traffic demands and quality of service (QoS) goals; and', 'determining resource allocations and inter-data center (DC) bandwidth resources for VMs for a plurality of services;, 'managing a generated virtualized data plane network using a central controller, the managing further comprisingconfiguring VMs for each middlebox function and a routing plane for each service based on the determined resource allocation; androuting flows based on the resource allocation and one or more configured network paths using an overlay-routing framework.2. The computer-implemented method of claim 1 , wherein the flows are routed across network function chains and a plurality of geographically distributed DCs.3. The computer-implemented method of claim 1 , further comprising:iteratively reassigning VMS and inter-DC resources across two of more DCs to minimize end-to-end delays until a threshold is reached.4. The computer-implemented method of claim 1 , wherein the network paths are configured ...

ACCELERATING MULTI-NODE PERFORMANCE OF MACHINE LEARNING WORKLOADS

Examples described herein relate to a network interface and at least one processor that is to indicate whether data is associated with a machine learning operation or non-machine learning operation to manage traversal of the data through one or more network elements to a destination network element and cause the network interface to include an indication in a packet of whether the packet includes machine learning data or non-machine learning data. In some examples, the indication in a packet of whether the packet includes machine learning data or non-machine learning data comprises a priority level and wherein one or more higher priority levels identify machine learning data. In some examples, for machine learning data, the priority level is based on whether the data is associated with inference, training, or re-training operations. In some examples, for machine learning data, the priority level is based on whether the data is associated with real-time or time insensitive inference operations. 1. A method comprising: accessing an indication in a packet of whether the packet includes machine learning data or non-machine learning data and', 'allocating resources of the network device based on the indication of whether the packet includes machine learning data or non-machine learning data., 'at a network device2. The method of claim 1 , wherein the indication in a packet of whether the packet includes machine learning data or non-machine learning data comprises a priority level and wherein one or more priority levels identify machine learning data.3. The method of claim 2 , wherein for machine learning data claim 2 , the priority level is based on whether the machine learning data is associated with inference claim 2 , training claim 2 , or re-training operations and the priority level is based on whether the machine learning data is associated with real-time or time insensitive inference operations.4. The method of claim 2 , wherein for machine learning data claim 2 , ...

DYNAMIC ASSYMETRIC COMMUNICATION PATH ALLOCATION

An apparatus may comprise a port to couple to a plurality of communication paths comprising a first, second, third, and fourth communication path, the communication paths each having a direction of either a receive path or a transmit path, the communication paths comprising a first communication path having a direction that may be selectively configured as a receive path or a transmit path. The apparatus further comprises a controller comprising circuitry, the controller to in response to a communication path reconfiguration command, reconfigure the direction of the first communication path such that the first communication path, second communication path, and third communication path have the same direction and the fourth communication path has a direction opposite to the direction of the first, second, and third communication paths. 1. An apparatus comprising:a port to couple to a plurality of communication paths comprising a first, second, third, and fourth communication path, the communication paths each having a direction of either a receive path or a transmit path, the communication paths comprising a first communication path having a direction that may be selectively configured as a receive path or a transmit path; and 'in response to a communication path reconfiguration command, reconfigure the direction of the first communication path such that the first communication path, second communication path, and third communication path have the same direction and the fourth communication path has a direction opposite to the direction of the first, second, and third communication paths.', 'a controller comprising circuitry, the controller to2. The apparatus of claim 1 , wherein the controller is further to receive the communication path reconfiguration command from a software driver.3. The apparatus of claim 2 , the software driver to generate the communication path reconfiguration command in response to an expected asymmetric traffic flow across the communication ...

Routing of communications to a platform service

Systems and methods for routing communications to a platform service are provided. A message including payload data is received. The information in the payload data of the message is examined in order to determine the type of message. The message is then relayed to an appropriate platform service based on the type of message. Some embodiments assign numbers to the packets that make up the message.

SYSTEMS AND METHODS FOR LATENCY BASED ROUTING

A method for determining a path through a communication network may include determining a first and second path from a first device to a second device based on path latency, removing from further consideration the first or the second path based on which has the highest path latency of the first and second path, and determining path candidates until a path candidate is found with the lowest differential latency between the determined first or second path and the path candidate. 1. A method for routing signals in a communication network , the method comprising:retrieving information of a topology of the communication network, the information including a plurality of connections between each of a plurality of devices in the communication network and latency information of each connection of the plurality of connections;determining a first path from a first device of the plurality of devices to a second device of the plurality of devices, the first path including a first portion of the plurality of connections with a lowest total latency between the first device and the second device;determining a second path from the first device to the second device, the second path including a second portion of the plurality of connections with a second lowest total latency between the first device and the second device;selecting the second path as one of a work path or a protect path;removing the second portion of the plurality of connections from the second path from the information of the topology of the communication network;determining a third path from the first device to the second device, the third path including a third portion of the plurality of connections with a third total latency between the first device and the second device;determining a fourth path from the first device to the second device, the fourth path including a fourth portion of the plurality of connections with a fourth total latency between the first device and the second device;determining a first latency ...

Systems and Methods for Routing Trade Orders Based on Exchange Latency

Systems and methods for routing trade orders based on exchange latency are disclosed. An example method includes measuring a first latency associated with a first exchange based on a processing time of a first trade order; and routing a second trade order from a trading device to one of the first and a second exchange based on the first latency. 1measuring a first latency associated with a first exchange based on a first processing time of a first trade order; androuting a second trade order from a trading device to one of the first exchange and a second exchange based on the first latency.. A method, comprising: This application is a continuation of U.S. patent application Ser. No. 16/203,083, filed on Nov. 28, 2018, which is a continuation of U.S. patent application Ser. No. 15/006,836, filed on Jan. 26, 2016, now U.S. Pat. No. 10,169,818, which is a continuation of U.S. patent application Ser. No. 13/722,649, filed on Dec. 20, 2012, now U.S. Pat. No. 9,280,791, the entire contents of each of which are incorporated herein by reference for all purposes.An electronic trading system generally includes a trading device in communication with an electronic exchange. The electronic exchange sends information about a market, such as prices and quantities, to the trading device. The trading device sends messages, such as messages related to orders, to the electronic exchange. The electronic exchange attempts to match quantity of an order with quantity of one or more contra-side orders.Certain embodiments will be better understood when read in conjunction with the provided figures, which illustrate examples. It should be understood, however, that the embodiments are not limited to the arrangements and instrumentality shown in the attached figures.The disclosed embodiments relate to trading systems and methods for routing trade orders based on exchange latency. In particular, the disclosed embodiments relate to systems and methods for routing trade orders for fungible ...

PATH SELECTION METHOD AND APPARATUS

The present application describes a path selection method and apparatus. The method may include obtaining a required latency of a service. The method may further include determining a target path for the service from m strict explicit paths based on the required latency, where a latency of the target path is less than or equal to the required latency, all the m strict explicit paths are unallocated paths, any subpath of a first strict explicit path in the m strict explicit paths exists in only the first strict explicit path, the first strict explicit path is any path in the m strict explicit paths, and m is an integer greater than or equal to 1. The present invention is applicable to the field of communications technologies and resolves at least a problem where a path computation element (PCE) cannot ensure that a path allocated to a service can meet a latency requirement of the service. 1. A path selection method , comprising:obtaining a required latency of a service; anddetermining a target path for the service from m strict explicit paths based on the required latency, wherein a latency of the target path is less than or equal to the required latency, all the m strict explicit paths are unallocated paths, any subpath of a first strict explicit path in the m strict explicit paths exists in only the first strict explicit path, the first strict explicit path is any path in the m strict explicit paths, and m is an integer greater than or equal to 1.2. The method according to claim 1 , wherein before the determining the target path for the service from m strict explicit paths based on the required latency claim 1 , the method further comprises:determining a loose path corresponding to the service; anddetermining the m strict explicit paths based on unallocated network slices in network slices of n subpaths of the loose path, wherein a second strict explicit path in the m strict explicit paths comprises n network slices, the n network slices are respectively ...

Ecmp set based on route time delay

Examples include generating a Precision Time Protocol (PTP) packet for a first nexthop in an Equal Cost Multi-Path set and sending the PTP packet to the first nexthop. Examples also include receiving a response from the first nexthop that identifies a time delay associated with a route to the first nexthop and updating the ECMP based on the time delay.

Systems and Methods for Routing Trade Orders Based on Exchange Latency

Systems and methods for routing trade orders based on exchange latency are disclosed. An example method includes measuring a first latency associated with a first exchange based on a processing time of a first trade order; and routing a second trade order from a trading device to one of the first and a second exchange based on the first latency. 1. (canceled)2. A method comprising:measuring by a computer device a first latency associated with a first electronic exchange based on a first processing time of a first trade order, wherein the first processing time is based on a time when the first trade order has been fulfilled by the first exchange, wherein a processing speed of trade orders at the first electronic exchange changes during a trading session;determining by the computer device that the first trade order is a first type of trade order;determining by the computer device a collective latency score for the first type of trade order at the first exchange using the first latency;receiving by the computer device a second trade order from a trading device;determining by the computer device that the collective latency score reaches a predetermined latency threshold defined for the first exchange; androuting by the computer device the second trade order from the trading device to a second exchange based on the first latency associated with the first exchange and in response to identifying the second trade order as being of the first type of trade order.3. The method of claim 2 , further comprising:measuring by the computer device a second latency associated with the second exchange based on a second processing time of a third trade order, wherein routing the second trade order from the trading device based on the first latency comprising routing the second trade order to one of the first and second exchanges having a lower latency.4. The method of claim 2 , further comprising:comparing the first latency with the predetermined latency threshold, wherein routing the ...

DATA FORWARDING METHOD AND DEVICE

This application discloses a data forwarding method and device. The method includes: obtaining a first data unit sequence stream by using a first logical ingress port, where the first data unit sequence stream includes at least one first data unit; determining, according to a preconfigured mapping relationship between at least one logical ingress port and at least one logical egress port, a first logical egress port corresponding to the first logical ingress port, where the at least one logical ingress port includes the first logical ingress port; adjusting a quantity of idle units in the first data unit sequence stream, so that a rate of an adjusted first data unit sequence stream matches a rate of the first logical egress port; and sending the adjusted first data unit sequence stream by using the first logical egress port. 1. A data forwarding method , comprising:obtaining a first data unit sequence stream by using a first logical ingress port, wherein the first data unit sequence stream comprises at least one first data unit;determining, according to a preconfigured mapping relationship between at least one logical ingress port and at least one logical egress port, a first logical egress port corresponding to the first logical ingress port, wherein the at least one logical ingress port comprises the first logical ingress port;adjusting a quantity of idle units in the first data unit sequence stream, so that a rate of an adjusted first data unit sequence stream matches a rate of the first logical egress port; andsending the adjusted first data unit sequence stream by using the first logical egress port.2. The method according to claim 1 , wherein the mapping relationship between the at least one logical ingress port and the at least one logical egress port comprises at least one of the following mapping relationships:a one-to-one mapping relationship between a logical ingress port in the at least one logical ingress port and a logical egress port in the at least ...

NETWORK SERVICE COMPUTATION SYSTEM

A method and system for implementing a network service computation system uses distributed graph processing at a plurality of network controllers corresponding to a plurality of network domains. Each network controller may manage and maintain a network graph for its respective network domain. Each network controller many communicate with nodes (or vertices) in its respective network domain, while the network controllers may communicate with each other for path discovery and computation purposes. 1. A method , comprising:receiving a network request at a first network controller, the network request specifying a source vertex and a destination vertex, wherein the source vertex is located in a first network domain managed by the first network controller, and wherein the destination vertex is located in a second network domain managed by a second network controller; within each network domain, identifying a minimum path distance between each vertex in the network domain and the source vertex;', 'sending controller messages among the plurality of network controllers, wherein each of the controller messages specifies a sending vertex identifier, a target vertex identifier, and the minimum path distance from the source vertex to a target vertex corresponding to the target vertex identifier, wherein a sending vertex corresponding to the sending vertex identifier is included in a network domain of a network controller sending the controller message and the target vertex is included in a network domain of a network controller receiving the controller message; and', 'recording, by each network controller for each vertex in the network domain corresponding to the network controller, path information comprising: the minimum path distance from the source vertex to the vertex; and a parent vertex identifier for a parent vertex from the vertex resulting in the minimum path distance to the source vertex., 'performing distributed graph processing at a plurality of network controllers ...

METHOD FOR PRIORITIZATION OF INTERNET TRAFFIC BY FINDING APPROPRIATE INTERNET EXIT POINTS

The systems and methods discussed herein provide for faster communications, particularly for high priority traffic, across a distributed network with multiple exit points to a Wide Area Network. Rather than simply routing traffic based on internal or external destination, an intelligent router may measure latency to an endpoint destination via multiple paths, both external and internal, and direct traffic accordingly. Steering high priority traffic via the internal connection to an exit point near the destination server, and then to the server via the external network, may be faster than simply forwarding the connection via the external network from the exit point closest to the source device. Additionally, to reduce bandwidth requirements of the nearby exit point and provide capability for higher priority traffic, low priority traffic may be redirected back via the internal connection and transmitted via a distant exit point. 1. A method comprising:establishing, by a device, a first connection to a server on an external network and a bridge connection to one or more routing devices on an internal network that provide a path to the server via the external network;redirecting, by the device, one or more packets with a low priority to the server via the bridge connection;identifying, by the device, that a source of a packet destined to the server is from the internal network and a priority of the packet is at least higher than the low priority;determining, by the device responsive to the priority of the packet, a first latency via the connection to the server is lower than a second latency of the path to the server via the bridge connection; andforwarding, by the device responsive to the determination, the packet to the server via the first connection.2. The method of claim 1 , wherein the device is deployed between the internal network and the external network.3. The method of claim 1 , wherein the one or more routing devices on the internal network provide a ...

PATH DETERMINATION METHOD AND SYSTEM FOR DELAY-OPTIMIZED SERVICE FUNCTION CHAINING

A method as implemented in a controller in a SDN: (a) receiving service function chain orders of packet flows comprising a service function chain; (b) receiving, in real-time, delay measurements from either one of the virtual network functions and/or one of the network switches; (c) determining a plurality of realizations of the service function chain orders of (a) in order to minimize a total delay; (d) choosing an optimal realization corresponding to a least delay; and (e) determining one or more flow rules for the one or more network switches, the determining based on the optimal realization in (d). A controller and an article of manufacture implementing such a method are also described. 1. A controller in a software defined network (SDN) comprising a plurality of network switches interconnected with a plurality of transmission facilities , either the network switches or hardware platforms attached to the switches hosting a plurality of virtual network functions , the controller comprising a processor and storage storing computer readable program code , which when executed by the processor implements:(a) a first application to receive one or more service function chain orders of packet flows, at least one of the orders comprising a service function chain;(b) a second application to receive, in real-time, delay measurements from any of, or a combination of, the following: one of the virtual network functions and one of the network switches;(c) a third application to determine a plurality of realizations of the service function chain orders of (a) in order to minimize a total delay, where the total delay comprises one or more delays incurred due to a chain of one or more virtual network functions in the plurality of virtual network functions and due to one or more network switches in the plurality of network switches, the third application choosing an optimal realization within the plurality of realizations corresponding to a least delay; and(d) a fourth ...

METHOD AND SYSTEM FOR ADAPTIVE AND CONTEXT-AWARE SERVICE FUNCTION CHAINING IN COMMUNICATION NETWORKS

A technique is provided for adaptively performing service function chaining based on network context. The technique includes receiving a request comprising a flexible SFC template (FST) for provisioning an SFC of a plurality of service functions (SFs). A service function path (SFP) is determined responsive to receipt of data packets corresponding to a pre-defined flow to be transmitted over the network. Monitoring of a pre-defined plurality of parameters associated with the SFP and a network context is performed after implementing the SFP. Based on the monitoring of the pre-defined plurality of parameters and SFP modification criteria, a requirement for modifying the SFP is identified. Responsive to the identification, the SFP is modified and the performance of the modified SFP is monitored based on one or more of the plurality of parameters, a network context after modifying the SFP, and a pre-defined plurality of service performance thresholds. 1. A method of adaptively performing service function chaining based on network context , the method comprising:receiving, by a network device, a request for provisioning a service function chain (SFC) of a plurality of service functions (SFs), wherein the request comprises at least a flexible SFC template (FST);determining, by the network device, a service function path (SFP) responsive to a receipt of data packets to be transmitted over the network, based on at least the FST, a current network context, one or more network estimation inputs, and historical network data, wherein the data packets correspond to a pre-defined flow of data packets;monitoring, by the network device, a pre-defined plurality of parameters associated with the SFP and a network context after implementing the SFP, wherein the monitoring corresponds to a periodic monitoring or an aperiodic monitoring;identifying, by the network device, a requirement for modification of the SFP based on the monitoring of the pre-defined plurality of parameters and SFP ...

QOS MANAGEMENT SYSTEM AND METHOD

Example implementations are directed to management of a system involving a plurality of apparatuses executing manufacturing processes based on instructions from a server, the plurality of apparatuses communicating with the server through a gateway, and can include managing a relationship between a Quality of Service (QoS) level for communications and the manufacturing processes; and controlling the gateway to adjust the QoS level for the communications between each of the plurality of apparatuses and the server based on the manufacturing processes. 1. A method for management of a system involving a plurality of apparatuses executing manufacturing processes based on instructions from a server , the plurality of apparatuses communicating with the server through a gateway , the method comprising:managing a relationship between a Quality of Service (QoS) level for communications and the manufacturing processes; andcontrolling the gateway to adjust the QoS level for the communications between each of the plurality of apparatuses and the server based on the manufacturing processes,wherein the managing includes allocating the QoS level to communication patterns involved in each manufacturing process group of the manufacturing processes by referring to a QoS level table, which associates the manufacturing processes with the QoS level for the communication involved in each of the manufacturing processes, and a communication pattern table, which associates a process group ID and the communication patterns included in the process group ID with a type of each of the manufacturing processes.2. The method of claim 1 , wherein the QoS level is based on communication delay.3. The method of claim 1 , further comprising:for input of information indicative of a modification to the plurality of apparatuses or the manufacturing processes, controlling the gateway to adjust the QoS level of ones of the plurality of apparatuses associated with the modification based on the manufacturing ...

MULTIPATH TRAFFIC SWITCH DAMPING

A method of managing multipath traffic switching in a network includes a plurality of shared paths, including selecting a first path from among the plurality of shared paths; setting an initial timer to an initial timer value; sending network traffic over the first path; based on determining that at least one path characteristic of the first path is unsatisfactory and that the initial timer has not expired, generating an updated timer value by increasing the initial timer value; and based on determining that the at least one path characteristic of the first path is unsatisfactory and that the initial timer has expired, selecting a second path, sending the network traffic over the second path, and setting an updated timer to the updated timer value. 1. A method of managing multipath traffic switching in a network including a plurality of shared paths , the method comprising:selecting a first path from among the plurality of shared paths;setting an initial timer to an initial timer value;sending network traffic over the first path;based on determining that at least one path characteristic of the first path is unsatisfactory and that the initial timer has not expired, generating an updated timer value by increasing the initial timer value; andbased on determining that the at least one path characteristic of the first path is unsatisfactory and that the initial timer has expired, selecting a second path, setting an updated timer to the updated timer value, and sending the network traffic over the second path.2. The method of claim 1 , wherein the updated timer value is generated by increasing the initial timer value by a predetermined amount.3. The method of claim 1 , wherein the updated timer value is generated by increasing the initial timer value by an amount that is adaptively determined based on the at least one path characteristic of the first path.4. The method of claim 1 , wherein the updated timer value is generated to be less than or equal to a predetermined ...

EDGE COMPUTING DEVICE AND METHOD FOR CONTROLLING THEREOF

An edge computing device controlling method includes executing some function modules of a plurality of function modules for processing a service request from a user device on a first edge computing device of a plurality of edge computing devices and additionally executing the some function modules on a second edge computing device of the plurality of edge computing devices when additional resource is required for the some function modules. 1. An edge computing device controlling method comprising:executing, on a first edge computing device of a plurality of edge computing devices, at least one function module of a plurality of function modules for processing a service request from a user device; andadditionally executing the at least one function module on a second edge computing device of the plurality of edge computing devices when additional resource is required for the at least one function module.2. The edge computing device controlling method of claim 1 , wherein the additional execution of the at least one function module comprises:additionally executing the at least one function module on the second edge computing device when processing time spent by the at least one function module on the first edge computing device exceeds the maximum time allowed for the at least one function module.3. The edge computing device controlling method of claim 1 , wherein the second edge computing device is selected among the plurality of edge computing devices based on network latency from the first edge computing device.4. The edge computing device controlling method of claim 3 , wherein the second edge computing device is selected by the first edge computing device.5. The edge computing device controlling method of claim 1 , wherein the additional execution of the at least one function module on the second edge computing device comprises:updating, by the first edge computing device, a routing table that indicates function modules executed on each of the plurality of edge ...

METHOD AND APPARATUS FOR ANALYZING A COAXIAL NETWORK INFRASTRUCTURE

Method for generating a virtual representation of a coaxial network structure of a MoCA (Multimedia over Coaxial Alliance) network, which MoCA network comprises a plurality of node devices, including one network management device, wherein the node devices are interconnected through the coaxial network, the method includes determining a time lapse matrix having time lapse values Trepresenting propagation time through the coaxial network between node devices nand n, processing the time lapse matrix to establish a branch association for each node device with respect to the network management device, and storing virtual representation data of the coaxial network comprising the branch associations. 1. Method for generating a virtual representation of a coaxial network structure of a communications network , which communications network comprises a plurality of node devices , the plurality of node devices comprising a network management device and node devices nand n , wherein the plurality of node devices are interconnected through the coaxial network , the method comprising:{'sub': i,j', 'i', 'j, 'determining a time lapse matrix, the time lapse matrix comprising time lapse values Trepresenting propagation time through the coaxial network between node devices nand n;'}{'sub': i', 'j, 'processing the time lapse matrix to establish a branch association for each of node devices nand nwith respect to the network management device;'}storing virtual representation data of the coaxial network comprising the branch associations.2. The method of claim 1 , wherein storing virtual representation data includes storing a branch identifier for each node device.3. The method of claim 1 , comprising:{'sub': 0', '0, 'arranging the time lapse matrix with the network management device as a node device n, and columns and rows in magnitude order of time lapse values T with respect to n.'}4. The method of claim 3 , wherein processing the time lapse matrix comprises:comparing magnitude of time ...

High performance software-defined core network

A method comprising instantiating at least one virtual machine (VM) at each node of nodes that form a network comprising virtual links in an overlay network provisioned over an underlay network. The VM is coupled to the network and to a tenant of the node. The method comprises configuring the VM to include at least one routing algorithm representing at least one routing behavior. The method comprises configuring the routing algorithm to use feedback data of a set of the virtual links to determine and adapt an optimal route through the network. The method comprises configuring the VM to control routing of traffic flows according to the optimal route.

METHODS AND SYSTEMS FOR ROUTE FINDING IN NETWORK 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 infrastructure components that make up various networks that, collectively, interconnect with one another, infrastructure components that house the physical infrastructure 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 infrastructure 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. 1. A system for route finding in networks and/or in a network of networks , comprising a server communicatively coupled to a datastore , said datastore hosting a model of an industry of Internet infrastructure as a graph wherein nodes of the graph represent physical infrastructure components that make up various networks that , collectively , interconnect with one another , infrastructure components that house the physical infrastructure components and equipment that connect the physical infrastructure components; and edges of the graph represent the relationships between the physical infrastructure components.2. The system of claim 1 , wherein the physical infrastructure components and equipment that connect the physical infrastructure components includes datacenters claim 1 , which are operated spaces within buildings claim 1 , and buildings housing the datacenters.3. The system of claim 2 , wherein the nodes of the graph further represent entities that own the buildings and/or datacenters claim 2 , operate the buildings and/or datacenters claim 2 , offer products in the datacenters claim 2 , and/or offer contractual ...

Methods of lossless traffic forwarding using distributed delay offset matching

Disclosed are methods lossless traffic forwarding using distributed delay offset matching. The lossless traffic forwarding method includes calculating a delay offset between a first forwarding path between a transmitting node and a receiving node and a second forwarding path between the transmitting node and the receiving node, and controlling a buffer resource by an extent of the delay offset to delay packets to be forwarded on the first forwarding path.

System and Method for Delay Management for Traffic Engineering

A method for engineering traffic in a communications system includes determining a set of delay constraints associated with a traffic flow over the communications system, and excluding non-convex constraints from the set of delay constraints, thereby producing a set of convex constraints. The method also includes selecting a path solution for the traffic flow in accordance with the set of convex constraints, and sending information regarding the path solution to nodes in the communications system. 1. A method for engineering traffic in a communications system , the method comprising:determining, by a traffic engineering (TE) controller, a set of delay constraints associated with a traffic flow over the communications system;excluding, by the TE controller, non-convex constraints from the set of delay constraints, thereby producing a set of convex constraints;selecting, by the TE controller, a path solution for the traffic flow in accordance with the set of convex constraints; andsending, by the TE controller, information regarding the path solution to nodes in the communications system.2. The method of claim 1 , wherein the path solution is selected in accordance with the set of convex constraints claim 1 , a set of link capacity constraints associated with the communications system claim 1 , and a set of flow demand constraints associated with the traffic flow.3. The method of claim 1 , wherein the path solution comprises at least one path from a source node to a destination node associated with the traffic flow.4. The method of claim 3 , wherein the path solution further comprises a bandwidth allocation for the at least one path.5. The method of claim 1 , wherein selecting the path solution comprises:selecting the path solution in accordance with a solution selecting criterion.6. The method of claim 5 , wherein the solution selecting criterion comprises one of a minimum number of delay constraints violated claim 5 , a maximum number of delay constraints met claim ...

Handling path issues for storage copy services

A method for determining path health to conduct a plurality of Input-Output (IO) operations along a healthy path in a network is provided. The present invention may include receiving an IO request from a user and sending the received IO request on a first path. The present invention may include determining a first IO response has exceeded a threshold time on the first path. The present invention may include determining the first path has degraded based on the exceeded threshold time. The present invention may include generating a duplicate IO request and sending on a second path. The present invention may include receiving the duplicated IO response before receiving the original IO response. The present invention may include determining a health state associated with the slower path. The present invention may include refreshing a path state machine based on the determined health state associated with the slow path.

Path selection for network service requests

In a method for directing a computer network request to process through one or more components, a processor identifies a plurality of input/output (I/O) paths capable of serving a computer network request and a plurality of components along each path of the plurality of I/O paths. A processor predicts resource demands at each respective component of the plurality of components along each path of the plurality of I/O paths. A processor estimates expected delay times at each respective component of the plurality of components along each path of the plurality of I/O paths using predicted resource demands at each component. A processor determines an expected delay time for each path of the plurality of I/O paths based on the expected delay times at each respective component of the plurality of components along each path of the plurality of I/O paths.

MULTI-HOP PATH FINDING

Systems and techniques are provided for multi-hop path finding. Order data describing an order may be received. The order data may include a currency pair, a price level, and a volume. A one-hop path structure may be generated based on the order data describing the order. The one-hop path structure may include one-hop paths for the currency pair. The one-hop path structure may be written to a first ring buffer. The one-hop path structure may be read from the first ring buffer. Two-hop path structures may be generated by joining the one-hop path structure with other one-hop path structures. A value for the relative importance of the two-hop path structures may be determined to be greater than a threshold. Combined two-hop path structures may be written to a second ring buffer when the value for the relative importance of the two-hop path structures is greater than the threshold. 1. A computer-implemented method comprising: receiving order data comprising a currency pair, a price level, and a volume,', 'generating a one-hop path structure based on the order data, the one-hop path structure comprising one or more one-hop paths for the currency pair, and', 'writing the generated one-hop path structure to a first ring buffer; and, 'executing a first thread, the first thread repeating operations comprising reading, from the first ring buffer, one of the at least one one-hop path structures written to the first ring buffer by the first thread,', 'generating one or more two-hop path structures by joining the one-hop path structure read from the first ring buffer with one or more other one-hop path structures,', 'writing one or more combined two-hop path structure based on the generated two-hop path structure to a second ring buffer., 'executing a second thread, the second thread repeating operations comprising2. The computer-implemented method of claim 1 , wherein the first thread further repeats operations comprising determining that a relative importance value of the ...

DOMAIN NAME SYSTEM (DNS) OPTIMIZATION FOR WIDE AREA NETWORKS

A method including receiving, in a controller, from a client device in a network, a resolution query specifying a host name, is provided. The method includes parsing the resolution query to determine whether the host name is associated with an core host or with a public host, and directing the resolution query to a remote domain name system server dedicated to service the core host when the host name is associated with an enterprise name. The method also includes directing the resolution query to a local domain name system server when the host name is associated with a public service provided by the public host. A system to perform the above method is also provided. 1. A computer-implemented method , comprising:receiving, in a controller, from a client device in a network, a resolution query specifying a host name;parsing the resolution query to determine whether the host name is associated with an core host or with a public host;directing the resolution query to a remote domain name system server dedicated to service the core host when the host name is associated with an enterprise name; anddirecting the resolution query to a local domain name system server when the host name is associated with a public service provided by the public host.2. The computer-implemented method of claim 1 , wherein parsing the resolution query comprises searching claim 1 , within the resolution query claim 1 , for a character string comprising an enterprise name.3. The computer-implemented method of claim 1 , wherein parsing the resolution query comprises searching claim 1 , within the resolution query claim 1 , for a character string comprising a public domain.4. The computer-implemented method of claim 1 , wherein directing the resolution query to a remote domain system comprises encrypting the resolution query through a firewall.5. The computer-implemented method of claim 1 , further comprising downloading a configuration for the local domain name system server from the remote domain ...