Abstract: A circuit that reduces external terminal count of a semiconductor chip, such as a communications chip or other type of chip that requires the generation of configuration codes, by reducing the number of external input terminals required for generating the configuration data. The circuit includes multiplexers, each of which selects output data or configuration data, and includes an output in communication with a respective external output terminal of the chip. A selector is connectable between a selected one of the external output terminals and an external input terminal in communication with a memory to serially input configuration data on that output terminal to the memory to configure the chip. Thus, configuration codes are generated for the chip using a reduced number of external input terminals, thereby reducing the overall external terminal count of the chip. The circuit and chip may be embodied on a network or Ethernet card.

Abstract: The method identifies repeating patterns in sequential event streams, in which each event (A1, B, C, D, A2) is of a pre-determined event type (A, B, C, D) and occurs at a specified position within an event stream. In the method, an edge-weighted graph is generated in which each event type is represented by a vertex. A window of pre-determined width is then moved through an event stream and the edges in the graph are weighted in response to the co-occurrence of eventsin the window. Thus, if a window contains an event A1 and moves on through the event stream such that it also contains a second event B, the weighting of the edge linking the vertices representing the corresponding event types A, B in the graph is incremented. Repeating patterns in the event stream thus emerge as clusters of higher edge weights in the graph and can be detected by a graph clustering method. Individual instances of a pattern identified by the method can optionally be located by re-scanning the event stream for individual patterns.

Abstract: A method for configuring a network, and a network configured according to such method, are provide in which a communication links laid out in a ring in a metropolitan area are partitioned into link segments, and managed according to a spanning tree protocol. The switches are configured to establish unique, mesh or tree type network configurations suitable for application to communication media arranged to support ring-based protocols. The method is used for connecting communication links arranged in a plurality of rings, which traverse a plurality of collocation sites in a metropolitan area. The method comprises configuring switches in the plurality of collocation sites to partition rings in the plurality of rings into a plurality of link segments providing point to point paths between switches at collocation sites in the plurality of collocation sites. The switches and link segments are managed according to a spanning tree protocol.

Abstract: A method and apparatus for a configuration ring is described. The method and apparatus include a configuration ring including a master, a first target, and a second target, the master coupled to the first target through a ring, the first target coupled to the second target through the ring, and the second target coupled to the master through the ring. The method and apparatus also include a method of using the configuration ring including originating a packet, passing the packet, decoding the packet, and utilizing the packet.

Abstract: A method of connecting a telecommunications network, in which the network is formed of plural nodes connected by plural spans. Each node has a nodal switching device for making connections between adjacent spans meeting at the node. Method steps A-F are followed. A) Select a set of candidate rings, each candidate ring being formed of nodes connected by spans, the candidate rings each being capable of serving a number of demands and having a ring construction cost C. B) Assess the total transport utility U of each candidate ring, wherein the total transport utility is a measure of at least the number of demands served by the respective candidate ring. C) Assess the construction cost of each candidate ring. D) Calculate a ratio formed of U/C for each candidate ring. E) Choose, from the set of candidate rings, a best set of candidate rings, wherein candidate rings in the best set of candidate rings have a higher ratio of U/C than candidate rings not in the best set.

Abstract: Systems and methods consistent with this invention allow for each node within one or more rings to obtain connection and topology information from other nodes within these rings. In such a system, each node is able to maintain connection table and topology tables for each node and each ring within a ring network. In particular, such information can be kept current because this scheme allows for dynamic updating of connection and topology information in real time. With such current information, a node is able to utilize this information to execute such operations as squelching connections on a protect line and timeslot interchange. In addition, by supporting timeslot interchange, the ring can be managed as more than a single logical entity as well as can have better bandwidth management utilization.

Abstract: There is provided a method for determining a topology for a network. The method comprises the steps of obtaining data that describes a requirement for a service between a first node and a second node, and searching a state space to define a solution that fulfills the requirement. The solution provides a topographic arrangement for the first node and the second node in the network. There is also provided a system for determining a topology of a network.

Abstract: A ring configuring method configures a network in which a plurality of nodes are connected linearly, and performs topology construction for the ring by circulating topology data through the respective nodes and collecting connection information of the respective nodes. The method includes the steps of providing in the topology data a flag indicating whether the connection information is collected in each node; inverting the flag at a terminal station which is an end node of the open ring, and turning the topology data there; causing the topology data to passing through a node other than any terminal station as it is; and adding the connection information to the topology data in each node according to the flag, and performing topology construction.

