Abstract: The Domain-based Congestion Management method and apparatus detects and regulates congestion in a Diff-serv network. It use an improvRED method for congestion detection at the core routers and token bucket filters for traffic regulation at the ingress nodes. In addition, improvRED also provides feedback control. ImprovRED uses three thresholds for detecting congestion: a minth, a maxth and a FeedbackThreshold, which lakes a value between the minth and the maxth thresholds. Whenever the average queue size is greater than minth and less than Feedback-Threshold, all outgoing packets are marked appropriately to indicate a potential onset of a congestion period. When the average queue size is greater th FeedbackThreshold (but less than maxth) packets are dropped probabilistically and all the outgoing packets are marked appropriately to denote the dropping phase. When the average queue size is greater than the maximum threshold, all incoming packets are dropped.

Abstract: A method of mirroring data to a mirrored to port in a plurality of switches. The method has the steps of determining if data was sent to all of said plurality of switches; determining if said data was sent to a mirrored to port (MTP); and resending said data to all of said plurality of switches if mirroring is enabled and said data was not sent to said MTP.

Abstract: A circuit for detecting a serial signal comprises a first circuit (400) coupled to receive the serial signal (200) during a predetermined plurality of time periods of substantially equal duration. The first circuit is coupled to receive a first code (414). The first circuit is arranged to compare a part of the serial signal corresponding to each time period of the plurality of time periods to the first code, thereby producing a match signal. The first circuit accumulates the match signal from each of the each time period of the plurality of time periods.

Abstract: A method and system for computer network physical layer analysis is describe using signal analysis techniques and beginning with time-domain responses to yield highly quantitative analysis of the computer network's physical layer. Specifically, multiple transmissions are accumulated into a composite response of the computer network link. This composite response is then used as the basis for analysis of the computer network link. Further, an automated process is described for location of an arbitrary termination of a link.

Abstract: The object of the invention is a method for controlling a data transfer connection, terminal equipment and a data transfer system wherein at least two subscriber stations are connected to one subscriber connection of the data transfer system. The invention can be preferably applied, for example, in Wireless Local Loop networks, i.e. in WLL systems. One idea of the invention is that information relating to subscriber stations which have been connected to the subscriber connection is stored in the data transfer system and this data is exploited in switching an incoming connection to the correct subscriber station and in setting the data transfer procedure of an outgoing connection to correspond to the subscriber station being used. Terminal equipment according to the invention comprises preferably switches (416, 417) which are controllable by the processor of the baseband part (412) for switching the connection to the correct subscriber station.

Abstract: To achieve an improved support for introduction of server pools in packet networks and further to achieve transparency for applications the present invention provides a communication apparatus running a protocol stack implementation for interworking between a signaling source node and a signaling target node. The communication apparatus comprises a first protocol implementation unit (SCTP) adapted to run a signaling control layer on top of a packet transfer network (IP) for exchange of signaling messages via at least one signaling association. Further, the communication apparatus comprises a second protocol implementation unit (SUP, M3UA) adapted to run a user adaptation layer on top of the signaling control layer (SCTP) for support of signaling connection control services (RANAP) used by the signaling source node. A name mapping unit is adapted to receive a signaling target node name from the signaling source node and to map the signaling target node name into a peer signaling association.

Abstract: A network communication device for directing data units over a communication network includes at least one input and/or output port arranged to receive and/or transmit data units, a plurality of buffer units divided into several sub-pools, and a buffer allocator for allocating buffer units between the sub-pools. The buffer allocator is arranged to determine a priority value for each sub-pool based on quality of service for each connection established at at least one port. The buffer allocator is also arranged to determine a utilization value of the port, and arranged to allocate buffer units for each sub-pool based on the priority value and based on the utilization value. The buffer allocator creates a precedence list to ensures that a minimal number of connections, which are established at a most utilized port, will suffer data unit loss while receiving the data units.

Abstract: A method and apparatus for adaptively enforcing Quality of Service (QoS) policies for one or more flows of packets in a packet-switched network based on network feedback information. In one aspect, packets of a first group of flows are assigned to a first service level. Then-current interface congestion information for network traffic that is mapped to the first service level and that is passing through an interface of a network device in the network is received. Based on the then-current interface congestion information one or more flows from the first group of flows are selected. Packets from the one or more flows are then assigned to a second service level.

Abstract: A truss assembly apparatus and a method for assembling a truss utilizing the apparatus, the apparatus comprising a truss table having a work surface divided into a first and second assembly zone. The apparatus further includes first and second clamping assemblies for clamping the truss in the first and second assembly zones. The apparatus includes a flip-over assembly having a flip-over arm movable relative to the truss table for moving the truss from a first truss position in the first assembly zone, wherein a first truss face contacts the work surface, to a second truss position in the second assembly zone, wherein a second truss face contacts the work surface. The flip-over arm is movable between a home position adjacent said work surface and an extended position, wherein the flip-over arm may be perpendicular to the work surface. In another alternative, at least a portion of the flip-over arm may extend over the second assembly zone when the flip-over arm is in the extended position.

Abstract: An Interworking Gateway enabled to provide continuous conversion of Protocol Data Units (PDUs) of any one of a provisioned set of transport protocols to any other member of the set is disclosed. Each transport protocol is associated with at least one transport protocol unit comprising at least one signaling port, at least one receive path, and at least one transmit path. Receive paths are adapted to convert PDUs of respective transport protocols into a base format, and transmit paths are adapted to convert a stream of base format data into PDUs of respective transport protocols. Transport protocol units are autonomous modules. The Interworking Gateway permits telephone services to extend across different broadband telephony networks in today's telecommunications system of networks.

