Abstract: In a local area network path control system, hubs are connected in a ring and classified into two groups. Each of terminals has two LAN controllers. One of LAN controllers is connected to one of the hubs belonging to one of the groups while the other is connected one of the hubs belonging to the other group. One of the LAN controller is used as an active controller and the other is used as a standby controller. Each of the terminals has a destination information table registering destination IP addresses and destination MAC addresses of the other terminals. When the terminal detects failure occurring between the active controller and the corresponding hub, it changes the active controller from one to the other of the two LAN controllers. Furthermore, the terminal notifies a newly MAC address for communicating with the terminal to the other terminals.

Abstract: An internet based telephone apparatus for embodying a telephone-to-telephone type of internet based telephone, the apparatus having a gateway function where a communication is possible between a general telephone connected via PSTN with another internet based telephone connected through internet network without separate internet telephone gateway installed between the internet network and PSTN, and a dual channel communication function where a communication is possible by being connected to a third internet based telephone when there is a communication connection between a general telephone connected via PSTN and a second internet based telephone connected through internet network.

Abstract: A method and apparatus is described for providing rate adaptation between a first node and a second node in a data communication environment employing bit stuffing and having a link budget of B bits per second. One or more N-sized frames of user data are randomized at the first node according to a predetermined random sequence to produce randomized N-sized frames which are then de-randomized at the second node according to the random sequence. N is the size of the N-sized frames in bits. Occurrences of a flag sequence related event is detected for in the N-sized frames after randomizing, and up to n bits are inserted in the N-sized frames according to a bit stuffing protocol. By performing randomizing before inserting, n and N are selected such that n+N does not exceed B. The bits are then removed such that de-randomizing can be performed. Randomizing includes combining N-sized frames with a random sequence and de-randomizing includes uncombining the N-sized frames with the random sequence.

Abstract: A transmission channel response calculation section calculates first to n-th transmission channel responses and stores the calculated first to n-th transmission channel responses in a memory section. A correlation calculation section obtains correlation values of the second to n-th transmission channel responses to the first transmission channel responses, respectively, and outputs the obtained correlation values to a transmission channel response synthesis section. The transmission channel response synthesis section gives weights according to the correlation values, weight-synthesizes the first to n-th transmission channel responses, and obtains a synthesized transmission channel response. An influence of noise on the synthesized transmission channel response is reduced. A distortion compensation section eliminates a distortion of the reception signal using the synthesized transmission channel response.

Abstract: In an address resolution method for an inter-working function (IWF) for mutually connecting mobile packet terminals (MS) and a radio system accommodating the packet terminals (MS) and a packet network having a switch node, when the packet terminal (MS) is handed over, the packet terminal (MS) transmits a kind of “address resolution protocol (ARP): see Internet Engineering Task Force Document RFC826”, the inter-working function (IWF) transmits the ARP packet to the packet network and the switch node renews an address management table on the basis of the packet received.

Abstract: A packet conversion device provided at the entrance/exit of a network that rewrites the header of a multi-cast data transfer packet and inputting the packet to the network as a uni-cast data transfer packet, and/or rewriting the header of the uni-cast data transfer packet received from the network and outputting the packet as a multi-cast data transfer packet.

Abstract: A partner appliance that communicates with a mobile node is connected via a communication network with a home agent and a foreign agent that relay the communication between the mobile node and the partner appliance. When the mobile node, moving during the communication, comes to be connected to a foreign link of the foreign agent, a moved address is assigned thereto. If the mobile node receives call setup request information regarding data transmission from the partner appliance via the home agent while moving, it determines, based on the received call setup request information, whether real-time transmission is required for the data. If so, the mobile node notifies the partner appliance of the moved address assigned thereto. When the moved address is notified, a communication path is established between the mobile node and the partner appliance, and the partner appliance sends the data to the mobile node via the communication path based on the moved address notified.

Abstract: In a packet relaying apparatus, a label distribution protocol processor performs a label assignment so that labels which a label management portion of its own processor manages and which the label management portion of an adjoining packet relaying apparatus manages are assigned in mutually reversed orders within a label available range when a directionality is determined to be unidirectional. In addition, an incoming label and an outgoing label assigned to a unidirectional FEC can be used as the outgoing label and the incoming label assigned to another FEC opposite in direction to the former FEC.

Abstract: Virtual Local Area Network (VLAN) trunking over Asychronous Transfer Mode (ATM) Permanent Virtual Circuits (PVC), defined as VTAP, allows for aggregation of multiple VLAN traffic into a single data pipe in a Wide Area Network (WAN) environment. The largest benefit for the user is that a single PVC can be utilized to aggregate all of their VLAN traffic between two sites. Packets to be transmitted between two switches are first encapsulated with a VTAP header that contains pertinent information as to allow the receiving switch to process and forward the packet at the switch. Certain information contained in the VTAP is also used to determine the virtual path identifier/virtual channel identifier (VPI/VCI) of the destination switch wherein the packet is segmented into ATM cells having VPI/VCI prefixed to it for forwarding via the ATM network.

Abstract: One embodiment of the present invention provides a system that facilitates asynchronously routing data within a circuit. This system includes a data destination horn, for routing data from a trunk line to a plurality of destinations. This data destination horn includes a plurality of one-to-many switching elements organized into a tree of at least one level that fans out from the trunk line to the plurality of destinations. It also includes a plurality of memory elements for storing data in transit between the plurality of one-to-many switching elements. An asynchronous control structure is coupled to the data destination horn, and is configured to control the propagation of data through the data destination horn, so that when a given data item appears at an input of a memory element, the given data item is asynchronously latched into the memory element as soon space becomes available in the memory element without having to wait for a clock signal.

Abstract: A network switch, configured for performing layer 2 and layer 3 switching in an Ethernet (IEEE 802.3) network includes a network switch port having a filter configured for evaluating an incoming data packet. The filter includes a min term memory configured for storing min term values. Each min term value is stored based on a location of a corresponding selected byte of the incoming data packet for comparison. Each min term is stored as a table entry having an expression portion specifying a corresponding comparison operation and a template identifier field that specifies templates that use the corresponding min term. The template identifier field includes an equation identifier. A min term generator is configured for simultaneously comparing a received byte of the incoming data packet with the min terms that correspond to the received byte and generates respective min term comparison results.