Abstract: Described are computer-based methods and apparatuses, including computer program products, for service integration on a network. Telecommunication services (e.g., calendar, television, phone, location) on a network are integrated using service codelets designed to interface with the services. A default codelet associated with the user (e.g., via a service plan) dynamically calls the service codelets to request information from the associated services (e.g., calendar data) and/or perform tasks with the associated services (e.g., update calendar). The service codelets can dynamically call other service codelets based on the results of their requests for information. The information from the services is integrated and returned to the user.

Abstract: One embodiment disclosed relates to a method of automated path tracing from an original mesh switch through a switching mesh to a specified destination. A mesh traceroute packet to the specified destination is built. The mesh traceroute packet is transmitted via an exit port associated with the specified destination and the returned packet is received. Another embodiment disclosed relates to a method of responding to receipt of a mesh traceroute packet during an automated path tracing. The mesh traceroute packet is received at a switch. A hop entry is appended to the mesh traceroute packet by the switch.

Abstract: A fast, lightweight, reliable, packet-based protocol that operates independent of the type of networking protocol used by the underlying physical layer of the network is disclosed. More specifically, the packet based protocol operates independently of or is capable of encapsulating physical layer protocols such as but not limited to MAC, Ethernet, Ethernet II, HARD or IP. The protocol defines at least three different types of frames including Information frames, Supervisory frames, and Unnumbered frames. In various embodiments of the invention, the Information, Supervisory, and Unnumbered frames include DSAP and SSAP field with semantics which are sufficiently large to support the various physical layer protocols that may be used on the network. The Information frames, Supervisory frames, and Unnumbered frames also have the ability to support urgent data delivery and certain memory management functions.

Abstract: A communication relay device with a redundancy function for a line in a network under a WAN environment is connected to another, having a one-to-one relationship at both ends of each line by first and second ports to configure a redundancy channel between lines. A closed port setting section sets one of the ports as a closed port, thereby configuring a network free of a loop between the respective lines. A closed port setting information notifying section notifies a counterpart communication relay device connected to the one port, via the one port, of closed port setting notifying information for notifying that one of the ports has been set as a closed port. A datagram transmission stopping section stops transmission of a datagram from a port of its own connected to the one port set as the closed port when receiving the closed port setting notification information as the counterpart communication relay device.

Abstract: A method for broadcasting messages in an ad hoc wireless network having a tree-based architecture is provided. When a node receives a broadcast message for re-broadcasting to other nodes in the network, it builds a list of identifiers of other nodes in the network from which the node requires reception of a broadcast message as an implicit acknowledgment that said other nodes in the network have received said broadcast message. The node builds this implicit acknowledgment list based on stored data pertaining to an existing tree-based topology of the network. After this list is built, the node re-broadcasts the broadcast message. Each node in the network executes this broadcasting protocol and in so doing a broadcast message quickly and efficiently propagates through the network with minimal redundancy and impact on the topology of the network.

Abstract: A synchronous optical network (SONET) system having multi-hierarchal network service access point (NSAP) addressing includes a plurality of network elements (NEs) electrically linked, and a first level routing area and a second level routing area that each includes at least one NE. The NEs include devices having respective NSAP addresses and at least one of the NEs is a network controller that controls the SONET. The first level routing area and the second level routing area are based on a predetermined prioritization of the NEs as first level NEs and second level NEs, and have a first level routing and have a second level routing for the NSAP addresses, respectively, and each of the areas is capable of having at least 151 NEs.

Abstract: A connection management device for managing connection mode between node devices in a tree type broadcast system formed by participation of all or a part of a plurality of node devices included in a distributed content storing system where a plurality of content data are distributed and stored in the plurality of node devices and each of the plurality of node devices provides content data stored in the own node through a network in response to a request from the other node devices, to thereby sequentially transfer the content data broadcasted by the broadcasting device from the node devices on upper hierarchies to the node devices on lower hierarchies, the connection management device including: a memorizing device; a participation request information receiving device; a connection target determining device; and a node information transmission device.

Abstract: A system for rapidly switching at least one virtual local area network (VLAN) from a first loop-free topology to a second loop-free topology in response to a failure within the first loop-free topology. Each VLAN has one “logical” VLAN which represents the network entities organized into the VLAN and a set of “physical” VLANs each having its own VLAN designation. For each physical VLAN, a different loop-free topology is defined, although only one physical VLAN is “active” at any given time. Messages associated with the logical VLAN are tagged with the designation of the currently active physical VLAN, and forwarded along its loop-free topology. Upon detecting a failure in the loop-free topology, the logical VLAN is rapidly switched to the loop-free topology defined by a second, back-up physical VLAN. Following the switch, messages associated with the logical VLAN are tagged with the designation of this back-up VLAN and are forwarded along its loop-free topology.