Abstract: An arbiter circuit is provided for resolving a plurality of N request signals received from a plurality of agents requesting access to a resource.

Abstract: A transmitter, a method of detecting an available node number, and a method of generating topology data are disclosed for a ring type network. The transmitter in a ring type network includes a packet generation and transmission part generating a packet to cause other transmitters in the ring type network to set node numbers assigned to the transmitters and circulating the packet in the ring type network, and a node number detection part, in response to receipt of the circulated packet, reading the node numbers from the packet and detecting an available node number with reference to the read node numbers. According to the present invention, it is possible to maintain and operate a ring type network with less operation steps to improve a maintenance and operation speed.

Abstract: The invention comprises a method for computing the shortest protectable paths in communication networks, and a method for establishing and defining protected paths. The invention utilizes a new algorithm to exclude from consideration as the “shortest path” between two network elements, a path for which adequate protection cannot be established. Such an unprotectable path will contain one or more unprotectable links. These unprotectable links can be identified and excluded based upon whether or not the link is a member of a loop. Because there are several more computational steps in defining the protected paths, after the shortest path has been found, the initial exclusion of unprotectable path segments from consideration eliminates the potential waste of computational resources leading to a more rapid and efficient routing and provisioning of reliable network paths and circuits.

Abstract: In an illustrative method for providing enhanced SONET network analysis, data related to the structure of a SONET network is identified, for example, in a database. The data comprises details regarding the network elements that form the SONET network as well as data regarding how the network elements are interconnected to form the SONET network. From the identified data, the nodes comprised in the SONET network are identified. Similarly, the plurality of communication links located between the identified nodes are retrieved from the data. Using the information identifying the nodes and plurality of communication links, a graphical representation of the SONET network is generated. In the graphical representation of the SONET network, nodes may be represented, for example, with a plurality of lines extending radially from a common point. Communication links between nodes are represented by lines that extend between the radial lines.

Abstract: The present invention describes a method for configuring a station connected to a field bus, wherein a logical address is allocated to said station. The method comprises the steps of: transmitting said logical address from an address-allocation unit to said station; transmitting a physical address from said address-allocation unit to said station, said physical address corresponding to an assumed physical position of said station relative to said field bus; verifying said physical address being transmitted to said station based on an actual physical position of said station relative to said field bus; and storing said transmitted logical address in a memory of said station depending on the verification of said physical address.

Abstract: Systems and methods consistent with this invention allow for each node within one or more rings to obtain connection and topology information from other nodes within these rings. In such a system, each node is able to maintain connection table and topology tables for each node and each ring within a ring network. In particular, such information can be kept current because this scheme allows for dynamic updating of connection and topology information in real time. With such current information, a node is able to utilize this information to execute such operations as squelching connections on a protect line and timeslot interchange. In addition, by supporting timeslot interchange, the ring can be managed as more than a single logical entity as well as can have better bandwidth management utilization.

Abstract: A logical star architecture imposed on an underlying non-star network, for example a Virtual Path Ring (VPR), enhances a mesh protocol with an automatic method for Virtual Path ID (VPI) generation. The VPIs are used by the mesh protocol's inherent routing function to effect automatic configuration at installation, automatic reconfiguration at node updates, and automatic reconfiguration for protection switching. The imposition of the logical star architecture on a VPR reduces node-to-node switching costs (e.g., delay, as well as memory and processing costs) since all nodes in a logical star topology are at most two logical hops away. The logical star also conserves virtual path address space relative to a fully configured ring. Additionally, the imposition of the logical star architecture allows existing star functions to be deployed on the underlying network. Finally, when the underlying architecture is a ring, the protection advantages of ring networks can be preserved.

Abstract: A system and a method for maintaining operation of a signaling interconnection between a first ring network and a separate second ring network. Each ring network comprises two communication paths transmitting data in opposite directions and at least two nodes connected to both communication paths. The networks are interconnected via two adjacent gateways, which receive data from the two communication paths on one network, and transmit the data onto the other network directed away from the other gateway. Data traffic is stopped in both directions in an inactive segment on each ring network, so that a node situated on a ring network receives traffic from only one of the two gateways.