Abstract: A method and system for establishing a Systems Network Architecture (SNA) session between SNA resources through a packet/cell switching network. The packet/cell switching network includes an origin access node that provides client access services, and at least one destination access node that provides server access services. In accordance with the method of the present invention a SNA session request is received from a source SNA resource for establishing an SNA session with a target SNA resource. An undirected message is broadcast over the packet/cell switching network to identify the destination access nodes that support the source SNA resource and that provide server access services. One or more positive replies are received from respectively one or more of the destination access nodes that support the source SNA resource and that provide server access services.

Abstract: A communications system includes N parallel communications channels connecting first and second devices. The N channels may include N−1 channels for carrying information symbols, and an Nth channel for facilitating deskewing and word framing. The first device may include an alignment symbol generator for generating alignment symbols on the Nth channel, and a word framing code generator for generating word framing codes on the Nth channel. The second device may include a deskewer for aligning received information symbols based upon the alignment symbols, and a word framer for determining word framing based upon the word framing codes. The word frame code generator in the first device or transmitter, and the word framer in the second device or receiver provide the desired feature of knowledge of where each word starts or begins. The start of each word may be determined in terms of a time and a corresponding one of the N−1 channels where the word starts.

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: Methods and apparatus are disclosed for propagating timestamp floors throughout a packet switching system and using the timestamp floors received at a first component of the packet switching system to determine when a packet may be sent from a packet switching system. Each input of a first stage of a packet switching system maintains a floor register which is updated by copying the timestamp from each arriving packet. In some systems, if a packet is not received during a packet time, the timestamp is automatically updated, typically by adding a fixed time value. Periodically, the first stage switching element forwards a timestamp floor to the next stage switching elements. In one implementation, this distributed timestamp floor is the lesser of the earliest timestamp in one of the floor registers in the input queues, and the earliest timestamp in an output queue for the particular next stage switching element.

Abstract: A system for determining an order of service of temporarily stored objects, at least one priority flag being attached to certain objects, includes a set of storage units disposed in a matrix organized into C subsets of elements, where C is the number of objects stored temporarily. Each subset corresponds to an object and all the subsets include the same number P of elements corresponding to P time positions. Each element includes a memory which can receive at least one time priority flag. A first time position selector determines, within the matrix, and from all the subsets, the element(s) marked by a particular time priority flag and corresponding to the time position having the lowest value.

Abstract: A network switch and a method for data switching using a crossbar switch fabric with output port groups operating concurrently and independently that increases throughput and reduces scheduling complexity. The network switch includes a crossbar switch fabric, plurality of output port groups, and a plurality of input ports. The crossbar switch fabric includes a plurality of inputs and outputs. The plurality of output port groups operate concurrently and independently, and each output port group includes one or more output ports and is configured to receive a packet from one of the outputs of the crossbar switch and to send the packet to an output port. The plurality of input ports are coupled to an input of the crossbar switch fabric and configured to send packets to the crossbar switch fabric through the input of the crossbar switch fabric.

Abstract: A network architecture for use in a data traffic network that includes a plurality of nodes and a plurality of data links coupling the nodes. The network architecture includes a working data link(220) that forms a signal pathway between a first router (200) and a second router (210) within the network. A protection data link(255) is likewise provided and forms a second signal pathway. The routers (200, 210) include both working data ports (312) and protection data ports (314) with each port including associated transmit and receive terminals. A combination of line splitting devices (250), line selection devices (260) and switch arrays (430, 435) are used to switch the flow of traffic data from the working data link (220) to the protection data link (255) or a protection channel (450) as is appropriate.

Abstract: The invention relates to a way of implementing the so-called “late” check according to IEC 61883 in a link layer IC for the IEEE 1394 Serial Bus in a way which is favourable in terms of expenditure. According to the invention, a specific time model is used which, during the checking of the up-to-dateness of a data packet by comparison with the current bus time, also substantially simplifies the necessary comparison operations by virtue of the fact that it is possible to represent only sections of the time axis by means of a data word with limited bit length.

Abstract: A method and apparatus for efficiently transporting DS-X traffic in packet form over an ATM or other packet network. Specifically, virtual connection or slot provisioning and/or cell concentration techniques are used to compact the amount of DS-X traffic broadcast between communications system devices such as the access mux and the communications switch and spare bandwidth. In provisioning, a configured DS-X loading of an end node supporting DS-X traffic is ascertained. In turn, a minimum number of virtual connections for bearing packetized DS-X traffic are established, either at communications system configuration or as needed. In concentration processing, a dynamic association between the virtual connections and the DS-X traffic is established, typically on a per frame basis. Only those digital channels entering the node within a given time frame which actually bear DS-X traffic will be assigned a slot within packet. Concentration may be augmented by provisioning to further reduce bandwidth requirements.

Abstract: A node for use in a multi-source ring transmission system includes a controller and storage. Identifiers, such as ring addresses, for the relative first and relative last source nodes within the ring transmissions system are stored within the node's storage, in a squelch table for example. The node's relative first source node is the source node farthest upstream from the node and the node's relative last source node is the node that is farthest downstream from the node. The node blocks communications whenever both its relative first source node and its relative last source node fail.