Abstract: Disclosed herewith is a composite type computer system that can assure that a PCI tree to be allocated to a computer is configured completely before the computer is powered. The composite type computer system includes a PCI switch that connects plural computers through PCI interfaces; plural PCI devices connected to the PCI switch; a system controller that controls the computers; and a PCI manager that controls allocation of the PCI devices to the computers.

Abstract: A system for providing resilient multimedia broadcasting services over a VPLS network is described. A Network Management System (NMS) calculates disjoint minimum cost trees using the Steiner algorithm, executed with extra steps to result in disjoint trees. Destination PE routers in the VPLS network are connected to the disjoint trees so that they can be serviced by either tree in case of a fault. Each of the disjoint trees is provisioned with enough bandwidth to carry all of the services provided by the VPLS network. Under normal operation, however, the services are distributed evenly over the trees. In the event of a fault, the services on a faulty tree are switched to another tree using split horizon bridging. Each Steiner tree can also be realized using point-to-multipoint LSPs which is fully protected by a precomputed point-to-multipoint LSP.

Abstract: In a communication system including an external maintenance terminal and a communication device in which boards including a maintenance-and-operation board and a switchboard are installed, the switchboard is directly connected to the external maintenance terminal, and a predetermined address is assigned for use only in communication between the maintenance-and-operation board and the external maintenance terminal, and set in the switchboard. When communication is performed between ones of the boards, the switchboard connects the ones of the boards on the basis of the local addresses of the ones of the boards. When communication is performed between the maintenance-and-operation board and the external maintenance terminal, the switchboard connects the maintenance-and-operation board to the external maintenance terminal, and translates a global address of the external maintenance terminal into the predetermined address and vice versa.

Abstract: A method and apparatus for determining information associated with a particular multicast channel in a multicast network are disclosed. In accordance with the method, a request message requesting information associated with the particular multicast channel is generated and sent to the multicast network. Further, the request message is propagated downstream in a recursive manner via a multicast topology of the multicast network. A response to the request message is propagated upstream via the multicast topology to generate a response message including requested information associated with the particular multicast channel. The information may comprise number of users receiving the particular multicast channel.

Abstract: A multicast architecture and method of operation for multi-hop wireless mesh networks is provided. The multicast architecture is above the network infrastructure to identify a group of clients. These clients share the same application and communicate to each other by using a common multicast address.

Abstract: Ethernet provider backbone transport (PBT) paths are controlled utilizing Generalized Multi-protocol Label Switching (GMPLS) signaling protocol. A path between edge nodes is identified by a combination of a VID and destination MAC address in a VID/MAC tuple populated in the forwarding tables of intermediary nodes. To establish the PBT path, a path calculation is performed from the originator node to the terminator node through the network. The originating node then sends a GMPLS label object with a suggested VID/MAC to identify the path to the terminator. The intermediary nodes or bridges forward the object to the terminating node. The terminating node then offers a VID/MAC tuple in a GMPLS label object in response. When the intermediary nodes forward the response from the terminating node to the originator, the appropriate forwarding labels are then installed in the forwarding tables of each node utilizing the associated VID/MAC tuples.

Abstract: A system and method for routing packets in a multihopping wireless communication network (100). The system and method selects a node (106-1) of the wireless network (100) to operate as an aggregation point, at which two or more possible routes for transmitting packets or packet fragments from a source mobile node (102-1) to a destination mobile node (102-2) meet. A primary route is selected based on historical quality of one or more links between nodes (102, 106, 107), and one or more secondary routes are selected based on the success rate of packets reaching the aggregation point.

Abstract: A routing device and associated method for allocating the nodes of a multi-way trie of a forwarding routing table between two or more memory devices is disclosed. In the preferred embodiment, the routing device comprises a routing table for storing a plurality of routes in a multiway trie in a first memory for caching a first set of the plurality of trie nodes and a second memory for caching a second set of the plurality of trie nodes; and a route manager adapted to relocate one or more nodes of the second set from the second memory to the first memory such that the a utilization count for each of the nodes of the first memory is higher than each of the nodes of the second memory.

Abstract: A system and method provide for reducing a number of topology instances in a network portion implementing a multiple instance topology. Various embodiments further provide for determining if one or more of the topology instances are merge-able or conditionally merge-able to form a lesser number of representative topology instances, and if so, for causing merging of the topology instances.