Abstract: Mobile routers establish a tree-based network topology in an ad hoc mobile network, the tree-based network topology having a single clusterhead and attached mobile routers. Each attached mobile router has a default egress interface configured for sending messages toward the clusterhead, and ingress interfaces configured for receiving messages from attached network nodes that are away from the clusterhead. A neighbor advertisement message received from an ingress interface away from a clusterhead is used by the attached mobile router to identify specified network prefixes that are reachable via the source of the neighbor advertisement message. The attached mobile router outputs on its default upstream interface a second neighbor advertisement message that specifies the network prefix used by the attached mobile router, and the specified network prefixes from the neighbor advertisement message received on the ingress interface. Hence, connectivity is established with minimal routing overhead.

Abstract: Shared sub-structures are found within a collection of multiple hierarchies. A label is associated with each node in the collection of hierarchies, and an inverted index mapping node labels to lists of hierarchies is created. Each pair of hierarchies in each hierarchy list is iterated over in a certain order, and a shared substructure is found between a pair of hierarchies using the node labels. When more than one shared substructure is found, the substructures are merged into a shared subtree.

Abstract: A technique for organizing a plurality of computers such that message broadcast, content searching, and computer identification of the entire collection or a subset of the entire collection may be performed quickly without the use of a controlling computer. The technique describes the creation, operation, and maintenance of a connection scheme by which each computer in the collection appears to be the top level of a hierarchical array. The maintenance of this hierarchical connection scheme allows one to many communications throughout the collection of computers to scale geometrically rather than linearly.

Abstract: A method and apparatus for performing an incremental update of a lookup table while the lookup table is available for searching is presented. To add or delete a route, a second set of routes is stored in a second memory space in the lookup table, while access is provided to the first set of routes stored in a first memory space in the lookup table. Access is provided to the first memory space through a first pointer stored in a subtree entry. After storing the second set of routes in the second memory space, access is switched to the first set of routes in the first memory space by replacing the first pointer stored in the subtree entry with a second pointer to the second memory space.

Abstract: Each mobile ad hoc node has an assigned hierarchy position within an identified tree-based aggregation group. Each ad hoc node is configured for selectively attaching to one of a plurality of available ad hoc nodes based on identifying a best match, for the assigned hierarchy position within the identified aggregation group, from among identifiable hierarchy positions of identifiable aggregation groups. Each ad hoc node also is configured for selectively attaching to any available ad hoc node based on a determined absence of any available ad hoc node advertising the identified aggregation group of the ad hoc node, or an aggregation group containing the identified aggregation group. Hence, a root node of an aggregation group can filter group-specific routing information from packets destined toward a network clusterhead, resulting in a scalable routing protocol that is not adversely affected by added nodes.

Abstract: Disclosed is a method and apparatus for filtering received data packets. A hierarchical tree is maintained. The tree includes nodes organized in a plurality of levels. Each level above a root node of the tree has one or more of the nodes, with each of the one or more of the nodes corresponding to a particular value of a segment of an Internet Protocol (IP) address. The segment is the same for each node of a particular level of the tree. Each node at a particular level of the tree stores a number representative of the number of received packets having the same value for the segment of the IP address associated with the particular level. Some of the received data packets are filtered out based on the hierarchical tree.

Abstract: Priority propagation is achieved in the context of a rate-based scheduling hierarchy. Priority traffic is not delayed by non-priority traffic by more than the duration required for transmission of the maximum packet length at the physical interface speed. Multiple sibling priority levels are supported. To achieve these objectives, the scheduling hierarchy tree is divided into sub-trees corresponding to non-priority traffic and the different levels of priority. At each scheduling decision, a packet is selected from the highest priority non-empty sub-tree. Scheduling decisions within each sub-tree exploit the usual rate-based scheduling method but without priority propagation. When a packet from a priority sub-tree is chosen, scheduling state in the non-priority sub-tree is updated.

Abstract: A small cost-effective crossbar switch is provided. A switch circuit is disposed in each of a plurality of nodes which are cascade connected with each other in a plurality of stages. Each switch circuit receives from a node of a previous stage a designated address to specify directly or indirectly the relative position in which a target switch circuit is present, determines whether the designated address represents a specific value “0”. When it is determined that the specific value is represented, each switch circuit allows data output to a node-out line, decrements the received designated address by “1” to generate a new designated address, and supplies this new designated address to a node of the subsequent stage.

