Abstract: A method and system for communicating traffic on an emulated subnetwork of a telecommunications ring having a plurality of nodes interconnected by a transmission media includes obtaining traffic at a node on the telecommunications ring. The traffic is segmented into a plurality of discrete segments. A set of broadcast cells is generated by adding an address header to each segment. The address header identifies a virtual channel dedicated to the node on the subnetwork in the telecommunications ring. The set of broadcast cells are transmitted in the virtual channel of the subnetwork and within a frame of the telecommunications ring. At each remaining node on the telecommunications ring, in response to receiving the set of broadcast cells in the virtual channel, both retransmitting and processing the broadcast cells.

Abstract: An advanced processor comprises a plurality of multithreaded processor cores each having a data cache and instruction cache. A data switch interconnect is coupled to each of the processor cores and configured to pass information among the processor cores. A messaging network is coupled to each of the processor cores and a plurality of communication ports. In one aspect of an embodiment of the invention, the data switch interconnect is coupled to each of the processor cores by its respective data cache, and the messaging network is coupled to each of the processor cores by its respective message station. Advantages of the invention include the ability to provide high bandwidth communications between computer systems and memory in an efficient and cost-effective manner.

Abstract: A method for communicating between an operator at an operator device and a user recipient includes enabling an operator of the operator device to enter a device-independent unique identifier for a user recipient by requiring interaction between the operator and the operator device without requiring interaction between the operator and software on the operator device that is designed for communication over an IP-based network. The method includes identifying an IP network address associated with the user recipient based on the device-independent unique identifier and routing a message entered by the operator to the determined IP network address.

Abstract: In one embodiment, a node comprises an interface to communicatively couple the node to a channel. The channel communicatively couples the node to a first neighbor node and first neighbor's neighbor node in a first direction. When the first neighbor node is scheduled to transmit and the node receives data from the first neighbor node via the channel, the node forwards the data to the first neighbor's neighbor, receives other data from the first neighbor's neighbor, compares the data to the other data, and relays the data along the channel with information indicative of the comparison.

Abstract: A technique retrieves computed path segments across one or more domains of a computer network in accordance with a stateless Path Computation Element (PCE) model. The stateless PCE model includes one or more PCEs configured to compute one or more path segments through the domains in response to a path computation request issued by, e.g., a Path Computation Client (PCC). Notably, each computed path segment is encrypted as a data structure to preserve confidentiality across the domains. Each PCE then cooperates to return a path computation response, including the encrypted path segments and an explicit route object (ERO) containing compressed path descriptions of the computed path segments, to the PCC.

Abstract: The Fibre Channel Credit Extender (FCCE) (600) is a network device that is disposed between and connected to an end node (210) and an optical repeater (220). The FCCE (600) contains as many buffer credits as necessary, to solve bandwidth problems in a network. In a situation where maximum bandwidth is required in both directions of a link, the FCCE (600) breaks a single logical link into three physically separated “linklets.” The short-distance linklets attain maximum bandwidth by use of the existing buffer credits of the end nodes. The long-distance linklet attains maximum bandwidth by use of very high receive buffer credits in the FCCEs (600). In this way, only those links that need maximum bandwidth over distances not covered by end-node credit counts need be attached to an FCCE (600). The FCCE (600) contains the optical repeater to gain distance on that link, and contains high credit count receive buffers to gain bandwidth on the link.

Abstract: A data transmission apparatus for implementing multiple service flow in a multiple service ring is described. The apparatus includes a trunk pipe and at least two nodes each with at least one flow. The apparatus also includes a flow Rx framer for converting data received from the flow into data packets of a predetermined protocol, a transmission setup device for setting up information for packets of the predetermined protocol to be transmitted, and a Tx framer for encapsulating the information into frames of the MSR and transmitting the same along the trunk pipe to a downstream neighbor node along the ring.

Abstract: A source node of a network transmits a path setup message for requesting a traffic path to a destination node. First and second nodes, located between the source and destination nodes, establishes first and second parallel transport paths on a first fault recovery layer between them. The first node further includes a database for storing identities of the first and second paths as a single virtual link as viewed from the source node. The first node responds to the path setup message for accommodating the traffic path on a second fault recovery layer through the first transport path. Each node accommodates the traffic path through the second transport path when the first transport path fails. The first node advertises recovery type of the virtual link as equal to the recovery type of the first and second transport paths, and/or equal to most unreliable recovery type of its component links.

