AcclaimIP-ad

Match Document Document Title
US20150156106 METRIC BIASING FOR BANDWIDTH AWARE TIE BREAKING  
A method is implemented in a network element for modifying the characteristics of tree construction for use in virtual network connectivity in a network that includes the network element. A...
US20120320754 ROUTE 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)...
US20130114415 PARAMETER 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...
US20140226491 Mechanism and Framework for Finding Optimal Multicast Tree Roots Without the Knowledge of Traffic Sources and Receivers for Fabricpath and TRILL  
The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the...
US20130100818 METHOD 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...
US20140307559 TIE-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....
US20120230199 TIE-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....
US20110128857 TIE-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....
US20140247727 DISTRIBUTED SERVICE ROUTING PROTOCOL SUITABLE FOR VIRTUAL NETWORKS  
A dynamic service routing protocol (DSRP) communicates messages (e.g., containing information regarding network routes and tables) across a partial-mesh network of nodes. Gateway nodes (i.e.,...
US20120224487 System and Method for Accepting Information from Routing Messages Into a List  
A system and method adds and manages entries on a list of entries of routing information to allow the top entry to be used for routing to a destination corresponding to the list. Costs of a...
US20150071080 REDUNDANCY FOR INTER-AS L2VPN SERVICE WITH OPTIMAL FORWARDING  
In one embodiment, a particular autonomous system border router (ASBR), in a control-plane media access control (MAC) learning (CPML) network, discovers other ASBRs in the CPML network, the...
US20150029865 NETWORK TRAFFIC ROUTING OPTIMIZATION  
The present disclosure describes methods, systems, and computer program products for providing network traffic routing optimizations. One computer-implemented method includes calculating a direct...
US20140153401 Method and System for Symmetric Transmit and Receive Latencies in an Energy Efficient PHY  
Aspects of a method and system for symmetric transmit and receive latencies in an energy efficient PHY are provided. In this regard, a delay introduced by a PHY of a network device for outbound...
US20130039187 CAPACITY 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...
US20130170335 SYSTEM AND METHOD FOR CONVERGENCE AND AUTOMATIC DISABLING OF ACCESS POINTS IN A WIRELESS MESH NETWORK  
One embodiment of the present disclosure sets forth a technique for convergence and automatic disabling of access points in a wireless mesh network. Specifically, an access point within a wireless...
US20120075999 DYNAMIC 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...
US20130308463 PATH SELECTION METHOD AND CONTROL SERVER  
A path selection method includes: calculating an inter-node traffic forwarding probability from a parameter value relating to path selection; calculating a link cost when the parameter value is...
US20150117224 Network Topology of Hierarchical Ring with Gray Code and Binary Code  
A hierarchical ring network comprising a plurality of nodes coupled in a base ring configuration such that each node is coupled to two adjacent nodes via base links, wherein the nodes are further...
US20150063123 METHODS AND SYSTEMS FOR ROUTING SELECTION BASED ON ROUTING DISTANCE AND CAPACITY  
A system, computer-readable storage medium storing at least one program, and computer-implemented method for route selection based on payload delivery capacity and routing distance are described....
US20140348002 RELAYED CSPF COMPUTATION FOR MULTIPLE AREAS AND MULTIPLE AUTONOMOUS SYSTEMS  
A method in a router for participating in computation of a constraint-based label switched path (LSP) that spans a plurality of areas to reach a destination is described. The method comprises...
US20130003557 REDUCING OVERHEAD ON VOICE TRAFFIC  
The present invention provides a method, apparatus, gateway and a computer program product for reducing overhead on voice traffic within a packet based communication system. The present invention...
US20130128746 MECHANISM 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...
US20120250516 TECHNIQUE 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...
US20110216654 Scheme 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...
US20120263042 METHOD 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,...
US20110273990 Per-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...
US20100309789 ROUTING-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...
US20120314582 METHOD 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...
US20120307625 Method and Apparatus For Selecting Between Available Neighbors in a RAPID Alternate Path Calculation  
A weighting process may be used to select between alternate neighbors in a RAPID calculation to enable policy and/or traffic engineering considerations to affect the selection of an alternate path...
US20150236945 SYSTEM AND METHODS FOR IMPROVED NETWORK ROUTING  
Known intra-domain routing methods (e.g., OSPF and IS-IS) are link-state routing protocols with hop-by-hop forwarding that sacrifice optimal traffic engineering for ease of implementation and...
US20120039161 AUTOMATED TRAFFIC ENGINEERING FOR FAT TREE NETWORKS  
Embodiments of a method implemented in at least one fat tree network node for improved load distribution, wherein the node is one of a plurality of fat tree network nodes in a fat tree network...
US20150036508 Method and Apparatus For Gateway Selection In Multilevel SPB Network  
A manner facilitating automatic selection of active gateway for communication between nodes in levels of a multilevel SPB network that adapts automatically to changes in network topology and...
US20120026886 PATH 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...
US20140254388 RECONFIGURABLE NOC FOR CUSTOMIZING TRAFFIC AND OPTIMIZING PERFORMANCE AFTER NOC SYNTHESIS  
Systems and methods described herein are directed to solutions for Network on Chip (NoC) interconnects that supports reconfigurability to support a variety of different traffic profiles each...
US20120087665 METHOD AND APPARATUS FOR PROVIDING A ROUTE RECOMMENDATION  
A method and apparatus for providing a route recommendation are disclosed. For example, the method obtains network topology information, wherein the network topology information comprises a...
US20140254387 SYSTEM AND METHOD FOR PACKET TRANSMISSION ALONG SHORTEST-PATH TO MULTIPLE DESTINATIONS  
A system, method and apparatus arranged for efficient usage of network resources. Embodiments include nodes linked together, and the links having differing costs, e.g., bandwidth, frequency,...
US20120069740 Relayed 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...
US20150117223 Network Topology of Hierarchical Ring with Gray Coding Shortcuts  
An interconnection network comprising a plurality of nodes arranged in a ring topology, wherein the nodes comprise a first node and a second node, and wherein the first node is not adjacent to the...
US20140269332 Method and System to Represent the Impact of Load Variation on Service Outage over Multiple Links  
Increased resource utilization efficiency can be improved by modeling path costs during admission and path-selection. Specifically, path costs for candidate paths are modeled based on load...
US20150188831 System and Method for Traffic Engineering Using Link Buffer Status  
Embodiments are provided for implementing traffic engineering (TE) using link buffer status. The link buffer status for each link is used to identify links with buffer build-ups. One or more of...
US20120294152 Hybrid 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...
US20140269333 SYSTEM AND METHOD FOR IMPROVING ROUTING IN A DISTRIBUTED COMMUNICATION PLATFORM  
A system and method for routing communication in a communication platform that includes generating edge cost scores in the communication network; assigning distribution values within the network;...
US20150117222 Standby Bandwidth Aware Path Computation  
At a first network device, a plurality of paths through a network from a source network device to a destination network device are determined. A vacant bandwidth is calculated for each of the...
US20110044174 METHOD 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...
US20100329120 Determining 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...
US20120063320 Method 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...
US20110085445 METHODS 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...
US20130223229 PATH SELECTION BASED ON HOP METRIC DISTRIBUTIONS  
In one embodiment, a network device determines, for each particular path of a plurality of paths in a computer network, a hop metric distribution that indicates, for each interval of the hop...
US20060083169 Method and/or system for transferring/receiving audio and/or video signals and minimizing delay time over internet networks and relating apparatuses  
A method and system for transferring/receiving audio and/or video signals and minimizing delay time over Internet networks including, in transmission, converting, analog audio and/or video input...
US20130003556 SCHEDULING PACKETS IN A PACKET-PROCESSING PIPELINE  
The disclosed embodiments relate to a packet-processing system. This system includes an input which is configured to receive packets, wherein the packets include control-message (CM) packets and...