-
公开(公告)号：CA2184018C
公开(公告)日：2002-11-26
申请号：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 so lution of a set of fixed point equations and the sensitivity of network performance, a s 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 point equations and the sensitivity equations is of an order which renders an exac t solution computationally intractable, an asymptotic approximation is applied which yi elds a solution to the network loss probabilities and network sensitivities. A glob al optimization procedure is then applied using an iterative, steepest ascent optimization procedure to yield a set of virtual path routings and capacity allocations.
-
22.发明专利
公开(公告)号：CA2314944A1
公开(公告)日：2001-02-09
申请号：CA2314944
申请日：2000-08-03
Applicant: LUCENT TECHNOLOGIES INC
Inventor： RAMAKRISHNAN KAJAMALAI GOPALAS , MITRA DEBASIS
Abstract: A method is described for solving traffic engineering problems in a netwo rk In one aspect, the invention is used in a network that has at least one QoS service class and at least one class of service that is not a QoS class. Bandwidth i s allocated to service routes in the QoS service class so as to optimize a figure of mer it such as network revenue. Then a new allocation is made so as to minimize network usa ge without departing too far from the optimal value of the figure of merit. A residual network consists of that bandwidth that remains unallocated, on each link of the network. Bandwidth for non-QoS traffic is allocated to mutes on the residual network. In a second aspect, the invention involves the use of optimization techniques to allocate bandwidth among service routes in one or more service classes in response to a set of demands in each class. The demands are calculated so as to take into account an effective bandwidth associated with the pertinent class, and so as to make allowance for the stochastic behavior of the traffic demands that occur in practice.
-
公开(公告)号：DE69800157D1
公开(公告)日：2000-06-29
申请号：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.
-
24.发明专利
公开(公告)号：CA2228236A1
公开(公告)日：1998-09-27
申请号：CA2228236
申请日：1998-01-27
Applicant: LUCENT TECHNOLOGIES INC
Inventor： RAMAKRISHNAN KAJAMALAI GOPALAS , BORST SIMON C
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 instea d 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.
-
公开(公告)号：DE60022406T2
公开(公告)日：2006-07-06
申请号：DE60022406
申请日：2000-11-06
Applicant: LUCENT TECHNOLOGIES INC
Inventor： BOUILLET ERIC , MITRA DEBASIS , RAMAKRISHNAN KAJAMALAI GOPALAS
-
Patent Agency Ranking26.发明专利
公开(公告)号：CA2228236C
公开(公告)日：2002-10-22
申请号：CA2228236
申请日：1998-01-27
Applicant: LUCENT TECHNOLOGIES INC
Inventor： RAMAKRISHNAN KAJAMALAI GOPALAS , BORST SIMON C
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 mea surebased 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 in stead of limiting the assignment of a slot to a single signal class. This fractional slotassignment produces a regularity measure that is bet ter than or equal to a corresponding regularity measure based on assigning a whole slot to a partic ularsignal class. The lower bound of the regularity meas ure 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 mo re desirable regularity of events than any template having the assigned slot positions to that particular signal class. As a consequence, other slot assignments canbe compared to the reference template to rapidly identify scheduling templates with enhanced regularity characteristics.
-
公开(公告)号：CA2318724A1
公开(公告)日：2001-09-03
申请号：CA2318724
申请日：2000-09-13
Applicant: LUCENT TECHNOLOGIES INC
Inventor： ARAVAMUDAN MURALI , KUMARAN KRISHNAN , RAMAKRISHNAN KAJAMALAI GOPALAS , SRINIVASAN ARAVIND
Abstract: A method is disclosed for designing a signaling network of call coordinato rs (CCs) for Internet telephony. The new method can be used to design a CC network of arbitrary size that satisfies, with high probability, limitations on the maximum number of sockets per CC and on the maximum number of hops between an arbitrary pair of switches in the network. According to the disclosed method , the network of CCs is treated initially as a collection of isolated points, one point for each CC. Then, links are added between pairs of CCs, excluding pairs lying within the same switch. The links are added randomly, but with a particular probability p, which may be different for different pairs. Thus, whether a given link is added depends, in effect, upon the outcome of a loaded coin toss in which the probability of a positive outcome is p.
-
公开(公告)号：DE69800083T2
公开(公告)日：2000-09-14
申请号：DE69800083
申请日：1998-03-17
Applicant: LUCENT TECHNOLOGIES INC
Inventor： BORST SIMON C , RAMAKRISHNAN KAJAMALAI GOPALAS
Abstract: An advantageous measurement technique evalutes theoverall scheduling regularity producible by a scheduling template having particular slot assignment orderings 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 scheduling templates to select the template having a desirable regularity measure for use in establishing a scheduling order of events for a network.
-
公开(公告)号：CA2266157A1
公开(公告)日：1999-10-24
申请号：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 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.
-
公开(公告)号：CA2228238A1
公开(公告)日：1998-09-27
申请号：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 assignment orderings 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 scheduling templates to select the template having a desirable regularity measure for use i n establishing a scheduling order of events for a network.
-
-
-
-
-
-
-
-
-
Search Results
31
records
(took 0.025 seconds)