Abstract: The present invention makes improvements in a mobile communication system that performs a communication via a communication network provided in a mobile body to execute a data transfer. The present system comprises a plurality of nodes, a path control device which receives data from the nodes respectively, selects a path for the data transfer on the communication network, and outputs the data, first optical fibers which connect each of the nodes and the path control device and transfer the data, and second optical fibers provided in parallel with the first optical fibers. In the present system, the path control device communicates with the node via the second optical fiber when a failure occurs in the first optical fiber.

Abstract: Locating hardware faults in a parallel computer, including defining within a tree network of the parallel computer two or more sets of non-overlapping test levels of compute nodes of the network that together include all the data communications links of the network, each non-overlapping test level comprising two or more adjacent tiers of the tree; defining test cells within each non-overlapping test level, each test cell comprising a subtree of the tree including a subtree root compute node and all descendant compute nodes of the subtree root compute node within a non-overlapping test level; performing, separately on each set of non-overlapping test levels, an uplink test on all test cells in a set of non-overlapping test levels; and performing, separately from the uplink tests and separately on each set of non-overlapping test levels, a downlink test on all test cells in a set of non-overlapping test levels.

Abstract: Peer-to-peer communications sessions involve the transmission of one or more data streams from a source to a set of receivers that may redistribute portions of the data stream via a set of routing trees. Achieving a comparatively high, sustainable data rate throughput of the data stream(s) may be difficult due to the large number of available routing trees, as well as pertinent variations in the nature of the communications session (e.g., upload communications caps, network link caps, the presence or absence of helpers, and the full or partial interconnectedness of the network.) The selection of routing trees may be facilitated through the representation of the node set according to a linear programming model, such as a primal model or a linear programming dual model, and iterative processes for applying such models and identifying low-cost routing trees during an iteration.

Abstract: A method of operating an Internet protocol (IP) address that effectively allocates, creates, and processes an interface identifier (ID) of an IP address area, and a subnet system using the same are provided. Allocation is done such that in the IP address area including a subnet prefix area and an Interface ID area, certain bits of the Interface ID area are used as an index area of a subnet gateway. In this case, the allocation is implemented in order from the higher layer to the lower layer so that the Interface ID area is sequentially allocated from the higher bits thereof for the index areas of the respective layers. The combination of the certain bits of the allocated Interface ID and the subnet prefix area of the IP address area is used as the subnet ID of the respective subnet layers. The lowest subnet gateway allocates the Interface ID to terminating equipment trying to access to the IP network based on a format of the IP address.

Abstract: An information management system for a device network is disclosed. The information management system may include a service requester node, a monitoring node, and a service provider node. The system may include a service oriented request message including a message header, having a list of destination nodes, including the service provider node, to which the service oriented request message is addressed, and a service request. The system may include a routing module disposed in the monitoring node and configured to analyze the list of destination nodes in the message, create a modified message including at least one child node selected from the service provider nodes based on a fan-out of the device network, and forward the modified message to the at least one child node, the modified message including a message header, having an updated list of one or more destination nodes, including the service provider nodes, to which the modified message is addressed, and the service request.

Abstract: Classification of network data packets includes a determination sets of one or more filter-identifiers where each set is associated with a respective data-packet classifier field. A result-set of filter-identifiers may be derived based on an intersection of the filter-identifier sets.

Abstract: Method and system for broadcasting live data over a network are described. In one embodiment, live data is accessed. Next, a first client is authenticated. The live data is then broadcast to a first client, wherein the first client is capable of buffering and re-transmitting the live data. Next, a second client is authenticated. A list of clients receiving the live data is then sent to the second client. The second client then selects the first client from the list, contacts the first client, and then receives the live data from the first client.

