Abstract: A communication connecting device includes a data storage to which data read by a scanner are written. A packetizer packetizes the data read out of the data storage in accordance with a packet size fed from a size information storage. A rate controller counts a period of time after the start of packet transmission or a period of time consumed to send a preselected number of packets. The rate controller calculates a communication rate on the basis of the above period of time and the number of packets sent, and then compares the communication rate with a communication rate assigned to a receiving terminal and defined by a Recommendation T.30 protocol. The rate controller allows the packets to be sent only if the calculated communication rate is lower than the communication rate of the receiving terminal.

Abstract: A detector for detecting packet arrival time for packets received by a Home Phoneline Network Alliance (HPNA) receiver. The detector correlates received preamble symbols with stored preamble symbols and generates an estimation of the packet arrival time when the entire transmitted preamble has arrived at the receiver. The estimation of the packet arrival time is defined on a symbol period boundary. The detector includes a complex correlator with a simplified structure based on characteristic of the received HPNA signal.

Abstract: The invention relates to a system and non-intrusive method for measuring loss rates and transfer durations for data flows that are sent by a telecommunication network in packet mode. The inventive method is characterized in that it comprises the following steps: classification of the data packet in a homogeneous flow; calculation of an identification signature for each data packet; counting of the packets in the flow; measurement of unidirectional transfer times per flow or information flow group and measurement of the loss rate for said packets.

Abstract: A device for Connection Admission Control for an ATM switch, intended for admitting to the switch a requested ATM connection of the DBR type, such that the “Quality of Service” of all ATM connections of the DBR type in said switch continues to satisfy certain conditions. For the composite traffic stream of DBR connections at an output port with capacity C, a single buffer with capacity B is available, while as boundary condition it holds that the total average load of the output port does not amount to more than ?×C, where ? is a constant with a value between 0 and 1. The CAC device comprises two sub-devices, which each execute a—rather complex—partial calculation, resulting in a positive or negative admission signal. The new ATM connection is only granted admission to the switch if both sub-devices emit a positive admission signal.