Abstract: A routing method is used to establish a data transfer path between a source node and a destination node in wireless networks having a tree structure. If a relay node relaying a data transfer receives data to be forwarded from a source node to a destination node, the routing table is searched to check whether the routing table stores information on a path to the destination node, and the received data is forwarded along a corresponding path if the path information to the destination node exists. However, if the information on a path to the destination node does not exist in the routing table, the routing table is searched to check whether the routing table stores information on a path to a parent node of the destination node, and; if the path information exists, the received data is forwarded along the path to the parent node.

Abstract: The invention provides a GeoIP resolving system (GIRS) which is able to resolve between the IP addresses and the geographic location of servers/hosts/access ports in a wide area network, in particular the internet. GIRS servers are provided which contain resolution tables indicating the correlation between IP addresses and geographic positions of servers/hosts/access ports. The GIRS system can be accessed by indicating a certain geographic area wherein the GIRS system responds by listing all IP addresses of servers/hosts/access ports located in the indicated geographic area. In addition, the service types provided or requested by the found servers/hosts/access ports may be listed. The GIRS system can also be accessed by specifying an IP address. The GIRS system then responds by issuing the geographic coordinates of the location of the host having the indicated IP address and, maybe, the associated service, policy server, as well as administrated area.

Abstract: A system and method for supporting multicast in highly dynamic wireless multi-hop networks, such as ad-hoc networks, with good scalability. The system and method provide a multicast routing algorithm to work in wireless ad-hoc networks without any fixed infrastructure nodes present. In doing so, the system and method provide a technique to build a multicast source specific tree on demand, while using a core source node to limit routing overhead. The system and method further provide a repair process to reduce the latency of discovery of topology change, employ a node sequence number mechanism to differentiate between upstream nodes and downstream nodes on the multicast tree in the repair process, and provide an active joining process to reduce the latency of discovery of membership change.

Abstract: The number of nodes in a private network-to-network interface may be very large. These nodes can be organized in two or more hierarchical levels. Network performance parameters, for example, call set-up time, may be used to determine the optimum number of hierarchical levels for a given PNNI network. A multi-step algorithm is presented for calculating the optimum number of levels in the network for a given number of nodes.

Abstract: Methods and systems for distributing messages of a ring-topology-based link level communications protocol over a star-topology using a star-topology-based link level communications protocol are disclosed. According to one method, when a packet of the ring-topology-based link level communications protocol is received, it is determined whether the packet is to be sent to a number of destinations and returned to a sender. If the packet is intended for distribution to a number of destinations and return to the sender, the packet is encapsulated in a frame of the star-topology-based link level communications protocol, the destination address in the frame is set to a next destination address in a virtual ring topology, the frame is forwarded to a switch. The switch forwards the packet to the next destination in the virtual ring based on the input port and the destination address of the star-topology-based link level communications protocol.

Abstract: A method and system for compressing a tree with a plurality of nodes that each may be associated with a node identifier and a parent node identifier. The method may comprise for each node in the tree determining whether the current node is to be deleted, If the current node is to be deleted updating a list of deleted nodes such that the node identifier of the current node may be stored; a parameter representing a number of nodes currently having been deleted from the tree may be stored, such that the parameter is associated with the node identifier of the current node, and updating the node identifier and the parent node identifier of the current node as a function of the list of deleted nodes. Each node in the tree is visited only once.

Abstract: A node structure of a multiway search tree can accelerates a search speed by making a key, a key pointer and a node pointer coincident with the size of a cache line through the use of only one pointer written on a node regardless of the number of keys used in the node and, thereafter, reduce the main memory capacity, a search method using the node structure and a computer readable recording medium in which a program implementing the search method is recorded. The method for generating nodes of a multiway search tree includes the steps of: a) assigning at least one key to each of the nodes; and b) assigning pointer information so that related information written on the node is accommodated in a cache line regardless a number of keys.

Abstract: A method and system for creating a peer-to-peer overlay network. The method includes discovering a set of node characteristics for each of a subset of existing nodes of a network. The method also includes scaling each of the discovered set of node characteristics to a value which is within a predetermined range of values. The method also includes generating a set of weighted values for each of the subset of nodes by applying a weighting function to each of the scaled values. In addition, the method includes generating a node rank value for each of the subset of nodes by summing the weighted values of each respective set of weighted values. Further, the method includes determining whether to connect to any of the subset of nodes based upon the node rank value.

