Abstract: A system permits queues to use more than an allocated amount of bandwidth. The system allocates an amount of bandwidth to each of the queues and determines whether any of the queues is using less than the allocated amount of bandwidth. If so, the system reallocates the allocated bandwidth from one of the queues to at least one other one of the queues based on the amount of bandwidth used by each of the queues.

Abstract: Ordering logic ensures that data items being processed by a number of parallel processing units are unloaded from the processing units in the original per-flow order that the data items were loaded into the parallel processing units. The ordering logic includes a pointer memory, a tail vector, and a head vector. Through these three elements, the ordering logic keeps track of a number of “virtual queues” corresponding to the data flows. A round robin arbiter unloads data items from the processing units only when a data item is at the head of its virtual queue.

Abstract: A group poll mechanism (GPM) that schedules upstream bandwidth for cable modems by pointing a request opportunity normally reserved for a single service flow to more than one service flow. Essentially, instead of using the seldom-used poll requests one per service flow, this same request opportunity is pointed to multiple service flows. In such kind of a scheme the GPM gives the same mini-slot to multiple service flows. The GPM implements the use of place-holder SIDs and novel mapping of information elements in MAP messages.

Abstract: A band control system for a digital subscriber line network in which a first apparatus and a second apparatus situated at a subscriber station and a center, respectively, are interconnected by a cable for interchanging at least a digital data signal with each other. The system may cause one of the first apparatus or the second apparatus to monitor receipt of signals from the other of the first apparatus or the second apparatus; send, based on a result of monitoring, a band variation command to the other apparatus for causing the other apparatus to vary a band by using a frequency band not used for signal transfer; cause the other apparatus to receive the band variation command; and vary the band in accordance with the band variation command.

Abstract: A hierarchical round robin arbiter includes a first set of arbitration vectors, each associated with a plurality of requesters. A second arbitration vector includes one bit for each arbitration vector in the first set. The single bit informs the round robin arbiter if any of the requesters associated with the corresponding arbitration vector in the first set are requesting service. The round robin arbiter can determine whether one of a number of requesters is requesting service by examining the single bit in the arbitration vector.

Abstract: A device includes an input processing unit and an output processing unit. The input processing unit dispatches first data to one of a group of processing engines, records an identity of the one processing engine in a location in a first memory, reserves one or more corresponding locations in a second memory, causes the first data to be processed by the one processing engine, and stores the processed first data in one of the locations in the second memory. The output processing unit receives second data, assigns an entry address corresponding to a location in an output memory to the second data, transfers the second data and the entry address to one of a group of second processing engines, causes the second data to be processed by the second processing engine, and stores the processed second data to the location in the output memory.

Abstract: A packet header processing engine includes a level 2 (L2) header generation unit and a level 3 (L3) header generation unit. The L2 and L3 header generation units are implemented in parallel with one another. The L2 generation unit may include a single execution section and the L3 generation unit may include multiple parallel execution sections. When both the L2 and L3 generation units complete their operations on a particular packet, a build component combines the generated L2 and L3 information to form a complete packet header.

Abstract: A method and apparatus for in-line processing a data packet while routing the packet through a router in a system transmitting data packets between a source and a destination over a network including the router. The method includes receiving the data packet and pre-processing layer header data for the data packet as the data packet is received and prior to transferring any portion of the data packet to packet memory. The data packet is thereafter stored in the packet memory. A routing through the router is determined including a next hop index describing the next connection in the network. The data packet is retrieved from the packet memory and a new layer header for the data packet is constructed from the next hop index while the data packet is being retrieved from memory. The new layer header is coupled to the data packet prior to transfer from the router.

Abstract: A network service administration system including a plurality of service objects, a plurality of address objects; and a service configuration application for a multifunction appliance running on a client computer coupled to the appliance via a network. The service configuration application includes an interface allowing subscribers to configure at least a subset of application content services provided by the appliance and including a rule set implementing rules in ones of said application content services in said subset based on changes to configurations of any other of said application content services. Each of said service objects may comprise an individual network service definition.

Abstract: A packet header processing engine receives a header of a packet. The received header includes a size of the packet. A maximum transfer unit size of a destination interface of the packet may be determined. The packet header processing engine determines whether the size of the packet exceeds the maximum transfer unit size of the destination interface. If the size of the packet does not exceed the maximum transfer unit size of the destination interface, the packet header processing engine generates a new header from the received header. If the size of the packet exceeds the maximum transfer unit size of the destination interface, the packet header processing engine generates a fragment header from the received header. The packet header processing engine may recycle the fragment header for further processing in addition to forming a first fragment packet from the fragment header.

