Abstract: Mechanisms for reducing the number of block masks required for programming multiple access control lists in an associative memory are disclosed. A combined ordering of masks corresponding to multiple access control lists (ACLs) is typically identified, with the multiple ACLs including n ACLs. An n-dimensional array is generated, wherein each axis of the n-dimensional array corresponds to masks in their requisite order of a different one of the multiple ACLs. The n-dimensional array progressively identifies numbers of different masks required for subset orderings of masks required for subsets of the multiple ACLs. The n-dimensional array is traversed to identify a sequence of masks corresponding to a single ordering of masks including masks required for each of the multiple ACLs.

Abstract: A processor includes scheduling circuitry and an associated interval computation element. The scheduling circuitry schedules data blocks for transmission from a plurality of transmission elements, and is configured for utilization of at least one time slot table in scheduling the data blocks for transmission. The interval computation element, which may be implemented as a script processor, is operative to determine an interval for transmission of one or more data blocks associated with corresponding locations in the time slot table. The transmission interval is adjustable under control of the interval computation element so as to facilitate the maintenance of a desired service level for one or more of the transmission elements.

Abstract: A method and methodology are provided for classifying Internet Protocol (IP) data in a packet switch network. Data may be received at a first node and classified based on source routing information of said data. The source routing information may be provided within LSRR/SSRR of IPv4 data or may be provided within a routing header of Ipv6 data.

Abstract: An infiniband architecture switch, includes a plurality of ports each configured to receive switch parameters, identify at least one data-packet error condition responsive to the switch parameters, generate a trap-initialization signal when the at least one data-packet error condition matches a trap-error condition, and a switch manager configured to receive the trap-initialization signal. A method for generating a switch manager control signal includes identifying at least one data-packet error condition in an infiniband architecture switch, determining when the at least one data-packet error condition matches a trap-error condition, generating a trap-initialization signal responsive to the trap-error condition, and forwarding the trap-initialization signal to a switch manager.

Abstract: Mobiles are sorted by using a first metric and one or more of the sorted mobiles are selected. A second metric is determined using the selected sorted mobiles, and mobiles are selected to transmit during a time period based on the second metric. Multiple embodiments are disclosed using these steps and exact or approximate solutions as to which mobiles should transmit may be determined. By way of example, the first metric may be a weighted marginal rate and the second metric may be an objective function. An uplink proportional fair technique is presented in which, for example, either a single “strong” mobile or a group of “weak” mobiles may be selected to transmit during a single time period. In addition, techniques are presented for determining uplink scheduling when there is partial orthogonality in Walsh codes, modeled by an orthogonality factor, assigned to mobiles.

Abstract: A communication device integrates traffic monitoring, policy configuration and enforcement, and proxy services within the device. The policies can affect both prioritization of data as well as allocation of communication bandwidth. Data packets that are accepted at the device are classified according to a set of defined classes and are transmitted through the device according to a policy for prioritization and bandwidth allocation for the classes. Optionally, some of the packets are passed to a proxy application hosted in the communication device. The device functions as a link-layer bridge, thereby allowing the device to be inserted into a data path without reconfiguring network layer software at devices that use that data path. The device includes operating modes in which packets are passed through the device without modification.

Abstract: Equivalence among bit-permuting networks and the mechanisms for the conversion between equivalent networks. Multistage switching networks in the bit-permuting type and banyan-type can be classified into equivalence classes. One network can usually be replaced by another equivalent network in certain applications. This widens the choices of networks in meeting different requirements in applications.

Abstract: A robot apparatus having a robot and a controller for controlling the robot. The apparatus has a diagnosing computer connected to the controller and acquiring a state quantity of the robot. An analyzing computer is provided remotely from the robot and has a control parameter adjuster for adjusting a control parameter of the robot, and a communicating function of connecting the computers. The state quantity is transmitted to the analyzing computer by the communicating function and a control parameter of the robot is obtained based on the state quantity. The control parameter is transmitted to the controller through the diagnosing computer to control the robot.

