Patent classifications
H04L12/741
Method for allocating resources in a mesh communications network, computer program, information storage means and node device
For allocating resources in a mesh communications network for setting up a data stream transmission from a talker device to a listener device via at least one node device, data paths being defined throughout the mesh communications network following a link-state routing protocol, each node device performs receiving, obtaining, determining, and checking. And when there are enough said resources, temporarily reserving and propagating. And when receiving for said data stream transmission a stream reservation response representative of a positive acknowledgement to said stream reservation request, effectively allocating and propagating.
Method and apparatus for improving forwarding performance of chip
A method and apparatus for improving forwarding performance of a chip are disclosed. The method includes: when a chip receives a message, judging whether the message is a protocol message required to be processed, if the message is the protocol message required to be processed, performing MAC learning, and if the message is not the protocol message required to be processed, determining whether to perform learning after performing calculation according to a current actual time value of the chip and a preset empirical value. The apparatus includes: a first judgment module and a second judgment module. With the method and apparatus of the embodiments of the present document, an MAC learning intensity of the chip can be relieved to a great extent, thereby improving the forwarding performance of the chip.
Priority based anycast routing
A technique for selecting a network node from a plurality of nodes employing anycast addressing based on a priority. The plurality of nodes is configured with an anycast address. At each node, the anycast address is associated with a unique priority value that represents a priority associated with the node. Traffic destined for the anycast address is forwarded to the node whose priority value indicates the highest priority. If the node becomes unavailable, traffic destined for the anycast address is forwarded to a node whose priority value indicates the next highest priority, and so on.
Method, system, control device and node device for data transmission
The application discloses a method, system, control device and node device for data transmission. The method includes determining a source node for data transmission; selecting a node which has not been selected for reception of the data as a destination node for the data transmission, from a list of nodes for the reception of the data, wherein the destination node serves as the next nearest node of the source node; wherein the list of nodes comprises at least one identifier and an address of each node; and issuing a data transmission task to the source node, wherein the data transmission task comprises the identifier and the address of the destination node, so that the source node transmits the data to the destination node according to the address of the destination node. The technical solutions of the application can guarantee the data transmission speed and the data transmission efficiency.
Integrated circuit, code generating method, and data exchange method
An integrated circuit, a code generating method, and a data exchange method are described. The integrated circuit includes a plurality of field effect transistors, a plurality of sense-amplifiers, and a processing circuit. Each field effect transistor is configured to represent an address in a mapping table and includes a source, a drain, a channel and a gate. Each sense-amplifier is connected to the drain and configured to sense an electric current from the drain and identify a threshold voltage of the corresponding field effect transistor. The processing circuit is configured to categorize each of the threshold voltages identified by the corresponding sense-amplifiers into a first state and a second state and mark the state of each of the threshold voltages at the corresponding address in the mapping table.
Distributed network subnet
In general, techniques for facilitating a distributed network (L3) subnet by which multiple independent control planes of network devices connected to physically separate L2 networks provide L2 reachability to/from a single L3 subnet. In some examples, a shared L2 network physically situated to connect a plurality of physically separate L2 networks “stitches” the L2 networks together within the respective, independent control planes of switches such that the control planes bridge L2 traffic for a single bridge domain for the separate L2 networks to the shared L2 network and visa-versa. Each of the independent control planes may be configured with a virtual IRB instance associated with the bridge domain and with a common network subnet. Each of the virtual IRBs provides a functionally similar routing interface for the single bridge domain for the separate L2 networks and allows the shared network subnet to be distributed among the independent control planes.
Multitier wireless data distribution
Data distribution between mobile stations and external data paths is assigned to a new set of devices, distribution points. Each distribution point is independently coupled to mobile stations, also assigned to access points. Control elements operate to control the distribution points separately from the access points. Each access point maintains a substantially stateless link with each distribution point for which the two share a mobile station. Access points might exchange data with any one or more distribution points concurrently. Access points thus obtain greater bandwidth connectivity to external data paths. Mobile stations transfer between access points and transfer between distribution points independently. This has the effect that bandwidth connectivity between distribution points and external data paths have no particular requirement for VLAN separation. Mobile stations may roam among multiple Internet protocol subnets.
Automatic virtual local area network (VLAN) provisioning in data center switches
Techniques are described for automatic provisioning of virtual local area networks (VLANs) on server-facing ports of access switches included in a data center network. Conventionally, VLANs are pre-configured on all server-facing ports of access switches. The techniques described in this disclosure enable automatic provisioning of VLANs on server-facing ports of access switches triggered by traffic received on the ports. The techniques include a feature in a forwarding plane of an access switch that is configured to detect data packets received for an unknown VLAN on a port, and notify a control plane of the access switch of the unknown VLAN on the port. In response to the notification from the forwarding plane, the control plane may authorize and provision the VLAN on the port. The techniques described in this disclosure include hardware-assisted software provisioning of an unknown VLAN on a given port of an access switch.
TRIPLE-TIER ANYCAST ADDRESSING
In one embodiment, a solution is provided wherein redundant routers are treated as a single emulated switch. When a packet is received at a layer 2 edge switch from a host, the layer 2 edge switch may determine a switch identifier for the emulated switch using a destination anycast hardware address contained in the packet. The anycast hardware address may identify an emulated switch comprising a plurality of routers. Then a header may be added to the packet, the header including the switch identifier. Following that, the packet may be forwarded to another layer 2 switch along a shortest path from the layer 2 edge switch to the emulated switch.
MODELING A BORDER GATEWAY PROTOCOL NETWORK
Methods and systems for generating a model of a transit autonomous system (AS) network. The method comprises analyzing the routing information base for each border gateway protocol (BGP) node in the AS and storing, for each BGP router, (i) a routing table; and, (ii) a prioritized list of next hops for each prefix based on the appropriate best path algorithm. The model can be used to (a) determine how traffic will be routed through the transit AS in steady state and failure scenarios (e.g. when one or more links or nodes/routers have failed); and/or (b) determine how traffic should be routed through the transit AS (e.g. determine the best routes) in steady state and failure scenarios. The optimal routing of the traffic in a particular steady state or failure scenario (as determined by the model) can be compared to the actual routing of the traffic in the steady state or failure scenario (as determined by the model) to determine what changes to make to the transit AS to achieve the optimum routing.