Abstract: A base station modulator/demodulator for constituting a mobile communication system and sending ATM cells to a higher rank station and receiving ATM cells from the higher rank station is provided. The base station modulator/demodulator comprises: receive means for terminating, among ATM cells received from the higher rank station through a leased line, ATM cells addressed to the base station; first send means for sending, among the ATM cells received from the higher rank station through the leased line, ATM cells addressed to another base station to the another base station; and second send means for multiplexing ATM cells of a plurality of base stations, the base station and the another base station, and sending the multiplexed cells to the higher rank station through the leased line.

Abstract: Techniques are described that configure a router in a configuration mode specified by a client. For example, a client may request to configure the router in a private configuration mode. In response to the command, a management module creates a private database. A client may edit the configuration data of the private database. The client may edit the private database without interference from other clients that may also be editing configuration data of the router. Management server module updates the committed database with edited private database, and the router begins to operate in accordance with the updated configuration data.

Abstract: An ATM switching system 1 is provided with an ATM switch 11, a reserved connection memory 12 for storing reserved connection information, a call history memory 13 for maintaining call histories of requests for connection from subscriber's terminal units 2?1 to 2?n, and a call-signal processing section 15. The call-signal processing section 15 generates a request for connection with respect to a trunk ATM switching network 3 by the use of the call histories in the call history memory 13 in the case where no call was issued from the subscriber's terminal units, and stores response results thereof in the reserved connection memory 16. Thereafter, when there was a call from the subscriber's terminal units 231 1 to 2?n and contents of the request for connection thereof are the same as the reserved connection information, which has been stored in the reserved connection memory 16, processing for connection is executed by the use of the reserved connection information.

Abstract: Samples from an addressed data forwarding devices, such as a router, are forwarded to a specified next hop address and/or out a specified next hop interface. However, the sampling and/or next hop forwarding is suppressed if the specified next hop address is unstable or unresolved.

Abstract: The present invention provides an efficient system and method for routing information through a dynamic network. The system includes at least one ingress point and one egress point. The ingress and egress point cooperate to form a virtual circuit for routing packets to destination subnets directly reachable by the egress point. The egress point automatically discovers which subnets are directly accessible via its local ports and summarizes this information for the ingress point. The ingress point receives this information, compiles it into a routing table, and verifies that those subnets are best accessed by the egress point. Verification is accomplished by sending probe packets to select addresses on the subnet. Additionally, the egress point may continue to monitor the local topology and incrementally update the information to the ingress to allow the ingress to adjust its compiled routing table.

Abstract: A computer networking system, method and device for multiplexing HTTP requests and demultiplexing HTTP responses. The method may include receiving HTTP requests from a plurality of clients and routing those requests to a socket on a server system. The method may also include receiving HTTP responses from the server system and selectively routing those responses to the corresponding clients.

Abstract: An MPOA system for establishing communication by using layer 3 protocol on an ATM network, in which data about the layer 3 address of a source of data packets is added to an address resolution request packet which is transmitted in order to establish a shortcut VCC toward a destination of the data packets in each communication node and hence transmitted to the destination, and in the case of accepting the address resolution request packets to be transmitted in order to establish the respective shortcut VCCs toward the destination of the data packets, as for the same communication, from a plurality of the communication nodes, a shortcut VCC is established only between the destination and the communication node remotest from the destination on the network.

Abstract: A cross-bar switch includes a set of input ports for receiving data packets and a set of sink ports for transmitting the received packets to identified targets. A set of data rings couples the input ports to the sink ports. Each sink port utilizes the set of data rings to simultaneously accept multiple data packets targeted to the same destination—creating a non-blocking cross-bar switch. Sink ports are also each capable of supporting multiple targets—providing the cross-bar switch with implicit multicast capability.

Abstract: A data flow rate policer enforces data flow policies for a number of data flows using a probabilistic policy enforcement mechanism. The policer includes a memory that stores the state of each data flow in a compact data structure. Additionally, the policer includes one or more policing engines that implement the actual data flow policies based on information derived from the data structures. The policing engines may be implemented in hardware to increase performance.

Abstract: A method for enabling secure communication between a client on an open network and a server apparatus on a secure network. The method is generally performed on a intermediary apparatus coupled to the secure network and the open network. The method includes the steps of negotiating a secure communications session with the client apparatus via the open network; negotiating an open communications session with the server via the secure network; receiving encrypted packet application data having a length greater than a packet length via multiple data packets; decrypting the encrypted packet application data in each data packet; forwarding decrypted, unauthenticated application data to the server via the secure network; and authenticating the decrypted packet data on receipt of a final packet of the segment.