Abstract: Modifications to the 2-stage interconnection to allow flexible scalability. Different switching fabrics having a range of different sizes can be constructed out of the same set of I/O switching nodes through this modified 2-statge interconnection, which can further be recursively invoked to construct large switching fabrics with desirable sizes. The recursive construction incorporating the modified 2-stage interconnection can seamlessly be realized through the five hierarchical levels of physical implementation, including inside-chip implementation, PCB implementation, orthogonal packaging, interface-board packaging and fiber-array packaging. The routability of the resulting switching fabric is always guaranteed and self-routing mechanism is also pertained.

Abstract: A generalized divide-and-conquer network and concomitant methodology for recursively constructing large-scaled switching fabrics to meet the need for present-day broadband switching. Such a network achieves optimal layout complexity among the class of banyan-type networks under the 2-layer Manhattan model with reserved layers, which has been the most popular layout model for CMOS technologies. Moreover, the network achieves optimal structure modularity that minimizes the number of different components required at each step of the recursive construction. The recursive construction of a 2n×2n generalized divide-and-conquer network can be readily mapped by an n-leaf balanced binary tree.

Abstract: Broadband switching including the implementation of and control over a massive sub-microsecond switching fabric. To effect the attributes of the switching fabric, conditionally nonblocking components are used a building-blocks in an interconnection network which is recursively constructed. The properties of the interconnection network are preserved during each recursion to thereby configure the massive switching fabric from scalable circuitry.

Abstract: Broadband switching including the implementation of and control over a massive sub-microsecond switching fabric. To effect the attributes of the switching fabric, conditionally nonblocking components are used a building-blocks in an interconnection network which is recursively constructed. The properties of the interconnection network are preserved during each recursion to thereby configure the massive switching fabric from scalable circuitry.

Abstract: A transmitter is provided for simultaneously transmitting a plurality of signals in a plurality of directive beams to corresponding destination stations, each destination station located in a separate fan within a service area. The transmitter includes a plurality of beamformers, each beamformer receiving one of the signals to be transmitted to an associated fan, each of the beamformers having a plurality of outputs for each different signal to be transmitted. A plurality of Butler matrices each receive one of the plurality of outputs from the plurality of beamformers for each different signal to be transmitted, each Butler matrix having a plurality of outputs in phased relationship to one another, wherein each of the signals to be transmitted is simultaneously provided across the outputs of each Butler matrix in a phased relationship.

Abstract: A method and a system for errorless switching, in a telecommunication network, from a basic data stream to a copy of the basic data stream obtained by bridging of the basic data stream at a first network node, being characterized in that the switching is performed at a second network node receiving both the basic data stream and the copy data stream, upon performing an operation of delay equalization between the basic data stream and the copy data stream.

Abstract: A common part sublayer (CPS) ATM adaptation device provides an interface between a narrow band network and a broad band network. The adaptation device is functionally partitioned to provide scheduling, prioritization and multiplexing of ingress traffic to the broadband network independently of the adaptation layer (AAL) type of that traffic. The device incorporating ingress and egress paths respectively to and from the broadband network. The egress path provides segregation and delineation of incoming data units on to respective external data ports, and the ingress path incorporates a common memory for payload storage whereby to perform multiplexing at both AAL and ATM layers.

Abstract: Broadband switching including the implementation of and control over a massive sub-microsecond switching fabric. To effect the attributes of the switching fabric, conditionally nonblocking components are used a building-blocks in an interconnection network which is recursively constructed. The properties of the interconnection network are preserved during each recursion to thereby configure the massive switching fabric from scalable circuitry.

Abstract: A method for selecting packets comprises pipelining execution of packet selection processes so that execution of each of the packet selection processes occurs at different levels of a scheduling hierarchy. At least two different packets are selected at two different times in response to execution of the packet selection processes.

Abstract: An arbitration scheme is used for scheduling connections between input ports and output ports. Input ports request connections to the output ports for a next time slot. Arbitration parameters, such as priority and weight, are identified for the buffer requests. Output port arbitrations are conducted for each one of the output ports according to the arbitration parameters. If there are more than two input buffers with the same priority and weight, a round robin arbitration is used. Grants are issued to the input port buffers winning the output port arbitrations. Input port arbitrations are conducted using the same arbitration parameters for input ports receiving multiple grants. The grants are accepted by the input port buffers winning the input port arbitrations. The input port buffers accepting the grants are connected to the requested output ports.