Abstract: A startup management system and method, particularly adapted for use in computer and other communication networks, is presented. Rate-based flow and congestion control mechanisms have been considered desirable, including to deal with the needs of emerging multimedia applications. Explicit rate control mechanisms achieve low loss because of a smooth flow of data from sources, while adjusting source rates through feedback. However, large feedback delays, presence of higher priority traffic and varying network conditions make it difficult to ensure feasibility (i.e., the aggregate arrival rate is below the bottleneck resource's capacity) while also maintaining very high resource utilization. The invention applies entry and early warning techniques which increase the initial connect rate of newly connecting sources.

Abstract: An apparatus and method of managing received packets to be transmitted from a network device stores the received packets on one of two different buffers. In particular, the received packets are one of a first type of data packet and a second type of packet. Each one of the first type is stored in a first buffer having a first drop function, while each one of the second type is stored in a second buffer having a second drop function. Each respective drop function specifies a packet drop rate as a function of the average number of packets in its respective buffer. The first drop function has a first average drop rate over a specified time interval, while the second drop function has a second average drop rate over the specified time interval. The first average drop rate and the second average drop rate have a predefined relationship. Accordingly, if the two drop rates do not comply with the predefined relationship, then at least one of the two average drop rates are modified.

Abstract: VPI/VCI of an ATM cell is translated into an internal ID by distribution entries into sections in a table according to a portion of each VPI/VCI entry. A section to be searched according to the portion of a VPI/VCI of the received ATM cell is selected; and a search over the selected section is performed to find an entry corresponding to the VPI/VCI of the received ATM cell. An internal ID corresponding to the found entry is outputted.

Abstract: A method and apparatus for performing measurement-based admission control using peak rate envelopes is disclosed. A peak rate envelope estimator that uses empirical traffic envelopes of the aggregate traffic flow to allocate resources. Connection requests from the user are accepted or denied based upon the empirical traffic envelopes of the aggregate traffic flow.

Abstract: A traffic policer is coupled to a network buffer. A cell stream is supplied to this traffic policer. When a frame has a mix of tagged and non-tagged cells, the distribution of tagged and non-tagged cells is determined. Based on this distribution and some predetermined criteria, a decision is made to tag all cells of the frame or to set all tags to non tagged in the frame. Exiting frames only exist of all tagged cells or all non tagged cells. Entire frames are discarded in case of congestion.

Abstract: A method and system for controlling congestion in an ATM network comprises the steps of pre-allocating, for a pre-determined interval of time, a set of burst access parameters to a set of pre-allocated virtual paths between a set of source node and destination node pairs in the ATM network, and controlling, at the burst level, the traffic at each source node based on the pre-allocated set of burst access parameters and without communicating with other nodes in the ATM network. Specifically, the network, for a pre-determined interval of time, pre-allocates a set of virtual paths between each source-destination node pair in the network, pre-allocates a set of maximum permitted rates to the pre-allocated set of virtual paths, respectively, and pre-assigns a set of burst access thresholds to a set of service classes, respectively, in the pre-allocated virtual paths, where the pre-assigned burst access thresholds are less than or equal to the corresponding pre-allocated maximum permitted rates.

Abstract: A data processing system and method are disclosed for providing an access connector which limits access to a network to only authorized client computer systems. The network is controlled by a server computer system. The access connector is provided for physically coupling a client computer system to the network. The access connector is physically coupled to the network. Prior to permitting the client computer system to attempt to establish a client communication link with the network, the client computer system attempts to authenticate itself to the server computer system. In response to the client computer system being unable to authenticate itself to the server computer system, the access connector prohibits the client computer system from establishing a client communication link between the client computer system and the network.

Abstract: A method is provided for fairly allocating bandwidth to a plurality of devices connected to a communication link implemented as a plurality of point-to-point links. The point-to-point links interconnect the devices in a daisy chain fashion. Each device is configured to transmit locally generated packets and to forward packets received from downstream devices onto one of the point-to-point links. The rate at which each device transmits local packets relative to forwarding received packets is referred to as the device's insertion rate. A fair bandwidth allocation algorithm is implemented in each (upstream) device to determine the highest packet issue rate of the devices which are downstream of that (upstream) device. The packet issue rate of a downstream device is the number of local packets associated with the downstream device that are received at the upstream device relative to the total number of packets received at the upstream device.

Abstract: A cell buffer use rate monitoring method allowing a memory required for detecting the currently used amount of a cell buffer to be reduced. A monitoring time and a plurality of cell buffer thresholds are previously set in a setting data memory. A cell buffer use rate is calculated based on the number of cells received within the monitoring time and the number of times a currently used cell buffer amount has exceeded each of the cell buffer thresholds.

Abstract: The present invention concerns a method for use in a telecommunication network by a data traffic policer (POL) for data traffic policing on a data communication link (L). The data traffic includes data cells that are grouped into frames (F1, F2, F3, . . . ). The method comprises the step of for each data cell of a frame (F2), upon reception of the data cell, checking a conformance of the data cell and providing thereby a conformance result of the data cell being any one of conforming and non-conforming (F/T). The method further includes the steps of storing the data cell into a buffer (BUFF) and treating the frame as conforming in the event when for each data cell of the frame that is stored in the buffer (BUFF) the conformance result is conforming (F); and in the event when the frame is treated as conforming (F) and upon reception of a predefined data cell of the frame (F2), starting transmission of a predefined number of data cells of the frame (F2) by the traffic policer (POL).

Abstract: A system for user-space packet modification, including a set of kernel code and a user-level application programming interface (API). The system facilitates creation of a special socket for passing packets between kernel space and user space. The system in turn facilitates creation and application of a packet filter associated with the socket, in order to trap incoming or outgoing packets being processed in the kernel at a designated point in a protocol stack. Once a packet is trapped, it is moved through the socket into user space, thereby at least temporarily preventing the protocol stack from further processing the packet. In user space, an application may operate on the packet, for instance, modifying aspects of the packet or deleting the packet altogether. The system in turn facilitates injection of a packet from user space into kernel space, and into a designated point in the protocol stack for desired stack processing.

Abstract: A frame relay network has a network management system in combination with frame relay nodes. The network management system provides frame relay oversubscription trunk and connection parameter signals to the frame relay nodes. The network management system uses a graphical user software interface program for receiving frame relay oversubscription trunk and connection parameters from a network supervisor that are formatted into the frame relay oversubscription trunk and connection parameter signals. The frame relay nodes respond to the frame relay oversubscription trunk and connection parameter signals, and at least one frame relay node provides a frame relay oversubscription connection control signal containing connect level parameters to another frame relay node when relaying communication signals from one frame relay node to another frame relay node. In operation, the trunk line has multiple virtual connections communicating the frame relay oversubscribed data between the frame relay nodes.

Abstract: The present invention includes a system for determining cell loss among on-off sources on a network by (a) receiving cells; and (b) measuring aggregate cell loss of said sources at port level. The method preferably includes determining aggregate cell loss of the sources; determining mean rate of each of the sources; determining burstiness of each of the sources; determining average burst length of each of the sources; determining buffer size; and approximating the cell loss ratio of each of the sources based substantially only upon the aggregate cell loss, the mean rate, the burstiness, and the average burst length.

Abstract: Measurement packets are sent at equi-intervals from a sending unit into a network path. The probing packets are received by a reception unit, which measures the packet transmission time to estimate an available bandwidth of a network path from a parameter Q indicative of a correlation in the packet transmission time between adjacent packets.

Abstract: A UPC (cell flowing ratio controlling) function is executed when a plurality of channels are multiplexed in single device. The cell flowing ratio control method and system on a cell switching system for receiving arrival cells transmitted from a plurality of channels and controlling to pass the received cells multiplexes the arrival cells flowing on the plurality of channels; increases only a time counter corresponding to a channel to which an arrival cell is belonging, the time counter being selected from a plurality of time counters provided for the plurality of channels; and controls cell flowing ratio correspondingly to counted value of the increased time counter.

Abstract: A user interface and computer-implemented method for analyzing and displaying network traffic performance assessment data in a computer network. Packet trace data is organized into application-level threads for display in a visual thread diagram. The user can manipulate the visual thread diagram to configure it in a number of ways in a dynamic manner.

Abstract: A feedback-based adaptive network is described wherein at least a portion of the network elements report operating information relating to network conditions to a centralized data store. The information which is reported to the data store is analyzed by a policy engine which includes a plurality of application specific plug-in policies for analyzing selected information from the data store and for computing updated control information based upon the analysis of the information. The updated control information is fed back to selected network elements to thereby affect operation of the selected elements. Typically, when the operation of a network element has been affected, its corresponding operating information will change. The new or changed network element operating information is then reported to the data store and analyzed by the policy engine. The policy engine may then generate new or updated control information for affecting the operation of selected elements in the network.

Abstract: An apparatus and method for monitoring data flow at a node on a network are disclosed. A memory location or “bucket” is allocated to each of a plurality of links and classes of service at the node. A free-running counter is incremented at a rate determined by the maximum allowable data rates on the various links and classes of service. When a data packet is received at a particular link and class of service, the corresponding memory location or bucket is adjusted or “leaked” by subtracting the present counter value from the present bucket contents. That difference is then added to the number of units of data, i.e., bytes or groups of bytes of data, contained in the incoming packet. That sum is then compared with a predetermined threshold determined by the allowable data rate associated with the link and class of service. If the threshold is exceeded, then the incoming data packet is marked accordingly.

Abstract: A method and system including an improved generalized reference decoder that operates according to any number of sets of rate and buffer parameters for a given bit stream. Each set characterizes a leaky bucket model and contains three parameters representing the transmission bit rate, buffer size, and initial decoder buffer fullness. An encoder provides at least two sets of these parameters, whereby the decoder selects one or interpolates between them to operate at any desired peak bit rate, buffer size or delay. The generalized reference decoder may select the smallest buffer size and corresponding delay that decodes the bit stream without buffer underflow or overflow, or alternatively may select and operate at the minimum required peak transmission rate, or something between both. In practice, the buffer size, delay and/or the peak transmission rate can be reduced by significant factors, and/or the signal-to-noise ratio (SNR) can be increased.

Abstract: A packet network employs flow control providing assigned rates to sessions in accordance with a general max-min (GMM) rate allocation. The GMM rate allocation accounts for the minimum cell rate and peak cell rate requirements for each session. For one case, a centralized flow control algorithm is employed that sorts sessions based on increasing minimum cell rate. The centralized flow control algorithm employs an iterative process of increasing the rate of the smallest rate session and adding sessions to the process when the smallest rate session equals the next higher rate session. The rates are increased until the rate either reaches the peak cell rate of the session or the link saturates. For a second case, a distributed flow control algorithm is employed with a distributed protocol within the network to allocate capacity of network links to sessions. For the distributed flow control algorithm, an iterative process of rate allocation uses a modified version of the Consistent Marking method.

Abstract: A Point-to-point protocol configured to provide communication exchange between a first device and a second device. The point-to-point protocol is configured to negotiate an exchange rate and establish a connection for the communication exchange between the first and second device. As system dynamics change, the point-to-point protocol is also configured to permit application programs in the first device and the second device to request renegotiation of the exchange rate at any time. The point-to-point protocol is also configured to provide confirmation to a sending application program that information was delivered to a receiving application program.

Abstract: Scheduler methods and apparatus utilize a weight limited FIFO (WLF) method to provide weighted per-connection queuing while maximizing preservation of cell arrival order, thus minimizing additional cell delay variation (CDV) added during scheduling. The invention minimizes additional CDV of a connection until the connection exceeds its fair share of resource utilization.

Abstract: Flow control of packet based traffic by window is known. Novel modification is described which causes the flow control mechanism to reduce sending rate to some configured number rather than just reducing it by a fixed amount such as one half. The description also shows how the flow control mechanism can be constrained to a maximum rate. The configured numbers will assure that the connection can always run at a minimum rate but not more than a maximum rate. If the guaranteed minimum bandwidth is known and the round trip time between the end points is known or has been calculated, then the sender node needs only reduce its window to that which corresponds to a sending rate equal to that configured number. In this way the protocol will still probe for extra, opportunistic bandwidth but will be able to maintain the minimum rate. In a similar way a window that corresponds to the maximum rate can be calculated and used to constrain the maximum rate of sending.

Abstract: A reshaper is provided in a DLC (Data Link Control) layer of a WLAN (Wireless Local Area Network) system. The system can be configured to support various link and network protocols such as ATM (Asnynchronous Transfer Mode), Ethernet and IP (Internet Protocol). The DLC reshaper overcomes time distortion of a stream of packets or cells that is introduced as the stream passes through the WATM, by restoring or maintaining proper time intervals between packets or cells in a stream. Thus, an output stream of packets or cells from the DLC reshaper is not slipped or shifted in phase, and does not include jitters. The DLC reshaper uses ARQ (Automatic Repeat Request) sequence numbers of the packets or cells to detect when one or more packets are discarded or lost. The DLC reshaper can determine time intervals for packets or cells in a stream based on a PCR (Peak Cell Rate) for the connection that is being supported, and ARQ sequence numbers of the packets or cells.

Abstract: A method of executing a sequence of multiple dependent operations, each operation including a memory read and a memory write involves overlapping memory accesses of the operations by grouping together memory reads and memory writes of multiple operations and preserving a desired sequence of the operations using a circuit external to a memory through which the memory accesses are performed. The operations may be updates to one or more linked lists. In one embodiment, the step of overlapping memory accesses may be performed by grouping together memory accesses according to ATM cell arrivals or departures. In this embodiment, the operations are associated with ATM cell arrivals or departures and may be gets or puts. Each get and put operation may be characterized by a number of atomic memory operations to update one or more linked lists.

Abstract: Router apparatus for initiating a control channel within a protocol stack comprises a receiving protocol stack, a controller and an operating system. The controller is programmed to respond to receipt of a message, for example a congestion message, from a fast packet network such as a frame relay or cell relay network to generate a pass through packet message requesting the opening of an upward control channel between layer N and layer N+2 of the protocol stack, where typically layer N is layer 2 of a frame relay protocol and layer N+2 is layer 4 of a TCP protocol. Layer 4 may refuse to open the channel but once a channel is opened, for example, in the presence of congestion, a data flow control may be initiated between destination intelligent terminals when congestion is sensed in the fast packet network. The data flow control channel may have the purpose of segmentation control, compression control or data presentation rate control.

Abstract: A method of controlling congestion in a node of an asynchronous transmission system in which cells forming packets are transmitted, wherein cells are accepted or rejected according to the peak cell rate (PCR) of the connection on which the cells are transmitted, and the peak cell rate is evaluated based on peak cell rate information negotiated with the system for the connection. When the first cell of a packet arrives, the evaluated peak cell rate of the cells of the packet and the remaining transmission capacity (RTC) at the node are compared, the latter being calculated as the difference between the possible cell rate of the node and the sum of the cell rates of the connections of the packets in process of transmission via the node. The method provides a simple way of effectively controlling congestion without having to transmit resource management information in dedicated cells.

Abstract: An apparatus and a method providing fair bandwidth sharing by adjusting video image quality in a data packet network comprises a network load detection means for detecting a network load and a video encoding control circuit. The network load has an uncongested state, a loaded state, and a congested state. The video encoding control circuit adjusts a video quality to a target video quality, by increasing the video quality when the network load is in the uncongested state and decreasing the video quality when the network load is in the congested state. The video quality is determined as a peak mean squared error between an uncompressed image and a corresponding decoded image. The network load is detected by using a forward explicit congestion notification bit.

Abstract: Inter-class schedulers for digital link systems provide high efficiency utilization of limited bandwidth by employing queuing techniques referred to as Statistical Priority Guarantee Queuing (SPGQ) and Generic Cell-Rate Algorithm Priority Guarantee Queuing (GCRA-PGQ). SPGQ “elevates” the priority of otherwise low-priority classes under prescribed circumstances in accordance with a statistical process. The SPGQ scheduler determines whether a number within a range produced by a uniform random number generator lies within a sub-range proportional to the programmed statistical guarantee for a given class. If the number lies within the sub-range associated with a given class, then the priority of that class is elevated to a higher priority when both are eligible to transmit. The GCRA-PGQ scheduler operates as a strict priority mechanism until a class requires bandwidth in excess of a GCRA “window” or threshold for that class.

Abstract: A load observation unit observes a load using each quality class buffer and the link (address management unit) accommodating quality class buffers. An ER computation unit computes an ER (explicit cell rate) for each quality class buffer. The ER can also be computed by the entire link. The ER computation unit defines the ER computed for the quality class buffer or the ER computed for the entire link, whichever is larger, as a first ER. Then, it compares the first ER with the MCR (minimum cell rate) set in the connection of the quality class buffer, and defines one of them whichever is larger as a second ER. Then, the value of the ER set in the ER field of the RM (resource management) cell arriving at the quality class buffer with the above described second ER, and the value whichever is smaller is set in the ER field of the RM cell.

Abstract: A flexible and scalable architecture and method that implements dynamic rate control scheduling in an ATM switch. The scheduler shapes a large number of streams according to rate values computed dynamically based on switch congestion information. To handle a large range of bit rates, a plurality of timewheels are employed with different time granularities. The streams are assigned dynamically to the timewheels based on computed rate values. The shaper architecture and method support priority levels for arbitrating among streams which are simultaneously eligible to transmit.

Abstract: An ATM switch having the buffer threshold controller to control the cell input into the switching element using the back-pressure signal and a method for determining the buffer threshold according to the buffer threshold controller are disclosed. The ATM switch includes buffer pool storing the cell input to the switch; buffer pool control part storing the buffer pool occupancy information per input port of the buffer pool; threshold control part receiving the buffer pool occupancy information from the buffer pool control part and calculating the threshold per input port periodically and then sending it to the buffer pool control part; input crosspoint control part controlling the cells input to the buffer pool by receiving the control signal from the buffer pool control part; and output crosspoint control part controlling the cells output from the buffer pool by receiving the control signal from the buffer pool control part.

Abstract: An apparatus and method for monitoring data flow at a node on a network are disclosed. A memory location or “bucket” is allocated to each of a plurality of links and classes of service at the node. A free-running counter is incremented at a rate determined by the maximum allowable data rates on the various links and classes of service. When a data packet is received at a particular link and class of service, the corresponding memory location or bucket is adjusted or “leaked” by subtracting the present counter value from the present bucket contents. That difference is then added to the number of units of data, i.e., bytes or groups of bytes of data, contained in the incoming packet. That sum is then compared with a predetermined threshold determined by the allowable data rate associated with the link and class of service. If the threshold is exceeded, then the incoming data packet is marked accordingly.

Abstract: A system which determines whether to accept a wireless connection to a network device receives a request to initiate the wireless connection to the network device, and then determines, in response to the request, a nominal cell rate at which cells are exiting from a buffer in the network device for the requested wireless connection. Thereafter, the system determines an amount of buffer space in the network device required to accommodate the connection, and decides whether to accept the wireless connection based on the nominal cell rate and the amount of buffer space required to accommodate the connection.

Abstract: In a method for admitting new connections based on measured quantities in a wireless communications network having a base station and remote hosts, the base station measures and computes performance metrics to determine whether admission of the new connection could cause a failure to meet the Quality of Service (QoS) promised to already admitted connections. Only if the QoS can be maintained is the new connection is admitted. In one embodiment, the base station may optionally disconnect one or more already admitted lower priority connections if doing so will allow a higher priority new connection to be admitted without loss of QoS to the remaining already admitted connections. In one embodiment, each connection request specifies the average bit rate required and a traffic burstiness factor, the base station measures the number of bytes sent by each connection for a certain period of time and a burstiness factor for the traffic in either direction.

Abstract: A method in a radio telecommunications network of broadcasting data in an over-the-air multicast to a group of mobile terminals. Statistics from regular point-to-point cellular transmissions to build a statistical database for each base station. The statistical data indicate the optimal signal quality that users normally experience when operating in that cell. From this data, a minimum transmission quality (TQmin) that a mobile terminal must receive for the type of data being broadcast is determined. The method then broadcasts a test transmission to the mobile terminals, and includes a maximum transmission quality (TQmax) in order to limit the number of responses. A response is then received from a mobile terminal representative of the group, the response including an indication of the received transmission quality. The method then determines whether the received transmission quality was greater than or equal to TQmin.

Abstract: Specialized telecom network users who burden the network, such as Internet Service Providers (ISPs), are identified by analysis of network traffic data to identify addresses (e.g. telephone numbers) for destinations receiving unique patterns of incoming traffic. For an ISP, in particular, the analysis involves identifying telephone, numbers of destinations receiving a high volume of calls and having connections exhibiting a long average hold time. To further enhance the ISP finder analysis, the call data may be examined to confirm that there is no outgoing call traffic from any station associated with the candidate ISP numbers. When numbers are identified by the call data analysis, a technician can call each number and listen for a modem tone, as a confirmation that each candidate number actually is of a data service, such as an ISP. Similar methodologies can identify destination numbers for other unique service providers, such as credit card verification services.

Abstract: The invention provides an ATM switch which realizes hierarchical shaping for each virtual channel and each virtual path with a simple configuration. Cells are sent from cell buffers of an ATM core switch by FIFO operation to output side connection information application sections of output side circuit interfaces. In each of the output side circuit interfaces, the output side connection information application section acquires connection information such as a service class based on an intra-switch connection identification number applied to each cell and applies the connection information to the cell. An output cell buffer queues cells for each virtual channel. A VC cell rate control section reads out cells from the output cell buffer in accordance with the connection information and performs traffic priority control and rate control of the cells to be outputted.

Abstract: Congestion at a network node can be aggravated by having too many TCP connections. A simple method of avoiding the bad effects of too many TCP connections is to limit the number of connections. Limiting the number of connections is achieved by an admission control which delays or even discards the connection set-up packets. TCP traffic flows are monitored to generate packet loss characteristics and when a certain condition is met, a connection request queue is disabled.

Abstract: A method for controlling an acceptance or refusal of a new connection on an ATM communication device with a maximum capacity Rmax and is already handling M connections which can be statistically multiplexed. The new connection has a peak cell rate PCR and an average sustainable cell rate SCR. The method determines a sum PM+1=&Sgr;PCRi of the peak cell rates PCR and a sum SM+1=&Sgr;SCRi of the average sustainable cell rates SCR of the existing connections M and the new connection. A variance V of the cell rates of the M+1 connections is determined and a required capacity loadM+1 for the M connections is determined in dependence on PM, SM and V, and the new connection is accepted if load M+1 is less than or equal to Rmax. The connection acceptance control can be carried out faster, more effectively and independently of the sequence of accepted connections by the exact calculation of the required capacity of the communication connections.

Abstract: A network traffic control system that generates traffic monitor information by monitoring the network traffic and controls the network traffic based on the traffic monitor information. The network traffic monitoring system includes a network traffic monitor and a network traffic controller. The network traffic monitor determines information such as types of communication, communicating partners, and geographical locations of the communicating partners. The network traffic controller processes the traffic monitor information. Thus, the traffic network control system reduces the cost of network communication as well as optimizes network performance based on traffic monitor information obtained by the traffic monitor.

Abstract: A telecommunications network includes a processor controlled switch and a network intelligence platform overload control function runs in the network intelligence layer. The overload control function measures the period of time taken to handle a call switching request and if the time taken exceeds a pre-determined quality of service threshold, it implements a call gapping function. The call gapping function modifies the gapping period such that requests to effect calls to particular destinations are spaced and any call arriving at a switching point prior to expiration of the gap period is automatically rejected by the local control processor. As the overload control function runs in a plurality of nodes, which may be file servers of the intelligence layer, the gapping period returned to the switch is dependent upon the perceived overload at the particular node.

Abstract: A technique for implementing a sublayer of a protocol suitable for data transfer in a multichannel environment where each channel is assumed to be prone to a significant bit error rate such as in a wireless communication system. The invention may be used to provide a high speed data transfer such as at 128 kilobits per second or higher with a bit error rate of 10−6 or better using multiple channels. By keeping track of the number of frames received in error, the sender dynamically adjusts the subframe size for each channel to optimize the effective overall throughput. The subframes each carry preferably two types of sequence numbers including a position number related to an index into a larger frame to be transmitted as a single data entity. The second sequence number is related to the subchannel used so that the receiver can detect missing subframes.

Abstract: A system and method for performing event-based rate policing using varying window start times. Rate policing overhead, including counter and timer monitoring and resetting, is performed only as needed and in response to actual received traffic on each connection. As the last bit of a data unit is received from an external network, an “event time stamp” is generated and associated with the data unit, for example as part of an internal header or trailer attached to the data unit. To determine if a rate policing window was active when the frame was received, the event time stamp is compared with a sum of a window start time and a window period value stored in association with the connection on which the data unit was received. If the associated event time stamp indicates a time prior to the sum of the associated window start time and window period, then a rate policing window is determined to have been active when the frame was received.

Abstract: An ATM switching equipment involves the use of a data editing terminal different from a central controller to easily efficiently collect data on a transmission path. Each component device generates an OAM cell having traffic data and performance monitor data as internal information without providing a new device as the one for inputting the data to the data editing terminal. The traffic data and the performance monitor data of all the devices are automatically simultaneously inputted at a high speed to the data editing terminal by routing the OAM cell to the data editing terminal connected to an ATM switch of the same switching equipment. The data required can be displayed at any time periodically or in response to a request from a maintenance man in the data editing terminal.

Abstract: A method for high speed connection admission control based on traffic monitoring includes the steps of comparing a peak cell rate of a call with a previous real available bandwidth which is updated, admitting or rejecting connection of the requested call by the comparison, computing a new available bandwidth as the call is connected and storing asynchronous transfer mode (ATM) cells, computing from the stored asynchronous transfer mode (ATM) cells a monitoring value for a traffic of the call by a certain time period, computing a probability distribution function for a cell number from the traffic monitoring value, computing an equivalent bandwidth according to the probability distribution function, and computing a real available bandwidth from a difference between the equivalent bandwidth and a physical link bandwidth and updating the available bandwidth, so that link may be efficiently used under real time control with a relatively simple hardware by performing the connection admission control (CAC) scheme b