Abstract: A technique treats a protected forwarding adjacency (FA) as a dynamic entity in that it allows a backup tunnel associated with the FA to carry traffic for the FA, when it's primary tunnel has failed, up to a predetermined amount of time. If after the predetermined amount of time has elapsed and the FA has not recovered (e.g., the primary tunnel has not been reestablished), a network topology change is automatically triggered causing the network to converge on a new network topology. By triggering the network topology change, a path that is more optimal than the path associated with the backup tunnel may be subsequently determined to carry the traffic.

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: Prefix searches for directing internet data packets are performed in a prefix search integrated circuit. The integrated circuit includes an array of search engines, each of which accesses a prefix search tree data structure to process a prefix search. An SDRAM is dedicated to each search engine, and SDRAMs share address and control pins to plural search engines on the IC chip. Internal nodes of the tree data structure are duplicated across banks of the SDRAMs to increase bandwidth, and leaf nodes are stored across the SDRAM banks to reduce storage requirements. Within each search engine, data stored in a data register from an SDRAM is compared to a prefix search key stored in a key register. Based on that comparison, an address is calculated to access further tree structure data from the SDRAM. Packet descriptors containing search keys are forwarded to the search engines from an input queue and the search results are forwarded to an output queue, the same packet order being maintained in the two queues.

Abstract: It is the object of the present invention to provide a processing apparatus, a tree-type network system, processing program and recording method that are capable of performing requests to a higher-order apparatus at the same time, while reducing the load that is concentrated in the communication path upstream in the network. One node apparatus which is provided with tree-type network system including broadcasting apparatus sending inquiry information as request-reception-begin data etc. for requesting sending response message as select-node information etc.

Abstract: Described are techniques for performing indication forwarding. At an indication consolidator, a request is received from a client to receive indications about a plurality of nodes in accordance with first filter information. A communication structure for forwarding indications is determined. Subscription requests including said first filter information are forwarded from said indication consolidator to others of said plurality of nodes to establish communication connections between said plurality of nodes in accordance with said communication structure. Indications fired from any of said plurality of nodes in accordance with said first filter information are forwarded to said indication consolidator node in accordance with said communication structure. The client is notified of any indications received at said indication consolidator node in accordance with said first filter information.

Abstract: A distribution system is provided, which is capable of distributing content more stably as compared with the case where connection is newly changed after distribution of content is stopped. In a distribution system in which a plurality of nodes are connected in a hierarchical tree shape and content is distributed to any of the nodes, a content distribution state is detected, and a quality parameter (which is controlled by a connection destination introducing server) indicative of a criterion to determine whether the state deteriorates or not is stored in a node. When distribution is continued, and the state of the distribution becomes worse than the criterion, an upstream node introduction request message is transmitted to a connection destination introducing server and, according to a reply to the message, connection is changed.

Abstract: Methods, apparatuses and systems directed to enhancing the interoperability of network devices with static native virtual LAN (VLAN) configurations with other network devices where the native VLAN is a configurable parameter. In some implementations, the network devices having configurable native VLANs conditionally add VLAN tags to common Spanning Tree Protocol (STP) Bridge Protocol Data Units (BPDUs) transmitted to network devices where the native VLAN is static and strip any VLAN tags from the common STP BPDUs that are received.

Abstract: In one embodiment, a method for setting up a flow-through mesh group (FTMG) for transmitting link-state packets (LSPs) in a network having a plurality of nodes interconnected by links. The FTMG is a combination of multiple spanning trees for the network through which LSPs are forwarded. FTMG set-up messages are received at ports of each node of the network from peer ports of linked nodes. FTMG set-up messages identify root nodes of the multiple spanning trees and the transmission modes of the peer ports. The FTMG set-up messages are used to determine (1) a root node for each spanning tree, (2) a root port on each node for each spanning tree, and (3) directionality of ports of the nodes. FTMG set-up messages are then used to determine the transmission mode of ports of the nodes and, subsequently, to update the spanning trees and transmission modes, as needed.

Abstract: A mobile router is configured for attaching to a selected router in a clustered network (e.g., a mobile ad hoc network) based on identifying a network topology model of the clustered network from received router advertisement messages that include tree information option fields specifying attributes of the network topology model. The mobile router selects which router advertisement originator to attach to based on correlating the attributes of the router advertisement originators relative to identified priorities, and orders the router advertisement originators within a default router list based on the identified priorities. If the mobile router detects a router from a second clustered network, the mobile router advertises to the attachment router that the second clustered network is reachable, enabling the two clustered networks to communicate using a point-to-point link between the respective attachment routers.

