Abstract: A switch apparatus and method according to the invention provides a carrier-class switching platform with a highly optimized data path and distributed signaling stacks to achieve high-density differential voice services. Incoming voice calls of any media type (TDM voice/fax, VoIP, VoATM, VoFR) are packetized and adapted for egress transmission of the same or another media type according to the service plan profile of the parties, and/or the instantaneous availability or cost of bandwidth resources. All calls are switched in an ATM switching core with QoS characteristics that can also be determined based on service plan profile. A call server handles call setup and management functions, as well as call signaling. Advantageously, the call server provides signaling relay functions to further support and enable the media conversion of voice calls.

Abstract: A switch apparatus and method according to the invention implements a three stage switching process. Various types of media streams presented to the switch apparatus by the broadband and narrowband connections are adapted for switching by being converted to ATM cells and enqueued in corresponding virtual circuit (VC) queues. ATM cell switching is performed among the different cards based on the quality of service requirement for each virtual circuit. The switched ATM cells are then converted to the outgoing media types and outputted to the necessary broadband and narrowband connections. The switch apparatus and method is further adapted to perform rate shaping and traffic management so as to guarantee the quality of service for various media types (voice, video, data) and also minimize the traffic loss due to rate mismatch between narrowband and broadband connections during the burst period.

Abstract: A method for managing a buffer queue that stores a data queue, wherein the data queue comprises a set of n data elements, n being at least zero. A head pointer is stored at a first location, which may be in a cache controlled by a first processor. The head pointer indicates a head buffer of the buffer queue. The first processor reads the head pointer to determine the head buffer of the buffer queue when a data element is to be removed from the data queue. The first processor reads a next pointer of the head buffer to determine whether the data queue is empty. The first processor determines that the data queue is empty when the next pointer has a first value, which indicates that the head buffer is a dummy buffer.

Abstract: A method for managing a buffer queue that stores a data queue, wherein the data queue comprises a set of n data elements, n being at least zero. A head pointer is stored at a first location, which may be in a cache controlled by a first processor. The head pointer indicates a head buffer of the buffer queue. The first processor reads the head pointer to determine the head buffer of the buffer queue when a data element is to be removed from the data queue. The first processor reads a next pointer of the head buffer to determine whether the data queue is empty. The first processor determines that the data queue is empty when the next pointer has a first value, which indicates that the head buffer is a dummy buffer.