Abstract: Disclosed herein are systems and methods for communicating a number of data flows on a single communications channel. In one embodiment, a method of communicating a number of data flows on a shared communications channel includes the acts of (1) calculating a set of optimum goodput rates for the data flows, in order to maximize a total utility of the data flows, (2) calculating a set of optimum throughput rates for the data flows based on the optimum goodput rates, and (3) transmitting the data flows on the shared communications channel with the optimized throughput rates. Optimization is preferably done using utility functions that indicate the utility of the data flows as a function of their goodput rates. The method can additionally block temporarily a transport layer of at least one of the data flows if the transport layer of that data flow is bottlenecked.

Abstract: A computer-implemented method for organizing data in a two-topology configuration is disclosed. The method includes providing a plurality of nodes, each node including data relating to a corresponding object state, and linking each of at least one of the plurality of nodes to one or more associated sub-nodes that each include data relating to one of a plurality of modifiable parameters representative of changes to the corresponding object state data such that all sub-nodes relating to a particular modifiable parameter of the corresponding object state data are arranged along a corresponding single branch of linked sub-nodes extending from the associated node.

Abstract: One embodiment of the present invention includes a computer operable to represent a physical system with a graphical data structure corresponding to a matroid. The graphical data structure corresponds to a number of vertices and a number of edges that each correspond to two of the vertices. The computer is further operable to define a closed pathway arrangement with the graphical data structure and identify each different one of a number of fundamental cycles by evaluating a different respective one of the edges with a spanning tree representation. The fundamental cycles each include three or more of the vertices.

Abstract: Methods and apparatus for bridging network protocols are disclosed. A protocol bridge may be used to function as a target for a network processor while performing a target mode operation, while functioning as an initiator on behalf of the network processor while performing an initiator mode operation. In one embodiment, the protocol bridge determines the mode of operation based on information in a received frame's header. In another embodiment, the protocol bridge couples a Fibre Channel device to a storage processor on a packet-over-SONET network.

Abstract: A packet forwarding apparatus comprises a plurality of line interfaces each for communicating with one of user terminals or one of redundant gateways, and a protocol processing unit for controlling packet forwarding among the line interfaces. The protocol processing unit forwards a connection initiation request packet received from a user terminal to the plurality of redundant gateways and forwards to the user terminal only one response packet which is selected according to connection load status information of each gateway stored in a load distribution management table from among a plurality of response packets received from the gateways within a predetermined period of time.

Abstract: In a method embodiment, a method for networking a computer cluster system includes communicatively coupling a plurality of network nodes of respective ones of a plurality of sub-arrays, each network node operable to route, send, and receive messages. The method also includes communicatively coupling at least two of the plurality of sub-arrays through at least one core switch.

Abstract: A method for providing a QoS-guaranteeing multi-path and a method for providing disjoint paths using the same are provided. The method configures the shortest path tree by adapting the start node “s” and the destination node “d”. When a new node is selected as a tree node in a tree configuration process according to the “s” or the “d”, the closest node to either the “s” or the “d” is selected. If a specified node “v” is contained in both a tree oriented from the “s” and another tree oriented from the “d”, one path of “s”-“v”-“d” is created. If all nodes are contained in either the tree of “s” or the other tree of “d”, then a program of path creation process is terminated. Further, the method further includes a step for determining two disjoint paths from the “s” to the “d” among the found multiple paths above.

Abstract: Mobile routers in a tree-based network topology with a single clusterhead in an ad hoc network establish connectivity based on each attached mobile router sending a neighbor advertisement message to an attachment mobile router via a corresponding egress interface. Any neighbor advertisement message received by a mobile router is used to identify specified network prefixes that are reachable via the source of the neighbor advertisement message. Each attached mobile router outputs to its attachment router another neighbor advertisement message that specifies the network prefix used by the mobile router, and the specified network prefixes from its attached mobile routers. The mobile router also identifies peer mobile routers having the same depth, and selectively shares limited routing information with the peer routers, enabling the mobile router to bypass the clusterhead and reach remote prefixes via the peer routers without burdening the tree.

Abstract: A tool for static or dynamic planning of a WDM network with dedicated protection. The WDM network is represented by a layered graph having image nodes for each node of the network and horizontal arcs for each link of the network, so as to replicate in each layer the topology of the network. A Bhandari algorithm is adapted for finding on the layered graph a working-spare pair of lightpaths for each connection request to be allocated.