Abstract: A hierarchical packet scheduler using hole-filling and multiple packet buffering. Packet references are enqueued into a hierarchical packet scheduler, wherein the hierarchical packet scheduler includes one or more levels, each level including one or more schedulers being served by one or more threads, wherein the number of threads serving a particular level is not dependent on the number of schedulers on the particular level. Packet references are dequeued from the hierarchical packet scheduler at a root level scheduler of the one or more schedulers.

Abstract: Disclosed are, inter alia, methods, apparatus, computer-storage media, mechanisms, and means associated with determining and distributing routing paths for nodes in a network. For each route computational node of multiple route computational nodes in a network: a tree of paths between itself and each of multiple nodes in the network is determined. A particular tree of paths is determined for a particular node of these multiple nodes to the other nodes based on at least two of the determined trees of paths for the route computational nodes. The particular node then sends a packet towards a destination based on the particular tree of paths determined for the particular node.

Abstract: A method and apparatus resynchronizes a link state database (LSDB) of a non-stop forwarding (NSF) router with the LSDB of a neighboring router (“neighbor”) while maintaining an existing adjacency with the neighbor in a computer network. An out-of-band resynchronization process executes on the routers to essentially maintain the existing adjacency between the router and neighbor, rather than resetting that adjacency as defined by a conventional resynchronization approach. By keeping the adjacency “up” from the perspective of a routing protocol, such as the Open Shortest Path First routing protocol, the adjacency can be used for continued data traffic to and from the NSF router.

