-
公开(公告)号：JP2001285363A
公开(公告)日：2001-10-12
申请号：JP2001071621
申请日：2001-03-14
Applicant: LUCENT TECHNOLOGIES INC
Inventor： KUMARAN KRISHNAN , JEFFREY EDMOND MAAGUREEBU , MITRA DEBASIS , KEITH R STANLEY
Abstract: PROBLEM TO BE SOLVED: To effectively manage a communication network that supports quality of a plurality of services(QoS) using generalized processor sharing(GPS) scheduler. SOLUTION: An arbitrary number of QoS service classes become available to an arbitrary number of connection classes on a common trunk. In an embodiment, an overall activity is modeled using a central-limit approximation based on a central-limit theorem. Performance of the GPS scheduler is dominated by importance of scheduling associated with an individual connection. The selection of importance for given connection is formulated as a nonlinear algebraic equation system. In another embodiment, Chernoff approximation is similarly applied. The present invention is applicable to dual leaky bucket regulated(DLBR) connection in the worst case.
-
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.
-
3.发明专利
公开(公告)号：JPH10290196A
公开(公告)日：1998-10-27
申请号：JP5461198
申请日：1998-03-06
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS , MORRISON JOHN A
Abstract: PROBLEM TO BE SOLVED: To exchange signals expressing plural information classes without illegally limiting communication link capacity in a radio network by setting the transmission power of the radio terminal so that the probability of the signal defect period during a certain time period can have a value allowable to the specified information class to which the signal belongs. SOLUTION: An a method for determining the transmission power of a radio terminal 20, for example, the strength of the interference signal during a certain time period is detected by a base station 5, and the average value, variant value and standard deviation of this strength are determined. According to the measurement of allowance signal defect period probability, desired signal strength Pi of the signal containing the information of class (i) to be received by the base station 5 is determined based on the determined average value, the variant value and the standard deviation of the interference signal. Then, the base station 5 prepares a control signal containing the information expressing the determined signal strength Pi and transmits this signal to the terminal 20 within its coverage area 25.
-
公开(公告)号：JPH1028141A
公开(公告)日：1998-01-27
申请号：JP3043997
申请日：1997-02-14
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS , ZIEDINS ILZE
IPC: H04Q3/545 , H04L12/801 , H04L12/911 , H04M3/00 , H04L12/56
Abstract: PROBLEM TO BE SOLVED: To share in-network resources by sharing band width between the services of different classes in a communication link in one network. SOLUTION: The network 110 is provided with nodes 130 and links 140 and band width is respectively related to the respective links. Information is inputted from end points 105. When information or exchange is executed between a call side and a destination end point concerning one call, the call side end point requests the establishment of a route for carrying the call inside the network. For example, the carrying possible route between the end points 105-1 and 105-2 are the nodes 130-1, -2 and -3 and the links 14-1, -3, -5 and -7. One call is carried by the network. That is, the nodes and the links in the specified route are required to provide usage possible resources in order to select the one specified route to forward the call. Then, the network resources are fairly and efficiently utilized between the service classes so as to enable the call carrying route.
-
公开(公告)号：JP2001189760A
公开(公告)日：2001-07-10
申请号：JP2000349142
申请日：2000-11-16
Applicant: LUCENT TECHNOLOGIES INC
Inventor： BOUILLET ERIC , MITRA DEBASIS , RAMAKRISHNAN KAJAMALAI G
Abstract: PROBLEM TO BE SOLVED: To provide a network management method for measuring traffic load for realizing higher efficiency in the operation of a network. SOLUTION: In a method for judging to which selected available service route an incoming call is routed, the available service route is preferentially processed when respective links have sufficient available capacity exceeding specified margin. In a method for calculating charging income, the reduction of a charging amount is requested to lost band width since a network service provider having a contract necessary condition on transported load does not follow a contract.
-
Patent Agency Ranking
公开(公告)号：JP2000295251A
公开(公告)日：2000-10-20
申请号：JP2000076282
申请日：2000-03-17
Applicant: LUCENT TECHNOLOGIES INC
Inventor： ELWALID ANWAR , MITRA DEBASIS
Abstract: PROBLEM TO BE SOLVED: To improve a traffic capacity by allotting a band which is reduced by means of suppressing a guarantee with respect to two different decision theory like service quality classes to be the absolute minimum one through the use of a statistical method to a newly added best-effort type service quality class. SOLUTION: The traffic of each connection 100 arrives at a GPS node after being restricted by a dual leaky packet. A buffer 100 is arranged in each connection 100 and restricted in peak speed. Two service quality(QoS) classes of connection 120 exist and share a band width C. In a GPS scheduler 130, loss does not exist even under the worst condition in the restriction of an output peak speed or the max. delay does not exceed a previously fixed upper limit in the case of a conservative function operation. Then a statistical viewpoint is introduced and buffer-over and the delay are permitted on condition that an offence probability is drastically small concerning a situation where a delay condition is not satisfied.
-
公开(公告)号：JPH10327169A
公开(公告)日：1998-12-08
申请号：JP11418798
申请日：1998-04-09
Applicant: LUCENT TECHNOLOGIES INC
Inventor： ELWALID ANWAR , MITRA DEBASIS
Abstract: PROBLEM TO BE SOLVED: To provide a system for efficiently reinforcing a connection hold capacitance at a node by forming a class, which is not more sensitive concerning delay, while using a data buffer for a node inlet and utilizing the difference of allowability in delay between traffic classes. SOLUTION: A data packet according to the parameter of regulator 16 is stored in a data buffer 42 at a former 28. When a token can be utilized for both a former token buffer 44 and a Ps line 46, a coupling circuit 48 outputs a specified data packet from the former 28. The former token buffer 44, which can hold BTS pieces of tokens, received tokens at a rate γ succeeded from the regulator 16 and a Ps line token buffer 50, which can hold a single token, receives a token at a peak rate Ps (Ps
-
公开(公告)号：JP2003218924A
公开(公告)日：2003-07-31
申请号：JP2003013971
申请日：2003-01-22
Applicant: LUCENT TECHNOLOGIES INC
Inventor： ELWALID ANWAR , MITRA DEBASIS
Abstract: PROBLEM TO BE SOLVED: To provide a system for increasing a connection-carrying capacity of a network node with an efficient method. SOLUTION: The traffic shaping system uses a data buffer at an ingress of the network node to selectively buffer classes of data cells. As such, the traffic shaping system exploits differences in delay tolerances between traffic classes to shape the less delay sensitive traffic classes to reduce the effective bandwidth of a connection of the particular traffic class and thereby increase the nodal connection-carrying capacity. In accordance with certain embodiments, an integrated regulator and shaper is provided which concurrently regulates and shapes the traffic cells to increase the nodal connection-carrying capacity. Further, this invention provides steps for selecting parameters for the regulator and shaper. COPYRIGHT: (C)2003,JPO
-
公开(公告)号：JP2001077848A
公开(公告)日：2001-03-23
申请号：JP2000239399
申请日：2000-08-08
Applicant: LUCENT TECHNOLOGIES INC
Inventor： MITRA DEBASIS , KAJAMALAI GOPALASWAMY
Abstract: PROBLEM TO BE SOLVED: To solve traffic engineering problems of a network which has a QoS service class and at least one service class other than the QoS class by including the use of a linear programming method for the purpose of band allocation to a service route in response to a set of requests by proper service classes. SOLUTION: Even when some of requests in a given service class between the pair of given source and destination are concerned in various VPNs, they are handled as a set. After flow parameters or a load is found thereafter, their quantities are assigned as to VPN and non-VPN traffic. Division is carried out in two stages. All flows in respective routes are divided into non-VPN traffic and VPN traffic directly in proportion to the contribution of non-VPN requests and VPN requests of all the requests. Then the whole VPN flow is distributed by sharing.
-
公开(公告)号：JP2000286896A
公开(公告)日：2000-10-13
申请号：JP2000067099
申请日：2000-03-10
Applicant: LUCENT TECHNOLOGIES INC
Inventor： AUKIA PETRI , LAKSHMAN TIRUNELL V , MITRA DEBASIS , KAJAMALAI GOPARASWAMY , STILIADIS DIMITRIOS
Abstract: PROBLEM TO BE SOLVED: To provide a method and a device for generating a new routing path through the router of a packet network by permitting respective filter rules generated based on the path on a packet flow through the router to regulate a physical path through the router. SOLUTION: A path related to respective packet flows is decided based on service quality supply information and network topology information. The group of single or plural filter routers is generated concerning the pertinent router based on the path related to the packet flow through the router. Respective filter rules regulate the physical path through the pertinent router. The selected filter rule is applied to the respective packets of the packet flow and the respective packets pass through the corresponding path through the pertinent router. In a network 100, for example, the routers 102-107 decide a logic path based on a multi-commodity flow routing method.
-
-
-
-
-
-
-
-
-
Search Results
47
records
(took 0.022 seconds)
