An example of a distributed system partition can include a method for client service in a distributed switch. The method can include maintaining local and global connection state information between a primary and a secondary controlling fibre channel (FC) over Ethernet (FCoE) Forwarders (FCFs) or FC forwarder in a distributed switch. A partition in the distributed switch can be detected and service to subtended clients of the distributed switch can continued using local state information.

A fully-connected mesh network includes a plurality of switches. A first switch receives a packet traveling through the mesh network from an external source node to an external destination node specified by the packet. A plurality of links, which are all included in a mesh link aggregation group (LAG), couple each possible pair of the switches by a respective single link. Each of the respective links is included individually in an individual LAG. Each of the switches is configured to receive a packet from another switch of the plurality of switches via only the mesh LAG, and each switch that receives a packet via the mesh LAG is configured to transmit the packet to another switch of the plurality of switches via only one of the individual LAGs. The packet travels to the destination node at most two hops across the plurality of switches.

MPLS segment routing is disclosed. In one embodiment, a first core router generates a first data structure that maps first portcodes to respective identities of first neighbor routers or respective first links, wherein the first portcodes identify respective first ports of the first core router, and wherein the first ports are coupled to the first neighbor routers, respectively, via the first links, respectively. The first core router generates and transmits a first link-state packet, wherein the first link-state packet comprises an identity of the first core router and the first data structure.

A method for aliasing of named data objects (in named data networks) and entities for named data networks (e.g., named graphs for named data networks). In various examples, aliasing of named data objects may be implemented in one or more named data networks in the form of systems, methods and/or algorithms. In other examples, named graphs may be implemented in one or more named data networks in the form of systems, methods and/or algorithms.

Request routing in a network of computing devices. Back-end nodes associated with a request router send load reports to the request router that makes routing determinations for request from clients based on the reports. To select a back-end node for processing a request, a request router determines, based on the reports and one or more factors, load probability distributions for each of a group of back-end nodes selected from available back-end nodes. A load value is then randomly selected for each back-end node in the group, based on the node's probability distribution. The node in the group with the least randomly-selected value is chosen to process the request.

Some embodiments provide a method for a host computer that executes a set of data compute nodes (DCNs), for identifying a designated router for a multicast group. The method receives a membership request message to join the multicast group from a particular DCN of the set of DCNs, the membership request message including an address associated with the multicast group. The method identifies a logical router gateway from a set of logical router gateways as the designated router for the multicast group, based at least in part on the address associated with the multicast group, where different logical router gateways from the set of logical router gateways are assigned as designated routers for different multicast groups with different associated addresses. The method forwards the membership request message to the identified logical router gateway.

A method is provided in one example and includes assigning a virtual switch identifier to a group of a plurality of switches in which each of the plurality of switches is configured with a redundancy protocol. The method further includes configuring a redundancy protocol priority value for each the plurality of switches, and generating at least one link-state routing protocol message including priority information indicative of the redundancy protocol priority value associated with one or more of the plurality of switches. The method further includes distributing the at least one link-state routing protocol message to one or more of the plurality of switches.

In a load sharing method and a router device, each of the router devices in a load sharing relationship obtains load sharing information of all downstream router devices that are in a load sharing relationship with the router device, and when determining load sharing information of the router device, the router device determines the load sharing information of the router device according to the load sharing information of all the downstream router devices that are in a load sharing relationship with the router device, so that a disturbance factor of the router device is different from disturbance factors of all the downstream router devices that are in a load sharing relationship with the router device. Therefore, a coupling degree of load sharing information of all the router devices in a load sharing relationship in the network is reduced, and load sharing at all levels is even.

Configuration of tunnel, firewall and/or other positional based functionality for routers operating within a multi-router network is contemplated. The functionality configured for one or more of the routers may be implemented automatically without manual input or identification, such as to facilitate an off-the-shelf implementation process where positioning and attendant functionality is routinely implemented according to a predefined set of roles.

A sticky order routing system may include multiple order routers in communication with an electronic exchange for communicating transaction messages. Each of the order routers communicates transaction messages between multiple associated trading sessions and the electronic exchange, where of the associated trading sessions is assigned to the order router in communication with the electronic exchange. Transaction message traffic between the order routers and the electronic exchange is monitored, such as randomly, based on round-robin assignment, and/or trading data. In response to transaction message traffic exceeding a threshold, the trading session may be assigned to a new order router.