VC MERGEABLE LABLE SWITCHING ROUTER FOR IP COMMUNICATION ON ATM NETWORK

    公开(公告)号:JP2000183888A

    公开(公告)日:2000-06-30

    申请号:JP35853399

    申请日:1999-12-17

    Abstract: PROBLEM TO BE SOLVED: To provide overhead processing having low data by utilizing a reassembled cell for being outputted to a virtual circuit(VC) associated with a packet destination. SOLUTION: Each asynchronous transfer mode(ATM) cell arriving at input pots 320-i (i=1,2,...,N) has two fields, one of them includes an output port number and the other includes an input port number. A packet is reassembled. Cells from respective output buffers are subjected to service according to a designated element set (QoS) condition. The scheduling of each cell can be executed by VC merging, and the scheduling of each packet can be carried out by frame switching. In each node of a path through a network, a data stream is generated to a given destination including data from many different original sources by applying the VC merging.

    METHOD FOR SCHEDULING PACKET IN COMMUNICATION NETWORK BY USING SERVICE CLASS STATISTICAL MULTIPLEXING

    公开(公告)号:JP2000295251A

    公开(公告)日:2000-10-20

    申请号:JP2000076282

    申请日:2000-03-17

    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.

    TRAFFIC FORMATION SYSTEM, NETWORK OPERATING METHOD AND INTEGRATED REGULATOR/FORMER

    公开(公告)号:JPH10327169A

    公开(公告)日:1998-12-08

    申请号:JP11418798

    申请日:1998-04-09

    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

    PACKET SCHEDULING IN A COMMUNICATION NETWORK WITH STATISTICAL MULTIPLEXING OF SERVICE CLASSES

    公开(公告)号:CA2299785A1

    公开(公告)日:2000-09-20

    申请号:CA2299785

    申请日:2000-02-28

    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.

    VC-MERGE-CAPABLE LABEL SWITCHING ROUTERS FOR IP COMMUNICATIONS OVER ATM NETWORKS

    公开(公告)号:CA2289052A1

    公开(公告)日:2000-06-18

    申请号:CA2289052

    申请日:1999-11-08

    Abstract: A VC-merge capable ATM switch allows many routes to be mapped to the same VC label, thereby providing a scalable mapping that can support a large number of edge routers. Such VC merging uses reassembly buffers to insure that cells belonging to different packets intended for the same destination do not interleave with each other. An output-buffered ATM Label Switching Router (ATM LSR) is described that supports VC merging capability while incurring minimal additional buffering overhead compared to non-VC merging approaches.

    TRAFFIC SHAPER FOR NETWORK NODES AND METHOD THEREOF

    公开(公告)号:CA2232144C

    公开(公告)日:2002-03-26

    申请号:CA2232144

    申请日:1998-03-16

    Abstract: The traffic shaping system according to the principles of the present invent ion increases the connection-carrying capacity of a network node by shaping the data cells to increase the admissible number of connections. In accordance with certain embodiments of the present invention, the traffic shaping system uses a data buffer at the ingress of the network node to selectively buffer classes of data cells. As such, the traffic shaping system exploits differences in delay tolerances between traf fic classes to shape the less delay sensitive traffic classes to reduce the effective bandw idth of a connection of the particular traffic class and thereby increase the nodal connection-carrying capacity. Certain embodiments of the traffic shaping sys tem operate within a framework to provide parameters for the traffic shaping system which increas e the connection-carrying capacity for the node while meeting quality of service requirements for the data cells. 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.

    PACKET SCHEDULING IN A COMMUNICATION NETWORK WITH STATISTICAL MULTIPLEXING OF SERVICE CLASSES

    公开(公告)号:CA2299785C

    公开(公告)日:2004-07-06

    申请号:CA2299785

    申请日:2000-02-28

    Abstract: This Generalized Processor Sharing (GPS) is the basis for the packet schedul er 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 base d 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, wit h two heterogeneous QoS classes coexisting with a third, best effort class. Each Q oS 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 outpu t 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 b y our analysis. The sources are subject to standard dual leaky bucket regulation. For the design of the GPS weights we giveprocedures 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 non- homogeneous" 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.

    9.
    发明专利
    未知

    公开(公告)号:DE69806434T2

    公开(公告)日:2003-01-23

    申请号:DE69806434

    申请日:1998-03-31

    Abstract: The traffic shaping system according to the principles of the present invention increases the connection-carrying capacity of a network node by shaping the data cells to increase the admissible number of connections. In accordance with certain embodiments of the present invention, the traffic shaping system uses a data buffer at the 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. Certain embodiments of the traffic shaping system operate within a framework to provide parameters for the traffic shaping system which increase the connection-carrying capacity for the node while meeting quality of service requirements for the data cells. 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.

    10.
    发明专利
    未知

    公开(公告)号:DE69806434D1

    公开(公告)日:2002-08-14

    申请号:DE69806434

    申请日:1998-03-31

    Abstract: The traffic shaping system according to the principles of the present invention increases the connection-carrying capacity of a network node by shaping the data cells to increase the admissible number of connections. In accordance with certain embodiments of the present invention, the traffic shaping system uses a data buffer at the 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. Certain embodiments of the traffic shaping system operate within a framework to provide parameters for the traffic shaping system which increase the connection-carrying capacity for the node while meeting quality of service requirements for the data cells. 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.

Patent Agency Ranking