Abstract: The invention is related to a switching arrangement for transporting data packets which comprise a section with data packet destination information and a payload section, to one or more output ports. The switching device is able to route the arriving data packets according to the data packet destination information, to at least one dedicated of the output ports. It comprises at each input port an input buffer with at least as many single input queues as there are output ports, and an input controller for each input port, serving for controlling the order of multiplexing the data packets from the input queues of the corresponding input buffer to the switching device.

Abstract: A method to calculate network latency includes correlating a first packet identifier recorded at a first network location with a second packet identifier recorded at a second network location, wherein the first and second packet identifiers indicate a common first packet and have respective first and second timestamps associated therewith. A first network traversal time for the first packet is calculated as the difference between the first and second timestamps associated with the first and second packet identifiers respectively. The network traversal time for the first packet is then the graphically display.

Abstract: Superconductor technology and Batcher banyan switching technology are combined and implemented as a practical component in a single cryo-MCM substrate (10) containing a plurality of superconductor chips (37, 38, 39, 41, 42, 43, 44, 46, 48, 49, 51, 53 and 55) arranged in a plurality of rows and columns. Wiring (52) on the substrate connects the chips in each row of a number of the columns (41, 43, 45, 47, 49, 51 & 53) serially to collectively define a Batcher sorter. Other wiring (52) connects the chips in each row of a number of other columns (40, 42, 44 & 48) in reverse banyan and banyan networks. The foregoing includes a novel superconductor Batcher two-bit serial sorter (FIG. 8) and trap (FIG. k9).

Abstract: A medical system that allows a medical device to be controlled by one of two input devices. The input devices may be consoles that contain handles and a screen. The medical devices may include robotic arms and instruments used to perform a medical procedure. The system may include an arbitrator that determines which console has priority to control one or more of the robotic arms/instruments.

Abstract: A method and system are provided for the development and maintenance of a single configuration file for a storage area network combined with an “intelligent” script which places server configuration files into the appropriate directories for servers which are part of the storage area network. On a server by server basis, each server is configured in accordance with the particular operating system the server itself is using. Once this is accomplished, each server added or removed from the storage area network will be processed in a similar way without the need for reconfiguration of the storage area network as a whole.

Abstract: A network interface that processes data packets transmitted on a network is provided. The network interface includes a first data path, a second data path, a header processor, a classifier unit, and a plurality of packet processors. The first data path unit inputs downstream data packets transmitted downstream on the network, and the second data path unit inputs upstream data packets transmitted upstream on the network. The header processor inputs data packet headers of the downstream and upstream data packets from the first and second data path units and classifies the downstream and upstream data packets by comparing the headers with predetermined rules. The classifier unit also inputs the data packet headers from the first and second data path units and evaluates the headers determine flows corresponding to the downstream and upstream data packets.

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 packet communications system which transmits a packet at a predetermined transmission rate includes a packet size controller configured to change a size of the packet in accordance with available space of a transmission buffer storing the packet, when the predetermined transmission rate is changed.

Abstract: Device for transferring data between two asynchronous systems communicating via a FIFO memory. The first system comprises a write pointer register and the second system comprises a read pointer register to the FIFO. Each pointer register is associated with a primary shadow register and a secondary shadow register. The primary shadow register is located in the same sub-assembly as the pointer register with which it is associated, and episodically receives a copy of this pointer register. The secondary shadow register is located in the other sub-assembly, and episodically receives a copy of the primary shadow register.

Abstract: The present invention relates to a scheduling method and apparatus for scheduling data packets in time-shared channels, wherein a scheduling priority is determined for a user based on a ratio between a transmission parameter, e.g. throughput, offered to said user and an average preceding value (Tn) of said transmission parameter provided to said user within a predetermined time period. The determined scheduling priority is changed in dependence on a difference between said average preceding value and a minimum average value allocated to said user, e.g. by using a mapping function for generating a mapped value (Hn) replacing the average preceding value (Tn). Thereby, the minimum average value allocated to said user can be guaranteed by increasing the scheduling priority when the monitored average preceding value converges to the minimum average value.