Abstract: A logical distributed server is generated for managing (Internet Protocol (IP) address allocation for an ad-hoc, self-forming peer-to-peer (P2P) network. The logical distributed server is generated according to messaging scheme where nodes on the P2P network allocate addresses for themselves and for clients connected to them. Each node implements a server that listens on the incoming client connections. Each node maintains data structures that represent the current state of an address database. Routing requests are fielded by the nodes from the clients and the messaging scheme is used to inform other nodes of its action so a consistent address space is maintained between all the nodes on the P2P network.

Abstract: To transmit signaling, a base station obtains signaling for a group of channels used for data transmission and selected from a set of channels having constraints on usage. The base station compresses the signaling based on the channel constraints and obtains at least one message. If multiple messages are to be sent, then the assigned channels are partitioned into multiple subgroups, and the signaling for the channels in each subgroup is compressed to obtain a message for that subgroup. Each message is encoded at a spectral efficiency and transmitted at a power level selected for the message. A Cyclic Redundancy Check (CRC) value is appended to the message(s) for error detection. To receive the signaling, a terminal checks a received message with the appended CRC, decodes the message if the CRC passes, decompresses the decoded message based on the channel constraints, and extracts the signaling for an assigned channel.

Abstract: A lookup table for searching for a longest prefix match for a key is disclosed. The lookup table provides a match for a key in a single search cycle. The number of matches stored in the lookup table is maximized by storing each match in only one location in the lookup table. The binary tree is divided into a plurality of levels and each level has a plurality of subtrees. A subtree descriptor stored for a subtree includes a field for each node in the subtree. The state of the field indicates whether an entry for the node is stored in the table. The bit vector allows indexing of the single match stored for the key.

Abstract: A compatible method for multiple spanning tree protocols. A verification module is provided between a standard multiple spanning tree (MST) module and a LLC layer and Ethernet driver module. The verification module executes a reception verification procedure and a transmission verification procedure. The verification module, the standard MST module, and the LLC layer and Ethernet driver module are established in a switch. A bridge protocol data unit (BPDU) is received by the verification module. If the BPDU comes from the LLC layer and Ethernet driver module, the verification procedure is executed for the received BPDU. If the BPDU comes from the standard MST module, the transmission verification procedure is executed for the BPDU.

Abstract: A route convergence monitoring system and method provide for determining routing changes or affected devices that may cause detrimental or other quality conditions to occur in an endpoint device. In one embodiment, ongoing endpoint quality monitoring of quality conditions and convergence occurrence monitoring of successive route changes that may occur are initiated. An endpoint quality monitor provides for determining an endpoint quality condition and transferring an indicator of the condition (e.g., endpoint device and timing) to a network manager. The network manager may add one or more information indicators and provides the indicators to an end-to-end convergence monitor. The convergence monitor, receives the indicators and determines one or more of a second endpoint device, routing changes in at least a portion of the network and a correlation of routing changes that may have caused the indicated or other quality conditions to occur.

Abstract: Distribution of content between publishers and consumers is accomplished using an overlay network that may make use of XML language to facilitate content identification. The overlay network includes a plurality of routers that may be in communication with each other and the publishers and consumers on the Internet. Content and queries are identified by content descriptors that are routed from the originator to a nearest router in the overlay network. The nearest router, for each unique content descriptor, generates a hash identification of the content descriptor which is used by remaining routers in the overlay network to provide the appropriate functions with respect to the content descriptor. In particular, this allows all routers in the overlay network except the nearest router to properly route content without processing every content descriptor.

Abstract: A network topology links nodes with Cartesian and diagonal links. The diagonal links may be uniformly-extending iso-delta diagonal links of different lengths. The network topology may be used to provide data communication between processors or groups of processors in a high-performance computer system.

Abstract: A spanning tree creation unit creates a plurality of spanning trees based on the network topology, and registers the spanning trees to a spanning tree information table. A spanning tree selection unit selects a spanning tree wherein communication resources will be used most effectively, out of the plurality of spanning trees registered to the spanning tree information table. A node setup unit sets the mapping information which expresses correspondence between the requested virtual LAN and the selected spanning tree in each node.

Abstract: A small world infrastructure (SWI) of a general packet communications network and a method of determining, establishing and maintaining a hierarchical forwarding path (HFP) interconnecting communications units (CUs) of the small world infrastructure. The SWI includes a domain that has a given communication unit CU as a message packet source, a plurality of associated communications units each in direct contact with the given CU, and a plurality of HFPs each providing the direct contact between the given CU and one of the associated CUs, respectively. The method includes providing these communications units in which there are HFPs between first and second CUs and between the second and the third CUs, and a third HFP is constructed between the first and the third CUs.

Abstract: A lost packet in a plurality of packets broadcasted from a broadcasting apparatus is detected. Packet complement request information indicative of a packet complement request for complementing the lost packet is transmitted to a device in a high hierarchical level, and a dummy packet for holding transmission of the packet complement request information for a predetermined hold time is transmitted in place of the lost packet to a node device connected in a low hierarchical level.

Abstract: Methods and apparatus are disclosed for storing tree data structures among and within multiple memory channels, which may be of particular use with, but not limited to tree bitmap data structures. A subtree (or entire tree) typically includes one or more leaf arrays and multiple tree arrays. One or more leaf arrays are typically stored in a first set of memory channels of N+1 sets of memory channels, the N+1 sets of memory channels including N sets of memory channels plus the first set of memory channels. Each of N contiguous levels of the multiple tree arrays are stored in a different one of said N sets of memory channels, wherein each of the multiple tree arrays at a same level of said N contiguous levels is stored in the same memory channel set of said N sets of memory channels. A memory channel for storing a particular level is typically assigned based on one or more current occupancy levels of the memory channels.

Abstract: Methods and systems for identifying instability or a loop in a network. In one method, a first BPDU message is received at a switch indicating a topology change. The message includes a bridge identifier identifying a network device originating the first BPDU message. A second BPDU is generated at the switch and includes the bridge identifier identifying the network device originating the first BPDU message. The method further includes transmitting the second BPDU message indicating the topology change from the switch.

Abstract: A wireless networking system uses mobile and fixed transceivers to achieve a network with changing topology. A routing process includes quality-of-service considerations in the network to allow for features such as file or other data transfer, streaming audio and video, digital telephone communications, etc. The routing process adapts to transceiver units entering, leaving, or moving within, the network. Auxiliary networks such as the Internet, campus or corporate intranets, home networks, etc., can be accessed through the wireless network. Features, designs and user interfaces for the units are described. Security and access control of media content and other data is presented.

Abstract: An apparatus for, a method of, and a computer carrier medium carrying code to cause a processor to execute a method. The method includes running a plurality of instances of a wireless spanning tree protocol in a wireless mesh node, each instance substantially conforming to the IEEE 802.1 standard. Running an instance of wireless spanning tree protocol including the wireless mesh point wirelessly transmitting BPDU information to other wireless mesh points of the network or wirelessly receiving BPDU information from other wireless mesh points, the BPDU information encapsulated in one or more control/management frames, e.g., beacon or probe response frames of a wireless network standard, the BPDU information relating to a spanning tree topology for the instance.

Abstract: A method and apparatus for composite link assignment are provided such that network capacity is sufficient to handle all the traffic (e.g., load) while an objective function, e.g., the total cost of the capacity is minimized. The present method receives a plurality of weights for a plurality of arcs and a load for the network. An objective function is selected for minimization, where the present method then determines the composite link assignment to handle the load while the objective function is minimized. In one embodiment, the composite link assignment comprises a plurality of different link types for the plurality of arcs.

Abstract: A multi-endpoint communication system comprising communication nodes linked in a tree structure by unicast connections includes a server to receive a request from a new communication node to join the tree structure. The system further includes a node selector to identify one of the plurality of communication nodes that is likely to be in a same local area network as the new communication node. In addition, the system includes a node linker to connect the new communication node to the identified communication node within the tree structure.

Abstract: A broadcast device in a tree-type broadcast system forming plural hierarchy levels with the broadcast device located at the top and connecting the nodes so as to be sequentially transferred from higher to lower nodes, wherein the nodes select a first mode determining a reconnection destination by acquiring node information from a server or a second mode determining a reconnection destination by acquiring node information of the reconnection destination candidate, and determines the reconnection destination by acquiring the node information according to the mode currently selected when the higher nodes are disconnected and the node except for the own is reconnected, and the broadcast device monitors a load status of the server, and broadcasts to switch selection to the second mode to thereby enable sequential transfer of the switch instruction from the higher to the lower nodes when a monitor level becomes a threshold level or more.

Abstract: when a network system of the present invention performs a bandwidth-guaranteed communication, a terminal device collects information on one or more relay devices on a path to another terminal device via a bandwidth request packet transmitted to the another terminal. When the bandwidth cannot be allocated, a detour path is searched according to the collected relay device information so as to perform the bandwidth-guaranteed communication via the detour path.

Abstract: Counters are implemented within an 802.1Q VLAN (Virtual Local Area Network) bridge model to assist a network administrator in diagnosing network problems associated with the dynamic registration of VLANs. Such counters are able to count the number of dynamic VLANs propagated through a bridging device, and for monitoring the maximum number of VLANs ever simultaneously configured on a bridge device.

Abstract: A method for managing bandwidth for transmitting the content of a video to users requesting the content. The total time duration T of the video is divided into N consecutive sessions. A unicast or multicast connection in normal play mode may be created for each session only at discrete times separated by a time increment ?T equal to T/N. An overall bandwidth B is established for transmitting the content of the video to the users. The overall bandwidth B is divided into a first part B1 and a second part B2. The first part B1 is allocated to a normal play mode of the video during the N sessions such that B1=N*R, where R is the bit transmission rate of the video. The second part B2 is allocated to unicast sessions dedicated to implementation of at least one non-normal streaming mode of the video.

Abstract: A method and apparatus for updating a shortest path graph or a shortest path tree are disclosed. For example, an arc weight is changed for an arc in the network, where a plurality of affected nodes in the network is determined. The distance of each of the affected nodes is determined, where a subset of the plurality of affected nodes is then placed in a heap. One aspect of the present invention is that not all the affected nodes are placed in the heap. In one embodiment, the present reduced heap approach only applies the Dijkstra's algorithm to those affected nodes whose distances change in a smaller amount that the change in the arc weight. In turn, the shortest path graph or the shortest path tree is updated in accordance with the affected nodes placed in the heap.

Abstract: A method for converging on a route through a radio frequency (RF) communications network, that includes multiple nodes, includes (a) identifying all RF links between each node in the RF communications network; (b) determining a connectivity confidence interval for each RF link by: (aa) developing a calculated signal to noise ratio using a radio frequency communication link propagation loss model; (bb) determining a threshold signal to noise ratio based on a predetermined RF packet completion rate; (cc) determining a standard deviation value based on a signal strength and a noise level at a signal receiving node; (dd) calculating a Z number, associated with a normal distribution table which is based on the threshold signal to noise ratio minus the calculated signal to noise ratio with that result being divided by the standard deviation value; and (ee) assigning a CCI probability value based on said Z number.