Abstract: A communication method and a bus design for interconnecting a plurality of components in a ring configuration with segments of the bus chaining from one component to another so as to reduce the amount of global wiring between components. One of the components serves as a beginning and end of the ring and controls the operation of the bus by injecting command, address, and write data, at the beginning of the ring and gathering read data at the end of the ring. By chaining components, no bus signal needs to travel further than a single component-to-component hop in any bus cycle. The bus includes unidirectional signal lines that carry data objects and tags in one direction, and carry flow control in the opposite direction. Tags accompany each data object and determine how a component interprets the data object when received.

Abstract: A network configuration protocol and algorithm are described which resolve deficiencies with existing protocols. A large network having many bridges may be built as a combination of smaller networks, many of which may each be arranged in a ring topology. Each ring may be monitored by a single master bridge regularly sending control packets, and each other bridge in the ring does not make decisions with respect to its status. A loop free topology is achieved by selectively blocking and unblocking data traffic in one of the ring ports of the single master bridge for the ring, while all other bridges in the ring keep their ports in non-blocked states. In multiple ring topologies, each ring has a single master bridge which chooses one of its ports to be blocking.

Abstract: A method for flexibly defining communication constructs includes providing at least one communication element type for at least one layer of a generalized communication model, such as a bus model. Each communication element type has a user-definable structure that is adaptable for representing a corresponding protocol layer of a target communication medium. Users can define specific communication element types to substantially represent the target protocol. Users can also define the communication element types to depart from the target protocol in precisely defined ways.

Abstract: A space-based network router architecture (20) is disclosed. The router includes an array-of-processors architecture (20) for routing uplink and downlink traffic of a communications system (10). The architecture comprises multiple node interface chips (26) linked to one another via horizontal and vertical rings (22, 24), thus forming a mesh (21). Associated with each node interface chip (26) is a processor (28) and either a demodulator (30) or modulator (32). Each node interface chip (26) selectively transfers a signal depending upon the particular signal's destination and processing requirements. The router architecture (20) provides scalabitly, fault-tolerance and flexibility, as well as structural advantages over present router systems.

Abstract: Methods and apparatus for providing a network data switch and buffer system are disclosed. In a switch having a memory associated therewith, the memory including a general memory and a plurality of dedicated memory segments, the general memory being available to a plurality of users associated with one or more network devices and each one of the plurality of dedicated memory segments being associated with one of the plurality of users, a method of storing data includes receiving data from a source network device connected to the switch. The data is then stored in a data buffer so that a portion of one of the plurality of dedicated memory segments is allocated when the general memory has been depleted.

Abstract: The number of ring layers necessary to support the traffic in a stack ring network is determined, and the ring layers are divided into a first set of layers and a second set of layers. The interchange points between the first set of layers and the second set of layers are determined, and the traffic between the first set of layers and the second set of layers is allocated. The method subdivides each of the first and second sets of layers into a first set of layers and a second set of layers, and repeats the process of determining interchange points, allocating traffic, and subdividing the sets of layers until each set of layers consists of a single layer.

Abstract: The present invention reduces the number of optical fibers used without impairing a self-recovery function of a ring network system. Current interfaces of a plurality of nodes constituting a ring network system are connected together by optical fibers, while standby interfaces of the nodes are connected together by optical fibers. However, an optical fiber is connected to an input end and an output end of each of those current interfaces which are not involved in signal communication in the current interfaces, in such a manner that the optical fiber loops from the input end to the output end.

Abstract: A system and method for optimizing placement of network equipment and information load in a network over a period of time. A demand input structure having a plurality of demands organized by their time points and MUX levels is provided as an input to a model generator and an optimization processor associated therewith. Starting with the earliest demand with the highest MUX level to be serviced by the network, a directed graph network model is obtained by using appropriate transformation techniques. A MUX modularity constraint is imposed in order to obtain a filtered network model that can support a MUX level of a selected demand at a particular time point. A cost function associated with the filtered network model is constructed using a flow cost term and an equipment cost term. Appropriate constraints are imposed on the cost function for optimization. A solution set comprising network placement information and demand routing information is obtained for a MUX level at a current time point.

Abstract: The present invention relates to a network supervisory control system so arranged that load distribution control of a plurality of transmission devices constituting a network is performed by disposing a gateway server between the transmission devices and a supervisory control device for remotely performing the supervisory control of the transmission devices.

Abstract: A method of address management in a net having a plurality of buses linked by a plurality of bus bridges where the net has only one branch bus with multiple bus bridges. A local identification address is assigned to each node on a branch bus and a bus number is assigned to each bus other than the branch bus. The bus number includes a common base and the local identification address for the node having a portal that connects to that bus.

