Abstract: A voice packet multiplexer with a voice transit switching function, which is connected to a PBX in an office. It detects an originating logical channel according to digits sent from the PBX, and sets, when transmitting a signal packet or voice packet, the detected originating logical channel in its address field. It also stores an originating logical channel while receiving a packet from a packet communication network. It further extracts an office number from a received packet containing the digit information, makes a decision whether the office number is the number of its own office or of another office, and retrieves, if it is of the another office, a terminating logical channel for establishing connection with that office. To carry out the voice transit switching after determining the terminating logical channel, it transmits a packet after translating its address field into the terminating logical channel or into the originating logical channel.

Abstract: A bridge (62) capable of reducing unwanted WAN multicast packet traffic in a LAN and an associated method and an associated LAN is disclosed. The bridge examines the contents of WAN multicast query and report packets and WAN multicast router-to-router discovery packets and includes this information in its filtering database (88). The bridge designates ports on which query packets or MRRDPs are received as router ports. When there is no WAN router generating multicast query packets into the LAN, the bridge simulates the behavior of a WAN router and generates WAN multicast query packets so as to cause report packet generation by end systems. A timeout interval for undesignating router ports and a method for determining an appropriate timeout for a port is disclosed.

Abstract: In a synchronous multiplex network including a plurality of multiplex transmission apparatuses, an overhead is passed through intervening multiplex transmission apparatuses such that administration and maintenance operation information is transmitted and received through the overhead between arbitrary multiplex transmission apparatuses. The multiplex transmission apparatus receives a multiplexed signal comprising a payload having a plurality of main signals multiplexed therein and overhead bytes including a plurality of administration and maintenance operation information, performs termination processing for the administration and maintenance operation information and transmission processing for the payload, thereafter converts the multiplexed signal into a different multiplexed signal comprising a payload which has been processed for transmission and a plurality of administration and maintenance operation information, and transmits the different multiplexed signal.

Abstract: A mechanism for performing multicast packet transfer when a certain one of the destination nodes participating in the multicast communication requires resource reservation for a certain packet flow specified among the packet flows to that destination node. A system may transfer multicast packets using a plurality of virtual connections based on which flow the packets to be transferred belong to, so that each node receives the packets without duplication. Alternatively, a system may selectively discard received packets to avoid processing duplicated packets, although duplicated packets are received at each node.

