Abstract:
Method and system for adapting access to a packet switching network including a dynamic bandwidth adjustment mechanism which continuously monitors the mean bit rate of the signal source and the loss probability of the connection. These values are filtered to remove noise and then used to test whether the values fall within a pre-defined acceptable adaptation region in the mean bit rate, loss probability plane. Values falling outside of this region trigger bandwidth adaptation procedures which, in turn, result in acquiring a new connection bandwidth, and determining new parameters for the adaptation mechanism. Furthermore, the mechanism controls the number of connections that can be adapted by a single processor, given its processing capability. It ensures fairness between the connections in the sense that it prevents a single connection to use, on the average, a unconsiderate portion of the processor capacity.
Abstract:
Method and system for adapting access to a packet switching network including a dynamic bandwidth adjustment mechanism which continuously monitors the mean bit rate of the signal source and the loss probability of the connection. These values are filtered to remove noise and then used to test whether the values fall within a pre-defined acceptable adaptation region in the mean bit rate, loss probability plane. Values falling outside of this region trigger bandwidth adaptation procedures which, in turn, result in acquiring a new connection bandwidth, and determining new parameters for the adaptation mechanism.
Abstract:
The present invention is directed to a high speed packet switching network and, in particular to a method and system for minimizing the time to establish a connection between an origin and a destination node. Due to high dynamicity of the traffic on transmission links, it is important to select a routing path according to a fully up-to-date information on all network resources. The simpler approach is to calculate a new path for each new connection request. This solution may be very time consuming because there are as many path selection operations as connection set up operations. On another hand, the calculation of paths based on an exhaustive exploration of the network topology, is a complex operation which may also take an inordinate amount of resources in large networks. Many of connections originated from a network node flow to the same destination network node. It is therefore possible to take a serious benefit in reusing the same already calculated paths for several connections towards the same node.The path calculated at the time the connection is requested is recorded in a Routing Database and updated each time a modification occurs in the network. Furthermore, alternate paths for supporting non-disruptive path switch on failure or preemption, and new paths towards potential destination nodes can be calculated and stored when the connection set up process is idle. These last operations are executed in background with a low processing priority and in absence of connection request.
Abstract:
PROBLEM TO BE SOLVED: To estimate and adjust the band width dynamically for lots of and high speed traffic fluctuation by providing a method that defines an adjustment area and corrects a frequency band width assigned for the connection between a sender node and a destination node in response to a pair of a mean bit transfer speed not set within the adjustment area and a missing rate. SOLUTION: This method includes a process that measures a mean bit transfer speed mn of a signal from a sender node and a process that uses a leakage packet module 107 to control a traffic flow from the sender node to a network, and also includes a process that measures a packet missing rate brought into the network by the packet module 107, a process that defines an adjustment area with respect to measured values of a mean bit transfer speed and a missing rate, and a process that corrects a frequency band width assigned for the connection between the sender node and the destination node in response to the mean bit transfer speed and the missing rate which are not contained in the adjustment area.
Abstract:
PROBLEM TO BE SOLVED: To minimize connection setup delay in an access node by selecting an advance calculation path for each connection request and calculating the path when the advance calculation path is not stored in a path designation database and including a process storing it to the path designation database. SOLUTION: A path controller 305 calculates an optimum path through a network to satisfy one set of given service quality designated by the user and to minimize the quantity of network resource used to make the communication path complete. Then the controller builds up a header for a packet generated at a path designating point. As an optimizing criterion, there are the number of intermediate nodes, the characteristic of a connection request, the link capability in the path, its operating state and number of intermediate nodes or the like. The optimum path is stored in a path designation database 308 for reuse.
Abstract:
PROBLEM TO BE SOLVED: To provide a system and its method by which a bandwidth of a consecutive bit rate virtual path connection set up between a source node and a destination node is dynamically adjusted in a packet or cell exchange network comprising a transmission link and a plurality of interconnected nodes. SOLUTION: The network defines a bandwidth management server that accesses information relating to a network node and a transmission link. This server receives indication relating to an initial bandwidth reserved for connection every time virtual path connection or virtual channel connection is set up on the network. The server detects and uses in common the bandwidth available on the transmission link between consecutive bit rate virtual path connections whose bandwidth is adjustable in the consecutive or periodic mode and decides new bandwidth to each connection. A source node is informed of it every time new bandwidth is calculated and adjusts the bandwidth of the consecutive bit rate virtual path connection whose bandwidth is adjustable accordingly.
Abstract:
PROBLEM TO BE SOLVED: To ensure impartiality among all connections supported by a same processor by including processes which measure an average bit transfer speed, control traffic flows, measure a packet missing rate, filter it and request correction of a frequency band width thereby controlling the adjustment of a plurality of connections. SOLUTION: This method includes a process that measures the average bit transfer speed of a signal from a sender node, a process uses a leaked packet control circuit to control a traffic flow from the sender node to the network, a process that measures the missing rate of a packet brought into the network by the leaked packet control circuit, a process filters a missing rate measured value, a correction request process that corrects a frequency band width assigned for connection from the sender node, and a process that corrects a frequency band width of a missing rate measurement low pass filter based thereon.
Abstract:
In an echo filter with a 128-tap delay line, successive sequences of real and imaginary components of samples of flat-spectrum signal are sent along the echo path. From the echo a sequence of samples (z(n)) is received and stored, and the terms of its fast Fourier transform (FFT) are calculated. Each term is rotated through a predetermined angle in accordance with its rank, and an inverse FFT is performed on the rotated terms. The results (h(n)) are sorted for location and measurement of the max. term in the inverse transform, on each side of which a given number of terms are selected and measured for the initial coeffts.