-
公开(公告)号：JPH10136023A
公开(公告)日：1998-05-22
申请号：JP29000697
申请日：1997-10-22
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS
Abstract: PROBLEM TO BE SOLVED: To provide high packet buffering capacity to established VC (circuit line), while a multi-port node having a common buffer memory maintains the grade of service commitment. SOLUTION: The common buffer memories are temporarily distributed to respective ports, based on valid memory request quantity judged for VC which is established through the ports. Then, whether or not the input packet of established VC is to be received is evaluated for transporting it through the target output port, based on almost all the buffer memories which are not used at present and which can be used for buffering the packets by considering reserved buffer quantity. Reservation buffer quantity is based on whether a temporary distribution memory for the port becomes overload or a load lacks by means of the reception of the input packets (and based on the preferential level of the input packets as options).
-
公开(公告)号：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.
-
公开(公告)号：AT440441T
公开(公告)日：2009-09-15
申请号：AT07750297
申请日：2007-02-08
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS , SANIEE IRAJ , WALID ANWAR I , WIDJAJA INDRA
IPC: H04L29/06
Abstract: A method of operating a packet network includes the step of selecting one of a plurality of candidate gateways to connect a multimedia communication session between the packet network and a TDM network. The packet network has a source node of the multimedia communication session, and the TDM network has a destination of the multimedia communication session. The candidate gateways interconnect the packet network and the TDM network. The selecting step includes comparing end-to-end congestions for bearer traffic between the source node and different candidate gateways of the plurality.
-
公开(公告)号：DE69737343T2
公开(公告)日：2007-11-29
申请号：DE69737343
申请日：1997-10-14
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS
Abstract: The invention concerns a method for a multi-port node (110) having a shared buffer memory (240) to provide enhanced data packet buffering capacity for established virtual circuits (VC's) through the node and one of its output ports (220) while maintaining grades of service commitments. The method admits incoming data packets to a node for an established VC based on a determination of combination of factors including the effective memory requirements for each output port as VC's are created or terminated, the portions of buffer memory in use for conveying packets through the intended output port for the incoming packet, and the total amount of available shared memory in the node. Such determinations enable the node to better decide whether admitting the incoming packet would cause a disproportionate allocation of the shared memory for the intended output port. As a consequence, a relatively high packet buffering capacity can be achieved substantially without violating grades of service commitments.
-
公开(公告)号：CA2213423C
公开(公告)日：2001-12-25
申请号：CA2213423
申请日：1997-08-18
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS
Abstract: The invention concerns a method for a multi-port node having a shared buffer memory to provide enhanced data packet buffering capacity for established vi rtual circuits (VC's) through the node and one of its output ports while maintaini ng grades of service commitments. The method admits incoming data packets to a node for an established VC based on a determination of combination of factor s including the effective memory requirements for each output port as VC's are created or terminated, the portions of buffer memory in use for conveying pa ckets through the intended output port for the incoming packet, and the total amou nt of available shared memory in the node. Such determinations enable the node to better decide whether admitting the incoming packet would cause a disproportionate allocation of the shared memory for the intended output por t. As a consequence, a relatively high packet buffering capacity can be achieved substantially without violating grades of service commitments.
-
Patent Agency Ranking16.发明专利
公开(公告)号：CA2299785A1
公开(公告)日：2000-09-20
申请号：CA2299785
申请日：2000-02-28
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS , ELWALID ANWAR
Abstract: This Generalized Processor Sharing (GPS) is the basis for the packet scheduler of choice in IP routers and ATM switches of the future. The currently accepted approach for the design of GPS schedulers is based on deterministic QoS guarantees, which, it is generally accepted, is overly conservative and leads to limitations on capacity. To address this problem we develop a framework for GPS scheduling which is based on statistical QoS guarantees and statistical multiplexing. We give the design of GPS weights which maximize the coverage of operating points, and also the design of the connection admission control (CAC). The general framework is end-to-end, with two heterogeneous QoS classes coexisting with a third, best effort class. Each QoS class has a specified delay bound together with a bound on the probability of its violation. An important objective is to maximize the bandwidth available to best effort traffic while just satisfying the guarantees of the QoS classes. To this end, we consider output regulated GPS scheduling which has the additional feature of limiting each connection's share of the bandwidth to a specified value, a design parameter which is determined by our analysis. The sources are subject to standard dual leaky bucket regulation. For the design of the GPS weights we give procedures based on two key concepts, the realizable set and the critical weights. The realizable set is the union of all admissible sets of connections of both classes over all weights. One of the main contributions is a pragmatic design process by which most of the realizable set is realized by only two critical weights. In the benign case, the system is "effectively homogeneous" and a single GPS weight suffices, while in the complementary "effectively nonhomogeneous" case it is necessary to switch between the critical weights. The numerical results, which are for a single node with a wide range of traffic and QoS parameters, validate the design procedure and also show that there are substantial capacity gains from statistical multiplexing.
-
公开(公告)号：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.
-
公开(公告)号：DE69739453D1
公开(公告)日：2009-07-30
申请号：DE69739453
申请日：1997-02-04
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS , ZIEDINS ILZE
Abstract: A method shares resources associated with various classes among calls in the various classes according to a state dependent reservation parameter. Nominal amounts of one or more resources are allocated to each call class. When a call of a class of service operating in a network requires resources in excess of those allocated to the class, resources allocated to other classes of service are advantageously shared with the class of service. The sharing is based on a reservation parameter associated with the class of service of the call. The reservation parameter is advantageously a function of the network state. The role of the reservation parameter is to protect underloaded classes (i.e., those classes not using all of their allocated nominal capacity) from excessive borrowing by overloaded classes ( i . e ., classes using more than their allocated nominal capacity). More generally, the inventive method is used to determine if sufficient resources are available for routing calls and to route calls based on the determined available resources.
-
公开(公告)号：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.
-
公开(公告)号：DE602004001910D1
公开(公告)日：2006-09-28
申请号：DE602004001910
申请日：2004-04-19
Applicant: LUCENT TECHNOLOGIES INC
Inventor： GILES RANDY CLINTON , MITRA DEBASIS , SANIEE IRAJ , WIDJAJA INDRA , ZIRNGIBL MARTIN
Abstract: In a system and method of optical communication, optical signals are generated in multiple wavelength channels. Each optical signal is passively transported from an origination node of a network to a destination node. The destination node is determined by the signal wavelength. For at least some signals, the passive transport includes transport through a branch point of the network, such that the signal wavelenth determines the output branch through which the signal is routed. In certain embodiments, signals are generated according to a schedule devised to substantially prevent the concurrent arrival, at the same destination node, of signals having the same wavelength but coming from different origination nodes.
-
-
-
-
-
-
-
-
-
Search Results
47
records
(took 0.021 seconds)