Abstract: In a congestion control system for congestion controlling communications on a network, a congestion control node has a congestion detection part for detecting a congestion level of the communications in the congestion control node in question and a congestion notifying part for notifying other congestion control nodes on the network of congestion information detected by the congestion detection part. The congestion control node further has a part for receiving the congestion information from the other congestion control nodes and a congestion flow estimating part for estimating, with reference to the congestion information and a routing table for designating a transfer path to destination, a flow having the congestion level that is not less than a predetermined level in the transfer path to the destination.

Abstract: A method and corresponding apparatus allows unknown packet traffic, such as Ethernet traffic, to be carried on a Resilient Packet Ring (RPR) network without flooding the traffic on the RPR network. Modules in a station of the ring network compare a destination address in a packet traffic signal with known addresses and associate an identifier of a tunnel in the ring network with the packet traffic signal based on the comparison. The modules then associate with the packet traffic signal an identifier of a destination station in the ring network that corresponds to the identifier of the tunnel and forward the packet traffic signal to the destination station via the tunnel. By transmitting the packet traffic via tunnels instead of flooding the RPR network, spatial reuse may be implemented allowing the network to support a higher volume of traffic.

Abstract: A method for safely adding nodes to a network provides safeguards to prevent adding nodes beyond a maximum number of nodes allowed in the network. In one aspect, if the node to be added exceeds the maximum number of nodes allowed, the connection between the node to be added and the network is quarantined. If the node to be added does not exceed the maximum number of nodes allowed, the connection is confirmed. In another aspect, an additional test is made to determine if the connection between the network and the node to be added creates a loop within the network. In the case of a detected loop, the connection between the network and the node to be added is quarantined. If the connection does not create a loop, it is confirmed.

Abstract: Methods and apparatus are disclosed for identifying the relevancy of packets. In one embodiment, source addresses are associated with network topology indications. When a packet is received, its network topology indication is compared with the corresponding one retrieved from a data structure to determine whether to drop the packet. Source addresses may also be associated with authorized interfaces to determine whether a packet was received on an authorized interface. In one embodiment, a maintained network topology indication is associated with a packet. After it is processed, the corresponding latest network topology indication is retrieved and compared with that previously associated with the packet. In one embodiment, upon a change in a network topology indication associated with an interface, control packets are placed in each of the queues corresponding to the destination interface, so it can be readily identified when this update has been propagated through the system.

Abstract: A method for data traffic transmission on a synchronous digital network to overcome the inefficiency of the data packet transmission on the synchronous digital network equipment. The method includes, adding a RPR processing module after Ethernet interface in the equipment; through the RPR processing module, an uplink Ethernet frame from Ethernet interface being mapped to a RPR frame; through LAPS/PPP/GFP protocol, the RPR frame being mapped into the payload of a synchronous digital network; the volume and number of the VCs and total bandwidth of the RPR being configurable. When the RPR frame arrives at the destination node of the RPR, it is stripped from the RPR and recovered to its original Ethernet frame. The method and device transmit data service efficiently, and the total bandwidth of the RPR is adjustable and is statistically multiplexed.

Abstract: The present invention provides for a method and apparatus for an end-to-end connection between an RPR and an MPLS network, where the RPR network is linked to the MPLS network (and viceversa) through a TLS layer. In a preferred solution, the client layer is Ethernet, but any client layer can be considered.

Abstract: A communication circuit for use within a vehicle includes a first network port and a second network port that is remotely located from the first network port. The networks are digitally connected together and digitally communicate a signal therebetween. The communication circuit is used between two or more coupled train vehicles.

Abstract: Disclosed herein is a resource allocation method for providing load balancing and fairness for a dual ring. The resource allocation method includes the step of determining whether a bandwidth allocation request message is received from one of other nodes. If the bandwidth allocation request message is received, it is determined whether one or more of two rings of the dual ring fulfill a request of the bandwidth allocation request message. If the rings fulfill the request, a path is allocated to one of the rings having a lower weighted cost. A resource allocation information notification message is provided to other nodes. If the rings cannot fulfill the request, the process ends.

Abstract: Methods and apparatus for Fibre Channel interconnection is provided between a plurality of private loop devices through a Fibre Channel private loop device interconnect system. In the preferred embodiments, the Fibre Channel private loop device interconnect system is a fabric or an intelligent bridging hub. In one aspect of this invention, a Fibre Channel private loop device is connected to two or more Arbitrated Loops containing, or adapted to contain, one or more private loop devices. Preferably, the interconnect system includes a routing filter to filter incoming Arbitrated Loop physical addresses (ALPAs) to determine which Fibre Channel frames must attempt to be routed through the fabric. Numerous topologies of interconnect systems may be achieved.