Abstract: A method and system for encoding a set of range labels for each parameter field in a packet classification key in such a way as to require preferably only a single entry per rule in a final processing stage of a packet classifier. Multiple rules are sorted accorded to their respective significance. A range, based on a parameter in the packet header, is previously determined. Multiple rules are evaluated according to an overlapping of rules according to different ranges. Upon a determination that two or more rules overlap, each overlapping rule is expanded into multiple unique segments that identify unique range intersections. Each cluster of overlapping ranges is then offset so that at least one bit in a range for the rule remains unchanged. The range segments are then converted from binary to Gray code, which results in the ability to determine a CAM entry to use for each range.

Abstract: A method and a system for providing transparent Quality of Service (QoS) and reducing bandwidth usage in an ATM access network uses that uses VC-merging and delivery of content directly through the access network. Root-initiated join proxy messages sent from a service gateway include a merge-eligibility indicator that prompts an access module to merge content delivered through the access networks into a virtual circuit link (VCL) provisioned for the subscriber. TCP splicing is also supported to further improve overall QoS.

Abstract: The present invention relates to a multicasting network apparatus and method for an ATM switching system having a banyan network and a route network which includes a header encoder part for generating a header, a boolean splitter network for copying a cell routed from the banyan network to thereby transmit the same to a route network. The boolean splitter network includes a plurality of boolean splitters, each of the boolean splitters includes the step of dividing the destination addresses of a cell into an upper group and a lower group and selecting an active port to thereby route the same. As described above, any extra translation table is not required owing to a cell copying operation according to the present invention, whereby the number of hardware components can be reduced, and an expansion can be easily performed.

Abstract: A network processor having bypass capability in which some data units are diverted from being processed by the processor core of the network processor. In one embodiment, a network processor may include a receiver to receive data units, configuration information used to evaluate whether the data units require processing, a processor core to process data units that require processing, a bypass store to hold those data units which do not require processing by the processor core, and a transmitter to transmit the data units. In one embodiment, a method may include receiving a plurality of data units, receiving configuration information, evaluating whether each of the data units requires processing based on the configuration information, bypassing processing those of the data units that do not require processing based on the evaluating, processing those of the data units that require processing based on the evaluating, and transmitting the data units.

Abstract: A method, apparatus, and computer program product are provided for implementing global to local queue pair translation in a network transport layer. A global queue pair number is identified. The global queue pair number is translated to a smaller local queue pair number. The local queue pair number is used for storing local queue pair context data for outbound header generation and inbound header checking. Upper layers of the network protocol above the network transport layer are allowed to use the global queue pair numbers.

Abstract: A system for queuing packets written to memory for switching includes a data memory logically divided into multiple blocks. The system also includes multiple input ports each operable to receive packets and write the packets to the data memory. The system also includes multiple output ports each having a memory structure and one or more output queue pointers. The memory structure includes multiple memory structure entries that each correspond to one of the blocks. Each of the memory structure entries includes a memory structure next pointer that can link to another one of the memory structure entries. An output queue pointer can link to one of the memory structure entries, and the output queue pointers and memory structure next pointers form output queue linked lists. Each of the output ports can read packets stored in the data memory using the output queue linked lists and communicate the packets.

Abstract: In a computing network environment having a gateway device electronically connected to a plurality of hosts potentially connected to one or more routers and local area networks, a method and apparatus is provided for dynamically configuring, deconfiguring and monitoring all connected hosts. Special IPX commands are provided to add or remove information about hosts in a routing table. The command provides information about the connected hosts' IPX sessions, router information and IPX packets and their final destinations, and connection routes. In another embodiment of the present invention the IPX command is also used to receive information and pass information about new IPX stations in the network environment. By providing a counter and incrementing it each time an IPX packet is received from the network, the most used entries are identified. A second special IPX host command is also provided for deconfiguring and removing entries from the routing table in a manner similar to the one described above.