Abstract: A network configuration protocol and algorithm are described which resolve deficiencies with existing protocols. A large network having many bridges may be built as a combination of smaller networks, many of which may each-be arranged in a ring topology. Each ring may be monitored by a single master bridge regularly sending control packets, and each other bridge in the ring does not make decisions with respect to its status. A loop free topology is achieved by selectively blocking and unblocking data traffic in one of the ring ports of the single master bridge for the ring, while all other bridges in the ring keep their ports in non-blocked states. In multiple ring topologies, each ring has a single master bridge which chooses one of its ports to be blocking.

Abstract: A high speed healing ring having a plurality of nodes is provided. The high speed healing ring includes a first link that is capable of carrying a first data in a first optical signal, which has a first wavelength, from a first node to a second node. The ring network also has a second link that is capable of carrying the first data in a second optical signal, which also has the first wavelength, from the first node to the second node. At least one of said first and second optical signals passes through at least one other node between the first node and the second node. By providing redundancy in the ring network through physical layer interface using optical add-drop multiplexers (OADMs), cost of the system may be reduced while providing a faster response time, as compared to systems based on Synchronous Optical NETwork (SONET) or Resilient Packet Ring (RPR).

Abstract: A redundant network call management system comprising interconnected duplicate call processing devices connected to a plurality of port network controllers, the plurality of port network controllers interconnected via a token bus. One of the duplicate call processing devices is active and the other call processing device is inactive and one of the plurality of port network controllers is a master port network controller. The active call processing device receives call requests and processes the call requests to generate call routing instructions that are sent to the master port network controller. When the interconnection between the duplicate call processing devices fails, both of the duplicate call processing devices transition to an active state and instruct one of the plurality of port network controllers to operate as master.

Abstract: A communications apparatus having: a communication cable receptacle having signal terminals and power supply terminals for connection to a communication cable having signal lines and power supply lines; a communication interface for transferring a signal to and from an external via the signal terminals of the communication cable receptacle; and one or a plurality of light emitting elements capable of emitting light, the light emitting element being disposed near the communication cable receptacle, being selectively connected to the power supply terminals of the communication cable receptacle, and being capable of displaying at least one of a communication state, a state of the apparatus, an alarm state, and a connection state of the apparatus while receiving a power from the communication cable via the power supply terminals.

Abstract: A telecommunications network is provided. The network uses a ring of ring switches to provide a transport mechanism for data packets that is transparent to the data and protocols contained in the data packets. This transport mechanism is simple and low cost to implement. Such networks can carry, for example, control data between a primary site and secondary sites of a cable network to set up and deliver pay per view, video on demand or near video on demand programming. The network can also be used, in other embodiments, to provide remote access to utility meters, to centralize network management of the cable network, and other appropriate monitoring and control functions.

Abstract: A loop network hub including a hub port with a loop initialization insertion mechanism. The loop initialization insertion mechanism causes a hub port which detects a new node port connection to automatically begin generating loop initialization data. A hub port continues to generate loop initialization data until that hub port receives a loop initialization sequence. The loop initialization data propagates around the loop of the hub, halting ordinary processing. In this way, the entire loop is cleared. Upon receiving a loop initialization sequence, the hub port originating the loop initialization data inserts the new node port into the loop. At this point, loop initialization begins and each node port in the loop network obtains a unique loop network address.

Abstract: A Gigabit Media Independent Interface (RGMII), which is adapted to also implement a ten bit interface (RTBI) that is intended to be an alternative to both the IEEE 802.3z GMII and the TBI is disclosed. The interface has a reduced number of input and output pins, i.e., pin-count, that can implement the above BMII and TBI standards. More particularly, the interface reduces the number of pins required to interconnect the MAC and the PHY from a maximum of 28 pins (TBI) to 12 pins in a cost effective and technology independent manner. The RGMII maps pins to transfer data at the same data rate with control functionality with a minimum number of input and output pins, and does so by utilizing both the rising and falling edges of the clock signal and complies with existing interface specifications set forth in the IEEE standards.