Abstract: A data transmission apparatus used in a multiple service ring is described. The apparatus includes at least two nodes coupled to at least one aggregate pipe and at least one tributary. The apparatus also includes a tributary TX framer for converting data received from the tributary, a transmission setup module for setting up information for processing protocol packets to be transmitted, a TX framer for encapsulating the information into frames of the MSR and transmitting the same along the aggregate pipe to a downstream neighbor node in the ring, and a RX framer for receiving and deframing data frames of the MSR from a upstream neighbor node. The apparatus also includes a transiting module for transiting the frames to the TX framer, a destination tributary determining module for determining a destination tributary, and a tributary RX framer for converting and sending protocol packets to a corresponding tributary.

Abstract: A network or interconnect structure 100 utilizes a data flow technique that is based on timing and positioning of messages communicating through the interconnect structure. Switching control is distributed throughout multiple nodes 102 in the structure so that a supervisory controller providing a global control function and complex logic structures are avoided. The interconnect structure operates as a “deflection” or “hot potato” system in which processing and storage overhead at each node is minimized. Elimination of a global controller and buffering at the nodes greatly reduces the amount of control and logic structures in the interconnect structure, simplifying overall control components and network interconnect components 104 and improving speed performance of message communication.

Abstract: A method for transmitting a packet in a wireless access network based on a wavelength identification code scheme. The method comprises the steps of connecting n number of RNCs (Radio Network Controllers) to one sub-ring where the “n” is a positive integer, and assigning a unique wavelength to each RNC; identifying a packet to be transmitted between the RNCs located within a same sub-ring using the assigned unique wavelength, and transmitting the packet through an SRC (Sub-Ring Controller); connecting m number of SRCs to one main-ring where the “m” is a positive integer, and assigning a unique wavelength to each SRC; and detaching a wavelength identification code from the packet to be transmitted between the RNCs located within different sub-rings, and transmitting the packet having the encapsulated wavelength identification code through an MRC (Main-Ring Controller).

Abstract: An Ethernet Optical Area Network (EOAN) system, and methods for implementing and using such an EOAN system, are disclosed. The EOAN system may be used to improve the speed and reliability of data communications networks for small to medium-sized companies in metropolitan area networks. The EOAN system provides end-to-end Ethernet protocol, enabling professionals to have high-speed data communications in real time. The EOAN system may be generally utilized for improving data communications between branch offices, home offices, campuses, and remote sites for a wide variety of industries. The present invention preferably includes a fiber optic ring, Network Operation Center (NOC), NOC architecture components, existing client equipment, and one or more Free Space Optic (FSO) devices, microwave communication technology, and/or data switching platforms to implement high-speed Ethernet-based connections such as within a specified metropolitan area.

Abstract: A fiber-optic networking system that can survive a break in the fiber and restore full connectivity to all nodes in the network. The network can detect the presence of a cut in the fiber, locate the cut, recover from the cut, and restore the communication capacity that was available before the cut. The network is also capable of automatically determining the existence and identity of the nodes in the network, the distance of the node from the headend, and the executing procedures to handle both planned and unplanned (i.e., during a fault) removal of nodes from the network.

Abstract: A telephone switching network having a plurality of nodes interconnected through the network through channels having dynamically changeable capacity. The telephone switching network includes a plurality of switching nodes and a network manager responsive to each one of the nodes for allocating traffic capacity of the network among the nodes dynamically in accordance with the traffic requested at the plurality of nodes. Each one of the nodes is coupled to the network through an ATM ADM. Each one of the ATM ADMs is coupled to a narrowband switch through an ATM switch. The nodes are interconnected through an ATM SONET.

Abstract: In allocating bandwidth using a Resilient Packet Ring (RPR) fairness mechanism in a node connected to an RPR network, when congestion occurs, an amount of traffic that the node has transmitted to a ring during one aging interval is stored together with its own identifier in a fairness message as a fairness transmission rate to be advertised to its own upstream nodes. The amount of traffic transmitted from the upstream node during the aging interval is measured and stored. When the congestion has been solved, an available bandwidth is calculated with reference to the fairness transmission rate and the amount of traffic transmitted from the upstream nodes, and the fairness transmission rate is calculated to fairly allocate the available bandwidth to the upstream nodes so that the fairness transmission rate is transmitted to the upstream nodes.