Abstract: A technique for reliably multicasting a message within a router network in a sequenced order with other messages is provided. At least one special router in the network has associated persistent storage for sequencing a message being routed to one or more clients. When a message is received at this sequencer node, the sequencer places a sequence number for the message in persistent storage and sends a sequencing acknowledgment back to those routers to which the message was originally routed, as well as back towards the source of the message. The sequencer acknowledgment includes the message id, and the sequencing number. When the sequencer acknowledgment is received by a router, it looks up the routing information from the original message, and sends the acknowledgment to those neighboring routers to which the original message was sent, excluding the link from which the sequencer acknowledgment was received.

Abstract: A packet transmission method wherein, when the sum of the bands of a plurality of flows including packets having the same priority exceeds the guaranteed band shared by these flows, a packet belongs to a flow having an earlier transmission start time is given a higher priority than a packet belongs to a flow having a later transmission start time on the in order of arrival basis based on the transmission start time. A classifier controls the token thresholds and a priority control mechanism controls the discard thresholds based on each flow to use for deciding the conditions.

Abstract: A method and apparatus that employ a buffer management architecture to address various video quality issues that may occur at a client player are disclosed. The present invention employs one or more buffers to assist in the scheduling and delivery of rendered content to a player's output system. In one embodiment, the system employs a packet buffer, a frame buffer and an image buffer. One useful advantage of the present invention is the control of these buffers to meet a predefined QoS, thereby ensuring factors that may negatively affect the QoS in the real-time transport of high bandwidth content will be minimized.

Abstract: A data transmission apparatus for sequentially transmitting data in units of packets each containing transmission data to the receiving end, comprises: a reception unit for receiving the transmission data as an input signal; a packet formation unit for receiving the transmission data received, and forming an uncompressed packet in which predetermined transmission data is stored as uncompressed data, and a compressed packet in which at least a portion of transmission data that follows the predetermined transmission data is compressed and stored as compressed data; a reference information management unit for holding and managing, as reference information, information relating to the uncompressed packet formed by the packet formation unit; and a transmission unit for transmitting the respective packets formed by the packet formation unit, as a transmission signal, to the receiving end.

Abstract: A system and method for sharing a resource (e.g., buffers) among multiple queues (e.g., InfiniBand send queues). Each queue has a local context indicating the Current amount of the resource allocated to the queue, the Minimum it is guaranteed, and a Maximum amount. A context may also include one or more pointers for managing the queue. Global Available and Reserve values indicate, respectively, the amount of the resource not currently allocated and the amount of the resource being reserved to guarantee each queue its Minimum. When an element is posted to a queue, a Full signal is raised for every queue to prevent further activity while the global values and the affected queue's context are updated. Then, if Available>0, the signal is de-asserted for any queue for which Current<Minimum or, if Available>Reserve, for any queue for which Current<Maximum.

Abstract: A method and apparatus for controlling information flow through a protocol bridge is disclosed. In one embodiment, circular queues in dual port memory are used for passing frame header information and control information between the hardware and a processor. In one embodiment, a ‘control bit’ in each element in the dual port memory serves as a signaling mechanism for passing control of the circular queue elements between the hardware and the software. In another embodiment, a ‘skip bit’ is used to simplify error handling by enabling the circular queue elements to be processed in a particular order even under error conditions.

Abstract: Method and Apparatus for delivering audio signals from a source node to a destination node on a network. The apparatus uses a number of switches that transmit prioritized data on a packet network. The switches are coupled to a number of send/receive nodes for sending and receiving digital audio signals on the data network. The audio packet size and the receive buffers are sized to store a minimum possible number of audio samples to minimize latency in processing audio signals arriving at said receive node, but still ensure audio delivery without interruption due to packet data network delay. An additional feature of the invention is recovery of clock synchronization over the same data network by novel arrangement of transmission of timing packets on the network.

Abstract: In a means for forwarding message cells transmitted according to the asynchronous transfer mode, the message cells of a plurality of blocks are supplied to an interface that supports back pressure of traffic. A 100% utilization of the interface is achieved in that a block only receives an authorization for forwarding a message cell when it has a message cell with payload data.