Abstract: There is provided a digital switch system for connecting a telephone central office with a number of subscriber lines, in which the system includes at least one central office-digital trunk interface switch which allows digital signals to be transmitted between the switch system and the central office, and a number of subscriber line interface switches which allow signals to be transmitted between the switch system and the subscriber lines, in which each of the subscriber line interface switches is connected with at least one subscriber line via at least one digital-to-subscriber line converter, and in which the central office-digital trunk interface switch and the subscriber line interface switches are connected in a ring-shaped structure.

Abstract: A method and apparatus for the robust implementation and protection of Asynchronous Transfer Mode (ATM) traffic over a Synchronous Optical Network (SONET) Unidirectional Path Switched Ring (UPSR). The traditional SONET bridging function is eliminated for the ATM traffic in favor of a selector function. The selector function occurs at the ingress of the ATM traffic to the UPSR and directs the ATM traffic to its destination via a virtual path over the UPSR. The ATM traffic is protected from both SONET failures and ATM failures by means of an Intra-Ring Communication (IRC) protocol. The IRC protocol governs failure detection and the notification of the SONET nodes on the UPSR of the failure and any protection switch that may be necessary.

Abstract: A method for configuration of a node inserted into a bidirectional ring network includes, responsive to traffic on first and second rings of the network, determining at the node that one of the first and second rings carries the traffic in a clockwise direction around the network, while the other of the rings carries the traffic in a counterclockwise direction. The node then sends and receives advertisement packets through its network interfaces over the respective rings, advertising the determined directions of the traffic carried by the rings. Responsive to the advertisement packets received at the node, the configuration of the node is completed so that the traffic can be sent to and from the node on the first and second rings in the determined directions.

Abstract: This invention relates to the design of a scaleable high performance multiservice network based on programmable transport. A meshed network with dynamically-adjustable link capacities and nodes which provide data packing into “containers” for transport is proposed. A ring-based network, exchanging data containers among its nodes, is the preferred implementation, due to its flexibility, maintainability, and high reliability. With lossless rings, the quality of service is controlled solely by the origin and destination nodes, without any interference from other data streams. Flexible programmable transport greatly improves the performance, simplifies the controls, and facilitates scaleability. The concept is a departure from classical network thinking. By reducing the complexity of the network core, an economical, reliable, and manageable network with feature-rich edge nodes can be realized.

Abstract: A network adapter includes a bypass buffer with sufficient capacity to store a packet from an upstream neighboring adapter and to store at least one additional incoming packet as a local packet is sent. The adapter also includes control logic which monitors the bypass buffer to determine whether the adapter may send local data packets. A network may be formed of such network adapters linked through counterrotating rings. If the control logic determines that the bypass buffer has sufficient storage available to avoid overflow while the adapter sends the local packet, the adapter sends the local packet. The control logic may choose to send a local packet only if there is sufficient room available within the bypass buffer to store a packet the same size as the local packet which is to be sent, thereby insuring that the bypass buffer does not overflow before the adapter can resume transmitting data from the bypass buffer.

Abstract: A circuit that reduces external terminal count of a semiconductor chip, such as a communications chip or other type of chip that requires the generation of configuration codes, by reducing the number of external input terminals required for generating the configuration data. The circuit includes multiplexers, each of which selects output data or configuration data, and includes an output in communication with a respective external output terminal of the chip. A selector is connectable between a selected one of the external output terminals and an external input terminal in communication with a memory to serially input configuration data on that output terminal to the memory to configure the chip. Thus, configuration codes are generated for the chip using a reduced number of external input terminals, thereby reducing the overall external terminal count of the chip. The circuit and chip may be embodied on a network or Ethernet card.

Abstract: Instead of central management of communication paths between repeating installations using a conventional central managing device, in plural repeating installations, a repeating installation compares and refers to another path information where use/free state of plural channels of the other repeating installations comprised in communication data received from the other repeating installations other than the repeating installation itself and use/free state of channels corresponding to one or more node terminal connected with the repeating installation itself, and decides path information of input-output data inputted/outputted into/from the repeating installation itself so that the respective repeating installations perform allocating management of communication channels for the input-output data individually and dispersively.

Abstract: A communication network includes a communication medium and a plurality of communication nodes, mutually coupled by the communication medium so as to form a ring, over which each of the nodes is configured to transmit traffic to the other nodes in both clockwise and counterclockwise directions around the ring. At least one of the nodes is configured to receive the traffic in only one of the directions at any given time.