Abstract: A time-shared network comprising edge nodes and optical core nodes may be dynamically divided into several embedded networks, each of which covering selected edge nodes. At least one of the edge nodes may host an embedded-network controller operable to form multiple-source flow-rate allocation requests each of the requests specifying flow-rate allocations to a plurality of paths from several source nodes to several sink nodes. A core node may also host an embedded-network controller or several embedded-network controllers. The time-shared network may use both time-division multiplexing and burst switching.

Abstract: Methods and apparatus for switching Fibre Channel Arbitrated Loop Systems is provided between a plurality of Fibre Channel Loop devices. In one aspect of the invention, the system switches based at least in part on arbitrated loop primitives. An exemplary interconnect system may include a first port and a second port, both including port logic to monitor certain arbitrated loop primitives, a connectivity apparatus, a route determination apparatus including a routing table consisting of ALPA addresses and their associated ports, the route determination apparatus coupled to each port and the connectivity apparatus, where the connectivity apparatus creates paths between the ports based on arbitrated loop primitives. In one embodiment, the connectivity apparatus is a crossbar switch. Examples of the arbitrated loop primitives that cause the switch to create paths between ports includes one or more of the following: ARB, OPN and CLS.

Abstract: A bridged network system (20). The bridged network system comprises a plurality of bridge nodes (N0-N7). Each bridge node in the plurality of bridge nodes is coupled to communicate with at least one other bridge node in the plurality of nodes. Further, bridge nodes in the plurality of bridge nodes are connected to one another to form a communications-possible line of bridge nodes (N0, N7, N6, N5, N1, N4, N3, N2). Each bridge node comprises circuitry for associating a bridge priority, selected from a plurality of bridge priorities, with the respective bridge node. The plurality of bridge priorities may be arranged in an ordered sequence, but the bridge priorities associated with successive bridge nodes along the communications-possible line of bridge nodes comprises at least two discontinuities (N0/N7; N1/N5; N1/N4) in the ordered sequence.

Abstract: A bandwidth brokering system and method incorporating methodology for supporting self-healing communication rings is disclosed. The present invention utilizes state-based tokens that are transmitted on a separate communication channel between network nodes to monitor and correct communication failures occurring at a link, interface, and network node level. The invention as taught permits generic brokering of all available network bandwidth in a granular method without the need for fixed designations of “protection” or “working” communication paths. As such, the present invention permits integration of “protection” and “working” communication data paths to permit full utilization of available system bandwidth with graceful recovery in the event of system or link malfunctions.

Abstract: Systems and methods enable maximizing network data throughput via optimizing network capacity allocation. The network throughput maximization system comprises a network transporting data from source nodes to a destination node of the network, buffers for buffering data bytes to be sent from the source nodes to the destination node, and an element at the destination node that cyclically allocates the network capacity among the source nodes according to the amounts of data bytes arrived in the buffers at the source nodes during the previous capacity allocation cycle. The network data transport capacity allocation optimization method comprises steps of buffering at network source nodes data bytes to be transported to a network destination node, and cyclically allocating by the destination node the data transport capacity among the source nodes based on the relative volumes of bytes received in the buffers of the source nodes during the most recent capacity allocation cycle.

Abstract: In a communications network where first and second nodes are interconnected by communication links, a source node transmits a path setup message for requesting a traffic path to a destination node. Each of the first and second nodes includes routing control means for establishing first and second transport paths on a first fault recovery layer between the first and second nodes. The first node further includes a database for storing identities of the first and second paths as a single virtual link as viewed from the source node. The first node responds to the path setup message from the source node for establishing the traffic path on a second fault recovery layer through the first transport path. The first and second nodes accommodate the traffic path through the second transport path when the first transport path is not working properly.

Abstract: A switch, switched architecture and process for transferring data through an FCAL switch is disclosed. The switch uses multiple switch control circuits each coupled to one FCAL network and all connected to a crossbar switch. The switch control circuits are coupled together by a protocol bus for coordination purposes. Local conversations can occur on each FCAL loop and crossing conversations through the switch can occur concurrently. The OPN primitive is used to establish the connection before any data is transferred thereby eliminating the need for buffer memory in the switch control circuits. The destination address of each OPN is used to address a lookup table in each switch control circuit to determine if the destination node is local. If not, the destination is looked up and a connection request made on the protocol bus. If the remote port is not busy, it sends a reply which causes both ports to establish a data path through the backplane crossbar switch.