Abstract: A network system (10). The system comprises a first network node (MNx), and that node comprises an input (30IN) for receiving a packet, and the node also comprises a buffer (30LC), coupled to the input and for storing the packet. The first network node also comprises circuitry (50) for detecting when a number of packets stored in the buffer exceeds a buffer storage threshold and circuitry, responsive to a detection by the circuitry for detecting that the number of packets stored in the buffer exceeds the buffer storage threshold, for issuing a pause message (60) along an output to at least a second network node. The pause message indicates a message ingress address (602) and a message egress address (602), where that message ingress address and the message egress address correspond to a network ingress address and a network egress address in a congestion-causing packet received by the first network node.

Abstract: A method of sorting packets for transmission over a communication network. The packets are sorted into groups in accordance with predetermined criteria, wherein the number of groups is equal to at least three times the square root of a fraction whose numerator is the maximum transmission rate and whose denominator is the minimum transmission rate. Each group is assigned a first departure time in accordance with the predetermined criteria. Each packet of each group is assigned a second departure time. Wherein the number of the departure time is equal to the square root of a fraction whose numerator is the maximum rate and whose denominator is the minimum transmission rate. Each packet is transmitted over the communication network in accordance with the second departure time.

Abstract: In a DOCSIS based satellite gateway data is transmitted over a single downstream channel, at different throughput rates. Data destined for each subscriber/receiver is assigned a throughput rate depending upon the downstream signal quality of that subscriber/receiver. To accomplish this, the downstream DOCSIS MAC data is parsed to extract DOCSIS packets. The DOCSIS packets are then loaded into packet queues based on an identifier within such packets such as the MAC destination address or SID. Each of the queues represents a bandwidth efficiency or throughput rate that can be currently tolerated by specific subscribers based on the current signal quality being experienced at the subscriber location. A PHY-MAP describing the downstream data structure to be transmitted and inserted into the downstream data. Data is extracted from the packet queues in queue blocks as defined by the PHY-MAP.

Abstract: The invention relates to methods and apparatus for controlling traffic congestion of communication traffic in a communication network. The network includes a first node which is operable to receive communication traffic in the form of data from one of more sending nodes and to pass that data to one or more receiving nodes. The method includes monitoring the possible output data rate of the first node and detecting if the possible output data rate becomes smaller than a maximum data rate value and responsive to that monitoring step performing congestion control whereby the data throughput of a flow of data through the first node is decreased.

Abstract: A packet switch and a packet switching method capable of taking the full advantage of the transfer capability of the packet switch by avoiding the influence due to the congestion are disclosed. In the packet switch, the priority level according to the congestion states of the transfer target is attached to a packet, and the processing at a time of packet collision is carried out by accounting for this priority level, so that it becomes possible to carry out the packet transfer control according to the congestion status of the transfer target of each packet.

Abstract: A method and architecture for transitioning the embedded base of Digital Loop Carrier access systems from the current narrowband circuit-switched paradigm—i.e., Synchronous Transfer Mode transport and Time division Multiplexed—to an Asynchronous Transfer Mode transport and ATM network interface paradigm. The invention operates to terminate the control data links from legacy DLC equipment, and to provide a protocol conversion function that enables these links to interface with the associated control and call processing structures of a serving packet switch. An additional function of the invention is the interfacing for bearer channels of the STM feeders from the legacy DLC and the provision of a Synchronous to Asynchronous Conversion function on such feeders.

Abstract: Aspects of the invention for posting buffers for a non-posting TCP application may comprise posting at least one generic buffer located in a memory external to a host adapter and transferring incoming data for a TCP connection to the posted generic buffer prior to the non-posting TCP application posting a TCP application buffer for the incoming data. At least one generic buffer may be allocated from a pool of available generic buffers upon receipt of the incoming TCP connection data. At least a portion of the incoming data may be stored in the allocated generic buffer if the TCP application buffer is unable to accommodate the incoming data. The method may further determining whether the incoming data for the TCP connection transferred to the posted generic buffer is in sequence and ordering the incoming data based on a sequence number if the incoming data is out of sequence.