WO1997004605A1 - System and method for optimal virtual path capacity dimensioning with broadband traffic - Google Patents
System and method for optimal virtual path capacity dimensioning with broadband traffic Download PDFInfo
- Publication number
- WO1997004605A1 WO1997004605A1 PCT/SE1996/000941 SE9600941W WO9704605A1 WO 1997004605 A1 WO1997004605 A1 WO 1997004605A1 SE 9600941 W SE9600941 W SE 9600941W WO 9704605 A1 WO9704605 A1 WO 9704605A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- virtual
- dimensioning
- blocking
- virtual path
- virtual paths
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
- H04Q3/0062—Provisions for network management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13526—Indexing scheme relating to selecting arrangements in general and for multiplex systems resource management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13531—Indexing scheme relating to selecting arrangements in general and for multiplex systems virtual networks - inc. PVN
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13562—Indexing scheme relating to selecting arrangements in general and for multiplex systems blocking
Definitions
- This invention relates to a system and method for the efficient dimensioning of a telecommunications network, and more particularly, to a technique for dimensioning defined virtual paths on a constrained physical network using the Entropy Rate Function as a blocking measure.
- Telephone instruments and other communications devices located in a localized geographic area are conventionally connected with one another by means of switching equipment referred to as local exchanges.
- Local exchanges are interconnected by trunk exchanges.
- Telephone/data instruments located in geographic areas separated from one another and connected to different local exchanges communicate with one another via a complex grouping of local and trunk exchanges linked together into a telecommunications network.
- a telecommunication network thus comprises a plurality of interconnected network elements, such as local exchanges, trunk exchanges, mobile radio exchanges, long distance exchanges and combinations thereof.
- traffic from one network element, such as an exchange, to another network element can take various routes that pass through different exchanges.
- Efficient network traffic management of the communication facilities within a network requires that a sufficient number of circuits be available to handle the traffic requirements of each destination without exaggerated congestion on last-choice traffic routes. It also requires that the network congestion be as even as possible on all last-choice routes and that unused capacity within the routes which are actually provided be minimized in order to insure efficient utilization of resources. In addition, the telephone company which operates a network has a limited budget and consequently must get as much efficiency as possible out of the existing resources in each network.
- traffic management within a communications network has included procedures for periodically surveying the traffic patterns within the network and changing the configuration of circuits and routes to increase the traffic handling efficiently.
- more routes and circuits may be added to a network in anticipation of high call densities to a particular location or a particular region and to local events within that region.
- Conventional network management systems are also capable of changing the relative distribution of traffic loads between selected routes within the network in order to efficiently maximize the utilization of the network without excessive degradation in the quality of service (QoS) .
- QoS quality of service
- Asynchronous Transfer Mode (ATM) technology is acquiring increasing significance due to its enhanced ability to provide broadband telecommunications facilities.
- a principal feature of ATM technology is its flexibility in the utilization of network resources.
- One possible approach to exploit this flexibility is to partition the physical network resources, either completely or partially, into logically defined resources. For example, by partitioning a physical network into a plurality of virtual networks, the operation, maintenance and management of a physical network can be substantially simplified. By this procedure, the task of analyzing and solving the traffic routing problem for each call over an entire physical network can be reduced to the considerably simpler routing problem on each virtual network.
- Each of the individual virtual networks have less complexity than the entire physical network as a whole, making the solution of the traffic routing problem easier.
- Partitioning of physical resources can also be necessitated by the existence of different traffic types, different classes of service or varying traffic demands within leased networks.
- a service provider can set up a number of virtual networks defined on top of a single common ATM physical infrastructure. This new flexibility in the configuration of virtual network structures demands efficient dimensioning tools, methods and algorithms. Since the nature of the telecommunications services that will be offered in the future are hard to predict, any dimensioning method that is used to manage the configuration of virtual network resources must be capable of dealing with all types of broadband traffic. If the configuration of a virtual network has to be frequently revised in order to adapt to changes in the pattern of offered traffic, then the computational efficiency of the network redimensioning and configuration control system also needs to be high.
- An algorithm selected for performing network redimensioning and reconfiguring a network should perform its calculations in a time period that is much shorter than the time duration of each virtual network.
- Many existing dimensioning techniques are excluded by the requirement that the dimensioning technique be capable of modeling a general traffic distribution.
- Most commonly used dimensioning methods are not capable of handling general traffic models because of limitations arising from the use of the Erlang blocking measure. The method and system of the present invention overcomes these disadvantages.
- the system and the method of the present invention illustrates a dimensioning technique that supports a general traffic model.
- the dimensioning task is treated as a load balancing problem over the various physical links.
- the optimal solution to the virtual path dimensioning problem corresponds to that choice of allocated capacities over the various virtual paths wherein the blocking on each of the virtual paths is made as uniform as possible over the various links.
- the present invention includes a method for efficiently dimensioning a telecommunications network having a plurality of physical links that interconnect a plurality of exchanges or nodes.
- a plurality of physical links are related to one or more virtual paths.
- Each of the virtual paths provide an individually switchable connection between a pair of exchanges or nodes in the telecommunications network.
- Offered traffic is specified for each of the virtual paths and a transmission capacity constraint is set for each physical link of the telecommunications network.
- the relationship between offered traffic and other computational parameters is modeled on the telecommunications network using an entropy-blocking measure and capacities are allocated to the plurality of virtual paths subject to the transmission capacity constraints for the various physical links such that the blocking probabilities on the various virtual paths are made as uniform as possible within a preselected error bound.
- FIGURE 1 is a block diagram of an illustrative telecommunications network within which virtual path dimensioning may be effected;
- FIGURE 2 is a block diagram illustrating exemplary ATM cell structure
- FIGURE 3 is a block diagram illustrating a number of interconnected virtual paths and virtual channels within an ATM network
- FIGURE 4 is a block diagram illustrating the cross- connection and switching of virtual paths and virtual channels within an ATM network
- FIGURE 5 is a diagram illustrating the CCITT B-ISDN reference model showing the variety of service classes supported and the layers of the standard;
- FIGURE 6 is a diagram showing an illustrative ATM network providing virtual leased line (VLL) service
- FIGURE 7 is a diagram illustrating a multi-layered SDH-based transport network which includes ATM cross- connects
- FIGURE 8 is a diagram illustrating the topological relationship between virtual paths and physical links
- FIGURE 9 is a flow chart depicting the various steps of an illustrative Push Down algorithm for dimensioning virtual paths defined on a physical network
- FIGURE 10 is a graph illustrating the characteristics of the Entropy Rate Function related to the present invention
- FIGURE 11 is a graph illustrating the characteristics of the shift parameter that is related to the Entropy Rate Function illustrated in FIGURE 10;
- FIGURE 12 is a flow chart depicting the various steps of a Virtual Path dimensioning algorithm using the Entropy Rate Function that is related to the present invention.
- FIGURE 1 there is shown an illustrative schematic diagram of a conventional public telecommunications network including a plurality of local exchanges 21 to 26, each of which have a plurality of local subscribers connected thereto and represented by telephone instruments 27.
- Two of the local exchanges 21 and 24 are represented as having remote subscriber multiplex stages 28 and 29 associated therewith which, in turn, have local customers 27 connected thereto.
- the network of FIGURE 1 also includes a plurality of trunking exchanges 31 to 34 which serve primarily to interconnect various local exchanges with one another and to provide routes between various parts of the network. Trunk exchange 31 is shown connected to a mobile exchange 35 which includes a pair of illustrative base stations 36 and 37 serving a plurality of mobile radio telephone subscribers represented at 38.
- telecommunications services such as databases and intelligent networks may also be connected to various ones of the exchanges shown.
- the network of FIGURE 1 also includes a network control system 40 which is connected to each of the exchanges 21 to 35 within the network by means of communication links 41 (represented by dotted lines) for the transmission of control signals to each exchange and for the reception of traffic data from each exchange.
- the network control system 40 issues commands to dynamically reconfigure the communication paths within the various traffic routes of the network as well as to control the alarm systems within the exchanges of the network in order to fine tune the alleviation of congestion conditions within the network.
- ATM Asynchronous Transfer Mode
- bandwidth granularity refers to a characteristic of a network in which the bandwidth required by a call can vary freely throughout the duration of the call.
- ATM has been chosen by the International Brass and Telephone Consultative Committee (CCITT) as the core technology for broadband ISDN (B-ISDN) services.
- CITT International Committee
- B-ISDN broadband ISDN
- An ATM network may be implemented using either plesiochronous digital hierarchy (PDH) or synchronous digital hierarchy (SDH), or both.
- PDH plesiochronous digital hierarchy
- SDH synchronous digital hierarchy
- pure ATM may be used as the bearer for a network whenever the limitations arising from multiple conversions between ATM and STM (synchronous transfer mode) and the resultant performance degradations can be dealt with.
- the ATM cell structure shown in FIGURE 2 is at the heart of ATM technology.
- An ATM cell has a fixed length of 53 bytes, or octets, divided into a 5-octet header and a 48-octet information field (also known as the payload) .
- the ATM cell header is structured as a number field and one of its main functions is to assist in routing the ATM cell from the point of origin to the point of destination through one or more switching nodes.
- the information held in each ATM cell is kept relatively small in order to reduce the size of the internal buffers in the switching nodes and to limit the queuing delays in those buffers.
- ATM operates in a connection-oriented mode.
- the principal function of the ATM cell header is the identification of the virtual connection. Routing information within the ATM cell is contained within two fields: a virtual path identifier (VPl), which determines which virtual path the ATM cell belongs to, and a virtual channel identifier (VCI), which determines which virtual channel in the virtual path the cell belongs to.
- VPl virtual path identifier
- VCI virtual channel identifier
- a virtual channel is a dynamically allocable end-to- end connection.
- Optical transmission links are capable of transporting hundreds of megabits per second, whereas virtual channels may fill only a few kilobits per second of a link.
- a virtual path is a semi ⁇ permanent connection between endpoints.
- Each of virtual paths can transport a large number of simultaneously- connected virtual channels. Since a large group of virtual channels are handled and switched together as a single unit, the total processing requirements of a virtual path are less than that of a virtual circuit, and consequently there is faster processing per (virtual) circuit, resulting in a significantly more efficient use of network resources.
- the network management of virtual paths is relatively simple and efficient.
- the ATM cell header is slightly different at the user-network interface (UNI) compared with the network-node interface (NNI) .
- the UNI contains four bits for generic flow control (GFC) and is used to ensure fair and efficient use of available capacity between a terminal and the network.
- GFC generic flow control
- a payload type indicator (PTI) field is used to indicate whether an ATM cell contains user information or special network information, e.g., for maintenance purposes.
- a cell loss priority (CLP) field encodes a two-level priority and is used when it becomes necessary to discard cells because of network conditions.
- the header information is protected by a check sum contained within the header error control (HEC) field.
- HEC header error control
- ATM cells permits the information transfer rate to adapt to the actual service requirements. Depending upon the capacity required, the number of cells per unit of time can be increased up to the transmission bit-rate limit of the physical medium used to carry the data.
- data cells there are also cells for signaling and maintenance and idle cells. Signaling cells are used between an end user in the network, or between nodes in the network and their function is to setup a service, e.g., a connection. Maintenance cells provide supervision of the ATM layer while idle cells are used to fill the transmission capacity up to the rate of the transmission medium.
- FIGURE 3 there is shown a block diagram illustrating the switching and cross-connection of virtual channels and virtual paths within an ATM link.
- VP switching refers to the switching of an ATM cell using only the upper part of the identifier field, that is, the shorter field (VPl) .
- VP/VC switching the entire identified field is used (both VPl and VCI) .
- a VP/VC path consist of a plurality of interconnected VP/VC lengths. Switching and cross-connection can be performed at either the VP or the VC level.
- the virtual path identifier (VPl) and the virtual channel identifier (VCI) define a two-tier handling and routing structure within the ATM circuitry. From the network architectural standpoint, a virtual path (VP) is a bundle of individual connections, a type of "highway" in the route map of an ATM network.
- One important task in network management is to allocate the right amount of transmission capacity to each such highway (i.e., a virtual path) in order to optimize network performance.
- This optimization task is the objective of bandwidth management or virtual path dimensioning techniques and is the subject matter of one aspect of the present invention as further discussed below.
- FIGURE 4 there are illustrated the concepts of virtual path and virtual channel cross- connection and switching.
- the virtual path identifier (VPl) and virtual channel identifier (VCI) values are only valid for a specific link.
- new VPI/VCI values are assigned to the cell with the combination of physical port and VPI/VCI values providing the identification for the ATM cell.
- the routing of an exemplary ATM cell is then performed, with the aid of translation tables such as that illustrated in TABLE 1, as follows: CONNECTED-FROM PORT VPl VCI CONNECTED-TO PORT VPl VCI
- An ATM cell is the basic multiplexing unit within an ATM transport system, with each cell or information unit containing its own connection and routing information. This feature enables direct multiplexing or demultiplexing of service channels wherein each channel may carry different bit-rates.
- Each ATM cell is identified and routed by information contained in the header within the virtual path identifier (VPl) and virtual channel identifier (VCI) fields.
- VP virtual path
- VCI virtual channel identifier
- a virtual path (VP) is a bundle of multiplexed circuits between two termination points, e.g., switching systems, Local Area Network (LAN) gateways, or private network gateways.
- a VP provides a direct logical link between virtual path terminations, with the VPl value identifying the particular virtual path.
- the virtual path concept used within ATM technology allows multiple virtual channels (VCs) to be handled as a single unit.
- Virtual channels with common properties e.g., the same quality of service (QoS)
- QoS quality of service
- This flexible bundling simplifies the operation and maintenance of an ATM system.
- Both virtual paths and virtual channels can be used to provide semi-permanent paths within the ATM network. Routes are established and released from an operation support system by the setting of "path connect tables" in the cross-connect equipment or in the multiplexers along a path. Virtual channels can also be used for on-demand switching with connections being established by signaling either between a user and the network or within the network.
- ATM technology relates to its protocol architecture and is built around the so-called "core-and-edge" principle.
- the protocol functions specific to the information type being transported such as retransmissions, flow control, and delay equalization, are performed in terminals at the "edges" of the ATM network.
- Within the ATM nodes in this core there are no error checks on the information field nor are there any flow controls. The cell information is simply read, the HEC is then used to correct single-bit errors that might affect the address and the cell is then switched towards its destination.
- An ATM adaptation layer (AAL) is used at the edge of the network to enhance the services provided.
- AAL ATM adaptation layer
- the CCITT reference model for B-ISDN services envisages that the AAL includes service dependent functions.
- the first layer is the physical layer defining the physical interfaces and framing protocols.
- the second ATM layer is independent of the physical medium chosen and defines cell structure, provides multiplexing and demultiplexing and VPI/VCI translation to control the flow of cells within the logical network.
- the third layer is the AAL which provides the important adaptation between the service and the ATM layer thereby allowing service-independent ATM transport.
- the AAL performs mapping between the original service format and the information field of an ATM cell. Exemplary functions provided by the AAL include variable- length packet delineation, sequence numbering, clock recovery and performance monitoring.
- ATM can be used within customer premises to support high speed data communications in and between customer local area networks.
- ATM can be used as an infrastructural resource that is common to all services within a customer premises network, including voice and video communications, data transfers and multimedia applications.
- VLL service is based upon a virtual path concept and allows line capacity to be directly tailored to customer needs and easily changed without modifying the interface structure.
- a large number of logical connections can be offered to a user through user-network interfaces (UNIs) .
- UNIs user-network interfaces
- a custom tailored quality of service can also be offered to a customer, matching the needs of the user.
- multiple classes of service, quality of service classes and performance parameters can be selected. For example, voice services require low transmission delays but can tolerate high bit-errors, while data communications, on the other hand, are more tolerant of network delays but are sensitive to bit-errors.
- the quality of service level of a particular application can be contractually agreed to between a service provider and a customer and audited manually or automatically to ensure compliance.
- FIGURE 6 there is an exemplary virtual channel based VLL service implemented within a ATM network.
- Network terminals A to E are each coupled through flow enforcement nodes 601 to 605, respectively, to ATM cross-connect nodes 611 to 614.
- the ATM network consist of a plurality of ATM cross-connects 611 to 614 which can provide routing both at the virtual path as well as at the virtual channel level.
- the flow enforcement functions 601 to 605 are located at the edge of the ATM network to protect the network against potential overloads. This function ensures that no connection violates the conditions agreed-to when the connections are setup. Additional services can be implemented by adding services to one or more of the cross-connect nodes 611 to 614.
- an exemplary virtual path is illustrated by the wavy line 621 between terminal C and D.
- a first virtual connection between terminals A and B is illustrated by the dashed line 631 while a second virtual connection is illustrated by the dotted line between terminals C and E, as illustrated by the dotted line 632.
- ATM technology can be used to provide new and enhanced entertainment services such as on-demand video to the end user.
- the flexibility of an ATM network makes it possible to support a multitude of services, such as long distance education, home shopping, and games.
- FIGURE 7 illustrates an ATM network which has been overlaid upon a SDH-based layered transport network.
- the layers include a customer premises network layer 701, a local transport network layer 702, a regional transport network layer 703 and a national transport network layer 704.
- ADM add-drop multiplexers
- the local cross-connect nodes 722 are in turn coupled through regional cross-connect nodes 731 in the regional transport network, two of which are coupled by add-drop multiplexers 732.
- a pair of ATM access nodes 723, and SDH rings, comprising the add-drop multiplexers 721, serve the cross-connects 722 and are used for subscriber access with a capacity of up to a full STM-1 (155 megabits per second), the standardized access rate for B-ISDN services.
- POTS can also be carried on this ring network, with remote multiplexers and other access nodes providing the final local-loop connection.
- the ATM access nodes 723 are shared for access to different services from one location and can include both voice and data using different VP/VCs. In the ATM access nodes 723, ATM traffic is concentrated to make more efficient use of the transport capacity.
- the size of a ATM access node can vary, depending upon the capacity required, from a small multiplexer to a large cross-connect.
- ATM cross-connects 733 are used to route traffic between local areas.
- ATM is not visible.
- services such as frame relay and SMDS/CBDS are easily added.
- Functionality for B-ISDN can also be added to both access and regional nodes by adding appropriate software and hardware.
- a network management system 750 such as one operating in accordance with the TMN standard of the CCITT can be implemented to provide the necessary network management functionality to both the SDH and ATM elements of the network.
- the management of the ATM network by subsystem 750 may be implemented in accordance with the telecommunications management and operations support
- TMOS network management systems
- Such network management may include various functionalities such as routing algorithms and congestion control implemented in accordance with the teachings of the present invention as set forth in detail below.
- a useful model in dimensioning a telecommunications network is to treat the dimensioning problem as involving a two-layered structure consisting of a ⁇ first physical network layer, with discrete topology and specified link capacities and a second virtual path layer with virtual paths and their particular routings.
- a traffic demand is offered to the virtual paths in this model.
- the virtual paths are, ipso facto, already routed.
- Each virtual path may travel through numerous physical links but will emulate a highway comprising only a single path.
- Each virtual path will have one characteristic blocking value and one characteristic allocated capacity value with only as many variables in the model as there are virtual paths.
- the term "offered traffic" is used to refer to the time varying demand for transmission capacity along each virtual path.
- the term "traffic demand" is used to indicate the time-averaged value of the offered traffic for each link.
- the traffic is termed as homogenous single-class traffic.
- the offered traffic is non-homogeneous, it is usually modeled using a multi- class Poissonian distribution.
- the offered traffic can also be modeled by a normal distribution. This is referred to as normal traffic.
- network dimensioning can also be based upon actual traffic as determined by measurements.
- a virtual channel is a dynamically allocable end-to-end connection.
- a virtual path is a logical construct that allows multiple virtual channels to be handled and switched together as a single unit. This unified switching reduces the processing requirements overall and also speeds up the transmissions. Since the management of a virtual path is both simpler and more efficient than the management of virtual channels or individual physical circuits, a significantly improved utilization of network resources can be obtained by this technique.
- each virtual path (VP) or route r is an ordered list whose elements are a subset of J.
- the relationship between the virtual paths and the physical links can be defined in terms of a routing matrix, ⁇ , whose elements are:
- FIGURE 8 illustrates the topological relationship between virtual paths and physical links.
- virtual path, VP. consists of physical links P. and P 2
- virtual path, VP 2 consists of physical links P 2 and
- Equation (EQN. 1) ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ a routing matrix of the type defined in Equation (EQN. 1) above, C VP is the virtual path capacity vector and C phys is the physical link capacity vector.
- Equation (EQN. 3) is a vector inequality, it is important to note that corresponding components of both vectors have to satisfy this inequality.
- the routing matrix ⁇ is:
- the call request process to a given route r can be any stationary process for which we know the fictitious occupancy distribution if the process were to be provided with a resource having infinite capacity that accepted all calls and avoided all blockage.
- X r denotes the occupancy level of this fictitious infinite capacity resource, and is commonly referred to in the art as "offered traffic".
- the virtual path dimensioning problem is defined in the system and method of the present invention as having two objectives. First, the transmission capacity allocated to each virtual path needs to be optimized so as to minimize a transmission cost function. Second, for every physical link, the capacities allocated to the various virtual paths traversing this link must not exceed the physical transmission capacity constraint of that physical link.
- the physical capacities that can be allocated to the various virtual paths can be approximated by a continuous function that assumes any real value in the range
- the "Push Down" Dimensioning Technique The virtual path dimensioning task is viewed in the present invention as a load balancing problem in which the "load" is the value of an appropriate chosen blocking measure and where the optimal solution corresponds to that choice of allocated VP capacities wherein the blocking on each of the virtual paths is distributed in as uniform a manner as possible.
- One way to make the blocking distribution uniform is to measure the divergence in the values of the blocking on the various virtual paths and then to minimize this divergence. This approach can be implemented using any standard minimization algorithm, for example, the well-known simulated annealing technique.
- a related approach would be to first identify the virtual path having the highest blocking value and then to minimize the blocking for this virtual path by reallocating capacity from other VPs until the virtual path is no longer the VP with the highest blocking.
- This formulation corresponds to a min-max optimization problem and can be analytically formulated as described below.
- the VP that has the largest blocking is max ⁇ B ( VP ⁇ ) ⁇ where the maximum is taken over all the VPs.
- the maximum of a blocking measure over the set of virtual paths defines the objective function (also known as the cost function) for the VP dimensioning problem.
- the goal of the optimization procedure therefore, is to find the minimum of the objective function, which corresponds to:
- FIGURE 9 shows the various steps in one illustrative embodiment of a Push Down Algorithm for dimensioning virtual paths defined on a physical network.
- the dimensioning process starts at 902 with the definition of the connection topology of the various VPs.
- the various VPs are also assembled into a VP Dimensioning Set.
- the VPs are then grouped at 903 in order of the physical links that they each traverse.
- Initial allocations of transmission capacity are then made to each VP at 904.
- a target figure for reduction in blocking is chosen.
- a blocking measure In one preferred embodiment of the present invention, the Entropy Rate Function, as detailed in the sections following, is used as a blocking measure.
- the target value is used to set termination conditions for the dimensioning algorithm.
- the blocking on each of the VPs is determined at 906 over each of the physical links. If the various VPs traversing a single physical link do not face the same or similar levels of blocking, then the capacities currently allocated to each of the VPs are revised at 907 so as to equalize the blocking values for the VPs within an error bound. Capacity can be added to VPs by the allocation of unallocated physical capacity or by reallocation of already allocated capacity from a less productive VP to a more productive VP. This capacity readjustment is performed without violating the capacity constraints of any of the physical links.
- This process results in the identification at 908 of one or more physical links as being the bottle-necks in this optimization procedure.
- a physical link on which the VP blockage is the highest and whose blockage is not reducible by capacity reallocation is referred to as a critical link.
- Each critical link determines the lowest blocking that can be achieved on VPs traversing that physical link.
- One of the principal tasks of the Push Down algorithm is to identify, at each stage of the optimization procedure, the set of critical links for a given set of virtual paths. Once a critical link is identified at 908, physical capacities can be reallocated between the various virtual paths traversing this critical link in such a way as to equalize the blocking values for each of the virtual paths.
- VPs with allocated capacities are removed from the set of all the VPs that still need to be dimensioned.
- the available physical link capacities are reduced by the allocated capacities of the VPs that were removed in the previous step.
- the dimensioning problem thus reduces to the optimization problem of minimizing the highest blocking probability for the remaining set of VPs. This permits the use of a recursive re-entrant algorithm to implement this procedure.
- This optimization procedure is recursively repeated at 911 until all the capacities of each of the physical links have been allocated.
- this greedy-type algorithm starts with dimensioning the complete set of all VPs and terminates at 912 when the set of virtual paths remaining to be dimensioned becomes a null set.
- the problem of analytically identifying the critical link in a given set of VPs has proven to be a difficult task.
- the push down algorithm employs an iterative approach to identify critical links.
- the algorithm is initialized for all VPs by using a uniform large blocking value for all the VPs.
- the initial blocking value that is selected has to be large enough so that the sum of the initially allocated values of the VP capacities do not exceed the available physical capacities of the various physical links.
- the critical link is identified at each level as being that link which first violates the physical capacity constraints of a traversed physical link.
- the speed and efficiency of the above procedure for identifying the critical link at each stage of the dimensioning process is critically dependent upon the complexity of the blocking measure used in the modeling.
- the Erlang blocking measure also known as the time congestion blocking formula
- the time congestion blocking formula has been used to determine the optimal allocation of VP capacities in a network.
- the present technique incorporating the use of the Entropy Rate Function as a blocking measure yields superior results to those obtainable by use of the Erlang blocking measure.
- the use of the Entropy Rate Function permits the modeling of arbitrary traffic distributions, and in most cases this computation can be done much faster compared to computations based upon other blocking measures. It has also been found that the iterative search for the critical link can be substantially improved, a result principally following from the fact that the Entropy Rate Function is a convex function. Prior to a description of a dimensioning algorithm using the Entropy Rate Function, it would be useful to explore the characteristics of the Entropy Rate Function.
- the Entropy Rate Function As A Blocking Measure As noted earlier, the choice of the blocking measure is critical to the Push Down algorithm. A general expression for the blocking measure based on the Entropy Rate Function will be derived next and applied to .an exemplary situation where the offered traffic is alternately modeled by single-class and by multi-class Poissonian distributions.
- the Entropy Rate Function is known in the art, and has been used to model congestion at the physical link level, see, e.g., J.Y. Hui, A Congestion Measure for Call Admi ssi on and Bandwidth Assignment for Mul ti -Layer Traffic, International Journal of Digital & Analog Cabled Systems (1990) , but has not hitherto been used as a blocking measure in solving either the dimensioning or the planning problem at either the virtual path level or at the network level. Additionally, the Entropy Rate Function has been used to define the concept of "effective capacity" of a physical link.
- Saturation blocking probability can be defined as the probability that the traffic demand exceeds a specified value of transmission capacity.
- the saturation probability is also called the "tail probability", because it denotes the probability mass of the tail of the offered traffic distribution.
- P (X > C) is the probability that the random variable X takes values greater than C.
- I_ y (-C(s) ) I y (C(-s) ) (EQN. 10)
- the use of the Entropy Rate Function to dimension virtual paths when the offered traffic is homogenous is considered first.
- Homogenous Poisson traffic can be characterized by a bandwidth demand parameter, p, the mean call arrival rate, r, and the mean duration of each call, h, (also referred to as the mean holding time) .
- the traffic demand, p is therefore the product of the mean call arrival rate and the mean holding time, i.e., r*h.
- Equation (EQN. 14) can also be expressed solely as a function of the allocated capacity, C, as:
- FIGURE 10 graphs the characteristics of the Entropy Rate Function for different values of offered traffic in the unit bandwidth demand, p.
- FIGURE 11 shows the shift parameter, s, plotted as a function of the allocated capacity, C.
- the transform parameter, s can thus be interpreted as a probability distribution shift parameter.
- the shift parameter takes negative values, the probability distribution is shifted to the left compared to the probability distribution corresponding to the zero value of the shift parameter.
- the shift parameter takes positive values, then the probability value is shifted to the right.
- the Entropy Rate Function For Multi-Class Poissonian Traffic The traffic model can be extended to offered traffic characterized by a multi-class Poisson distribution and the Entropy Rate Function corresponding to such an offered traffic model is derived next.
- ⁇ X is an estimate of the negative logarithm of the
- k is the number of traffic classes and C is the capacity allocated to the VP carrying this aggregated multi-class traffic.
- allocated capacity, C can further be functionally related to the shift parameter, s, as:
- Entropy Rate Function in terms of the shift parameter, s, we can vary s instead of varying C.
- the capacity value can be computed at each iterative step of the algorithm by using Equation (EQN. 22) .
- the zero value of s corresponds to the zero value of the entropy measure.
- the dimensioning algorithm is initialized by setting s to zero for all VPs.
- the Entropy Rate Function can also be used with other traffic models than those based on Poissonian offered traffic distributions. Two other important traffic models are discussed below.
- the first traffic model is based on the Entropy Rate Function for a normal distribution of offered traffic. Corresponding expressions for the Entropy Rate Function are derived for this traffic model.
- the second traffic model is based on the Entropy Rate Function derived from actual traffic flow measurements rather than on explicit assumptions about the distribution of the offered traffic.
- the Entropy Rate Function is shown to be a simple (and convex) quadratic function.
- traffic measurement statistics are defined on the time scale of a standard ATM cell.
- the call-level time scale can be considered to be an approximation of the cell-level time scale. Randomly changing traffic demand during a call can thus be abstracted by one or more parameters describing constant bandwidth demand on the call-level time scale.
- Entropy Rate Function can be estimated from traffic measurements on the cell level. See, e . g. , N.G. Duffield et al. , Entropy of ATM Traffic Streams : A Tool for Estimating QoS Parameters (Dublin Institute for Advanced Studies, 1994) .
- TABLE 2 lists three values of allocated capacities and corresponding traffic demands that were calculated for a fixed blocking value of 0.03. Note that in the last case, the offered traffic is larger than the allocated capacity, even though the blocking is relatively low.
- the Entropy Rate Function is a convex function having a minimum value of zero at E ( X k ) .
- the left branch of the Entropy Rate Function defines the overload region (see FIGURES 10 and 11) .
- an increase in the Entropy Rate Function corresponds to a decrease in the allocated capacity and to negative values of the control parameters.
- Push Down algorithm based on the Entropy Rate Function can be easily extended to cover the overload region. Such an extension requires only a minor modification of the original dimensioning algorithm.
- the left branch region of the Entropy Rate Function corresponds to the approximation of the left tail of the probability mass:
- One interpretation of the objectives of the optimization in the overload region can be as follows. To improve the uniformity of the distribution of entropy utilization measures in this region, the largest consumer of resources (i.e., the VP having the lowest entropy) is identified and the utilization of this extreme representative is decreased. Decreasing utilization of the largest consumer corresponds to an increased Entropy Rate Function in the overload region. Thus, this approach corresponds to a maxi min formulation of the optimization problem. It should be noted that the constraint conditions are now applied by starting with values that initially fall in the overload region.
- the entropy utilization measure is made uniform on each critical link. Further, the capacities of all VPs traversing the critical link are allocated in such a way that the entropy utilization values of these VPs are made equal.
- the objective of the optimization in the right side region of the entropy curve was to increase the capacity allocated to the VP having the highest blocking (i.e., the VP with the least entropy blocking measure) .
- the optimization objective for the left side region can be transformed to an optimization problem for the right side region by replacing the term "utilization” by the term “blocking” and the term “largest consumer of resources" by the term "VP with the largest blocking” in the earlier formulated optimization objective for the left side region.
- the Entropy Rate Function needs to be increased. This can be accomplished by increasing the absolute value of the control parameter, s . If the load does not exceed the resources available, then the shift parameter will be positive and the capacities allocated to the various virtual paths can be successively raised until all the available physical resources are allocated. If, on the other hand, the load exceeds the resources available, then the shift parameter is negative. In such cases, the allocated capacities need to be gradually decreased until they come within the physical resource constraints.
- the VP dimensioning problem aims at allocating limited physical network resources amongst a plurality of predefined VPs given an offered traffic distribution.
- One embodiment of a VP dimensioning algorithm that uses the Entropy Rate Function as a blocking measure is shown in FIGURE 12.
- the process starts with a series of initialization steps 1202 to 1206. All of the VPs that are to be dimensioned are assembled into a VP dimensioning set at 1202.
- the transmission capacity constraints for each physical link in the network are specified at 1203.
- a set of upper limits, for the Entropy Rate Function, I are optionally specified, one per virtual path, at 1204. It should be noted that steps 1202 to 1204 may be performed in any order depending on implementation considerations.
- J ⁇ is specified at 1204 only if there is a realistic likelihood of the offered traffic distribution having a truncated right tail i.e., only if P ⁇ X > C) is zero for values of X that are greater than some finite value, C M_AX v .
- initialization steps include the selection of large and equal blocking values for each of the Virtual Paths at 1205. As explained elsewhere, there is an inverse relationship between the values of the Entropy Rate Function and the corresponding blocking on a VP. Consequently, large blocking values correspond to small values of the Entropy Rate Function.
- initial capacity allocations for the various VPs are also computed at 1205. At 1206, these initial capacity allocations are cumulated over each physical link and compared to the prespecified transmission capacity of that physical link.
- Another step implicit in the initialization process is to choose an offered traffic model, and if this model is not based on measurements, to derive the corresponding relations for the Entropy Rate Function, J, the allocated capacity, C, and the shift parameter, s. This step is not shown in FIGURE 12.
- the dimensioning technique After the initialization steps 1202 to 1206, the dimensioning technique performs recursive steps 1207 to 1215.
- the recursive technique outlined in FIGURE 12 shows a two-level recursion wherein the VP dimensioning algorithm first iteratively allocates capacity to the VPs in the VP dimensioning set, as shown in 1207 to 1210, till one or more physical links reach full (i.e., 100%) utilization.
- critical links Physical links whose capacities are fully allocated are called critical links.
- steps 1207 to 1210 the net effect of steps 1207 to 1210 is to recursively identify critical links. While the critical link identification procedure is likely to identify only one physical link as a critical link at each stage of the iterative procedure, the algorithm, as implemented, is equally capable of identifying and processing more than one critical link at a given time. In one embodiment of the present invention, the identification of critical links is done by incrementing, at 1207, the current Entropy Rate Function estimate by a fixed amount using a functional expression for the Entropy Rate Function that depends on the offered traffic model.
- the values of the shift parameter, s are calculated at 1208 for each of the VPs in the dimensioning set. It should be noted that the shift parameter value represents the slope of the entropy-capacity graph of FIGURE 10, for the corresponding VP.
- the incremental capacities to be allocated to the VPs in the dimensioning set is calculated at 1209 using the incremented values of the Entropy Rate Function. Steps 1207 to 1209 may be performed in a different sequence than that shown in the FIGURE 12 based upon implementation considerations.
- the capacities allocated to various VPs are then cumulated at 1210 for each of the physical links and compared in 1211 against the total capacity of that physical link. If the unallocated physical capacity of a link falls below a preset limit, then the link is determined to be a critical link.
- the computation proceeds to 1212. If no physical link is found to be a critical link, then steps 1207 to 1210 or their equivalents are iteratively repeated until a critical link is found. In rare situations involving offered traffic models having a truncated right tail, it is possible that the iterative procedure is sometimes unable to identify any more critical links. In such situations, the calculation automatically terminates when the Entropy Rate Function reaches its maximum value, as specified at 1204.
- the VP dimensioning algorithm After identifying a critical link, the VP dimensioning algorithm outputs the results and reformulates the problem as shown at 1212 to 1213. Every time one or more physical links are identified at 1211 to be critical links, the VP dimensioning algorithm proceeds to generate output, at 1212, detailing the currently allocated capacities on each of the VPs traversing a critical link. VPs traversing a critical link are removed from the dimensioning set at 1213. If no VPs remain to be dimensioned, then the dimensioning algorithm terminates at 1216.
- the dimensioning set is redefined at 1215 to include only such VPs. Since the VPs traversing critical links were removed from the dimensioning set, and since these removed VPs used up part of the physical link capacities, the dimensioning task reduces to the distribution of the unallocated physical link capacities over the VPs still remaining in the dimensioning set. This is done at 1215 by reducing the available capacities of the various physical links by the amounts allocated to removed VPs that correspond to the critical links last found at 1211. In an alternative embodiment of the invention, the same effect is achieved by freezing the values of the Entropy Rate Function for VPs that have been eliminated from the VP dimensioning set.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP96923176A EP0873656A1 (en) | 1995-07-14 | 1996-07-11 | System and method for optimal virtual path capacity dimensioning with broadband traffic |
JP9506610A JP2000501899A (en) | 1995-07-14 | 1996-07-11 | System and method for optimal virtual path capacity allocation with broadband traffic |
AU63760/96A AU6376096A (en) | 1995-07-14 | 1996-07-11 | System and method for optimal virtual path capacity dimensioning with broadband traffic |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US116995P | 1995-07-14 | 1995-07-14 | |
US60/001,169 | 1995-07-14 | ||
US08/514,480 | 1995-08-11 | ||
US08/514,480 US5872918A (en) | 1995-07-14 | 1995-08-11 | System and method for optimal virtual path capacity dimensioning with broadband traffic |
Publications (1)
Publication Number | Publication Date |
---|---|
WO1997004605A1 true WO1997004605A1 (en) | 1997-02-06 |
Family
ID=26668667
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/SE1996/000941 WO1997004605A1 (en) | 1995-07-14 | 1996-07-11 | System and method for optimal virtual path capacity dimensioning with broadband traffic |
Country Status (6)
Country | Link |
---|---|
US (2) | US5872918A (en) |
EP (1) | EP0873656A1 (en) |
JP (1) | JP2000501899A (en) |
AU (1) | AU6376096A (en) |
CA (1) | CA2226480A1 (en) |
WO (1) | WO1997004605A1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2386287A (en) * | 2002-03-06 | 2003-09-10 | Lucent Technologies Inc | A method of monitoring state of a telecommunications network |
US7277400B2 (en) | 2002-03-06 | 2007-10-02 | Lucent Technologies Inc. | Method of monitoring state of a telecommunications network comprising a plurality of nodes, and a corresponding telecommunications network |
Families Citing this family (54)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
SE9402059D0 (en) * | 1994-06-13 | 1994-06-13 | Ellemtel Utvecklings Ab | Methods and apparatus for telecommunications |
US6304549B1 (en) * | 1996-09-12 | 2001-10-16 | Lucent Technologies Inc. | Virtual path management in hierarchical ATM networks |
US6842780B1 (en) * | 1997-04-08 | 2005-01-11 | Swisscom Ag | Method of management in a circuit-switched communication network and device which can be used as a node in a circuit-switched communication network |
JPH1117719A (en) * | 1997-06-20 | 1999-01-22 | Fujitsu Ltd | Cross connect device |
US6085216A (en) * | 1997-12-31 | 2000-07-04 | Xerox Corporation | Method and system for efficiently allocating resources for solving computationally hard problems |
US6452939B1 (en) | 1998-03-24 | 2002-09-17 | Samsung Electronics Co., Ltd. | ATM interface device with double header conversion |
US6434619B1 (en) * | 1998-04-29 | 2002-08-13 | Alcatel Canada Inc. | Internet-enabled service management system and method |
US6459681B1 (en) * | 1998-11-13 | 2002-10-01 | Sprint Communications Company L.P. | Method and system for connection admission control |
US6493346B1 (en) * | 1999-03-31 | 2002-12-10 | Alcatel Usa Sourcing, L.P. | System for providing conversion of TDM-based frame relay data in a cross-connect matrix to and from ATM data |
US6862559B1 (en) * | 1999-07-23 | 2005-03-01 | Xerox Corporation | Methods and apparatuses for measuring diversity in combinatorial structures |
US6721270B1 (en) * | 1999-08-09 | 2004-04-13 | Lucent Technologies Inc. | Multicommodity flow method for designing traffic distribution on a multiple-service packetized network |
US6427035B1 (en) | 1999-08-12 | 2002-07-30 | Bellsouth Intellectual Property Corporation | Method and apparatus for deploying fiber optic cable to subscriber |
US6519660B1 (en) * | 1999-09-28 | 2003-02-11 | International Business Machines Corporation | Method, system and program products for determining I/O configuration entropy |
US6986137B1 (en) * | 1999-09-28 | 2006-01-10 | International Business Machines Corporation | Method, system and program products for managing logical processors of a computing environment |
US6810422B1 (en) | 2000-01-14 | 2004-10-26 | Lockheed Martin Tactical Defense Systems | System and method for probabilistic quality of communication service determination |
US6963575B1 (en) * | 2000-06-07 | 2005-11-08 | Yipes Enterprise Services, Inc. | Enhanced data switching/routing for multi-regional IP over fiber network |
NO20003682L (en) * | 2000-07-18 | 2002-01-21 | Ericsson Telefon Ab L M | Measurement of holding time in communication networks |
US6654655B1 (en) | 2000-08-10 | 2003-11-25 | Taiwan Semiconductor Manufacturing Co., Ltd | Target generation system based on unlimited capacity allocation |
US20010054097A1 (en) * | 2000-12-21 | 2001-12-20 | Steven Chafe | Monitoring and reporting of communications line traffic information |
US7336658B2 (en) * | 2001-02-28 | 2008-02-26 | Telefonaktiebolaget Lm Ericsson (Publ) | Methods and system of virtual circuit identification based on bit permutation of link numbers for multi-stage elements |
US7054934B2 (en) * | 2001-10-26 | 2006-05-30 | Hewlett-Packard Development Company, L.P. | Tailorable optimization using model descriptions of services and servers in a computing environment |
US7039705B2 (en) * | 2001-10-26 | 2006-05-02 | Hewlett-Packard Development Company, L.P. | Representing capacities and demands in a layered computing environment using normalized values |
US7035930B2 (en) * | 2001-10-26 | 2006-04-25 | Hewlett-Packard Development Company, L.P. | Method and framework for generating an optimized deployment of software applications in a distributed computing environment using layered model descriptions of services and servers |
CA2411806A1 (en) * | 2001-11-16 | 2003-05-16 | Telecommunications Research Laboratory | Wide-area content-based routing architecture |
US7013318B2 (en) * | 2002-05-29 | 2006-03-14 | Raytheon Company | Method and system for encapsulating cells |
US7072960B2 (en) * | 2002-06-10 | 2006-07-04 | Hewlett-Packard Development Company, L.P. | Generating automated mappings of service demands to server capacities in a distributed computer system |
US7305464B2 (en) * | 2002-09-03 | 2007-12-04 | End Ii End Communications, Inc. | Systems and methods for broadband network optimization |
CN1235369C (en) * | 2002-09-17 | 2006-01-04 | 华为技术有限公司 | Method for realizing route distribution in multi-business optimization of photo synchronous digital transmission network |
US7307961B2 (en) | 2002-09-25 | 2007-12-11 | At&T Knowledge Ventures, L.P. | Traffic modeling for packet data communications system dimensioning |
WO2004040846A2 (en) * | 2002-10-29 | 2004-05-13 | British Telecommunications Public Limited Company | Method and apparatus for network management |
US7299273B2 (en) * | 2002-12-16 | 2007-11-20 | International Business Machines Corporation | Method and system to bundle message over a network |
US20040205064A1 (en) * | 2003-04-11 | 2004-10-14 | Nianjun Zhou | Adaptive search employing entropy based quantitative information measurement |
AU2003903602A0 (en) * | 2003-07-14 | 2003-07-24 | Steven Luzima Mutabazi | Networking corridors for packet data and voice communications |
US20080089347A1 (en) * | 2003-08-29 | 2008-04-17 | End Ii End Communications Inc. | Systems and methods for broadband network optimization |
US7756522B2 (en) * | 2003-08-29 | 2010-07-13 | Fujitsu Limited | Dynamic traffic control method and device for the same |
US7382801B2 (en) * | 2003-09-03 | 2008-06-03 | At&T Deleware Intellectual Property, Inc. | Link capacity dimensioning methods for packet switched communications networks, and networks and links dimensioned thereby |
US7577091B2 (en) * | 2004-02-04 | 2009-08-18 | Telefonaktiebolaget Lm Ericsson (Publ) | Cluster-based network provisioning |
US7489638B2 (en) * | 2004-04-08 | 2009-02-10 | Alcatel-Lucent Usa Inc. | Scheduling with delayed graphs for communication networks |
EP1594255B1 (en) * | 2004-05-05 | 2007-09-05 | Siemens Aktiengesellschaft | Load control in a TMN system |
US20080022004A1 (en) * | 2004-12-04 | 2008-01-24 | Electronics And Telecommunications Research Institute | Method And System For Providing Resources By Using Virtual Path |
US20080137533A1 (en) * | 2004-12-23 | 2008-06-12 | Corvil Limited | Method and System for Reconstructing Bandwidth Requirements of Traffic Stream Before Shaping While Passively Observing Shaped Traffic |
US8045453B2 (en) * | 2005-01-20 | 2011-10-25 | Alcatel Lucent | Methods and systems for alleviating congestion in a connection-oriented data network |
US7515594B2 (en) * | 2005-07-15 | 2009-04-07 | Telefonaktiebolaget L M Ericsson (Publ) | Enhanced virtual circuit allocation methods and systems for multi-stage switching elements |
US20070045400A1 (en) * | 2005-08-23 | 2007-03-01 | International Business Machines Corporation | Distriubuted registry for personalization |
US7712134B1 (en) * | 2006-01-06 | 2010-05-04 | Narus, Inc. | Method and apparatus for worm detection and containment in the internet core |
US8300798B1 (en) | 2006-04-03 | 2012-10-30 | Wai Wu | Intelligent communication routing system and method |
EP2285030B1 (en) * | 2006-04-14 | 2012-12-19 | Mitsubishi Electric R&D Centre Europe B.V. | Method for obtaining information representative of the channel quality indication on at least one frequency subband |
US8009669B2 (en) * | 2006-10-16 | 2011-08-30 | Futurewei Technologies, Inc. | System of path computation element protocol support for large-scale concurrent path computation |
US7831700B2 (en) * | 2006-10-16 | 2010-11-09 | Futurewei Technologies, Inc. | Distributed PCE-based system and architecture in multi-layer network |
US8300614B2 (en) * | 2009-05-14 | 2012-10-30 | Avaya Inc. | Preventing packet loops in unified networks |
US20140341568A1 (en) * | 2013-05-20 | 2014-11-20 | Sodero Networks, Inc. | High-Throughput Network Traffic Monitoring through Optical Circuit Switching and Broadcast-and-Select Communications |
US20140369347A1 (en) * | 2013-06-18 | 2014-12-18 | Corning Cable Systems Llc | Increasing radixes of digital data switches, communications switches, and related components and methods |
KR101428573B1 (en) | 2013-06-20 | 2014-08-11 | 경북대학교 산학협력단 | Network Apparatus and Method for Processing Traffic |
US10320970B2 (en) * | 2016-09-28 | 2019-06-11 | Nokia Of America Corporation | System and method for anomaly detection for non-homogenous arrival rate |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5381404A (en) * | 1992-07-14 | 1995-01-10 | Mita Industrial Co., Ltd. | Packet-switching communication network and method of design |
US5430729A (en) * | 1994-04-04 | 1995-07-04 | Motorola, Inc. | Method and apparatus for adaptive directed route randomization and distribution in a richly connected communication network |
Family Cites Families (24)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4679187A (en) * | 1985-04-22 | 1987-07-07 | International Business Machines Corp. | Adaptive trunk-compression system with constant grade of service |
US4669113A (en) * | 1985-04-26 | 1987-05-26 | At&T Company | Integrated network controller for a dynamic nonhierarchical routing switching network |
US5175866A (en) * | 1987-06-03 | 1992-12-29 | Ericcson Ge Mobile Communications Inc. | Fail-soft architecture for public trunking system |
US5199027A (en) * | 1989-03-14 | 1993-03-30 | Alcatel N.V. | Communication switching system |
JP2837182B2 (en) * | 1989-08-04 | 1998-12-14 | 富士通株式会社 | Cell data transmission method, transmission request processing method, and switch |
US5270919A (en) * | 1990-06-04 | 1993-12-14 | At&T Bell Laboratories | Network planning tool |
JP2834293B2 (en) * | 1990-08-17 | 1998-12-09 | 株式会社日立製作所 | How to change the virtual path capacity |
JP3241716B2 (en) * | 1990-08-31 | 2001-12-25 | 株式会社東芝 | ATM exchange method |
JPH04151933A (en) * | 1990-10-16 | 1992-05-25 | Toshiba Corp | Communication network control system |
JPH04326836A (en) * | 1991-04-26 | 1992-11-16 | Nippon Telegr & Teleph Corp <Ntt> | Virtual path capacity controller |
US5179556A (en) * | 1991-08-02 | 1993-01-12 | Washington University | Bandwidth management and congestion control scheme for multicast ATM networks |
JP3071007B2 (en) * | 1991-10-22 | 2000-07-31 | 富士通株式会社 | Communication network control method |
JPH0697952A (en) * | 1992-08-10 | 1994-04-08 | Nippon Telegr & Teleph Corp <Ntt> | Asynchronous transfer mode private network end customer control system |
US5289303A (en) * | 1992-09-30 | 1994-02-22 | At&T Bell Laboratories | Chuted, optical packet distribution network |
US5345444A (en) * | 1992-09-30 | 1994-09-06 | At&T Bell Laboratories | Chuted, growable packet switching arrangement |
US5519707A (en) * | 1992-10-13 | 1996-05-21 | Synoptics Communications, Inc. | Multiplexing of communications services on a virtual service path in an ATM network or the like |
US5715396A (en) * | 1992-10-13 | 1998-02-03 | Bay Networks, Inc. | Method for providing for automatic topology discovery in an ATM network or the like |
US5274643A (en) * | 1992-12-11 | 1993-12-28 | Stratacom, Inc. | Method for optimizing a network having virtual circuit routing over virtual paths |
US5357507A (en) * | 1993-08-24 | 1994-10-18 | Northern Telecom Limited | Fast connection admission control for ATM networks |
US5559877A (en) * | 1995-03-21 | 1996-09-24 | At&T | Automatic provisioning of trunking and routing parameters in a telecommunications network |
US5596722A (en) * | 1995-04-03 | 1997-01-21 | Motorola, Inc. | Packet routing system and method for achieving uniform link usage and minimizing link load |
US5727051A (en) * | 1995-07-14 | 1998-03-10 | Telefonaktiebolaget Lm Ericsson (Publ.) | System and method for adaptive routing on a virtual path broadband network |
US5764740A (en) * | 1995-07-14 | 1998-06-09 | Telefonaktiebolaget Lm Ericsson | System and method for optimal logical network capacity dimensioning with broadband traffic |
US5937042A (en) * | 1996-03-19 | 1999-08-10 | Mci Communications Corporation | Method and system for rehome optimization |
-
1995
- 1995-08-11 US US08/514,480 patent/US5872918A/en not_active Expired - Lifetime
-
1996
- 1996-07-11 WO PCT/SE1996/000941 patent/WO1997004605A1/en not_active Application Discontinuation
- 1996-07-11 CA CA002226480A patent/CA2226480A1/en not_active Abandoned
- 1996-07-11 JP JP9506610A patent/JP2000501899A/en not_active Ceased
- 1996-07-11 EP EP96923176A patent/EP0873656A1/en not_active Withdrawn
- 1996-07-11 AU AU63760/96A patent/AU6376096A/en not_active Abandoned
-
1998
- 1998-11-24 US US09/198,681 patent/US6304639B1/en not_active Expired - Lifetime
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5381404A (en) * | 1992-07-14 | 1995-01-10 | Mita Industrial Co., Ltd. | Packet-switching communication network and method of design |
US5430729A (en) * | 1994-04-04 | 1995-07-04 | Motorola, Inc. | Method and apparatus for adaptive directed route randomization and distribution in a richly connected communication network |
Non-Patent Citations (3)
Title |
---|
J.Y. HUI: "A congestion measure for call admission and traffic engineering for multi-layer multi-rate traffic", INTERNATIONAL JOURNAL OF DIGITAL AND ANALOG COMMUNICATION SYSTEM, vol. 3, no. 2, June 1990 (1990-06-01), UK, pages 127 - 135, XP000564735 * |
R. KRISHNAN ET AL.: "An approach to path-splitting in multipath networks.", INTERNATIONAL CONFERENCE ON COMMUNICATIONS, vol. 3, May 1993 (1993-05-01), USA, pages 1353 - 1357, XP000448363 * |
T. BAUSCHERT ET AL.: "Network engineering for ATM with virtual path", CONFERENCE ON EUROPEAN FIBRE OPTIC COMMUNICATIONS AND NETWORKS, June 1994 (1994-06-01), CH, pages 22 - 26, XP002013625 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2386287A (en) * | 2002-03-06 | 2003-09-10 | Lucent Technologies Inc | A method of monitoring state of a telecommunications network |
GB2386287B (en) * | 2002-03-06 | 2004-04-28 | Lucent Technologies Inc | A method of monitoring state of a telecommunications network comprising a plurality of nodes, and a corresponding telecommunicatons network |
US7277400B2 (en) | 2002-03-06 | 2007-10-02 | Lucent Technologies Inc. | Method of monitoring state of a telecommunications network comprising a plurality of nodes, and a corresponding telecommunications network |
Also Published As
Publication number | Publication date |
---|---|
EP0873656A1 (en) | 1998-10-28 |
CA2226480A1 (en) | 1997-02-06 |
US6304639B1 (en) | 2001-10-16 |
US5872918A (en) | 1999-02-16 |
AU6376096A (en) | 1997-02-18 |
JP2000501899A (en) | 2000-02-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5872918A (en) | System and method for optimal virtual path capacity dimensioning with broadband traffic | |
US5727051A (en) | System and method for adaptive routing on a virtual path broadband network | |
US5764740A (en) | System and method for optimal logical network capacity dimensioning with broadband traffic | |
US5809501A (en) | Method and system of database management in an asynchronous transfer mode (ATM) environment | |
US5812525A (en) | Methods and systems for managing bandwidth resources in a fast packet switching network | |
US5706279A (en) | Methods and systems for managing packet flow into a fast packet switching network | |
US6104699A (en) | Method and device for partitioning physical network resources | |
US7266122B1 (en) | System and method for allocating bandwidth in a communications environment | |
Gursoy et al. | A layered broadband switching architecture with physical or virtual path configurations | |
WO1998053636A1 (en) | System and method for maintaining a table in content addressable memory using hole algorithms | |
Shim et al. | Modeling and call admission control algorithm of variable bit rate video in ATM networks | |
WO2000076148A1 (en) | Method for allocating bandwidth to real-time variable bit rate (rt-vbr) traffic | |
Wu et al. | Efficient bandwidth allocation and call admission control for VBR service using UPC parameters | |
EP1145588B1 (en) | Mechanism and method for dynamically allocating atm connections between exchanges | |
JP3786371B6 (en) | System and method for optimal dimensioning of logical network capacity due to band traffic | |
Erfani et al. | Dynamic access capacity management in a multiservice packet-mode environment | |
Valadas | Dimensioning and Resource Management of ATM Networks | |
Chiotis et al. | The effective bandwidth approach: configuration of ATM virtual connections | |
TW399380B (en) | System and method for optimal virtual path capacity dimensioning with broadband traffic | |
Safaei et al. | Optimal Capacity Allocation for Support of ATM Services over SDH Unidirectional Rings | |
Batubara et al. | An Introduction To B-ISDN And ATM | |
Hwang | Adaptive routing in VP-based ATM networks | |
Ross et al. | Multiservice Loss Systems | |
Chandan | Performance evaluation of an ATM multiplexer. | |
Karlsson | A Superposition of Bursty Sources in a LAN Interconnection Environment |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AL AM AT AU AZ BB BG BR BY CA CH CN CZ DE DK EE ES FI GB GE HU IL IS JP KE KG KP KR KZ LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK TJ TM TR TT UA UG UZ VN AM AZ BY KG KZ MD RU TJ TM |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): KE LS MW SD SZ UG AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN |
|
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 1996923176 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2226480 Country of ref document: CA Ref country code: CA Ref document number: 2226480 Kind code of ref document: A Format of ref document f/p: F |
|
ENP | Entry into the national phase |
Ref country code: JP Ref document number: 1997 506610 Kind code of ref document: A Format of ref document f/p: F |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
WWP | Wipo information: published in national office |
Ref document number: 1996923176 Country of ref document: EP |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 1996923176 Country of ref document: EP |