Abstract: Upper layer 3 routing in conjunction with self-healing lower layer networks is more informed by the addition of reachability costs determined in the lower layer. Maintenance changes on the self-healing network are monitored. A change causes revision of reachability costs. The revised costs are communicated by lower layer logic to upper layer logic.

Abstract: A method and apparatus for performing bit stuffing operations for transmission signals are described. In an embodiment, a method includes receiving data for a number of channels of a signal. The method also includes recursively processing the data for the number of channels in an order. The processing of a channel of the number of channels includes retrieving a previous state for the channel upon determining that a timeslot for the channel is being processed. The previous state includes a history of values of a depth of a First In First Out (FIFO) for the channel. Moreover, the processing of the channel of the number of channels within the signal includes determining whether to make a bit stuffing decision for the channel upon determining whether the timeslot is associated with a bit stuffing opportunity for the channel. The bit stuffing decision is based on a current value and the history of the values of the depth of the FIFO for the channel.

Abstract: In a method of establishing communication over a network a number of nodes are interconnected in a ring architecture. Virtual connections are set up on a pair of counter-rotating packet-based rings to interconnect the nodes. At each node packets destined for that node are extracted from the rings, outgoing packets are added to the rings, and packets on each ring not destined for that each node pass directly through. This arrangement establishes a virtual mesh structure between the nodes. Either each node transmits packets on both rings or receives packets from both rings. In the case where each node transmits packets on both rings the node selects one of the rings from which to receive packets in the absence of a fault, selects the fault-free ring from which to receive packets if only one of the rings has a fault, and selects both rings from which to receive packets if both rings have faults.

Abstract: A ring network has first and second network connecting offices for connecting ring networks together and for dropping a signal from a terminal office. Each node of the ring network recognizes whether it is the first network connecting office based upon channel setting information. A first node, which has been recognized as being the first network connecting office, executes a squelch-table creation procedure between itself and other nodes based upon the channel setting information, thereby identifying a second node, which is the second network connecting office. The first node embeds office identification information in a squelch table of a protection channel and sends this information to the second node. The second node recognizes that it itself is the second network connecting office based upon the office identification information.

Abstract: The disclosure relates to apparatus and methods that provide a system interconnect for transporting cells between nodes on a dual counter-rotating ring network, including a link selection register for selecting the shortest path to a destination node, use of a fault tolerant frequency reference to synchronize node clocks, interconnect initialization, multi-ring topologies along with an addressing schema and ring-to-ring couplers. The disclosure also discusses flow control of cells leaving nodes, coupling cells from one ring to another, and use of such an interconnect as a bus replacement.

Abstract: A telecommunications network is provided. The network uses a ring of ring switches to provide a transport mechanism for data packets that is transparent to the data and protocols contained in the data packets. This transport mechanism is simple and low cost to implement. Such networks can carry, for example, data to and from the Internet to a subscriber with a cable modem hook-up to a cable network or a DSL modem connection to a copper wire DSL enabled telephone network.

Abstract: In the situation that data switching is incorporated in a wide area telecommunications network it is advantageous to use a local area network protocol such as ethernet which allows network resources to be shared. However, this introduces a problem with respect to loops in the network and the possibility of infinite packet looping. If the known spanning tree algorithm is used to prevent infinite packet looping this is problematic because the known algorithm takes a relatively long time to take effect. An algorithm is described which is based on assumptions about the topology of the communications network and which is simpler and faster.

Abstract: A method and system for ordering an interconnect topology to form a ring structure, the topology comprising a number of nodes, are described. In one embodiment, a self identifier for each of the nodes is determined. Further, the self identifier is mapped to a ring identifier for each node. In addition, each node computes the ring identifier of one of its port-connected nodes as its topologically adjacent neighbor identifier.

Abstract: The present invention is a wireless network designed to deliver information communication services, such as telephony and data services, from a service provider, such as an ISP or LEC to metropolitan commercial customer locations. The network of a preferred embodiment of the present invention incorporates all system components necessary to connect customers, application equipment (e.g., phones, PBX's, computers) to the service provider's equipment, (e.g., C.O. switch, Tandem switch, point of presence (POP) gateway, ISP server, etc.). The preferred embodiment of the present invention integrates all the various functional tasks at the component level, to build a comprehensive, cohesive network solution. The network architecture of the present invention includes a distributed set of non-hierarchal nodes, connected together via wireless links. Nodes of the network can act both as termination points (i.e., connecting to the customer's or service provider's equipment) and/or as tandems, (i.e.