Abstract: A core network shared by a large number of edge nodes comprises core nodes interconnected by core channels. Selected core channels are provided with buffers to enable temporal alignment of signals arriving at any core node from several other core nodes. A buffer may be provided at either end of a core channel. Otherwise, all other ports of the core node may be bufferless. Providing such buffers enables the construction of high-capacity wide-coverage network comprising a large number of core nodes shared by numerous edge nodes. Methods of temporal coordination among the network nodes are disclosed.

Abstract: A method of operating a wireless network with a base station and a plurality of outstations comprises transmitting a broadcast signal from the base station and in response to reception of the broadcast signal, transmitting an acknowledgement signal from an outstation. At least some of the outstations serve to relay signals for other outstations. An outstation relaying an acknowledgement signal appends to the signal an identifier identifying the relaying outstation. The base station, upon receipt of an acknowledgement signal, stores any appended identifier(s) for later use in routing signals to the outstation which originated that acknowledgement signal.

Abstract: Described is a method extending the OAM functionality in the RPR networks through a new OAM loopback procedure of request-reply type together with the definition of a new RPR OAM loopback frame. The OAM loopback function allows any RPR station to check the reachability of another RPR station. It is not necessary to stop any data traffic communication on the network in order to perform this function.

Abstract: A method for determining a master ring for an optical communications network having nodes arranged in a plurality of interconnected ring structures. (A master ring is a ring structure which contains every node in the network exactly once, and which also respects the node ordering of every individual ring.) An efficient solution to the master ring problem is provided by advantageously limiting the enumeration process based on the consistency of the enumeration of individual rings with each other. Illustratively, an intersection graph of the network is generated; one or more of the rings is chosen and possible openings of each of these rings are enumerated; and a limited number of possible openings of one or more other (i.e., non-chosen) rings are enumerated such that the enumeration of the possible openings of the other (i.e., non-chosen) rings are consistent therewith.

Abstract: A method for communicating between an operator at an operator device and a user recipient includes enabling an operator of the operator device to enter a device-independent unique identifier for a user recipient by requiring interaction between the operator and the operator device without requiring interaction between the operator and software on the operator device that is designed for communication over an IP-based network. The method includes identifying an IP network address associated with the user recipient based on the device-independent unique identifier and routing a message entered by the operator to the determined IP network address.

Abstract: Connections between communication nodes are established along a ring, with nodes at successive positions along the ring and two-way point to point communication connections between pairs of the nodes at successive positions along the ring. Data addressed to a node is split into parts that are transmitted to the node along opposite directions along the ring. Intermediate nodes forward the data. The nodes monitor the connections and other nodes to detect whether there is a failure of transmission along any direction and, if there is a failure along one of the directions, suppressing transmitting all of the data in a failing one of the directions.

Abstract: An aspect of the invention is physical layer interface for a network interface including a plurality of input/output pins. The input/output pins are coupled for being multiplexed into a physical layer interface selected from among a Reduced Gigabit Media Independent Interface and a Gigabit Media Independent Interface. The input/output pins internal to a programmable logic device are for access to and from a processor block located in the programmable logic device.

Abstract: Local add traffic exchange between separate East and West line cards in a Half-MAC architecture for Resilient Packet Ring networks is provided by a scheduler and a shared transit path between RPR MACs. By sharing the interconnecting bus that is used for the transit of traffic between the two RPR MACs, a path is provided for the local add traffic that needs to be redirected to the other RPR line card.

Abstract: A network component for processing a packet can include a buffer configured to receive a packet, a forwarding unit configured to forward the packet received at the first buffer to a loopback port, and a transmitting unit configured to transmit the packet out of the loopback port. In addition, the network component can include a loopback unit configured to loop back the packet into the loopback port, a first identification unit configured to identify an egress port, and a second transmitting unit configured to transmit the packet looped back from the loopback port out of the egress port.

Abstract: A plug-in card for an optical transmission apparatus includes a J1 byte generating unit. The J1 byte generating unit sends information on on-use side J1 byte data to a plug-in card at a spare side in a redundant structure when the plug-in card operates as an on-use side plug-in card. The J1 byte generating unit receives information on on-use side J1 byte data from a plug-in card at the on-use side when the plug-in card operates as a spare side plug-in card. Based on the information, the J1 byte generating unit matches spare side J1 byte data to the on-use side J1 byte data. The plug-in card also includes a B3 byte calculating unit that operates in a similar way as the J1 byte generating unit does in processing B3 byte data.