Abstract: Described are a method and a device for efficiently switching multicast data flows from a shared distribution tree to a shortest path distribution tree. The method achieves an efficient and scalable tree switch that reduces the latency of multicast data transmitted from the source to receivers. A determination is made for each source group (S,G) entry in a portion of a forwarding plane database of a router as to whether a byte count for that entry exceeds a threshold value. A message sent from the forwarding plane to the router control plane indicates the (S,G) entries determined to have byte counts exceeding the respective threshold values. For each message entry, the respective shared distribution tree is switched to a shortest path distribution tree. The method achieves a substantial reduction in the number of inter-process messages exchanged between the control plane and the forwarding plane compared to conventional tree switchover techniques.

Abstract: The invention concerns a method whereby each module is determined from the address of the module located immediately upstream in the networked relative to the central unit, the detected address being transmitted by the upstream module in an attribution message, which triggers off an automatic search phase for the module without address, nearest downstream to a module with an address, during which each downstream module without address receives (50) the address attribution message, triggers (52) a delay whereof the duration is so much longer if the received message reception is low, and if at the end (54) of the delay, no address capture message is detected (53), it transmits (56) such a message, stores (57) the received address, determines the address of the nearest downstream module without address, and triggers (30) the search phase for the nearest downstream module without address.

Abstract: Systems and methods for preemption of Traffic Engineering LSPs such that preemption decisions are made in a coordinated fashion along the path of a new LSP and computation of a new path for a preempted LSP can take advantage of knowledge of newly unavailable links. The efficiency of the preemption mechanism is greatly increased and the undesirable effects of heterogeneous preemption decisions are limited. The amount of signaling may also be significantly reduced. In one implementation, these advantages are achieved by exploiting an upstream preemption feedback mechanism that uses an incremental timer to delay preemption decisions until feedback is available.

Abstract: The present invention is to provide a processing method enabling each unit in a stacking network device to utilize the functions and the Port Role Selection procedure updtRolesBridge( ) provided by the RSTP to rapidly select the port having the best priority from the stacking network device for executing STP and the relating algorithm in order to effectively reduce the working burden of the master unit through uniformly distributing the work to the slave units, which not only greatly increase the network transmission efficiency of the stacking network system, but also greatly improve the quality and speed of the network information transmission.

Abstract: In a DBA (Dynamic Bandwidth Allocation) method for an E-PON including an OLT and ONUs, DBACNs (DBA Control Nodes) corresponding to processes in a tree algorithm are arranged in multi-level stages with the ONUs being in the lowermost stage. DBACNs or ONUs in a specific stage are connected to a DBACN from its immediately higher stage in a tree structure. A process of allowing a DBACN to collect bandwidth request information from DBACNs or ONUs in its immediately lower stage is performed sequentially from the lowermost DBACNs to the uppermost DBACN. The uppermost DBACN allocates the smaller one of a total available allocation-bandwidth and a total requested bandwidth to DBACNs in its immediately lower stage in their priority order. DBACNs, other than the uppermost DBACN, each allocate a bandwidth allocated down from a DBACN in the immediately higher stage to DBACNs or ONUs in the immediately lower stage in their priority order.

Abstract: An ad-hoc low rate-wireless personal area network (LR-WPAN) includes an ad-hoc network coordinator having a first processor, a first memory, and a first communication interface; and a plurality of ad-hoc network devices. Each of the devices includes a second processor, a second memory, and a second communication interface for communication with the first communication interface of the coordinator or with the second communication interface of another one of the devices. A simple, low-cost, incremental source routing is employed. The first memory stores complete communication routes for messages from the coordinator through at least one of the devices to other devices. The second memory of each of the devices stores an identification of another device to forward a message from the second communication interface of a corresponding one of the devices toward the coordinator's first communication interface and through the second communication interface of that other device.

Abstract: Methods and apparatus are disclosed for generating and using an enhanced tree bitmap data structure in determining a longest prefix match, such as in a router, packet switching system. One implementation organizes the tree bitmap to minimize the number of internal nodes that must be accessed during a lookup operation. A pointer is included in each of the trie or search nodes to the best match so far entry in the leaf or results array which allows direct access to this result without having to parse a corresponding internal node. Moreover, one implementation stores the internal node for a particular level as a first element in its child array. Additionally, one implementation uses a general purpose lookup engine that can traverse multiple tree bitmaps or other data structures simultaneously, and perform complete searches, partial searches, and resume partial searches such as after receiving additional data on which to search.