Abstract: A scheduler in accord with the invention schedules available bit rate (ABR) traffic over an asynchronous transfer mode (ATM) link in such a manner as to provide circuits having the ABR traffic service a minimum cell rate (MCR) that may be greater than zero. The scheduler uses static scheduling information to schedule traffic for high priority services, such as constant bit rate service. The static information also specifies transmit opportunities for an ABR circuit, in a manner analogous to that for CBR traffic. The statically scheduled transmit opportunities provide a negotiated minimum cell rate that is greater than zero, for the ABR circuit. The scheduler maintains dynamic scheduling information, which it uses to schedule traffic in otherwise available transmit times. For example, the scheduler may use the dynamic information to create a work list of virtual circuit connections for ABR service. During any cell transmit time that is not used by a higher priority service (e.g.

Abstract: A port aggregation protocol (PAGP) dynamically aggregates redundant links between two neighboring devices in a computer network through the exchange of aggregation protocol data unit (AGPDU) frames between the two devices. Each AGPDU frame contains a unique identifier corresponding to the device sourcing the frame and a port number corresponding to the port through which the frame is forwarded. The exchange of AGPDU frames and the information contained therein allows the neighboring devices to identify those ports corresponding to the redundant links. Each device then dynamically aggregates its ports corresponding to the redundant links into a logical aggregation port (agport) which appears as a single, high-bandwidth port or interface to other processes executing on the device.

Abstract: A method is provided for admitting new requests for service in a shared resource having a capacity. The new request has service priority levels associated therewith. In one embodiment of the invention, for example, the shared resource may be a packet communications network and the service request may be a request to admit a new connection. The method proceeds as follows. First, for each service priority level on said shared resource, a total effective bandwidth is generated which is represented by a sum of individual effective bandwidths of previously admitted requests for service. Subsequent to receiving a new request for service having a specified priority of service level, a plurality of effective bandwidths are accessed for the new request. The plurality of effective bandwidths are respectively associated with the specified service priority level and service priority levels therebelow.

Abstract: In CDMA mobile communication of the packet switching mode which is one-way, the packet is transmitted to divide to a frame unit. In this time, the first, the second and the third transmission timing which are obtained to divide to three pieces the predetermined frame are set up for increasing the transmission efficiency by realizing the retransmission of the frame unit, as the transmission timing of a backward control signal in a backward channel,. Base station 100 transmits a forward signal (a forward control signal and an user data signal) by using code A (a forward channel) at any frame. When the forward signal is received at this frame by mobile station 70, mobile station 70 transmits a receiving acknowledgment signal (a backward control signal) of the forward signal by using code A' at the first transmission timing of the next frame.

Abstract: A method is disclosed for operating a mobile station (10). The method includes a first step of receiving a forward channel from a base station (30), the forward channel being transmitted to contain repeating frames each comprising N time slots, individual ones of the time slots including a synchronization word. A second step of the method correlates an i.sup.th one of the N time slots using a first correlation sequence (SYNC 1) and a second correlation sequence (SYNC 4) to obtain a first correlation result and a second correlation result, respectively. A third step of the method declares the forward channel to be one of a half-rate channel or a full-rate channel based on the first and second correlation results. In an exemplary embodiment N is equal to six, and i is equal to four. In the exemplary embodiment the first N/2 of the time slots are transmitted to have a same sequence of N/2 synchronization words whether the channel is a half-rate channel or a full-rate channel.

Abstract: In a telecommunications network, broken connections can be detected and located through a next hop loopback technique. The next hop loopback technique involves the generation, transmission, and analysis of specialized data packets which attempt to traverse a telecommunications connection, node by node. The failure of a data packet to properly traverse a link can then be used to determine whether a connection is broken, to notify the network management system as to the location of the broken connection, and whether appropriate action is warranted so that the network operator can re-route data around that portion of the network. In addition, the next hop loopback technique can be triggered on an "as needed" basis by the end user, rather than on a periodic basis, thereby conserving network time and resources.

Abstract: In order to reduce messaging within a wireless communication system an emulator (137) is provided that receives multicast packet data from a router (138). The multicast packet data is transmitted from a server (120) and destined to at least one remote unit (113-117). The emulator (137) additionally receives control data for the current multicast session from the router (138). The first set of data is transmitted to the remote unit (113-117) and the emulator (137) responds to the control data (via a response message (134)) without transmitting the control messages to the remote unit (113-117).

Abstract: It is objected to simplify a procedure concerning bandwidth acquisition. Bandwidth acquiring means 809 of a second transmitting apparatus 814 acquires a bandwidth which was used by a first transmitting apparatus 806 by using a propagation delay identifier 804 read from first transmitting apparatus 806 and a maximum transmission data size 805 after stopping transmission of first transmitting apparatus 806. Each apparatus is composed so that transmission is started using this bandwidth and because returning and re-acquisition are not accompanied when the transmission is switched, necessary procedure can be simplified. Further, it is possible to effectively use the bandwidth by using a propagation delay identifier.

Abstract: In a multi-point mobile radio broadcast network, the multiple mobile radios can have personality information reprogrammed via a broadcast method, rather than on a one-to-one basis. A communications manager, which controls the communications between the various mobile radios can change the personality information contained in each radio by broadcasting that information to the radios as a group. After receiving the new personality information, a processor within the mobile radios can remove the unique identification codes associated with that particular radio from the old personality information, imported into the new personality information communicated to it by the communication manager, and store the new personality information with the newly incorporated unique identification codes into a local memory. The protocol for broadcasting the personality information to the mobile radios is important to ensure that the mobile radios receive the new personality information.

Abstract: A method in a connection based communication network for rerouting a call connection path coupling a calling and a called party. Rerouting is done within a peer group and may be performed in any peer group level along the connection path. The method allows individual segments within peer groups to be rerouted for a number of different reasons such as fault recovery, route optimization, bandwidth adjustment, and load balancing. The reroutable call paths are implemented by inserting rerouting information elements in the standard setup and connect messages used to create call paths in PNNI environments. These information elements permit both nonpreemptive rerouting, establishing a new call path before the old one is terminated and preemptive rerouting, establishing a new path after the old one is terminated. Additional features such as, preserving QoS metrics during rerouting and separately identifying different incarnations of segments along the same call path are also provided.

Abstract: A variable delay circuit is formed by a fine delay circuit and a coarse delay circuit. The fine delay circuit adjusts the delay of a delayed clock signal in relatively small phase increments with respect to an input clock signal. The coarse delay circuit adjusts the timing of a digital signal in relatively large phase increments. The delayed clock signal is used to clock a register to which the digital signal is applied to control the timing a the digital signal clocked through the register responsive to adjusting the timing of the fine delay circuit and the coarse delay circuit. The timing relationship is initially adjusted by altering the delay of the fine delay circuit. Whenever the maximum or minimum delay of the fine delay circuit is reached, the coarse delay circuit is adjusted. The variable delay circuit may be used in a memory device to control the timing at which read data is applied to the data bus of the memory device.

Abstract: A remote communications server system enables multiple remote users simultaneous access to a network. The system connects a plurality of on-line sessions across multiple communication lines to the network. A unique combination of multiple buses, multiple processors, and a segmented design creates a distributed processing communications system having high throughput without the stability problems associated with gigabit bus speeds. Furthermore, the system supports a mixture of communication links and allows the substitution of one service type for another without affecting the remaining communication links. The system is scalable in that segments can be added as needed and the number of lines handled by a segment can be increased.

Abstract: A computer booking system is provided for booking individual ones of a set resources to users of the resources. The resources may be, for example, channels between multiplexes in a telecommunications network. The database creates a pair of data nodes for each booking. Each node has a user field for specifying the user for whom the booking is scheduled, an event field for specifying whether the event associated with the node is the beginning or end of a booking, and a time field for specifying the time at which the event is scheduled to occur. Each node is also located in a single linked list (the time list) of nodes in which the nodes are arranged in order of their event times. Each node is also located in a respective of a set of lists (the value lists). The value lists are arranged in order of rank and each new node is located in the value list of the lowest possible rank.

Abstract: Each packet normally consists of a preamble, start-of-frame delimiter and data. The preamble has nibbles each having a particular format. A header substituted for preamble nibbles by an individual one of the originating devices in a plurality, and an individual one of the ports in such originating device, indicates such originating device and such port. Such port in such originating device sends such modified packet to others of the originating devices and to an observing station. The header format is such that the last nibble in the header and the remaining preamble portion will not be confused with any two (2) nibbles in the header. A particular one of the originating devices indicated in the data converts the header back to the preamble format and transmits the converted packet to a receiving station. The observing station records the individual originating device, and the individual port in such device, indicated in the header.

Abstract: A synchronous bus system that enables the bus lengths between devices to be extended such that the timing budget is more than one clock cycle. A reset process resets the transmission and reception circuitry and both circuitry function according to prespecified parameters relative to the deassertion of the reset signal such that the amount of logic required to latch and sample the data is minimized. As the timing budget is not limited to one clock cycle, devices can be spaced further apart providing more physical space for devices. Furthermore, skew sensitivity is reduced as the skew is distributed over multiple clock periods.

Abstract: The common-wave broadcasting of radio programs is known in the art. Common-wave operation of radio transmitters allows the available transmission band width to be particularly well utilized, for example for national scale common-wave broadcasts. A new process now allows a stereo transmission channel to be divided into two mono transmission channels during radio broadcasts and to broadcast certain programs only through particular transmitters. Information concerning the division of the stereo transmission channel into two mono transmission channels is further broadcast over the entire common-wave transmission network. This information causes receivers tuned to this transmission channel to automatically switch to mono evaluation of the reception signal. On a regional level, information may also be broadcast concerning which of both mono transmission channels may be received. Alternatively, the receiver or user himself may select the mono transmission channel he wishes to receive.