Abstract: System and method for dynamically altering bandwidth allocation to each region serviced by a network. Each region is allocated an initial estimated bandwidth on the network and compares instantaneous demand against the allocation. When demand falls below the allocation, the region releases bandwidth so other regions can take advantage of that bandwidth. When demand exceeds the allocation, the region takes advantage of bandwidth released by other regions.

Abstract: A data communication bus and method of operation thereof, including a plurality of nodes connected to a respective plurality of media segments. A typical node includes an output port coupled to a media segment that it exclusively controls. And an input port coupled to a media segment that is exclusively controlled by another node of the bus. Each media segment typically includes a plurality of high speed data channels such as electrical transmission lines.

Abstract: In a ring topology digital network propagation delay is reduced A master node transmits a clock signal into the network in one direction. Each slave node propagates the signal to the next slave node without regeneration until the signal is received by the master node. The amount of time the signal takes to travel around the ring, is measured and is the total ring propagation delay. The master node then transmits a clock signal in both directions to the first slave node which measures the difference in their arrival times and transmits the difference to the master node. The process is repeated for each other slave node. Based upon each difference the master node computes the propagation delay for each ring segment. The master node transmits to each slave node the corresponding ring segment propagation delay and each slave node adjusts the phase of the node's clock.

Abstract: Frame-transfer functional units function as a switch for transferring a frame to a destination retrieved from an FDB. In transferring a frame to a ring selecting unit, the frame-transfer functional units transfers the frame with the frame added with a header in device. RPR functional units execute processing on an RPR frame received from the other communication device or a frame from the frame-transfer functional units with ring processing functional units based on an RPR protocol. The ring selecting unit searches a switch table based on information about the header in device added to the frame with the frame-transfer functional units and the RPR functional units to transfer the frame to a retrieved destination. The ring selecting unit can distribute a frame addressed to one port to plural ports.

Abstract: A failure protection between interconnected adjacent Resilient Packet Rings (RPRs) in a multiple RPR network is provided. Two paths, a regular message path and a protection path, are provided between two adjacent RPRs. The regular path is used for routing inter-ring messages when no failure has occurred on the path. Messages are rerouted through the protection path when a failure occurs on the regular path. Each of these paths has two RPR interface nodes (one for each RPR) that are connected to an interconnection device (a layer 2 bridge or a layer-3 router) through interconnection links. Procedures for detecting failures and generating notifications for message rerouting and fault reports are executed at the interconnection devices. The procedures use periodic keep alive messages for diagnosing network segment and interconnection device failures. The fault detection and message rerouting are accomplished in less than 50 ms.

Abstract: A ring node device includes a main Resilient Packet Ring (RPR) card and a queued RPR card. Upon detection of disconnection of a communication link between the main RPR card and an L2/L3 switch, the ring node device exercises control to switch from the main RPR card to the queued RPR card and carries out communication with the L2/L3 switch.

Abstract: An information platform system, the configuration thereof is able to change flexibly to meet the needs of the customers, and able to use a single adapter for multiple uses, wherein multiple general-purpose processing modules and dedicated processing modules for processing disks and external networks are connected to one another with switching hubs via respective adapters, and the platform system includes a management module having a system identifier management table specifying system type of the general-purpose processing modules, a functional set management table managing a functional set to be included by the general-purpose processing module of each system identifier, and the configuration management table managing the combination of the general-purpose processing modules and dedicated processing modules, and the management module selects a functional set from multiple functional sets, installs the selected functional set into a general-purpose processing module and an adapter, and manages the system conf

Abstract: An apparatus and method for extending digital data transmission link distances provide a mechanism in which data is transmitted over relatively long distances using a repeater to provide data buffering and handle the flow control. The repeater function incorporates large virtual lane receiver buffers in its long distance ports. Enough virtual lanes are implemented so that service level to virtual lane mapping is not required, allowing the repeaters to be made invisible to Subnet Management.

Abstract: A method for multicasting/broadcasting IP data in a mobile communication system, includes the steps of a packet data serving node (PDSN) receiving multicast packet data, transforming the multicast packet data to a PPP frame format having an identification header, transmitting multicast message to base station controller/packet control function (BSC/PCF), the BSC/PCF transmitting multicasting/broadcasting message to all or some of base stations under control of the BSC/PCF according to header information of the multicast message, and transmitting the multicasting/broadcasting message to mobile station through broadcasting channel.