Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees

Least cost or minimum delay routing

Subclass of:

370 - Multiplex communications


370235000 - Flow control of data transmission through a network

Patent class list (only not empty are listed)

Deeper subclasses:

Class / Patent application numberDescriptionNumber of patent applications / Date published
370238100 ATM least cost routing 1
20080219170Systems and methods for allocating network bandwidth - An improved system for allocating bandwidth allows a network customer to dynamically modify bandwidth settings for their private networks. Applicable modified bandwidth settings may include port speed, committed access rate, and Ethernet flow. Port speed determines how much total data may pass through a node in a private network at one time, while committed access rate determines how much bandwidth the node will commit to a particular class of service. Ethernet flow governs the bandwidth allowed over a private line between two nodes. A bandwidth modification request is received by an input interface, which provides it to a processing server that schedules the modification request for committal. The processing server also changes customer billing information accordingly. Additionally, the user may specify a future time when the bandwidth modification request should be committed.09-11-2008
20130028094FIBER CHANEL DEVICE - A fiber channel device comprising a processor to distribute and receive link constraint information on available links when there is a need to transmit data packets to a destination, and to establish a constraint-based routed label switch path (CRLSP) to transmit data packets to the destination.01-31-2013
20090196184METHOD AND SYSTEM FOR PATH IDENTIFICATION IN PACKET NETWORKS - A method and system for extracting and building end-to-end route information in a multi-area Internet protocol (IP) autonomous system (AS) is disclosed. The method and system enable a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the source area of the AS where it originates until its exit point in its intended destination area.08-06-2009
20100027425FAIR WEIGHTED NETWORK CONGESTION AVOIDANCE - Systems and methods which provide network congestion avoidance implementing a fairness scheme in which a cost function is used are shown. Transmission cost, for use in network congestion avoidance packet dropping decisions, may be determined from an amount of air time needed to transmit a data packet, a transmission data rate, a size of a packet, an amount of spectral energy or transmit power associated with transmission, etc. A packet dropping probability for a particular packet is preferably determined as a function of the current flow cost and average flow cost to provide fair allocation of network communications resources. Embodiments additionally implement buffer based packet dropping probability calculation in order to provide a robust network congestion avoidance technique. Cost based packet dropping probability calculation and buffer based packet dropping probability calculation implemented according to embodiments are adapted to accommodate quality of service applications.02-04-2010
20100074115System and Method for Designing a Network - A system and computer-readable medium for designing a network are disclosed. A network is designed by a system having modules configured to perform steps that generate the network wherein nodes originate and terminate traffic to keep delay related to node-to-node delay-sensitive communication below a threshold. The computer-readable medium stores instructions for controlling a computing device to design the network. The instructions comprise obtaining an initial network topology including links and traffic routing based on a volume of traffic, allocating a maximum delay to each link in the network topology in proportion to a square root of an imputed cost for each of the links, sizing a bandwidth required for each of the links based on a current traffic routing and at least one of a maximum delay allocated to the link, determining link lengths and rerouting traffic according to shortest paths with respect to the determined link lengths.03-25-2010
20100074114Achieving High-Rate Multi-Hop Data Delivery in Vehicular Networks - A method for high rate data delivery in a multi-hop vehicular network comprises at each source vehicle, initiating a packet having a flow tag, assigning an identifier of the content and the current location to the flow tag, and forwarding the packet; at each destination vehicle, setting a flow request and broadcasting at the current intersection; further on movement, setting the flow request at the new intersection, and at each intersection, selecting a header vehicle at the intersection, computing backlog and congestion indicators and listening for broadcasts with a matrix and the flow requests at the header vehicle, determining if the matrix is present, updating the matrix in accordance with the backlog and congestion indicators if the matrix is present, initializing the matrix and estimating the delay on the outgoing road segments if the matrix is not present, forwarding the packet flow, and broadcasting the matrix from the header vehicle.03-25-2010
20130077496ASSIGNING RESOURCES TO RESOURCE-UTILISING ENTITIES - A method of assigning a resource from amongst a plurality of resources to a resource-utilising entity from amongst a plurality of resource-utilising entities, wherein a resource-to-resource-utilising entity assignment has an associated cost. The method includes computing network flow costs of assignments for assigning resources to the resource-utilising entities. The method constructs a flow network including source nodes corresponding to the resources, transhipment nodes corresponding to the assignments and a demand node, the flow network having arcs representing flow between the nodes, each arc having an associated network flow cost. The method then solves a Minimum Cost Flow problem for the flow network with negated arc costs to obtain flow values for the assignments, and assigns a resource to a resource-utilising entity dependent on the flow value obtained.03-28-2013
20130039187CAPACITY ADAPTATION BETWEEN SERVICES OR CLASSES IN A PACKET NETWORK - A method and system is described that adjusts the allocated capacity of a network between services, or service or traffic classes, in dependence on a congestion-influenced shadow price indication in respect of each service or class. In this respect, instead of viewing the congestion price as a cost of using already allocated unit of capacity, such a shadow price indication can be viewed as an indicator of the value obtainable from allocating an extra unit of capacity to a service or class. By so doing the shadow price indication becomes a factor to be taken into account in deciding on capacity allocation between services or classes, with a high shadow price indication for a service or class indicating that additional value would likely be obtained by allocating an additional unit of capacity to the service or class.02-14-2013
20130033987METHOD FOR ENABLING THE EFFICIENT OPERATION OF ARBITRARILY INTERCONNECTED MESH NETWORKS - Wireless mesh networks (or “meshes”) are enabled for arbitrary interconnection to each other and may provide varying levels of coverage and redundancy as desired. Interoperability between meshes having differing configurations, internal operations, or both, may be freely intermixed and inter-operated in unrestricted combination. Enhanced explicit inter-bridge control protocols operate using pre-existing control packets. Pre-existing broadcast packet floods are used to learn the best paths across interconnected meshes (termed a “multi-mesh”). Enhanced routing protocols operating within each mesh may optionally examine information limited to the respective mesh when forwarding traffic, thus enabling robust multi-mesh scaling with respect to memory and processing time required by the routing protocols. Communication scalability is improved by enabling frequency diversity across the multi-mesh by configuring meshes within interference range of each other for operation at a plurality of frequencies. Each mesh may operate at a respective non-interfering frequency.02-07-2013
20100039939METHOD AND SYSTEM FOR OBTAINING PATH INFORMATION, PATH COMPUTATION ELEMENT - A method and a system for obtaining path information as well as a PCE are disclosed herein. All the PCEs from the source PCE to the confluent PCE compute the shortest path from the source node to the egress border node of the domain covered by the respective PCE one by one, and send the computation result to the next-hop PCE until the confluent PCE. Meanwhile, all the PCEs from the destination PCE to the confluent PCE compute the shortest path from the destination node to the ingress border node of the domain covered by the respective PCE one by one, and send the computation result to the previous-hop PCE until the confluent PCE. After receiving computation results from the previous-hop PCE and the next-hop PCE, the confluent PCE computes the shortest path between the source node and the destination node, and sends the shortest path to the source PCE.02-18-2010
20100039938Congestion and delay handling in a packet data network - A method of managing a data packet queue in a buffer associated with the radio layers of a wireless network, the buffer storing packets prior to their transmission over the radio interface. The method comprises defining minimum and maximum threshold levels for the packet queue, and for a data packet received by the buffer 1) performing a congestion avoidance procedure if the buffer queue exceeds said maximum threshold level, or 2) not performing said procedure if the buffer queue is less than said minimum threshold level, or 3) if the buffer queue lies between said maximum and minimum thresholds, performing said congestion avoidance procedure for said packet, and not performing the procedure for at least one or more subsequent packets.02-18-2010
20130070604OPEN SHORTEST PATH FIRST (OSPF) NONSTOP ROUTING (NSR) WITH LINK DERIVATION - OSPF NSR with link derivation synchronization is described. When a network element having an active OSPF instance and a standby OSPF instance attempts to create a FULL adjacency with a neighbor network element using a neighbor data structure of the active OSPF instance, and if and when a switch causes the second OSPF instance to act as the active OSPF instance, neighbor information is retrieved from the LSAs of the standby OSPF instance and a link is derived between the network element and the neighbor network element based on the retrieved neighbor information. In one embodiment, the standby OSPF instance retrieves virtual neighbor information from its LSAs and derives a virtual link between the network element and the neighbor network element based on the retrieved virtual neighbor information without having to synchronize the neighbor information between the active and standby OSPF instance.03-21-2013
20090040931Method and device for determining the length of a shortest path in a network - A computer-implemented method for pre-processing a network, wherein the network comprises nodes and edges, each edge having a length measured according to a given metric, comprises the steps of selecting a source and a target node; determining a transit node for the selection; determining a length of a shortest path between the source node and the transit node; and storing it. A method for determining the length of a shortest path in the network may use the pre-processed network to answer the shortest path query in constant time.02-12-2009
20110038264BASE STATION AND COMMUNICATION CONTROL METHOD - A base station communicating with user equipments using shared channels. The base station includes a congestion level estimation unit estimating a congestion level of a cell; a priority-level/desired-value changing unit changing priority levels or desired minimum transmission rates of data to be transmitted by the user equipments or the base station based on the congestion level of the cell; and a selection unit selecting one or more of the user equipments to which radio resources are to be allocated based on the changed priority levels or the changed desired minimum transmission rates of the data.02-17-2011
20110013517SYSTEM AND METHOD FOR PROVIDING LOWER-LAYER PATH VALIDATION FOR HIGHER-LAYER AUTONOMOUS SYSTEMS - An approach is provided for validating lower layer paths for higher layer networks. A request for path cost information is generated relating to a path traversing a first autonomous system and a second autonomous system, wherein each of the autonomous systems utilizes different cost metrics. The path cost information is received associated with reservation of capacity for the path. The path cost information is evaluated. The reservation is selectively accepted based on the evaluation.01-20-2011
20130064094DATA COMMUNICATION DEVICE - In a wireless communication network, a data communication device (e.g. a Layer 2 switch) includes a wireless monitoring device, a path cost control device, and a communication path control device. Due to an increase of path costs in wireless areas, the path control device recalculates path costs over a network so as to carry out switching to an appropriate data communication path, e.g. a LAN with blocking a wireless line. When a wireless band is recovered due to an AMR function, the wireless monitoring device sends a path cost change request to the path cost control device, which in turn reduces a path cost at a wireless line port. Additionally, the communication path control device recalculates path costs over a network so as to switch over data communication paths. Thus, it is possible to select an optimum data communication path with a low cost.03-14-2013
20090238076METHOD AND APPARATUS TO ENABLE AN IPe DOMAIN THROUGH EIGRP - In one embodiment, a system, method, and apparatus for preventing excessive transmission of routing information in a communications network occurs by receiving a network routing address at a connection node in a communications network, the network routing address allowing the transmission of data packets from a source node to a destination node in the communications network; determining a longest summary route covering a path to the destination node; creating a list comprising a summary of all neighbor connection nodes of the connection node; and transmitting an update of the longest summary route of the network routing address towards all neighbor nodes advertising a destination address comprising a shorter address prefix, wherein the transmitting process occurs sequentially beginning with a first neighbor connection node entered in the list.09-24-2009
20090238075NETWORK ROUTING USING A RETRANSMISSION-TIME-BASED LINK METRIC - A system computes link costs for a multi-hop wireless network. During operation, the system receives topological information for the multi-hop wireless network which includes a set of nodes, a set of links, and a success probability for a respective link. The system then obtains an average media access time for the multi-hop wireless network. The system also obtains a retransmission time for a respective node in the set of nodes. Next, the system computes a link metric value for a respective link based on the corresponding link success probability, the average media access time, and the corresponding retransmission time. The system then produces a link cost for the link based on the associated link metric value.09-24-2009
20090046587Fast computation of alterative packet routes - A method for communication includes simultaneously computing a shortest path and a backup path through a network between a pair of nodes. Packets are routed through the network using at least one path selected from among the shortest path and the backup path.02-19-2009
20090310490Radio communication system - A radio communication system in which radio communication terminals can efficiently transmit and receive data with each other suppressing the amount of data held by each of them. Each radio communication terminal can calculate an average delivery delay time of deliver data based on the degree of proximity to an adjacent radio communication terminal and transmit data delivery path information containing this and, for each data delivery path information received from another radio communication terminal, calculate a total average delivery delay time for delivery to a destination radio communication terminal based on the average delivery delay time contained in the data delivery path information and the average delivery delay time calculated by itself and, in response to the arrival of a data delivery time, transmit deliver data toward the destination radio communication terminal via the delivery path associated with the smallest total average delivery delay time.12-17-2009
20110286336RELAXED CONSTRAINED SHORTEST PATH FIRST (R-CSPF) - In one embodiment, a target bandwidth, a lower bandwidth boundary constraint, and an upper cost boundary constraint for a constrained path are configured. A set of paths are computed that have bandwidth within the lower bandwidth boundary constraint and cost within the upper cost boundary constraint. A determination is made whether one or more paths of the set of paths has bandwidth that provides at least the target bandwidth and, if so, a path from the one or more paths of the set of paths having bandwidth that provides at least the target bandwidth is selected to use as the constrained path, and, if not, a path from the one or more paths of the set having bandwidth that does not provide at least the target bandwidth that has bandwidth closest to the target bandwidth is selected to use as the constrained path.11-24-2011
20110134756OPERATING METHOD OF SESOR NETWORK AND NETWORK NODE PROVIDING ROUTING MECHANISM SUPPORTING REAL-TIME TRANSMISSION OF PRIOR INFORMATION - Provided is an operating method of sensor network. The operating method detects upper network nodes of a specific network node. The operating method detects link costs between the specific network node and the detected upper network nodes, respectively. The operating method detects a transmission and reception rate for the detected upper network nodes of the specific network node. The operating method selects one of the detected upper network nodes as a parent node of the specific network node, based on the detected link costs and the detected transmission and reception rate.06-09-2011
20090003217Network Optimisation System - A network optimisation system including a neural network module (01-01-2009
20090168653Method and Apparatus for Mesh Routing - Method and apparatus for optimizing mesh routing for stability and system lifetime maximization in networks, for example in wireless networks. A routing module may be instantiated in nodes on the network. The routing module may implement a link quality and node health aware routing protocol on the network that considers a combination of link quality and node health/residual lifetime metrics in the calculation of the desirability of nodes and links between nodes as parts of an overall route. A route selection metric for each route may be determined from routing cost metrics for the nodes on the route and the number of hops on the route. A node may then select a best route according to the determined route selection metrics for the routes.07-02-2009
20090316584Mechanism for Enabling Load Balancing to be Achieved in a Loop-Free Switching Path, Reverse Path Learning Network - A mechanism is disclosed for enabling load balancing to be achieved in a loop-free switching path, reverse path learning network, such as an Ethernet network. The network is divided into a plurality of virtual networks, with each virtual network providing a different path through the network. When it comes time to send a set of information through the network, one of the plurality of virtual networks, and hence, one of the plurality of paths, is selected. The set of information is then updated to indicate the selected virtual network, and sent into the network to be transported along the selected path. With multiple paths, and with the ability to select between the multiple paths, it is possible to balance the load imposed on the multiple paths.12-24-2009
20090154359METHOD FOR CALCULATING SERVICE REDUNDANCY OF A WIRELESS NETWORK - A method for calculating service redundancy of a wireless network is provided. The method comprises determining one or more of a plurality of routes through which a node can communicate to reach a destination. A routing metric is calculated for each of the plurality of routes. Using the calculated routing metrics a route having a best routing metric is identified as a best route to the destination. Service redundancy for each node within the wireless network is calculated using a sum of weighted ratios of the best routing metric to at least one alternate routing metric.06-18-2009
20110170416METHOD AND APPARATUS FOR LEAST COST ROUTING USING MULTIPLE PATH ACCUMULATED CONSTRAINTS - A cost of a path may not be the only factor in searching for a path solution in a network. For example, some applications are delay sensitive and require finding a path that does not exceed a latency constraint for the entire path. Accordingly, a method and corresponding apparatus for searching for a path solution in a network is provided that identifies combinations of partial paths that satisfy an end-to-end path constraint, compares attributes of the combinations of partial paths, prunes the combinations of partial paths based on results of the comparing to identify candidate combinations of partial paths, and selects a candidate combination of partial paths as the path solution. By pruning combinations of partial paths, considerable is saved compared to exhaustive comparing of every possible combination of partial paths and scalability is achieved.07-14-2011
20090154360Employing parallel processing for routing calls - A least-cost path between a pair of nodes A and B of a network is realized by segmenting the network into three or more segments, with nodes A and B being in different ones of the segments, with the third or more other segments being interposed between the segments to which nodes A and B belong, concurrently process the different segment to identify paths and their associated costs, and processing results generated by the different processing units to compute the least-cost path. Advantageously, the segmenting is chosen to equalize the work load of the different processing units so that the units finish their task roughly at the same time.06-18-2009
20080310311Method and system for providing network and routing protocols for utility services - A method and system for providing a network and routing protocol for utility services are disclosed. In one embodiment, a computer-implemented method comprises discovering a utility network, wherein a utility device (for example, a constant powered meter) sends network discovery messages to find the utility network. Neighboring meters are discovered and the device listens for advertised routes for one or more networks from the neighbors. The device is then registered with one or more utility networks, receiving a unique address for each network registration. Also illustrated in this invention disclosure is how each device of a class of devices (for example, battery powered meter) finds and associates itself with another device (for example, constant powered meter). The constant powered meter also registers its associate battery powered meter with the utility networks. The constant powered meter registers itself with the access points and the upstream nodes in the path out of each network. Each upstream node can independently make forwarding decisions on both upstream and downstream packets i.e. choose the next hop according to the best information available to it. The constant powered meter can sense transient link problems, outage problems, and traffic characteristics. It uses the information to find the best route out of and within each network. Each network device thus maintains multi-egress, multi-ingress network routing options both for itself and the device(s) associated with it.12-18-2008
20120033555ROUTING METHOD, APPARATUS AND SYSTEM - A routing method and apparatus are provided. The routing method includes the following steps: sending a probe frame that carries an address of a destination node to a neighboring node(s); receiving a response message returned; selecting one neighboring node from the neighboring node(s) that returns the response message as a next-hop node to which data is sent. A neighboring node with a cost parameter which is lower than a cost parameter in a routing table of the destination node is selected as the next-hop node. In the routing method, when a routing node forwards data, the route is found in real time by broadcasting a probe frame, and data may be sent as long as any one of the neighboring nodes that may arrive at the destination node is in an active state, and thus a data transmission delay is shortened.02-09-2012
20090207738Timer handling - Methods, apparatuses, computer program products and a system for enabling timer value handling are provided. Handling of timer values is enabled by creating a connection initiation message, placing into the connection initiation message a state keeping timer value, and sending the connection initiation message. Timer value handling is further enabled by receiving a connection initiation message, determining availability of state keeping timer adjustment on the basis of the connection initiation message, acquiring, in case state keeping timer adjustment is available, a state keeping timer value from the connection initiation message, creating a connection initiation response message, placing the state keeping timer value into the connection initiation response message, and sending the connection initiation response message.08-20-2009
20090207737REDUCING PACKET DROPS IN NETWORKS GUARANTEEING IN-ORDER DELIVERY - In one embodiment, the convergence node switches of a destination node switch in a network having multiple equal paths between a source switch and destination switch are identified. When a new equal cost path is added to the network, packets are flushed up to the convergence node switch closest to the source switch.08-20-2009
20090207736CONSTRAINED DYNAMIC PATH SELECTION AMONG MULTIPLE COMMUNICATION INTERFACES - Method and apparatus are disclosed for constrained dynamic path selection among multiple available communication interfaces. In some embodiments selection logic is operatively coupled with a number of link-layer interfaces to select a set of link-layer interfaces that satisfy a set of congestion constraint conditions. Metric logic is operatively coupled with the link-layer interfaces to calculate a metric value for each link-layer interface in the set. Switch logic is operatively coupled with the selection logic and metric logic to assign a data stream a link-layer interface in the set of interfaces according to its metric value to optimize communication performance.08-20-2009
20120294152Hybrid Cross-Layer Routing Protocol for MANETs - A Hybrid Cross-Layer Routing (HCLR) protocol designed and implemented based on the premise of being able to leverage a pair of proactive and reactive routing schemes in Mobile Ad Hoc Networks (MANETs) which is used to compensate against wireless link effects thereby allowing for making more intelligent routing decisions. Compared to standalone proactive or reactive routing protocols, HCLR provides a two-tier improvement logic by performing local on-demand search in an n-hop neighborhood utilizing a 2-tuple cross-layer routing metric. HCLR is implemented in a Linux Quagga suite and its performance improvements compared to OSPF MANET Designated Routing (MDR) through emulation studies is demonstrated.11-22-2012
20120106347LOAD BALANCING IN SHORTEST-PATH-BRIDGING NETWORK - A flow classification process is used at the edge of the shortest path bridging network to determine a flow label for attachment to a client frame entering the network. Any of several flow labels can be assigned to a client frame traversing the network to a particular egress node, and the flow labels are used by forwarding nodes to select among multiple equal-cost paths. In several embodiments, the flow label is calculated as a function of the client frame contents, which provide an entropy source for randomizing the selection of the flow label. This entropy source comprises the Internet Protocol (IP) header in the client frame, in some embodiments, but may comprise other client frame content in other cases.05-03-2012
20110170417TRANSMISSION RATE CONTROL DEVICE AND TRANSMISSION RATE CONTROL METHOD - A first communication terminal which communicates with a second communication terminal through a best effort network includes: a communication history storage unit in which a communication history is stored for each of the communication terminals; and a round-trip delay time calculation unit which calculates a round-trip delay time that occurs in a communication with the second communication terminal. The second communication terminal includes a target loss event rate calculation unit which calculates a target loss event rate that is to be set by the first communication terminal in a communication with the second communication terminal, based on a past transmission rate that is recorded in the communication history and has been realized in the communication with the second communication terminal, and on the round-trip delay time that occurs in the communication with the second communication terminal. The first communication terminal changes a transmission rate which is set at the present time to a target transmission rate which is calculated based on the target loss event rate and the round-trip delay time. According to the transmission rate control device, when it is determined that the bandwidth that is estimated to be available in a communication through the network is rapidly changed, the transmission rate can be changed to a target bit rate in a short time period.07-14-2011
20090279437LOCALITY-BASED ROUTING TABLE GENERATION - Systems and methods storage of adding a node entry to a routing table of an inquiring node of a data network are disclosed herein. An inquire message is transmitted to a publishing node. The publishing node can be configured to publish a routing entry which can be added by nodes of a network. An acknowledgment response can be received from the publishing node. The roundtrip time elapsed between transmitting the inquire message and receiving the response can be measured by the inquiring node. For all node registration entries in the routing table of the inquiring node a determination of whether the inquiring node is closest in locality to the publishing node than to a node corresponding to each node registration entry can be performed. Such determination can be made based on (a) the roundtrip time between nodes (b) node IP address prefix matching.11-12-2009
20090285101Method and Apparatus for Dynamically Runtime Adjustable Path Computation - A method and apparatus for performing a dynamically runtime adjustable constrained shortest path first (CSPF) computation of a label switched path (LSP) is described. In one embodiment of the invention, a network element acting as a source of the LSP receives a request to compute the LSP which includes one or more traffic engineering constraints. If the request includes at least one additive constraint, the network element performs a CSPF calculation. If the request does not include an additive constraint, the network element prunes each link that does not satisfy each of the constraints, and prunes those links whose paths converge at an intermediary network element according to cost, calculates a path to the destination according to cost. Other methods and apparatuses are also described.11-19-2009
20090290494SYSTEM AND METHOD FOR MOBILITY IN MULTIHOP NETWORKS - A network controller (NC) (11-26-2009
20090185492PATH SELECTION FOR A WIRELESS SYSTEM WITH RELAYS - A method selects a path for forwarding a data packet in a wireless communication system. A system capacity versus delay impact curve is calculated for a direct path to mobile station. The direct path has a capacity cost based on communication quality of a direct link between a base station and the mobile station. This curve is shifted by a predetermined time corresponding to an additional delay over a relay path to produce a projected capacity curve for the relay path having a second capacity cost determined according to a combined measure of signal quality of multiple links in the relay path. The second capacity cost is multiplied by a capacity cost ratio to produce a relay capacity curve. The direct path or the relay path is selected based on a comparison of the system capacity versus delay impact curve and the relay capacity curve according to a QoS requirement.07-23-2009
20110205901ROUTING DEVICE, METHOD, AND PROGRAM - A routing apparatus that determines a path for a flow in a network including a plurality of data links, the routing apparatus including: a constraint condition setting unit configured to generate a constraint condition that has a requirement that an end-to-end quality requirement of the flow is satisfied based on a quality variation occurring in each of the data links owing to the allocation of the flow to each of the data links and another requirement that an end-to-end quality requirement of another flow existing in each of the data links is satisfied based on a quality variation occurring in the another flow owing to the allocation of the flow to each of the data links; and a routing unit configured to determine the path for the flow from among a plurality of paths including the data links within a range satisfying the constraint condition.08-25-2011
20100128609Determining a Minimum Cost Solution for Resolving Covering-By-Pairs Problem - In one method for determining a minimum cost solution for resolving a covering-by-pairs problem, a plurality of covering nodes, a plurality of branch nodes, and a plurality of edges connecting the covering nodes and the branch nodes are given. A plurality of vectors are generated. For each vector in the plurality of vectors, it is determined whether the selected covering nodes cover the branch nodes. Responsive to determining that the selected covering nodes do not cover the branch nodes, each vector is completed so that the selected covering nodes cover the branch nodes. Responsive to determining that selected covering nodes cover the branch nodes or to completing the vector, redundant covering nodes are removed from each vector. The vectors are inserted into a current population. A new population is generated by evolving the current population for at least one generation.05-27-2010
20110205902PATH COMPUTATION AND ESTABLISHMENT METHOD, APPARATUS, AND SYSTEM - In the field of network technology, a path computation method is provided, which includes: receiving Path Computation Request (PCReq) information from a Path Computation Client (PCC), in which address information of a head node and an end node of a path and information of add/drop interfaces of a service corresponding to the path are carried in the PCReq information; acquiring label information of the add/drop interfaces of the service corresponding to the path, and cross-connection capability limit information of the head node and the end node of the path; computing path information satisfying the cross-connection capability limit information of the head node and the end node of the path, according to the address information of the head node and the end node of the path, the information of the add/drop interfaces of the service, the label information of the add/drop interfaces of the service, and the cross-connection capability limit information of the head node and the end node of the path; and sending the computed path information to the PCC. A path establishment method, apparatus, and a system are provided.08-25-2011
20090109856SYSTEM AND METHOD FOR REDUCING SWITCHING OVERHEAD IN A COMMUNICATION NETWORK - A system and method for reducing switching overhead in a communication network and a web-based server incorporating the system or the method. In one embodiment, the system includes: (1) an optimization engine configured to receive input data describing trunks, switches and traffic demands in at least a portion of the communication network and arrange connections between the trunks and switches such that the traffic demands are satisfied and such that a switch load or cost is reduced and (2) a report generator associated with the optimization engine and configured to produce a report containing a modified configuration having the reduced switch load or cost.04-30-2009
20090168652SYSTEM AND METHOD FOR AUDITING ROUTE PARAMETERS IN A NETWORK - A system includes a collector module configured to collect route parameters from a selected node of a plurality of nodes in the network, wherein the route parameters from the selected node are indicative of a first route to a destination address and a second route to the destination address; and a route processor configured to determine a first intermediate node along the first route communicatively coupled to the destination address and a second intermediate node along the first route communicatively coupled to the destination address, based at least in part on the collected route parameters. A method includes collecting route parameters from a first intermediate node and a second intermediate node that can be configured to communicatively couple a source node to the destination node, determining at least a first route through the first intermediate node and a second route through the second intermediate node, and determining which route among the first route and the second route is optimal according to one or more criteria07-02-2009
20080279106SWITCHING FABRICS AND CONTROL PROTOCOLS FOR THEM - A network unit for use in a switching fabric includes multiple units collectively constituting a single network entity, each having ports for the reception and forwarding of data packets. The network unit has at least one fabric port for connection to a partner port on another one of the units by at least one link. The network unit is organized to send and receive via the at least one fabric port protocol packets which contain information on the path costs between said units in the fabric and to perform an algorithm to determine, on the basis of said information, routes for data packets within the fabric to other units of the fabric.11-13-2008
20080285460METHOD AND SYSTEM FOR FAULT RESILIENCE IN NETWORKS WITH AUDIO/VIDEO BRIDGING AWARE SHORTEST PATH BRIDGING - Aspects of a method and system for fault resilience in Audio/Video Bridging (AVB) aware Shortest Path Bridging (SPB) networks are provided. In this regard, a path cost, which may be based at least on AVB compatibility, may be determined for each network path discovered between a first network node and a second network node. Additionally, a plurality of network paths may be selected based on the determined path cost, and a plurality of network connections may be established over the selected plurality of network paths. Also, a plurality of data streams may be transmitted and/or received via the established network connections, wherein at least one of data streams comprises data that is redundant to a first data stream. Furthermore, a primary data stream may be conveyed via a first network connection and one or more redundant data streams may be conveyed via a second network connection.11-20-2008
20080291834System and Method for Efficient Broadcast of Information Over a Network - A system and method that can receive, buffer, and asynchronously combine data from various incoming data packets is disclosed. The system and method can do so by, first, receiving incoming packets of one or multiple generations that have incoming data and incoming metadata, with the incoming data of each of the incoming packets that are of a first generation being a combination of a first, original set of data vectors, and the incoming metadata of each of the first generation of incoming packets including an indicator for the first generation. Second, once these incoming packets are received, the system and method can buffer them based on the indicator and, asynchronously from the receiving and buffering, combine the incoming data in the buffered, first generation incoming packets into outgoing data in an outgoing packet.11-27-2008
20080310310Algorithm for network Route Selection - A method for selecting a path in a physical network that selects nodes for the path based on the coordinates of the nodes in a representation of the subject network in space. From a working node M that is included in the selected path, the next node that is selected for the path is a node N such that (a) a link MN exists, and (b) the link MN forms an angle relative to a line that connects working node with the destination node that is smaller than the angle that any other link from node M forms with the line that connects working node with the destination node12-18-2008
20110007635METHODS AND COMPUTER PROGRAM PRODUCTS FOR ROUTE DETERMINATION - Methods and computer program products are provided for improved routing by evaluating routing alternatives based on multiple-path elements. The homing models provide a solution for improved access homing while balancing latency, load-balancing, and diversity needs by viewing each network in isolation or the combination of networks as a single network.01-13-2011
20090190478SYSTEM AND METHOD FOR RESTORATION IN A MULTIMEDIA IP NETWORK - Disclosed herein are systems, methods, and computer readable media for modifying IP backbone link weights such that multicast traffic and unicast traffic will not travel on a same path between nodes. The method comprises assigning link weights to nodes within an IP backbone such that multicast forwarding paths and unicast forwarding paths are failure disjoint, and delivering undelivered multicast packets using IP unicast encapsulation to the loopback address of next hop router on a multicast tree upon link/interface failure.07-30-2009
20090059797ENSURING PHYSICAL LOCALITY OF ENTITIES SHARING DATA - A method and system for ensuring that data is only distributed within a certain physical area are disclosed. In one embodiment, a method provides that data is distributed only if the distance between a source and a sink is within a distance threshold. Under this system, the distance between the source and the sink may be estimated directly or indirectly. In some embodiments, the distance may be estimated by estimating the propagation delay for a signal traversing between the devices. The physical distance between the devices may be determined from the propagation delay. If the physical distance is outside a threshold value, the source may be prohibited from transmitting the data or the sink may refuse to display the data.03-05-2009
20090185490Method of monitoring traffic in an optical or electronic network with shared resources - The present invention concerns a method of monitoring traffic in a network in which a plurality of nodes 07-23-2009
20120140636METHODS AND APPARATUS TO DETERMINE NETWORK LINK WEIGHTS - Methods and apparatus to determine network link weights are disclosed. An example method disclosed herein to determine link weights for routing in a communication network comprises iteratively updating a plurality of vectors using a genetic algorithm, the vectors including a plurality of individual values decodable into possible link weights, and decoding a first one of the vectors updated using the genetic algorithm into a first plurality of link weights providing a possible routing of a load through the communication network, the load to be split among a plurality of paths having respective path lengths determined from the plurality of link weights, at least two of the paths having different path lengths.06-07-2012
20120069740Relayed CSPF Computation for Multiple Areas and Multiple Autonomous Systems - Computing a constraint-based label switched path (LSP) that spans multiple areas is described. In one embodiment, a router in a first one of the multiple areas computes a path segment that meets a set of one or more constraints to at least one border router of the first area that lies in a path necessary to reach the destination. The router transmits a path computation request message to a path computation element (PCE) in a second one of the areas, which includes a set of one or more attributes for each computed path segment that are used by the PCE to compute one or more path segments towards the destination of the constraint-based LSP. The router receives a path computation reply message from the PCE that specifies a set of one or more computed path segments that meet the set of constraints and that were computed by one or more PCEs downstream from the router. The router stitches at least one of the set of computed path segments that are specified in the path computation reply message with the path segment computed by the router to form at least part of the constraint-based LSP.03-22-2012
20090185491Shortest-path routing optimized for network utilization - A method for shortest path routing, optimized for network utilization is provided. The shortest or optimal paths for routing within the network are calculated from initial values for the link costs. The paths comprise possible path alternatives. The number of originally calculated paths is reduced to the set of unique paths (no path alternative), by changing the link costs as a measure of the loading of the individual links, which leads to an optimized loading of the links, in other words an optimized network utilization. The method provides a simple determination of paths for a single shortest path routing, optimized for network utilization.07-23-2009
20130121156EFFICIENT PROPAGATION OF LINK STATE ADVERTISEMENTS IN DENSELY INTERCONNECTED OSPF NETWORKS - A method for efficient propagation of link state advertisements in densely interconnected OSPF networks is disclosed for reducing the number of duplicate LSAs propagated during a flooding event. The efficient propagation method includes calculating an LSA propagation subgraph which is used by a node which receives an LSA to determine which links to propagate the LSA upon. This allows a significant reduction in the LSAs which traverse the network during a flooding event. The reduction in LSAs is particularly useful for reducing network convergence times associated with flooding events. In addition, a system is disclosed for performing the method in both a centralized and dispersed manner.05-16-2013
20130121157System and Method for an Energy Efficient Network Adapter - In accordance with an embodiment, a network device includes a network controller and at least one network interface coupled to the network controller that includes at least one media access control (MAC) device configured to be coupled to at least one physical layer interface (PHY). The network controller may be configured to determine a network path comprising the at least one network interface that has a lowest power consumption of available media types coupled to the at least one PHY.05-16-2013
20090086638Method and system for wireless communication of data with a fragmentation pattern and low-density parity-check codes - A method and system for wireless data communication is provided, which involves constructing a data payload containing data, partitioning the data payload into fragments, performing LDPC encoding on each fragment, and transmitting the data payload including encoded fragments over a wireless channel.04-02-2009
20090052327End-to-end considerate link control and routing in a multihop network - By introducing a novel parameter common to all links along the entire multihop route it is possible to more flexibly allocate, for each of a number of the links, a set of three interdependent link transmit parameters representative of link transmit energy, link transmit time or link transmit bandwidth or link code word consumption, and link transmit power. Basically, the common parameter is determined based on a given end-to-end (ETE) transmit parameter constraint for the entire multihop route. The idea is then to assign or allocate, for each considered link, the three interdependent link transmit parameters based on the common parameter and local link characteristics. In this way, all three link transmit parameters may (and generally will) be different between at least two links on the route when the links have different link characteristics, assuming that each link transmit parameter is also dependent on the local link characteristics. Preferably, the common parameter is determined in the process of optimizing a given objective ETE function.02-26-2009
20110228678OVERLAY NETWORK - Methods and apparatus are disclosed for dynamically discovering and utilizing an optimized network path through overlay routing for the transmission of data. A determination whether to use a default network path or to instead use an alternate data forwarding path through one or more overlay nodes is based on real-time measurement of costs associated with the alternative paths, in response to a user request for transmission of message data to a destination on the network. Cost metrics include delay, throughput, jitter, loss, and security. The system chooses the best path among the default forwarding path and the multiple alternate forwarding paths, and implements appropriate control actions to force data transmission along the chosen path. No modification of established network communication protocols is required.09-22-2011
20090201817METHOD OF OPTIMIZING A FLOW OF VALUE IN A NETWORK - A method of modeling flow between first and second economic entities (EEs), where the first and second EEs interact either directly or indirectly with other, including defining a network to which the first and second EEs belong, expressing economic interactions of each of the EEs in the network and for each economic interaction, determining first and second value transfers, which are respectively defined as a total of a set of transfers of value from one EE to another, and vice versa, and expressing a flow based on an absolute value of a difference between the first and the second value transfers, determining a value of a wallet of each of the EEs in the network based on external information, and calculating a maximum flow from the first EE to the second EE.08-13-2009
20090245113LOAD BALANCER, NETWORK SYSTEM, LOAD BALANCING METHOD, AND PROGRAM - In a load balancer and a load balancing method, if load on a server becomes higher and the server enters a high-load state, processing is transferred from the server to a second server. In a load balancer, for user terminals registered to SIP servers, a server as a register request destination is dynamically changed according to load on the user terminals, which makes it possible to transfer the processing to a low-load SIP server.10-01-2009
20090252039LEAST COST ROUTING - A system includes a communications device configured to selectively allow communications in a plurality of communications protocols, and a router configured to receive a communications request from a user. The router may determine a preferred communications protocol from the plurality of communications protocols, based on at least a portion of the received communications request.10-08-2009
20120140635Data relay device and route selection method - A data relay device stores therein a total of costs between nodes in each of routes and, if a path having a predetermined bandwidth is to be established from a start node that is the device in a network to an end node, refers to the total cost while converging a number of routes required for obtaining the predetermined bandwidth, thereby virtually establishing one path. The data relay device includes a group organizing unit that organizes groups of routes such that a difference between total costs of the respective routes is equal to or less than a predetermined value preset in the data relay device; and a route selecting unit that selects a number of routes corresponding to the bandwidth of the path from an identical group in the groups organized by the group organizing unit in response to a request for establishing a path to the end node.06-07-2012
20100157808METHOD AND APPARATUS FOR DESIGNING RADIO ACCESS NETWORKS INCLUDING BROADBAND WIRELESS LINKS - A technique for reducing costs associated with a radio access network of a mobile telecommunications network includes configuring the radio access network using a linear programming model of the radio access network subject to constraints. The technique includes selecting cellular sites and hub locations of the radio access network to be connected by broadband wireless links based on the linear programming model and constraints. In at least one embodiment of the invention, a method of designing a radio access network of links between a cellular site and a core network includes selecting at least one first link of the radio access network to be at least one first wireless link at least partially based on a linear programming model of the radio access network. The method includes configuring an output device of a computer system to indicate the selection.06-24-2010
20090316583METHOD AND APPARATUS FOR CALCULATING MPLS TRAFFIC ENGINEERING PATHS - Methods and apparatuses are provided for searching a least-cost path between a source node and a destination node in a communication network. A set of costs associated with least-cost paths from the source node to a set of intermediate nodes is first determined. A least-cost path in a reverse direction from the destination node to an intermediate node is also determined. The intermediate node is selected based at least on a first cost associated with the least-cost path from the destination node to the intermediate node, and a second cost associated with a least-cost path from the source node to the intermediate node that was first determined. Accordingly, the least-cost path between the source node and the destination node might then be calculated by using the second cost as heuristic information.12-24-2009
20090116393MULTI-METRIC ROUTING CALCULATIONS - In a Mobile Ad Hoc Network (MANET), multi-metric information is gathered and applied to a cost-based route calculation. In particular, each node gathers resource metrics from neighboring of nodes, along with data rate and reliability information for data links to and from the node. This information is applied to a costing algorithm such as Dykstra' Open Shortest Path First algorithm to obtain routes through the network. This approach may be adapted with suitable modifications to use with unicast traffic or with a multicast forwarding group.05-07-2009
20090316582Determining Link Costs - Embodiments of a system (12-24-2009
20090116392Communication network, path setting method, network management system and node - A hierarchized path setting system in a communication network efficiently contains lower order paths in higher order path. The communication network has a plurality of nodes capable to perform switching process and demultiplexing process not only for lower order paths in a predetermined hierarchical level among hierarchized paths but also for higher order paths in a hierarchical level higher than the predetermined hierarchical level, and a plurality of links connecting these nodes. The system is responsive to a new path setting demand for setting the lower order path, for setting the lower order path in the higher order path when a single higher order path is set from a predetermined transmitter node group, in which a transmitter node of the lower order path belongs, to a predetermined receiver node group including a receiver node.05-07-2009
20100226254CUSTOMER PREMISE EQUIPMENT WITH ACCESS TO FREE MARKET BASED PRICING FOR BANDWIDTH ON A COMMUNICATIONS NETWORK - A system and method for providing a user of communications services with free market based pricing may include providing for communications over one of multiple network paths serviced by multiple respective communications service providers via at least one communications network. One of the network paths over which to communicate based on current pricing from the multiple communications service providers may be selected and communications may be performed over the selected network path.09-09-2010
20130215756APPARATUS AND METHOD FOR MANAGING CONTENTS CACHE CONSIDERING NETWORK COST - Provided is a content cache managing method and apparatus, and more particularly, a method and an apparatus for managing a content cache by considering network cost in a network. A content cache managing method of transmission equipment that forwards a content data packet may include calculating a cache replacement factor value by using network cost that is incurred in a network path from the transmission equipment to an original content server storing original content data, based on the content data packet that the content data packet is received from neighboring transmission equipment, and managing a cache in the transmission equipment based on the calculated cache replacement factor value or a state of cache in the transmission equipment to store the content data packet.08-22-2013
20100220596System and method for optimizing the routing of multimedia content - A system for optimizing the routing of data to a subscriber's device. The novel system includes a first sub-system for obtaining records on when each of a plurality of routing methods was available to the device during a predetermined period of time and a second sub-system for recommending a time and routing method to deliver data to the device based on the records. In an illustrative embodiment, the first sub-system includes an applet stored in and executed by the device adapted to monitor what routing methods are available to the device and record what routing methods were available at what times in a data file. The second sub-system includes a neural network artificial intelligence engine adapted to analyze the recorded data to predict when routing methods will be available to the device and identify an optimum time and routing method that minimizes a cost for delivering the data.09-02-2010
20100080128SYSTEM AND METHOD FOR PROVIDING LEAST-COST ROUTING OF VOICE CONNECTIONS BETWEEN HOME AND FOREIGN NETWORKS USING VOICE-OVER-IP INFRASTRUCTURE - A system and method are described for providing least-cost call routing for mobile wireless devices having access to voice-over-IP (VoIP) infrastructure, such as may be operated by an enterprise having global presence. Using a local wireless connection, such as a wireless local area network (WLAN), a software agent on the mobile wireless device registers with a common, enterprise-wide registrar, which, in turn, informs a VoIP gateway in the device's home region of the device's new location. The home region VoIP gateway will then re-route incoming calls for the device to a VoIP gateway serving the region in which the device is currently located. The local VoIP gateway will then route the call to the device via the WLAN. Seamless routing occurs even when the wireless device obtains a local phone number in a foreign network. Outgoing calls from the device can be routed via the VoIP infrastructure or the foreign network based on availability of service and/or cost.04-01-2010
20110235519DELAYED FLOW CONTROL ACTION IN TRANSPORT NETWORK LAYER WCDMA COMMUNICATIONS - Congestion is detected in a radio access transport network that includes radio network controllers and base stations. Data packet flows associated with mobile radio communications are controlled in the radio access transport network by a corresponding flow control entity. Each flow is monitored for congestion in the transport network. A flow control action is determined in response to the detected congestion. Performance of the flow control action is delayed for a predetermined delay period before the flow control action may be performed. Delaying flow control action after congestion is detected allows other affected flows to detect or be notified of the congestion, thereby making congestion detection more fair.09-29-2011
20090109855CHANNEL ASSIGNMENT FOR A MULTI-CHANNEL DUAL-RADIO MESH BACKHAUL - In an example embodiment, a method for determining backhaul channel assignments for multi-channel dual radio mesh nodes. The method comprises acquiring collision domain data for each access point of an associated mesh network. A cost function is calculated for each access point of the associated mesh network, the cost function assigning a weighted value for each access point in a collision domain based on a number of access points in the collision domain. Backhaul channel assignments for selected for each access point that minimizes the cost function.04-30-2009
20090109854MULTI-FACTOR OPTIMIZED ROUTING - A multi-factor optimized routing can select a computing device, from among multiple computing devices associated with a domain, to receive communications and thereby optimize one or more factors associated with such communications. Such multi-factor optimized routing can likewise specify a particular route, such as through the specification of one or more sub-networks. A performance monitoring system, comprising a performance monitoring framework that can support service-specific performance monitors can collect performance data to be used in the selection of a multi-factor optimized route. Additional data can be collected from other sources and the multi-factor optimized routing can be provided to a name resolution and routing system to ultimately route communications in an optimized manner.04-30-2009
20090323535DISTRIBUTING INFORMATION ACROSS EQUAL-COST PATHS IN A NETWORK - A method of distributing data across a network having a plurality of equal-cost paths. Also, a device for distributing data over a network according to the method. The data, which is typically contained in data packets, may be distributed based on at least one attribute of each of the packets. The data may also be distributed according to a weighted distribution function that allows for unequal amounts of traffic to be distributed to each of the equal-cost paths.12-31-2009
20110128857TIE-BREAKING IN SHORTEST PATH DETERMINATION - A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.06-02-2011
20110013518Demand-Based Distribution Of Internet Protocol Forwarding Information With A Router - Systems and methods are described that reduce the amount of forwarding table state on components within routers. This is performed by having a router line card generate a prefix-request message to its central processor which contains a full routing table. Line cards only populate their forwarding tables for packets needed to transmit. By being only concerned with information of packets that are traversing each line card, the amount of required memory and processing required may be reduced for a complete forwarding table.01-20-2011
20090067334MECHANISM FOR PROCESS MIGRATION ON A MASSIVELY PARALLEL COMPUTER - Embodiments off the invention provide a mechanism for process migration on a massively parallel computer system. In particular, embodiments of the invention may be used to update process state data for a migrated compute node, such as MPI (or other communication library) state data, across a full collection of compute nodes present in a given parallel system executing a parallel task. Migrating a process form one compute node to another may be useful to address a variety of sub-optimal operating conditions. For example, one or more processes may be migrated to cure network congestion resulting from a poorly mapped task or when a compute node is predicted to experience a hardware failure.03-12-2009
20090067336BROADCAST RECEIVER AND METHOD OF PROCESSING DATA - A broadcast receiver and a method of processing data are disclosed. The broadcast receiver includes a signal receiving unit, a position information module, and a navigation unit. The signal receiving unit receives broadcast signal multiplexed mobile broadcast service data including traffic information and main broadcast service data. The position information module searches and generates a current position information of the broadcast receiver. The navigation unit assigns a weight to each link of a route to a destination based on the current position information received and the traffic information included in the mobile broadcast service data and searches for a bypass route based on the weighted link, and then performs route guidance using at least one of current route and the bypass route.03-12-2009
20090034418Method and system of routing in a utility smart-grid network - A wireless network has a server that includes a server controller that controls the receipt and transmission of packets via a server radio. The server controller selects a route to nodes in the wireless network, and provides communication between the wireless network and at least one other network. A plurality of nodes in the wireless network include a node controller that controls the receipt and transmission of packets via a node radio, and selects a route to the server. A route included in a transmitted packet is selected as a preferred route based upon lowest path cost. The lowest path cost is determined on the basis of ambient noise level information associated with links along a given path in the wireless utility network.02-05-2009
20090034417Systems and Methods for Efficiently Load Balancing Based on Least Connections - Systems and methods for load balancing services based on fewest connections by decreasing granularity of service selection as a number of fewest connections serviced by the services increases may include establishing, by an appliance, a set of identifiers corresponding to a number of connections serviced by a service, the set comprising a first plurality of identifiers each identifying a predetermined number of connections and a second plurality of identifiers each identifying a predetermined range of numbers of connections. The appliance assigns, to each service servicing connections, an identifier corresponding to the number of connections serviced by the service, at least one of the identifiers selected from the second plurality of identifiers. The appliance receives a request for a service, and forwards the request to a service assigned to the identifier corresponding to a fewest number of connections with at least one service assigned to the identifier.02-05-2009
20110044176METHOD, APPARATUS AND SYSTEM FOR EQUALIZING FLOWS - A method, apparatus and system for equalizing flows are provided. The method includes: by a relay node, receiving a link setup request of the service flow sent from a source node; acquiring link load information of each bearer network between the source node and a destination node according to the link setup request of the service flow, and selecting a bearer network with a less link load to set up a forwarding link for a service flow; and forwarding the service flow according to the forwarding link. The technical solution provided by the invention implements the equalization of data flows forwarded on networks, and improves the bearer efficiency and transmission efficiency of bearer networks, thus saving the equipment purchase cost and maintenance cost.02-24-2011
20110044173OPTIMIZED LAYER-2 NETWORK SWITCHING SYSTEMS AND METHODS - An exemplary method includes monitoring a performance of at least one of a plurality of layer-2 network paths connecting a layer-2 network switch device to another layer-2 network switch device and selecting an optimal one of the plurality of layer-2 network paths over which to forward data traffic based on a path selection heuristic and the monitored performance of the at least one of the plurality of layer-2 network paths. At least a portion of the exemplary method may be performed by a layer-2 network switching system. In certain embodiments, the selecting of the optimal one of the plurality of layer-2 network paths over which to forward the data traffic is based on at least one of a latency parameter, a congestion parameter, and a cost parameter associated with the at least one of the plurality of layer-2 network paths. Corresponding systems and methods are also disclosed.02-24-2011
20110044175LOW COST IMPLEMENTATION FOR A DEVICE UTILIZING LOOK AHEAD CONGESTION MANAGEMENT - The invention utilizes a separate queue per output port as implemented in the traditional simple queuing schemes of the prior art. Further, it also uses the information found in the packet header to determine the output port and the next output port. Based on this information, it utilizes queues dedicated to congested flows, or “Congested Flow” queues. When the switch determines that, based on the first output port and the second subsequent output port, a packet in the output queue is destined for a congested path, it sets the offending packet aside in a Congested Flow queue, thereby allowing other packets destined for the first output port to continue to be transmitted. In this way, the HOL blocking issue is addressed, without the need for a significantly increased number of output queues.02-24-2011
20090034419Method and system of routing in a utility smart-grid network - A wireless utility network contains a plurality of utility nodes that communicate within a wireless utility network. A gateway to the wireless utility network communicates with the utility nodes in the wireless utility network, and connects the wireless utility network to at least one other network. A packet is transmitted from one utility node to another utility node according to a route included in the transmitted packet. The route included in the transmitted packet is updated with received network information to determine an updated path cost of the included route and compared to alternate routes to select a preferred route based upon path cost. The selected preferred route is included in the packet and the packet is transmitted to another node according to the selected preferred route.02-05-2009
20120120808REDUCTION OF MESSAGE AND COMPUTATIONAL OVERHEAD IN NETWORKS - Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the node, a network update message; determining whether the network update message should be propagated to other nodes; if the network update message should be propagated to other nodes, forwarding the network update message to at least one other node; and if the network update message should not be propagated to other nodes, refraining from forwarding the network update message to any other node. Various further embodiments relate to a method and related network node including one or more of the following: determining a first time period for the network update message; setting the first time period as a delay time; waiting for the delay time; and after the delay time has elapsed, computing new routing information based on the network update message.05-17-2012
20120201141COMMUNICATION SYSTEM - In a relaying apparatus, a label information controller generates and transmits label information including at least one of communication medium information on communication media for use in communication with other apparatuses and communication cost information on communication costs that are generated when communication is performed via the relaying apparatus. In a communication apparatus, a route controller receives the label information, creates a list of routes for use in communication with a communication counterpart, and detects a communication route through which communication is to be performed from the list. The route controller creates a list of all routes including, out of relaying apparatuses, relaying apparatuses which enable communication with a counterpart apparatus using a communication medium which the communication apparatus has, and based on the communication cost information included in the label information, detects a communication route which is lowest in communication costs from the list.08-09-2012
20110032825MULTIPATH DISCOVERY IN SWITCHED ETHERNET NETWORKS - A network switch device receives a communication packet having a source MAC address s and a destination MAC address d at a switch port p. Then, the network switch device determines whether a valid routing table entry (s, p) exists, there by indicating that the source MAC address s is reachable via a switch port p. The network switch device further determines for the destination MAC address d whether there is at least one switch port q for which a valid routing table entry (d, q) exists, there by indicating that d is reachable via a switch port q. When the routing table entries (s, p) and (d, q) exist, the network switch device routes the communication packet to the switch port q.02-10-2011
20080247318Low cost method of communication via the power supply grid - This invention describes a low cost method for electrical and electronic appliances to communicate with a master control appliance (such as a computer). It has often been said that very soon all appliances will be connected to the internet. However this is economically infeasible at this time. The minimum cost of adding ethernet connectivity to an appliance is approximately $100. For an appliance that costs less than $100 (and there are many) this is obviously infeasible. This invention describes a method which can be implemented for less than $2 and will meet the needs of an appliance to communicate with a master control appliance (such as a computer).10-09-2008
20090022055SYSTEMS AND METHODS FOR IMPROVING TCP-FRIENDLINESS OF DELAY-BASED CONGESTION CONTROL - Disclosed herein is a novel technique that greatly improves the TCP-friendliness of CTCP over such under-buffered network links without degrading the protocol efficiency to utilize the link capacity. Instead of using a pre-defined threshold, the disclosed approach, which may be referred to herein as “CTCP-TUBE,” dynamically adjusts the threshold based on the network setting in which the flow is operating. The backlogged packets of a regular TCP may be estimated along the same path by emulating the behavior of a regular TCP flow in runtime. Based on this, a threshold is set so as to ensure good TCP-friendliness. CTCP-TUBE can automatically adapt to different network configurations and also concurrent competing flows.01-22-2009
20110158102METHOD AND SYSTEM FOR ROUTING DATA STREAMS IN AN IP NETWORK BY FLOODING OF A SUBSCRIBER SEARCH MESSAGE - Method and system for determining the best path to be followed by a data stream within a communication network including several nodes communicating with one another through arteries. The method further includes an application QSAi executing the method steps, the location of the output gateway, the calculation of the routing cost, the instigation of a timeout proportional to the previously calculated cost, the setting up of the route between the caller and the called party, the preemption of resources, and the configuration of the router by imposition of the output port. The method further includes an input handler and an output handler, each linked to a router of the network. Each of the handlers includes a QSP application ensuring the conversion of the multimedia protocol into a protocol for routing in the network and a call and location server making it possible to steer the multimedia calls toward the QSP.06-30-2011
20080267074METHOD OF SETING QoS PACKET FLOW AND HANDLING QoS PACKET IN PACKET SWITCHING SYSTEM - Provided is a method of setting a QoS packet flow and processing a QoS packet for providing a QoS service. In the method of setting a QoS packet flow in the packet switching system, whether there are VOQs that are not pre-allocated is determined in response to a QoS packet flow setting request. If there are no VOQs that are not pre-allocated, it is determined whether there are VOQs that have not been used for a predetermined period. If there are VOQs that have not been used for the predetermined period, one of the VOQs is selected. Thereafter, an inactive state of a flow using the selected VOQ is indicated and QoS parameters set for the flow are released. Therefore, metro Ethernet services such as E-LINE and E-LAN can be provided in an Ethernet network and custom QoS services such as Diff Serv and ACL can be provided in an IP network. Also, limited resources can be efficiently used and thus costs can be reduced.10-30-2008
20080198751Method for implementing cross-domain constraint routing - The present invention discloses a method for implementing cross-domain constraint routing, through setting in addition the border node identifier in the ERO sub-objects saved in ERO corresponding to nodes that a route will pass, this invention realizes the distributed calculation of the route. When calculating the path of cross-domain constraint routing, the original node determines the first border node that the route will pass based on the border node identifiers set in the ERO sub-objects in ERO, calculates the path to the first border node, and then sends a PATH message; the first border node determines, based on the next ERO sub-object with a border node identifier in the ERO of the received PATH message, the next border node that the route will pass, calculates the path to the further next border node, and then sends the PATH message; . . . Repeat such a process until the PATH message reaches the destination node.08-21-2008
20100309789ROUTING-BASED PROXIMITY FOR COMMUNICATION NETWORKS - A node in an overlay network requests a ranked list of other nodes in multiple areas of the overlay network that can provide a desired piece of content or service to the requesting node. A separate node such as a router generates the ranked list using a routing algorithm, returning the list to the requesting node so that the requesting node may acquire the desired content or service from the nearest node in the overlay network.12-09-2010
20080205283COST CONTAINMENT OF MOBILE DATALINK COMMUNICATIONS - A method for transmitting messages over a datalink communication system is disclosed. The method comprises assigning each message a cost index value based on prescribed factors for at least one message transmission attribute of the message and transmitting each message that satisfies a select transmission attribute over at least one mobile communications sub-network associated with a datalink communication system.08-28-2008
20100329120Determining Disjoint Paths With An Optimized Number Of Regenerators - According to particular embodiments, determining disjoint paths includes receiving a graph representing a network comprising nodes and links. The graph is transformed such that the number of intermediate nodes of a path indicates the number of regenerators for the path. A set of seed paths from a source node to a destination node of the transformed graph is generated. For each seed path, a shortest path from the source node to the destination node is determined to yield one or more pairs of disjoint paths from the source node to the destination node. An optimized pair of disjoint paths is selected, where the optimized pair of disjoint paths has an optimized number of regenerators.12-30-2010
20080219169Flexible, Cost-Effective Solution For Peer-To-Peer, Gaming, And Application Traffic Detection & Treatment - A method and apparatus for detecting, peer traffic based on a heuristic model and deep packet inspection is described. A suspect set of peer packets is detected using a heuristic model. From the suspect set of peer packet, a set of verified peer packets is detected using deep packet inspection. The set of verified peer packets is processed according to the peer processing policy, while the non-verified peer packets is processed according a non-peer policy. Furthermore, the statistics are generated from the set of suspect peer packet. These statistics are used to update the heuristic model.09-11-2008
20090175171METHOD FOR FINDING OPTIMAL PATHS USING A STOCHASTIC NETWORK MODEL - A method finds an optimal path from a source to a destination. The possible paths from the source to the destination are represented as a stochastic graph of nodes connected by edges. Each edge has an independent probability distribution over a cost of the edge. A constraint for reaching the destination is defined. The graph is reduced to a relatively small set of deterministic minimum cost problems, which can be solved to determine an optimal path that maximizes a probability of reaching the destination within the constraint.07-09-2009
20090175172Method and Arrangement for Route Cost Determination and Selection with Link Cost Interaction - This invention extends routing mechanisms that use link metrics for route selection so that: A link metric cross correlation vector is determined for all links, where each element in the vector corresponds to some other link, and reflects the change in the link metric value if a data flow would already use this other link. The invention further describes a specific embodiment where all cross-correlating links are adjacent to each other, i.e., they terminate or originate in a common node. A mechanism is described to create an extended routing graph. This extended graph permits the use of standard polynomial time algorithms that simultaneously construct the optimal route and find the optimal route metric (such as shortest-path algorithms) also for the adjacent link cross-correlating case.07-09-2009
20100027427Hop cost as secondary metric for equal cost multi-paths - Systems, methods, and other embodiments associated with computing path costs based on link cost as a primary metric and hop cost as a secondary metric are presented. The secondary metric facilitates distinguishing between what would be equal cost multi-paths if only link cost was employed. One example method includes computing a modified link cost for a plurality of paths between switches. The example method may also include determining a lowest modified link cost associated with a path between the switches. The example method may also include providing a signal identifying the lowest modified link cost.02-04-2010
20100027426BANDWIDTH AND COST MANAGEMENT FOR AD HOC NETWORKS - A system and method is described herein for managing bandwidth and cost in connection with a plurality of sensors in an ad hoc network. The system and method receives sensor data that is provided from a plurality of sensors and constructs an ad hoc network among the plurality of sensors based on the sensor data. The system and method also receives and analyzes bandwidth information from each sensor in a group of sensors in the ad hoc network. Based on the analysis, the system and method then modifies a manner in which at least one sensor in the group exchanges data, including sensor data and multimedia content.02-04-2010
20100027424Path Estimation in a Wireless Mesh Network - Methods and algorithms for path estimation in a wireless mesh network are described. In an embodiment, each node calculates its cost for a packet flow based on the back-log at the node and the cost of downstream neighbor nodes for the flow. The cost is communicated to the upstream neighbor nodes for the flow. When a node has an opportunity to transmit a packet, a flow is selected by the node based on the back-log at the node and the costs received from each of the downstream neighbor nodes. These costs are then also used to select a downstream neighbor node is selected based on the costs received from each of the downstream neighbor nodes. A packet re-ordering algorithm is also described which intercepts packets received at a node and delays delivery of the packet to the IP layer if an earlier packet in the sequence of packets has not been received.02-04-2010
20100020695ROUTING ENGINE FOR TELECOMMUNICATIONS NETWORK - A system for automated installation of a communication line using an optimal route between a source location and a destination location is disclosed. The system includes a routing engine providing an automated design process for rendering the optimal route. The routing engine utilizes a routing algorithm to select the optimal route from a graph of capacity links defining a plurality of possible routes between the source and destination locations. If, at any time during the design process, the optimal route or capacity links defining the optimal route are detected as unavailable for any reason, the routing engine re-initiates the design process and thereafter selects a new optimal route based upon a new capacity graph built without the previously unavailable capacity link. Once designed, the available optimal route is provided to a command and control engine, which, in turn, manages the installation of the communication line using the optimal route. The command and control engine manages the process for assigning the optimal route in the provisioning system.01-28-2010
20110216654Scheme for randomized selection of equal cost links during restoration - The present invention relates generally to restoration of services in a network. More particularly, the invention encompasses a scheme for randomized selection of equal cost links during restoration in a communication network. The invention further includes multiple schemes for restoring services. The network could consist of optical, ATM, FR, or IP/MPLS switches and cross-connects.09-08-2011
20120147753METHOD AND SYSTEM FOR DYNAMIC TRAFFIC PRIORITIZATION - A method provides for the dynamic traffic prioritization in a communication network. The method electronically monitors traffic in a communication network and determines when traffic exceeds configured thresholds on the links of the communication network. Thus, the method determines a link which is potentially about to be congested in the communication network. The method categorizes the traffic on this link by an end system attached to one end of the potentially congested link into a plurality of priority categories using application layer parameters. Using a re-direct capability of the end system, the method re-directs at least one of the pluralities of priority categories of traffic to an alternate Internet Protocol address. The method uses preconfigured Quality of Service mechanisms on the provider edge router attached to the other end of the potentially congested link to guarantee a predetermined amount of bandwidth capacity of the link to traffic destined to the alternate Internet Protocol address.06-14-2012
20090067335CONGESTION CONTROL IN A TRANSMISSION NODE - Packets are selectively marked or dropped when congestion of the radio resources is experienced, the selective marking/dropping being related to or dependent on the probability that a packet will be marked with the relative efficiency of usage of the radio link by the receiver, e.g., dependent upon radio resource usage costs and fairness. For example, packets are marked or dropped based on a user's associated share of the total (or a subset of the) shared radio resources. This share may be expressed in terms of the costs of the resources in terms the user's level of utilization of the shared resources, or in terms of it's fairness with respect to other users sharing the same resources. Thus, the present technology takes into account the distribution of resources usage between receivers contributing to the congested state of the radio network.03-12-2009
20090141637VALLEY-FREE SHORTEST PATH METHOD - A method of calculating a valley-free shortest path between two autonomous systems having a first graph representing an autonomous system topology and comprising a plurality of nodes and a plurality of links interconnecting the nodes, each link linking a first and a second node of the plurality of nodes. The method comprises generating a second graph using the first graph by: Mapping the nodes of the first graph into the second graph, by representing each node of the first graph by a respective uphill node and a downhill node; mapping each link of the first, second and third relationship type with a plurality of directed links between the uphill and downhill nodes according to the type of relationship. The method further comprises calculating the shortest-path route between two autonomous systems on the second graph, using the shortest-path routing algorithm.06-04-2009
20130010601Path Selection For A Wireless System With Relays - A method selects a path for forwarding a data packet in a wireless communication system. A system capacity versus delay impact curve is calculated for a direct path to mobile station. The direct path has a capacity cost based on communication quality of a direct link between a base station and the mobile station. This curve is shifted by a predetermined time corresponding to an additional delay over a relay path to produce a projected capacity curve for the relay path having a second capacity cost determined according to a combined measure of signal quality of multiple links in the relay path. The second capacity cost is multiplied by a capacity cost ratio to produce a relay capacity curve. The direct path or the relay path is selected based on a comparison of the system capacity versus delay impact curve and the relay capacity curve according to a QoS requirement.01-10-2013
20110075566Effective Bandwidth Path Metric and Path Computation Method for Wireless Mesh Networks with Wired Links - Enhanced mesh network performance is provided by computation of a path metric with respect to multi-hop paths between nodes in a mesh network and determination of a path through the mesh network that is optimal according to the path metric. Information is communicated in the mesh network according to the determined path. Nodes in the mesh network are enabled to communicate via one or more wireless links and/or one or more wired links. The path metric optionally includes an effective bandwidth path metric having elements (listed from highest to lowest conceptual priority) including an inverse of a sustainable data rate, a number of wireless links, and a number of wireless and wired links. The sustainable data rate is a measure of communication bandwidth that is deliverable by a path for a period of time. Accounting is made for interference between contiguous wireless links operating on the same channel.03-31-2011
20110063980COMMUNICATION APPARATUS AND COMMUNICATION METHOD - A communication apparatus includes an acquiring unit that acquires wireless cost for each path to other communication apparatuses in an ad hoc network to which the communication apparatus belongs; an accumulating unit that accumulates wireless cost for each path, acquired at different times by the acquiring unit; a determining unit that determines a priority level for each path, based on time correlations among the paths in terms of the wireless cost accumulated by the accumulating unit; and a communicating unit that communicates with the other communication apparatuses by preferentially using a path of a relatively high priority level.03-17-2011
20120044811CREATING BALANCED LINK-DISJOINT TOPOLOGIES IN A COMPUTER NETWORK - In one embodiment, each node in a computer network determines a shortest looping ring back to the node through each of its neighbors. Each of these rings may then be marked in a particular direction, ensuring that any ring that shares a link with another ring is marked in such a way that the shared link is in the same direction in each of the rings that share the link. The links that are marked in the particular direction may be stored as part of a first topology. Conversely, the opposite direction on the links (e.g., bidirectional links or parallel unidirectional links) may be stored as a second topology that is link-disjoint from the first topology.02-23-2012
20120063320Method and System for Call Processing - According to one embodiment of the invention, a method includes receiving a first setup message transmitted by a first endpoint, the first setup message an attempt by the first endpoint to setup a call with a second endpoint, the setup message sent by the first endpoint to an IP address of a call manager after the first endpoint registered with a gatekeeper, the IP address of the call manager supplied to the first endpoint by the gatekeeper in response to a request by the first endpoint to the gatekeeper for an IP address of the second endpoint. The method further includes attempting to setup the call between the first and second endpoints by transmitting a second setup message to the second endpoint.03-15-2012
20120002550GLOBAL PROVISIONING OF ZERO-BANDWIDTH TRAFFIC ENGINEERING LABEL SWITCHED PATHS - A method of load balancing zero-bandwidth Traffic Engineering Label Switching Paths (0-bw TE LSPs) in a communication network having a plurality of network nodes and a plurality of network links connecting the nodes. The method may be implemented in a centralized Path Computation Element (PCE) or in an ingress router. Each equal cost path from a source node to a destination node is identified from network topology information. A probability of selecting each equal cost shortest path is determined using an iterative Global Load balancing Algorithm (GLA) and each 0-bw TE LSP is provisioned with a specific probability such that the 0-bw TE LSPs are uniformly distributed over all network links.01-05-2012
20120008503NETWORK ROUTING METHOD AND APPARATUS - The present invention discloses a network routing method and apparatus. In the network routing method, for multiple selectable paths corresponding to current service, an average utilization rate of links of a whole network is calculated according to a bandwidth utilization rate of each link before bearing the current service and the number of the links in the whole network, wherein each of the selectable paths includes at least one link; for each link in each of the selectable paths, a bandwidth utilization rate of each link after bearing the current service is calculated; for each link in each of the selectable paths, a link balanced weight for each link is set according to the bandwidth utilization rate of said link after bearing the current service and the average utilization rate of the links of the whole network; and the link balanced weight of each link included in each of the selectable paths is accumulated respectively to obtain accumulated loads, and a path with the minimum accumulated load is selected as a bearing path for bearing the current service. The technical solution according to the present invention can improve the efficiency and realize the balanced load among the links of the whole network.01-12-2012
20090022056TUNING ROUTING METRICS TO REDUCE MAXIMUM LINK UTILIZATION AND/OR PROVIDE FAILURE RESILIENCY - A metric tuning technique optimizes the maximum link utilization of a set of links incrementally. Changes to the metric are constrained to be metric increases to divert routes from select links, thereby minimizing the number of changes required to achieve the optimization by avoiding the potential cascade of changes caused by attracting routes to a link. An interactive user interface is provided to allow a user to specify limits and constraints, and to select the sets of links to be addressed, including, for example, only the links that exceed a given link utilization threshold, the links having the highest link utilizations, the links having the highest failure effect, and so on. This incremental optimization technique is also used to optimize network resiliency by minimizing the network degradation caused by the failure of one or more links.01-22-2009
20120057468System and Method for Routing Internet Traffic Over Internet Links - An apparatus and method for Internet Protocol (IP) transit is described. Embodiments include a platform for routing IP traffic in real time from at least one network user to a plurality of Internet links. Embodiments further include assigning different ranks to different internet links based on network monitoring. In one embodiment, a system for routing internet traffic includes an internet route optimizer to generate routing instructions for incoming data packets using a ranked list of the internet links, wherein the internet route optimizer generates the ranked list of the internet links using: (a) financial costs of routing data packets over the internet links, (b) a delay associated with routing packets over the internet links and (c) a type of data of the incoming data packets.03-08-2012
20120057469Data transfer in large network in efficient manner. - The embodiments herein generally relate to distributed systems and more particularly, to data propagation in a large network. This invention enables the network to support data propagation in plurality of directions based on configuration. Using this method data propagation is equally fast and deterministic in all the configured directions. Here, superframe duration is divided into plurality of data cycle period, which is further divided into plurality of time zones each dedicated to support a specific directional data flow. This method improves the power efficiency of data propagation, enables user to configure any directional data propagation and reduces the delay.03-08-2012
20120057467RELAY DEVICE - A relay device includes a switch for switching a combination of an input for receiving traffic data and an output for sending the traffic data; a congestion information processing section for obtaining congestion information indicating a degree of congestion of each of a plurality of traffics from an adjacent relay device which handles the plurality of traffics commonly with the relay device, and congestion information of each traffic in the relay device; a congestion information comparison section for finding information on a congestion level which quantitatively indicates difficulty of flowing of each traffic based on the congestion information obtained from the adjacent relay device and the congestion information of the relay device; a transmission scheduling adjustment section for assigning a transmission band of a bus to each traffic based on the congestion level; and a switch assignment section for shifting the switch based on a result of the assignment.03-08-2012
20120057466Automated Traffic Engineering for Multi-Protocol Label Switching (MPLS) with Link Utilization as Feedbank into the Tie-Breaking Mechanism - A method implemented in a node of a multi-protocol label switching (MPLS) network for improved load distribution, including determining a first set of one or more shortest paths between each MPLS node pair, selecting at least a first shortest path by applying the common algorithm tie-breaking process, calculating a link utilization value for each link of the MPLS network, determining a second set of one or more shortest paths between each MPLS node pair, generating a path utilization value for each shortest path in the second set of shortest paths based on link utilization values corresponding to each shortest path, and selecting a second shortest path from the second set of shortest paths on the basis of said path utilization value, whereby the selection of the second subsets in light of path utilization minimizes the standard deviation of load distribution across the entire MPLS network.03-08-2012
20110085445METHODS AND APPARATUS TO DESIGN A SURVIVABLE INTERNET PROTOCOL LINK TOPOLOGY - Methods and apparatus to design a survivable Internet Protocol link topology are disclosed. An example method to generate a network topology is described, which includes identifying a plurality of potential express links based on a first subset of a plurality of physical links coupling a plurality of communication network nodes, wherein one or more of the potential express links includes a network layer link traversing more than one of the physical links, determining an amount of network layer traffic that may be carried on a first potential express link, selecting the first potential express link as a chosen express link based on at least one of the traffic or a first number of network layer links on the physical links, adding the chosen express link to a list of express links, generating a plurality of network topologies by selecting one or more different numbers of express links from the list of express links, and selecting one of the generated network layer topologies based on a cost of the generated network layer topologies.04-14-2011
20120113810TOLL-BASED ROUTING - A method for toll-based routing is described. A routing table that associates a cost and a quality factor with each destination in a network is built. One or more data packets are received. A neighboring node to send the one or more data packets is selected based on the routing table and user preferences of an originator or intended receiver of the one or more data packets. The one or more data packets are sent to the selected neighboring node. A routing report that indicates routing of the one or more data packets is sent to a toll service.05-10-2012
20120026886PATH COMPUTATION METHOD, PATH COMPUTATION ELEMENT, NODE DEVICE, AND NETWORK SYSTEM - The present invention provides a path computation method, a Path Computation Element (PCE), a node device, and a network system. The method includes: receiving a path computation request message (S02-02-2012
20100061246TRANSIT PREVENTION IN HUB-AND-SPOKE TOPOLOGIES USING LINK STATE PROTOCOLS - In one embodiment, a method and apparatus of controlling transmission of data packets in a communications network includes designating all networking devices in a portion of the communications network as either hubs or spokes, communicating a link-state advertisement to each connected hub and spoke in the portion of the communications network, computing a shortest path tree at all the hubs and the spokes based on the link-state advertisement, the computing including truncating the shortest path tree at the hubs only for links leading from the spoke to the hub, creating a routing table at each of the hub and the spoke based on the truncated shortest path tree, and transmitting the data packets in the communications network based on the link-state advertisement. The shortest path tree includes all data transmission routes in the tree except links leading from a spoke to a hub.03-11-2010
20110103228OSPF POINT-TO-MULTIPOINT OVER BROADCAST OR NBMA MODE - A network device identifies an Open Shortest Path First (OSPF) link between the network device and a layer 2 network as one of a point-to-multipoint over broadcast interface or a point-to-multipoint over non-broadcast multi access (NBMA) interface, and performs database synchronization and neighbor discovery and maintenance using one of a broadcast model or a NBMA model. The network device also generates a link-state advertisement for the network device, where the link-state advertisement includes a separate link description for each point-to-point link within the layer 2 network; and sends the link-state advertisement to each fully adjacent neighbor in the layer 2 network.05-05-2011
20120163180Systems and Methods for Policy Based Routing for Multiple Hops - The present application is directed towards policy based routing for intelligent traffic management via multiple next hops. In some embodiments, the systems and methods disclosed herein may provide management of inbound and outbound traffic across multiple network links, and may further provide reliability in case of link failure, and provide balancing of traffic, responsive to the latency and bandwidth requirements of various applications. Accordingly, these systems and methods may provide intelligent policy-based routing and network and port address translation, sensitive to application traffic types, protocols, source IP addresses and ports, destination IP addresses and ports, or any combination thereof, and can balance traffic loads among multiple available paths based on multiple traffic characteristics. The routing may performed on a packet-by-packet basis, a transaction-by-transaction basis, or a session-by-session basis, and the systems and methods may include capabilities for application-aware health monitoring of available network paths.06-28-2012
20120213079TRAP-FREE SHORTEST LINK-DISJOINT PATHS - A method including receiving information corresponding to a network graph of a network; determining a maximum flow value of the network based on the network graph; selecting a value for a number of trap-free shortest link-disjoint paths to find between a source node and a destination node based on the maximum flow value; selecting a value for a minimum remaining flow value based on the value for the number of trap-free shortest link-disjoint paths; and selecting a trap-free shortest link-disjoint path in which a complementary part of the network supports at least the remaining minimum flow value.08-23-2012
20120213081NETWORK DESIGN SYSTEM - An operator sets a path demand to be accommodated, and sets information of a device candidate, the number of ports, a path route and the like, which are demanded for a network, in an objective function that indicates a total cost when the path demand to be accommodated is newly included in the network. A mathematical programming problem for minimizing the objective function under a constraint condition derived from a configuration of the network is set, and a solution is obtained by using a solver for solving the mathematical programming problem. A device is added or the like to the network based on the obtained solution, and the demanded path is added to the network.08-23-2012
20120314582METHOD AND APPARATUS FOR SIMPLIFYING THE COMPUTATION OF ALTERNATE NETWORK PATHS - An alternate path calculation process may be terminated after considering some of a source node's neighbors and without considering each of its neighbors, to reduce the amount of processing required to perform the alternate path calculations. The neighbors may be ranked according to the number of alternate paths that the neighbor has historically been able to provide on the network. The influence of historical success or failure may degrade over time so that the rankings may be adjusted to reflect changes in network topography. A given source node, when computing alternate paths through the network, may preferentially select neighbors to perform alternate path calculations on historically higher scoring nodes before performing calculations on historically lower scoring nodes. Several different criteria may be used to stop the alternate path calculation process before considering all neighbors. The neighbors may be loop free neighbors or U-turn neighbors.12-13-2012
20120314581METHOD & APPARATUS FOR OPTIMIZING DATA TRAFFIC PATH THROUGH A STACKED SWITCH LAG CONFIGURATION - A stacked switch includes two or more individual network switches connected to each other in a ring or daisy chain topology over stacking links, and at least one port on two or more of the individual switches comprising the stacked switch is a member of a LAG configured on the stacked switch. Each of the individual switches comprising the stacked switch include control plane and data plane functionality that operates to maintain switching tables and to process network data ingressing to the switch to determine how to forward the network data through the switch to an egress point. The control functionality included in each of the switches comprising the stacked switch also includes an enhanced ECMP functionality that operates to optimize the use of stacking link bandwidth on the stacking links connecting the two or more individual switches to each other.12-13-2012
20120213080TRAP-FREE SHORTEST LINK-AND-SHARED RISK LINK GROUP-DISJOINT PATHS - A method including receiving network graph information of a network, wherein the network graph information includes shared risk link group (SRLG) information; determining a maximum link-and-SRLG-disjoint flow value of the network based on the network graph information; selecting a value for a number of trap-free shortest link-and-SRLG-disjoint paths to find between a source node and a destination node based on the maximum link-and-SRLG-disjoint flow value; selecting a minimum remaining link-and-SRLG-disjoint flow value based on the value for the number of trap-free shortest link-and-SRLG-disjoint paths; and selecting a trap-free shortest link-and-SRLG-disjoint path in which a complementary part of the network supports at least the minimum remaining link-and-SRLG-disjoint-flow value.08-23-2012
20120250516TECHNIQUE FOR USING OER WITH AN ECT SOLUTION FOR MULTI-HOMED SITES - In one embodiment, a plurality of spoke-to-hub virtual private network (VPN) tunnels are established from a spoke router located at an edge of a spoke network to a hub network. The spoke router is configured as an optimized edge routing (OER) node. The spoke router monitors a network statistic for each of a plurality of prefixes on each of the plurality of spoke-to-hub VPN tunnels. The monitored network statistic is analyzed to determine whether a distribution of traffic between the spoke network and the hub network can be optimized. In the event the distribution of traffic between the spoke network and the hub network can be optimized, traffic is redistributed on a per-prefix basis among the plurality of spoke-to-hub VPN tunnels based on the monitored network statistic, such that at least a portion of the traffic is routed over each of the plurality of spoke-to-hub VPN tunnels.10-04-2012
20120075999DYNAMIC LATENCY-BASED REROUTING - A switch creates and dynamically updates a latency map of a network to adjust routing of flows. Further, the network is monitored to detect latency issues and trigger a dynamic adjustment of routing based on the latency map. In this manner, a flow can be routed along a route (i.e., a faster route) that provides less latency than other available routes. The latency map can be generated based on latency probe packets that are issued from and returned to the source switch. By evaluating many such latent probe packets that have traveled along many available routes (e.g., corresponding to various ports of the switch), the switch or associated administrative logic can dynamically adjust the latency map to updated latency information of available routes. Therefore, responsive to a trigger, the source switch can dynamically adjust the routing of a flow based on latency issues discerned from the network.03-29-2012
20120176904APPLYING A TABLE-LOOKUP APPROACH TO LOAD SPREADING IN FORWARDING DATA IN A NETWORK - A method to provide load distribution that selects one of a set equal cost paths for each flow that minimizes imbalance in the distribution of flows across the set of equal cost paths, the method including calculating the set of equal cost paths to each destination node, generating a set of next hop discriminators for the set of equal cost paths, each next hop discriminator in the set of next hop discriminators to uniquely identify one of the equal cost next hops, populating the load distribution table by storing, according to a distribution mechanism, in each load distribution table entry one of the next hop discriminators from the set of next hop discriminators, receiving a first PDU from a first flow and performing a lookup of one of the next hop discriminators in the load distribution table by using values at the bit locations of the first PDU directly as an index into a CAM.07-12-2012
20120176905APPARATUS AND METHOD FOR DELIVERING MESSAGES OVER MULTIPLE MEDIUMS - A method of and device for transmitting a data message to a communication device configured to receive data through a plurality of communications mediums, including: assigning a first priority to a first component of the data message and a second priority to a second component of the data message; sending the first message component to the communication device over an available communications medium; and queuing the second component for delivery via a communication medium having a lower relative data transmission cost than the medium over which the first component was sent.07-12-2012
20100002586Method for Tracking Network Parameters - A method for tracking network parameters in a communication network formed by nodes and links between them, particularly in a packet-based IP network, with access controls for the purpose of limiting the traffic load, where the network parameters include a link/cost metric with link weights for the links, a) a traffic matrix for the network is regularly ascertained, b) a blocking probability for traffic which is subject to an access control is determined from a current traffic matrix, c) a check is performed to determine whether the ascertained blocking probability satisfies a criterion for scheduled network operation, d) if the blocking probability does not satisfy the criterion and/or redetermination for limits used as part of the access controls using the current traffic matrix does not result in a blocking probability which satisfies the criterion then the current traffic matrix is used to determine a new link/cost metric for optimizing the transport of traffic through the network, e) new values for limits used as part of the access controls are determined on the basis of the new link/cost metric and, following determination of the new values for the limits, a check is performed to determine whether the criterion is satisfied when the limits are fixed at these values again, f) if the criterion is satisfied then the link weights are configured with the new link/cost metric in the network and the limits are stipulated at the new values, wherein in step d) the link/cost metric is first of all optimized for the transport of traffic through the network without taking account of error situations, and if it is established in the subsequent step e) that the criterion is not satisfied when the limits are fixed again on the basis of the new link/cost metric, optimized without taking account of error situations, then the process returns to step d) and the link/cost metric for transporting traffic through the network is optimized taking account of error situations.01-07-2010
20120224487System and Method for Accepting Information from Routing Messages Into a List - A system and method adds and manages entries on a list of entries of routing information to allow the top entry to be used for routing to a destination corresponding to the list. Costs of a wireless link may be a function of the success rate experienced on that wireless link.09-06-2012
20120263042METHOD AND SYSTEM FOR DETERMINATION OF ROUTES IN LEO SATELLITE NETWORKS WITH BANDWIDTH AND PRIORITY AWARENESS AND ADAPTIVE REROUTING - In Low Earth Orbit (LEO) satellite networks data routes for point to point and point to multipoint communication sessions in LEO satellite networks are determined by considering session bandwidth, priority, and the constantly changing terminal-satellite and satellite-satellite connectivity. Multiple routes are computed for a session to facilitate automatic adaptive rerouting by satellite payloads when they encounter network failures or congestion conditions.10-18-2012
20090016224MULTI-CRITERIA OPTIMIZATION FOR RELAYING IN MULTI-HOP WIRELESS AD HOC AND SENSOR NETWORKS - A generalized multi-parameter mapping function aggregates decision criteria into a single virtual criterion to rank the potential relay candidates. Optimal rules for next hop relay as applicable to both transmitter-side selection and receiver-side election based forwarding schemes are also provided. Examples of network performance based on two optimization criteria include one-hop progress (greediness) and packet success rate (link quality). A suitable mapping function trades off the greediness for link quality. Simulation information is provided that indicates that the implementation according to the mapping function outperforms the reported transmitter-side link-aware forwarding schemes.01-15-2009
20120230199TIE-BREAKING IN SHORTEST PATH DETERMINATION - A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.09-13-2012
20080298252METHOD OF ROUTING TRAFFIC IN A NETWORK - Methods, systems, and apparatuses are described for communicating among stations in a network. A station in the network can determine costs between that station and a headend through a number of other stations and selecting a low cost path from among the possible paths. Cost data from the determination can be transmitted from the station to other stations in the network for use in selecting low cost paths at those stations.12-04-2008
20080298251INTEGRATING LOCAL CONGESTION AND PATH INTERFERENCE INTO QoS ROUTING FOR WIRELESS MOBILE AD HOC NETWORKS - A method and apparatus is provided for using a distributed multi-path QoS-aware routing scheme that considers basic MANET characteristics to meet transport service requirements of real-time applications and makes use of multiple discovered paths to calculate a next-hop decision. The QoS Routing scheme superimposes distributed neighborhood congestion, neighborhood density, and link stability and delay information over the multiple discovered paths when the next-hop decision is calculated.12-04-2008
20080298250Method and Arrangement for Link Cost Determination for Routing in Wireless Networks - The invention relates to determination of a link cost employable in route determination and data forwarding in a multihop communication network (12-04-2008
20080298249METHOD FOR SELECTION OF AN ASSOCIATION ACCESS POINT FOR A STATION IN A MESH NETWORK - A method for selection of the association access point for a station in an infrastructure mesh network based on received signal strength and one or more “association bias” weights received from neighboring access points. Each weight corresponds to a packet length category. In one embodiment, stations measure received signal strength for received signals and decode the association bias information field(s) and corresponding packet length category thresholds that are received in management frames such as beacons. Stations use this information to select an access point for association that will minimize the overall mesh resource utilization for the traffic (i.e. packet lengths) being transmitted. The method includes three elements: network assistance, access point actions, and station actions.12-04-2008
20080285459METHOD AND SYSTEM FOR AUDIO/VIDEO BRIDGING AWARE SHORTEST PATH BRIDGING - Aspects of a method and system for Audio/Video Bridging aware shortest path bridging are provided. In this regard, network nodes which are AVB enabled and capable of routing information based on a desired path cost and/or a desired quality of service (QoS) may be identified, and an AVB enabled path comprising one or more of the identified nodes may be established for communication over a network. In this regard, the desired cost may be a least cost and may be the “shortest path” between two nodes in a network. Additionally, the nodes maybe identified using Shortest path Bridging protocols and/or Audio Video Bridging protocols and/or extensions thereof. Also, bridge protocol data units may be exchanged to identify the nodes.11-20-2008
20080285458Deadlock free network routing - A method for establishing a routing scheme defining a path between any given pair of source node and destination node in a network including a plurality of nodes connected by links. The method comprises defining a plurality of virtual network layers, each virtual network layer comprising addresses for identifying each node, and channels for communicating between said nodes using said addresses, and defining a routing function for each layer, the routing scheme comprising all routing functions, each routing function comprising a set of source node/destination node pairs and a path connecting each pair. The routing function is defined by defining a cost function for each layer, said cost function being adapted to assign a high cost to any path creating a deadlock, using said cost function to assign a cost to each path in each layer connecting the source node/destination node pair, selecting the path with the lowest cost, and assigning the pair of source node/destination node and its selected path to the routing function of the layer that contains said selected path.11-20-2008
20120327779SYSTEMS AND METHODS FOR CONGESTION DETECTION FOR USE IN PRIORITIZING AND SCHEDULING PACKETS IN A COMMUNICATION NETWORK - Systems and methods provide a parameterized scheduling system that incorporates congestion detection and end-user application awareness and can be used with scheduling groups that contain data streams from heterogeneous applications. Congestion can be detected at multiple domains. Congestions can be detected using demand for communications, measure of resource usage in the communication device, or performance of the communication device. Congestions can also be detected using measures of protocol delay. The detected information can be used for scheduling transmission of the packets. Quality of Experience (QoE) for users can be maximized by efficient control responses to detected congestion.12-27-2012
20110044174METHOD TO SCHEDULE MULTIPLE TRAFFIC FLOWS THROUGH PACKET-SWITCHED ROUTERS WITH NEAR-MINIMAL QUEUE SIZES - A method to schedule multiple traffic flows through a multiplexer server to provide fairness guarantees, while simultaneously minimizing the sizes of the associated queues, is proposed. To minimize the sizes of the associated queues, the multiplexer server minimizes a quantity called the maximum Normalized Service Lag for each traffic flow. Every traffic flow to be scheduled through a multiplexer server is assigned two values, an initial Normalized Service Lag value, and a Normalized Lag Increment value. In each time-slot, the normalized service lag of every traffic flow is updated by adding the normalized lag increment value, whether or not there is a packet in the queue associated with the flow. In each time-slot, a multiplexer server selects a traffic flow to service with an available packet and with the maximum normalized service lag. Efficient software and hardware methods for performing the iterative calculations are presented. When the traffic rate requested by each traffic flow is stable, the multiplexer server schedule will repeat periodically. Efficient methods to compute periodic schedules is proposed. The methods can support multiple traffic flows with multiple traffic classes. The methods can be applied to packet-switched Internet routers to achieve near-minimal queue sizes and near-minimal delays.02-24-2011
20120320754ROUTE CALCULATING AFTER SWITCHING OCCURS FROM A PRIMARY MAIN CONTROL BOARD TO A STANDBY MAIN CONTROL BOARD - Calculating routing after switching occurs from a primary main control board to a standby main control board in a Fiber Channel (FC) switch includes receiving neighbor Link State Records (LSRs) sent by the primary main control board and backing up the neighbor LSRs on the standby main control board. The standby main control board is triggered to be promoted to the primary main control board, and an adjacency relationship is established with neighbors according to the backed up neighbor LSRs. LSRs of the switch are generated based on available ports on the switch and the neighbors, and a message is sent for maintaining the adjacency relationship to the neighbors with which the adjacency relationship has been established. Routing is calculated based on the neighbor LSRs and the LSRs of the switch12-20-2012
20100232295AIRCRAFT DATA LINK NETWORK ROUTING - A method includes selecting a first communications network from a plurality of communications networks based on one or more aircraft state inputs. The one or more aircraft state inputs include at least one of a flight phase, a flight event, an aircraft position, an aircraft trajectory, an aircraft state, and an aircraft distance from a ground station. The method further includes transmitting data over the first communication network. The method further includes selecting a second communications network from the plurality of communications networks based on a change in the one or more aircraft state inputs.09-16-2010
20100214927METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS FOR LOAD BALANCED AND SYMMETRIC PATH COMPUTATIONS FOR VoIP TRAFFIC ENGINEERING - The subject matter described herein includes methods, systems, and computer program products for load balanced and symmetric SPF path computations for VoIP traffic engineering. One method includes advertising an output interface cost in a first direction over a first network segment between a source IP device and a destination IP device that is different from an output interface cost in advertised in a second direction over the first network segment. A plurality of available network paths between the source IP device and the destination IP device is identified. A path cost is calculated for each of the available network paths from the source IP device to the destination IP device. Calculating a path cost includes, for paths that include the first network segment, substituting the output interface cost advertised in the first direction with the output interface cost advertised in the second direction. The path costs are ranked based on the calculated costs. A lowest cost path is selected from the ranked paths. Both directions of a media session are assigned to the lowest cost path.08-26-2010
20120140637COMMUNICATION NETWORK AND METHOD FOR OPERATING A COMMUNICATION NETWORK - A communication network includes a plurality of network elements—communicating nodes—that are enabled to request the establishment of connections—flows—among each other, and a plurality of network elements—switches (06-07-2012
20130021910NETWORK DATA CONGESTION MANAGEMENT METHOD - A method to manage data congestion in a computer network may include network devices to route data packets throughout the network. The method may also include a source node that sends data packets to any of the network devices. The method may further include a routing table at each network device that is updated by the source node, and the route the data packets are sent by any network device is based upon each respective routing table.01-24-2013
20080253291Network management method - A network management method is applied to a network management system, which includes at least one user apparatus and a network managing agent apparatus connected to the user apparatus. The management method includes the steps of: adopting at least one information string, which is set by a network management protocol established for at least one layer except a data-link layer, by the network managing agent apparatus; packing the information string into a managing packet; and transmitting the managing packet to the user apparatus through the data-link layer according to an Ethernet protocol by the network managing agent apparatus.10-16-2008
20080232258Method and Arragement for Advanced Routing Metrics in Multihop Networks - The inventors have envisioned a multihop network scenario in which nodes are equipped with advanced multi-antenna arrangements, and recognized the advantage of exploring the presence of such advanced antenna arrangements in multihop network nodes for the specific purpose of determining link cost for routing in the network. A basic idea of the invention is therefore to determine link cost for a wireless link between a pair of nodes in the network based on multi-channel characteristics between the nodes, where at least one of the nodes is configured for operation with multiple antennas to provide for multiple channels. These multi-channel characteristics may for example be determined based on explicit channel matrix estimation and/or the number of transmit and receive antennas or other information on the antenna capabilities of the involved nodes. The determined link cost information may subsequently be used together with additional routing cost information for route determination, and packet forwarding.09-25-2008
20080225730Method and apparatus for monitoring and displaying routing metrics of a network - The invention includes an apparatus and method for displaying path metrics associate with nodes and links within a network. The method includes determining path metric values associated with the network. The method further includes displaying only the path metric values that fall within a predetermined set. The predetermined set can be adjustable by a network manager. The predetermined set can include an initial default value and be additionally adjusted by a network manager. The predetermined set associated with a particular node can be based upon a redundancy of paths available to the particular node.09-18-2008
20080225729Apparatus, methods and computer program products implementing fast bearer prioritization in a MAC-HS packet scheduler based on required activity detection - Apparatus, methods and computer program products provide fast instantaneous overload control during scheduling operations involving users in a wireless communications network who are candidates to be scheduled in a next transmission time interval. Apparatus detect congestion conditions in a wireless communications network by determining an instantaneous operating region of a scheduler (e.g., a medium access control-high speed scheduler) based on required activity detection and prioritize users in a scheduling candidate set based on the cost of a user. In a variant, this may be implemented by combining part of the required activity detection algorithm with a per-bearer cost function. In one implementation, this will limit the number of users that suffer during momentary congestion in the wireless communications network.09-18-2008
20110273990Per-graph link cost assignment in layer 2 multipath networks - In one embodiment, a method includes assigning at a switch in a layer 2 multipath network, costs to a link in the network, each of the link costs associated with a different graph for forwarding traffic in the network, transmitting the link costs to other switches in the layer 11-10-2011
20130114415PARAMETER SCALING FOR FRACTIONAL BANDWIDTH SYSTEMS - Methods, systems, and devices are described for making scaling adjustments with respect to a fractional subsystem in a wireless communications system. To handle the effects of scaling associated with fractional bandwidth systems, different adjustments may be made to maintain certain quality of service (QoS) requirements, for example. Scaling adjustments may include identifying a scaling factor for the fractional subsystem and a parameter and/or a timer associated with the fractional subsystem. An adjustment associated with the parameter and/or timer may be determined based on the scaling factor. The adjustment may be applied with respect to the parameter and/or timer for at least a portion of the fractional subsystem or another portion of the wireless communications system.05-09-2013
20130100818METHOD FOR DETERMINING PLACEMENT OF INTERNET TAPS IN WIRELESS NEIGHBORHOOD NETWORKS - Disclosed is a method for determining the placement of ITAPs in wireless neighborhood networks. The method disclosed provides for efficient integration of multi-hop wireless networks with the Internet by placing ITAPs at strategic locations. Initially the method provides for the formulation of the ITAP placement problem under three wireless models. For each model, methods are developed to efficiently place ITAPs in the networks. The methods aim to minimize the number of required ITAPs while guaranteeing users' bandwidth requirements. Next, a fault tolerance version of the placement method is presented that provides bandwidth guarantees in the presence of failures. Finally the methods are extended to take into account variable traffic demands by developing an approximation algorithm to simultaneously optimize ITAP placement based on demands over multiple periods.04-25-2013
20130100817METHOD FOR DISCOVERY AND LOAD BALANCING OF PATH COMPUTATION ELEMENTS BASED ON TRANSPORT PLANE LINK METRICS - A method and system for path computation in a communications network having multiple domains are disclosed. According to one aspect, a method of path computation across multiple domains includes identifying a plurality of border nodes at borders of a plurality of domains, each domain having at least one border node. The method includes providing a path computation element at each of the plurality of border nodes of the domains of the network. The locations of the path computation elements are known to be at the border nodes prior to determining a path in response to a path computation request.04-25-2013
20130128746MECHANISM FOR PACKET FORWARDING USING SWITCH POOLS IN FLOW- BASED, SPLIT-ARCHITECTURE NETWORKS - Method and apparatus for reducing forwarding table sizes in flow switches in a flow-based, split-architecture network is described. In an embodiment, a set of flow switches along a flow path is identified to form a switch pool. The forwarding table of only one of the flow switches in the switch pool is configured to have a flow entry that is associated with a particular flow. The flow entry includes a set of match fields for identifying packets belonging to that particular flow, and a set of actions to be performed on the packets belonging to that particular flow.05-23-2013
20080198752DATA REPLICA SELECTOR - A method is provided for selecting a replication node from eligible nodes in a network. A multidimensional model is constructed that defines a multidimensional space and includes the eligible nodes, with each of the dimensions of the multidimensional model being a system characteristic. A data availability value is determined for each of the eligible nodes, and a cost of deploying is determined for each of at least two availability strategies to the eligible nodes. At least one of the eligible nodes is selected for replication of data that is stored on a source node in the network. The selecting step includes selecting the eligible node whose: data availability value is determined to be highest among the eligible nodes whose cost of deploying does not exceed a specified maximum, or cost of deploying is determined to be lowest among the eligible nodes whose data availability value does not exceed a specified minimum.08-21-2008
20120275310METHOD AND APPARATUS FOR CONTROLLING THE APPLICATION OF SELECTED IP TRAFFIC OFFLOAD AND LOCAL IP ACCESS - A method and apparatus are described for controlling the application of Selected Internet Protocol (IP) traffic offload (SIPTO) or Local IP Access (LIPA) services for a wireless transmit/receive unit (WTRU). The SIPTO and LIPA services may be performed over packet data network (PDN) connections. A user of the WTRU may be prompted to accept or reject the usage of the SIPTO or LIPA services. The user of the WTRU may request switching from SIPTO or LIPA services to non-SIPTO or non-LIPA services.11-01-2012
20120275309ROUTING COST NORMALIZING - A computing device ranks multiple routing pairs based on a current routing configuration for weighted links in a network, and ranks the multiple routing pairs based on a proposed routing configuration, different than the current routing configuration, for the weighted links in the network. The computing device compares a current rank order of a first routing pair and a second routing pair in the multiple routing pairs with a proposed rank order of the first routing pair and the second routing pair. The computing device identifies a change between the current rank order and the proposed rank order and generates a data structure that indicates the identified change between the current rank order and the proposed rank order for the first routing pair and the second routing pair.11-01-2012
20130208599TRANSMISSION SYSTEM, MANAGING COMPUTER, AND LOGICAL PATH CONSTRUCTION METHOD - A transmission system that uses resources of a transmission network efficiently to a request of dynamic bandwidth guarantee from a communication network while controlling a load of a managing server, and connects a logical path of the communication network and a logical path of a transmission network. In the transmission system that has multiple transmission nodes each serving as a component of the transmission network, multiple communication nodes each serving as a component of the communication network, and a managing computer, when an available bandwidth of a default path is smaller than a guaranteed bandwidth contained in control information and then when information about the logical path already having been dynamically constructed coincides with a condition, a logical path that uses a route different from a specified default path is dynamically constructed as a logical path in the transmission network.08-15-2013

Patent applications in class Least cost or minimum delay routing

Patent applications in all subclasses Least cost or minimum delay routing