-
公开(公告)号：JPH09181743A
公开(公告)日：1997-07-11
申请号：JP29428196
申请日：1996-11-07
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS , MORRISON JOHN A , RAMAKRISHNAN KAJAMALAI GOPALAS
Abstract: PROBLEM TO BE SOLVED: To provide a method for designing and optimizing a multirate ATM network by integrally using a nonasymptatic analysis method and a asymptotic analysis method. SOLUTION: One price of routing for a virtual path inside a network 110 between communication device 105-1 and 105-2 is provided with nodes from 130-1 to 130-3 and links 140-1, 140-3, 140-5 and 140-7. Then, the blocking probability of the subset for the link of this set is determined, the sensitivity of network performance is determined as a function of load requested for that network, and that network performance is adjusted based on the sensitivity and the blocking probability. In this case, the asymptotic approximation is applied to both the network loss probability and the network sensitivity for applying their solutions. Next, a global optimizing is applied by using the repetitive steepest ascent procedure, and the virtual path routing and capacitance allocation of set are provided. Thus, when handing the link of wide band width, the complexity of calculation can be canceled.
-
2.发明专利
公开(公告)号：JPH11341154A
公开(公告)日：1999-12-10
申请号：JP11600099
申请日：1999-04-23
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS , MORRISON JOHN A , RAMAKRISHNAN KAJAMALAI GOPALAS
Abstract: PROBLEM TO BE SOLVED: To solve the complex problem of optimal route selection and optimal band width allocation in plural sub-networks and a network supporting plural communication services by making decision of a traffic speed to be provided and allocating the band width to each link of the sub-network by a method which responds to each other. SOLUTION: This method is executed by interaction between a master process 110 and a slave process which exist for each VPN 15. The master process 110 solves a resources allocation problem when a pair of service route traffic density is equivalent to an optimal path selection corresponding to a sub-network link capacity. Each of the slave processes solves an optimal path selection problem in the case of a present pair of the link capacity with regard to each sub-network. All the procedures are repeatedly performed in the way in which each reallocation of the link is performed and then a new solution for the optimal path selection problem regarding each sub-network is found.
-
公开(公告)号：CA2228238C
公开(公告)日：2002-10-01
申请号：CA2228238
申请日：1998-01-27
Applicant: LUCENT TECHNOLOGIES INC
Inventor： BORST SIMON C , RAMAKRISHNAN KAJAMALAI GOPALAS
Abstract: An advantageous measurement technique for evaluating the overall scheduling regularity producible by a scheduling template having particular slot assign mentorderings for respective classes of events such as, for example, transmitting order of communication signals over respective virtual circuits by a node of a network. This measurement technique is used for measuring the overall scheduling regularity producible by each of a plurality of different schedul ing templates to select the template having a desirable regularity measure for u se in establishing a scheduling order of events for a network.
-
公开(公告)号：CA2184018A1
公开(公告)日：1997-05-08
申请号：CA2184018
申请日：1996-08-23
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS , MORRISON JOHN A , RAMAKRISHNAN KAJAMALAI GOPALAS
Abstract: A method is described for network optimization based on a multirate, circuit-switched analysis. Network loss probabilities are determined as a soluti on of a set of fixed point equations and the sensitivity of network performance, as a function of offered load and loss probabilities, is determined as a solution to a set of linear equations. Because the numerical complexity of solving both the fixed poi nt equations and the sensitivity equations is of an order which renders an exact so lution computationally intractable, an asymptotic approximation is applied which yields a solution to the network loss probabilities and network sensitivities. A global optimization procedure is then applied using an iterative, steepest ascent optimization procedure to yield a set of virtual path routings and capacity allocations.
-
公开(公告)号：DE69931841T2
公开(公告)日：2006-11-30
申请号：DE69931841
申请日：1999-04-13
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS , RAMAKRISHNAN KAJAMALAI GOPALAS , MORRISON JOHN A
Abstract: We describe a method for solving the joint problem of optimal routing and optimal bandwidth allocation in a network that supports plural subnetworks and plural communication services. Our method involves, for each source-destination pair communicating via a given subnetwork and a given class of service, determining a traffic rate to be offered to each of a set of permissible routes between that source and that destination, in the given subnetwork and service class. Our method further involves allocating a respective bandwidth to each link of each subnetwork. Significantly, the determinations of traffic rate to be offered, and the allocations of bandwidth to respective links of subnetworks, are performed in a mutually responsive manner.
-
Patent Agency Ranking
公开(公告)号：CA2323396C
公开(公告)日：2006-05-30
申请号：CA2323396
申请日：2000-10-16
Applicant: LUCENT TECHNOLOGIES INC
Inventor： BOUILLET ERIC , RAMAKRISHNAN KAJAMALAI GOPALAS , MITRA DEBASIS
Abstract: Disclosed are network management procedures that apply measurements of traffic load to achieve greater efficiency in the operation of the network. In a method for deciding whether to route an incoming call on a selected potential servi ce route, the potential service route is treated preferentially if each of its links h as available capacity that is more than sufficient by a specified margin. In a method for computing billing revenues, the non-compliance of the network service provid er with contracted requirements for carried load causes a revenue penalty to be exacted for lost bandwidth.
-
公开(公告)号：CA2266157C
公开(公告)日：2003-04-22
申请号：CA2266157
申请日：1999-03-18
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS , MORRISON JOHN A , RAMAKRISHNAN KAJAMALAI GOPALAS
Abstract: We describe a method for solving the joint problem of optimal routing a nd optimal bandwidth allocation in a network that supports plural subnetworks a nd plural communication services. Our method involves, for each source-destination pai r communicating via a given subnetwork and a given class of service, determini ng a traffic rate to be offered to each of a set of permissible routes between that sourc e and that destination, in the given subnetwork and service class. Our method further involves allocating a respective bandwidth to each link of each subnetwork. Significantly, the determinations of traffic rate to be offered, and the allocations of bandwid th to respective links of subnetworks, are performed in a mutually responsive manner.
-
公开(公告)号：CA2323396A1
公开(公告)日：2001-05-16
申请号：CA2323396
申请日：2000-10-16
Applicant: LUCENT TECHNOLOGIES INC
Inventor： RAMAKRISHNAN KAJAMALAI GOPALAS , MITRA DEBASIS , BOUILLET ERIC
Abstract: Disclosed are network management procedures that apply measurements of traffic load to achieve greater efficiency in the operation of the network. In a method for deciding whether to route an incoming call on a selected potential servi ce route, the potential service route is treated preferentially if each of its links h as available capacity that is more than sufficient by a specified margin. In a method for computing billing revenues, the non-compliance of the network service provid er with contracted requirements for carried load causes a revenue penalty to be exacted for lost bandwidth.
-
公开(公告)号：DE69800157T2
公开(公告)日：2001-01-25
申请号：DE69800157
申请日：1998-03-17
Applicant: LUCENT TECHNOLOGIES INC
Inventor： BORST SIMON C , RAMAKRISHNAN KAJAMALAI GOPALAS
Abstract: An advantageous scheduling template slot ordering for use in establishing a scheduling order of events such as transmitting communication signals in a communication network is determined by assigning at least two initial slot positions to a particular signal class and then determining a regularity measure based on a lower bound for the regularity measure of such assignments and the remaining unassigned slot positions. This lower bound for the regularity measure of the unassigned slots is advantageously based on a hypothetical assignment of fractions of the slot positions to different signal classes instead of limiting the assignment of a slot to a single signal class. This fractional slot assignment produces a regularity measure that is better than or equal to a corresponding regularity measure based on assigning a whole slot to a particular signal class. The lower bound of the regularity measure is then compared with a threshold regularity measure, such as from a known reference scheduling template. If the threshold regularity measure is lower than the determined lower bound, then it is known that the reference template would provide a more desirable regularity of events than any template having the assigned slot positions to that particular signal class. As a consequence, other slot assignments can be compared to the reference template to rapidly identify scheduling templates with enhanced regularity characteristics.
-
公开(公告)号：DE69635092T2
公开(公告)日：2006-06-01
申请号：DE69635092
申请日：1996-11-19
Applicant: LUCENT TECHNOLOGIES INC
Inventor： GAWLICK RAINER , KAMATH ANIL P , PLOTKIN SERGE , RAMAKRISHNAN KAJAMALAI GOPALAS
Abstract: A method of admitting and routing switched virtual circuit requests (210) in a network first finds a set of routing paths on which a requested VC may be routed by using a two step process (220). The method uses a cost function based on a parameter related to the number of hops in a subset of VC connections previously made in the network to determine potential routing paths on which the VC can be routed at a cost below a specified threshold. The method next checks to determine which potential routing paths comprise links and nodes with sufficient resources to accommodate the request. Paths satisfying both steps are output as a set of routing paths and then a second criterion is used to select (240) a path from the set on which to route the request (250). In a distributed routing system, the inventive method uses a local network state to determine the cost function and the set of routing paths. The method further updates (260) local state information at nodes along a path selected from the set and permits other paths from the set to be selected for routing a requested VC if the previously selected path has insufficient resources to accommodate the request.
-
-
-
-
-
-
-
-
-
Search Results
31
records
(took 0.022 seconds)