Abstract: A set of globally-reachable attachment registers is provided for interconnected communications networks and hosts. At least some of the networks and hosts each has a corresponding attachment register. The attachment registers are not located with their respective network or host. Information is stored in the attachment registers that establishes one or more logical links between the attachment registers. The information in certain ones of the attachment registers is used to perform one or more network communication functions. Non-limiting example functions include location registration and update, name to global locator resolution, routing, multi-homing, dynamic ISP selection, and handover.

Abstract: One embodiment of the present invention provides a system that facilitates performing a fast address lookup within a packet forwarder to determine where to forward a packet. Upon receiving the packet at an input link of the packet forwarder, the system reads a destination address from the packet. The system uses this destination address to lookup a corresponding entry in a forwarding table that is organized as a multi-bit trie. If the corresponding entry does not identify the output link for the packet, the system backtracks through the multi-bit trie to locate an entry with a prefix that matches the destination address and that identifies the output link for the packet. Finally, the system forwards the packet to the identified output link.

Abstract: In one embodiment, a tree-topology building method for a wireless mesh network includes using a centralized parent selection process to select a parent and join offer messages to a selected child of the selected parent.

Abstract: Methods and arrangements for monitoring at least one interconnection between at least two nodes in a distributed network. At least one subscriber node is prompted to ascertain the integrity of an interconnection with at least one parent node.

Abstract: One embodiment of the present invention provides a system for generating an interconnection network. During operation, the system associates an n-bit binary identifier with each node in the interconnection network. The system also groups the n bits of each binary identifier into h overlapping sets a1, a2, . . . ah, wherein the sets a1, a2, . . . ah cover all of the n bits. For each set ai, the system forms fully connected clusters of nodes by creating a direct point-to-point link between any two nodes that have binary identifiers that differ in bits of the set a1 but are the same in other bit positions. Note that by varying the amount of overlap and the pattern of overlap between the overlapping sets, a1, a2, . . . ah, the interconnection network can be configured to accommodate different redundancy requirements.

Abstract: The present invention provides a communication network comprising a host network, a plurality of base stations, at least a mobile host capable of establishing links to the base stations, and a hierarchy-network of plural routers which are improved in transferring performances for ensuring continuous operations with a reduced load without packet loss.

Abstract: A network cluster is provided herein having a plurality of cluster members. One member of the cluster (i.e., the “reservation coordinator”) is responsible for controlling the distribution of rate capacity across members of the cluster. In general, rate capacity may be distributed in a hierarchical fashion to account for the needs of the various services, applications and/or operations provided by the cluster members. More specifically, a hierarchical tree structure may be formed by distributing rate capacity among a plurality of nodes arranged at a global, service, application or operation level of the tree. In some cases, rate capacity may also be distributed at a requester level to account for the needs of requesters (i.e., users) who are granted access to the services, applications and operations provided by the cluster members. A method for distributing rate limits across members of a cluster and a method for tracking rate consumption for at least one member of a cluster are also provided herein.

Abstract: A method is disclosed for determining and communicating the existence of a hybrid bus. The method comprises the acts of determining whether the node has a connection to a Legacy link layer; if the node determines that it has a connection to a Legacy link layer, then transmitting a Self-ID packet without a Speed Code; and if the node determines that it does not have a connection to a Legacy link layer, then transmitting a Self-ID packet without a Speed Code.

Abstract: A computer-implemented method for filtering, responsive to a logical specification of a network farm and a communication model for the farm, a tree topology network specification to obtain a filtered tree topology network specification is disclosed. The filtered tree topology network specification has fewer devices therein relative to the tree topology network specification, devices needed for constructing the farm being available in the filtered tree topology network specification. The method includes removing a first set of devices and a first set of switching elements from the tree topology network specification starting at the lowest level of the tree topology network specification and working toward the root node of the tree topology network specification. Each device in the first set of devices represents one of a redundant device, a device having a type unneeded by the farm, and a device unavailable for constructing the farm.

Abstract: Methods and apparatus for creating a network farm from a tree topology network are disclosed. One method includes receiving a logical specification of the farm, the logical specification specifying at least one of device types required by the farm and a number of devices for each of the device types. The method further includes receiving a communication model for the farm, the communication model specifying expected bandwidth usage for devices of the farm. The method additionally includes ascertaining, responsive to the logical specification and the communication model, a solution set of devices among devices of the tree topology network for constructing the farm.