CA2237201A1 - Arrangement and method relating to packet flow control - Google Patents

Arrangement and method relating to packet flow control Download PDF

Info

Publication number
CA2237201A1
CA2237201A1 CA 2237201 CA2237201A CA2237201A1 CA 2237201 A1 CA2237201 A1 CA 2237201A1 CA 2237201 CA2237201 CA 2237201 CA 2237201 A CA2237201 A CA 2237201A CA 2237201 A1 CA2237201 A1 CA 2237201A1
Authority
CA
Canada
Prior art keywords
signals
arrangement
packets
traffic
buffering
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
CA 2237201
Other languages
French (fr)
Inventor
Dan Horlin
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from SE9503967A external-priority patent/SE508328C2/en
Application filed by Individual filed Critical Individual
Publication of CA2237201A1 publication Critical patent/CA2237201A1/en
Abandoned legal-status Critical Current

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The present invention relates to an arrangement and a method for controlling the flow of signals comprising a number of information packets in a communications network, e.g. an ATM-network. The arrangement comprises means for separating the signals in first traffic signals and second traffic signals. The first traffic signals are signals that have a higher proportion of guaranteed resources, i.e. bandwidth, than the second traffic signals. The first traffic signals are also given a lower priority than the second traffic signals. The first and second traffic signals are handled separately.

Description

CA 02237201 1998-0~-08 WO97/17787 PCT/SEs6/01413 Title:
ARRANGEMENT AND METHOD RELATING TO PACKET FLOW CONTROL
.

TECHNICAL FIELD
The present invention relates to an arrangement for controll~
the flow of signals S'~ ising a number o~ information packets in a c; ~n ~ cations network.

The invention also relates to a method of controlling the ~low of signals in the form of information packets.

More particularly the invention relates to controlling the flow o~ information ;nr _ i n~ to ~n~ntrating arrany~ ~nts and most particularly to switch;ng arrangements in c~ ~nications ~y~Lel--~.

STATE OF T~E ART
In digital c~ lnications ~y~ of today the information is divided into packets. Each packet comprises a h~A~e~ and a data field. The h~A~ is the preamble o~ the packet and~contains information about destination address, sometimes also originating address and control bits whereas the data part comprises the information intended for the given address. A cell is a short packet having a predeter~;n~ number of bits, i.e. a packet of a ~i~ed length. Via swit~hing arrangements in the communications network packets or cells are routed from various sources to destinations as given by the address information of the packets via packet switching arrangements. Swit~hi~g arrangement which operate in so called synchronous trans~er mode (STM) are known as well as other switching arrangements operating in asynchronous transfer mode (ATM). Some switching arranyements may also operate in both modes.

The ATM switching technique is a so called fast packet swit~h;ny CA 02237201 1998-0~-08 techni~ue. This SWitCh; ng techn~ que is particularly applicable when different sources have different re~uirements as to bandwidth. Via ATM different or ~xe~ tra~fic streams such as for example data, voice, video or images can be transmitted asynchronously which is clearly advantageous in modern _ lnication ~yxL- wherein one or more kinds of information may need to be transmitted.

In ATM, information is tran~l~ed in the form of cells, i.e.
packets of a fixed length. It is of great importance to the network how the packet switches operate. A number of cells may ~or instance arrive at a switch on a number of different input links at the same time and a number of them may have the same output link destination or there may be a discrepancy between the ~5 number of input links and the number of output links wherein the number of output links is considerably lower than the number of input links. This means that a nlTmhe~ ;nco~i n~ cells may have to compete for an output link. The output link, however, cannot handle more than one cell at a time -~n; n~ that the other cells have to be stored L_.. ~oLarily in a buffer. This puts high ~n~
on the buffering capacity and in some cases the ~p~c~ty may not be sufficient and the cells may even run the risk-of being completely lost. It may also be difficult to fulfil the requirements as to waiting time etc.
Various buffering arrangements or buffering methods have been provided using input buffers, output buffers or a combination of both. One aspect relates to the head of the line problem (HOL).
This is a problem that may occur when a number of data cells are stored in an input buffer which is a waiting position, i.e. the first cell in the bu~fer is waiting to be served. Then all data cells cont~;~e~ in that buffer have to wait, also those cells further down in the queue which are destined for other output links which for example at that ~o~-nt might not be loaded at all. This means that neither the packet switch nor the output links are used to their full capacity but even very poorly. To CA 02237201 1998-0~-08 solve these problems output buffers have been provided as well as inte~ te buffers in a switch core etc. However, this may put high requirements on the output buffers and if there are a number of buffers at different locations, e.g. input buffers, intermediate buffers, output buffers etc. the switch gets very complicated. The cop~n~ n~ patent application "Arrangement and method relating to packet switch~ ng" by the same applicant and filed at the same date as the present application discloses a way how to solve these problems and it is inc~ ~Glated herein by reference.

It may also be required that different gualities o~ service, different QoS, are handled by the network. The SWit~-h; ng arrangements as described in the above mentioned reference also deals with this.

There are different categories of signals one of which is CBR
(constant bit rate). This category puts high requirements on the network and requires reservation of the n~ bandwidth. This means that a network must have a high capacity for such signals since there are not accepted any variations in delay or delays as such at all. CBR signals are generally used for telephony and video signals. In US-A-5 150 358 a system is given separating CBR
signals from the others and h~n~l ~ ng them separately and giving them a higher priority. The CBR service class is however "homogenous" why the same problems are not encountered as when a service class is not homogenous.

Another category relates to signals o~ variable bit rate, VBR, which for example can be used for video. This relate to traffic streams having a guaranteed bandwidth but wherein the requi~ ents as to delay variations are less strict.

A third category relates to ABR signals wherein ABR means available bit rate. The ~ n~ as to variations in delay are low or even none at all for these signals. What is important is CA 02237201 1998-0~-08 that no cells are lost. The signals are e.g. used for data communication. There is today still no st~n~dization relating to ATM ABR ~ut such is expected to be produced soon. One controlling method hAs~ on cellrate meas~l.- ?nts has been suggested. This means that swit~h; ng arrangements in a network reaeiving ATM ABR si~n~ m~a~ aa7aulate a value on an a~uat~
cellrate and f~e~ n~ this information back to the sources of the ~ lc, A source here means either a network terminating equipment or equipment within the network forming terminating equipment only as far as the flow control is ~o~ce~ned. However, since the method is h~ on measuring and f~;ng back of cellrate parameters, it works poorly when the cellrate is close to saturation. This means that links, for example ~p~-n~ive links, e.g. are not used fully or to an acceptable degree.
In WO 92/19060 an ATM switch;ng arrangement is disclosed. Cells are divided into low loss and low delay cells respectively and the switch;n~ arrany ~t comprises a cell buffer which is divided into one y area for each of the two types of cells.
Dep~n~;ng on what kind of cell it is and on the buffer fl-l ln~, the cells are given different priorities for re~;ng in and r~.A~ i ng out respectively. Such an arrangement could hQwever not in a satisfactory way deal with ABR signals.

US-A-5 153 877 relates to allocation of the resources in a packet network. The resources are subdivided into subresources which are to be allocated to n,_ ~n; cations divided into different classes dep~n~;ng on QoS such as packet lossrate and transmission delay.
Also this document does not deal with resource allocation for ABR
signals.

ABR signals for instance are particularly difficult to handle since irrespective of being of one and the same QoS, they can be of different categories such as being guaranteed resources to different extents. There may thus be a variation between not being guaranteed any resources at all up to being guaranteed CA 02237201 1998-0~-08 WO97/17787 PCT/SE96~1413 resources to a considerable or a significant extent.

SUM~ARY
What is nee~ is therefore an arrangement through which links in a ~_ lnication network can be used in an optimal way. An arral.y~ ~ t is particularly nee~A through which the output links of a ~on~ntrating or SWit~-h~ ng arrangement can be used to a desired degree, for example be used ~ lly or at least more efficiently than in hitherto existing systems. An arrangement is also ne~e~ through which the flow control of ATM s~ gn~l ~ can be done in an easy and reliable way while fulf~ different requirements of different signals.

~ven more particularly an arrangement is ne~ through which i nc~ - i ng si gn~l ~ in a fast swit~,hing network which, even if they are within the same service class, are of different categories or of different types can be h~ in a satisfactory way so that said signals are sent on to their respective destination without causing congestion and which still operates satisfactorily when the cellrate is close to saturation.

Moreover a method is ~ through which the flow of signals in the form of information packets can be controlled in such a way that links, particularly output links from co~ntrating~ e.g.
swit~-hing arrangements or expensive links, can be used opti~-lly.
A method is also ne~ through which ATM signals of different QoS or of different types within one and the same QoS can be switched through the network in a way which is adequate for the respective signals while still meeting their respective requirements. A flow controlling arrangement is further also nee~ through which the flow control can be imp~emented in a simple and non-expensive way without considerably affecting the ~o~entrating/swit~h~ ng arrangements or maybe even without affecting them at all.
Therefore an arrangement is provided which comprises means for CA 02237201 1998-0~-08 separating traffic signals at least into those having a higher proportion of guaranteed resources and those having a lower proportion o~ guaranteed resources. The arrangement furthermore ~o.l,~Lises means for separately h~n~ g c;gn~l S of the first and ~conA kind respectively. Particularly the traffic signals of the first mentioned kind have a h~ gh~ proportion of guaranteed bandwidth than the signals of the second kind. Particularly the first mentioned ~ignAl~ are given a lower priority than the ~ ~n~ 1 ~ having a lower proportion of guaranteed resources or particularly bandwidth. The traffic signals particularly relate to signals having a lower proportion of cells that are guaranteed resources e.g. in the form of bandwidth which then are given a higher priority. The arrangement ~,..~ises a bu~fering unit in which packets can be arranged in at least one queue. Particularly there are a num~er of different queues, each for a particular QoS
for signals having di~ferent QoS. The buffering unit particularly ~_ _ i~es a first buf~ering area wherein low priority packets can be stored in at least one queue. Particularly, cells or packets of the same QoS, e.g. ABR cells which have a high proportion of guaranteed bandwidth are stored in the ~ueue in the first buffering area whereas the ABR cells having a lower proportion of yuaranteed bandwidth are stored in the second area of the bu~~ering unit.

Advantageously the packets or cells may be arranged in the buffering unit both dep~n~i ng on QoS and on proportion of guaranteed bandwidth.

In an advantageous embodiment monitoring means are provided for measuring the cellrate of signals not being guaranteed a significant proportion of resources or bandwidth whereas monitoring means also are provided ~or monitoring the ~ueue status in the buffer area of signals having a low priority which thus provides first and second flow control signals which are provided to the sources ~or controlling purposes.

CA 0223720l l998-0~-08 If the signals are fed back to the real source, a source end ~yS~~ (SES), the signals are converted to ABR Explicit Rate - parameters and used for modification of resource management cells (RM) which always are fed back with a given frequency for every r 5 conne~tion. ABR Explicit Rate parameters relate to an estimation by the ~-~n~-ntrating arrangement relating to what c~n~ ~ n~
cellrate can be a~e~Led and they are provided to the sources via the resource manag~ -nt cells. If the f~e~h~ck ~i ~n~l ~ are sent to a virtual source end ~y~ll (VSES) within the network itself, no conversion is required but the signals may contain information based on credit flow results according to e.g. a protocol as defined by the network.

Advantageously a rate flow controlling method (taking the available bandwidth into account) is combined with a cell credit flow control method, cell credit control here relates to storing in the buffering unit irrespectively of whether particular cell credit parameters are used or cellrate parameters of the other method.
In an advantageous embo~; ?nt the arrangement is implemented at the input unit of a switch core. In a most ad~antageous embodiment the switching arrangement has the features of the arrangement as described in the simultaneously filed patent
2~ application by the same applicant which was referred to above.

The invention is applicable to arrangements in general wherein a concentration occurs e.g. requiring any kind of buffering arrangement. The arrangement may comprise a virtual flow controlling element o~ the network, element in this case relating to a segment as defined in relation to ATM A~R signals. The arrangement in a particular embodiment relates to signals having different proportions of guaranteed resources or bandwidth irrespectively of whether they belong to different QoS or whether there are different types of signals of the same QoS, as e.g. A~R
signals which as such can be of different types.

CA 02237201 1998-0~-08 WO97/17787 pcT/sEs6/ol4l3 Moreover, d~p~n~i ng on the proportion of guaranteed resources, signals may be handled in more than two different ways, ~or example there may be separate buffers for one or two or even more of the types of signals i.e. ~r~ i ng on their proportion of guaranteed resources particularly of the same QoS. To summarize this means that the s~ ~n~l ~ more or less sensitive to being stored ~ arily, are stored in one buffer area whereas those si~n~l~ being well c~p~hle of being stored to some extent are stored in another area of the buffering mea~s, whereas those signals who are not guaranteed any bandwidth at all or at least substantially no bandwidth, are controlled via an ordinary cellrate flow controlling method. Instead of storing the s~n~l in different areas of one and the same buffer of bu~fering unit, they may be stored in separate buffers.
There~ore, the invention also provides a swit~.h ~ ng arrangement for swit~-h~n~ information packets ~n-- ~ng to at least one inlet unit on a number of input links, through a switch core on to a nll~h~ of output links which comprises means for separation of ~n~ing traffic signals into at least first and second traffic signals wherein the first traffic signals comprises a higher proportion of packets guaranteed resources than the second traffic signals. Flow control of at least one of said first or second traffic signals is handled separately from the other traffic signals. Advantageously the first and second traf~ic streams of signals respectively are not only handled separately but also differently. Advantageously the first traffic signals are handled using a cell credit flow control method, i.e. the cells are temporarily stored in a buffering unit separately from said second signals until they csn be switched whereas the second traffic stream is handled using a cellrate flow control method.

The invention therefore also provides a method of controlling the flow of signals in the form of cells ; n~ ng on a number of input links to a concentrating arrangement such as e.g. a switching arrangement or a multiplexing arrangement etc.

CA 02237201 1998-0~-08 WO97/17787 pcT/sEs6/~l4l3 according to which these signals are at least separated into those signals having a proportion of guaranteed bandwidth which ~x~e~.~ a given threshold value from the rest of the signals, and hA~l ~ng the flow of these signals separately from said other ~ ~n~ l ~ . Advantageously those signals having a p~ Lion of guaranteed bandwidth or resources being smaller than the thr~h.ol~ value, are given a higher priority. Cel]rate measu~ ~ts may then be undertaken relating to these ~; gn~l ~
whereas information on ~uffering status of the non-prioritized cells is fed back to the sources for flow controlling purposes, i.e. to instruct the sources on how to adjust the ~n~; ng frequency etc. Sources may here mean either a real source and system or a virtual source end ~y~. .

It is an advantage of the invention that links in a network, particularly output links from swit~h; ng arrangements, which for example may be expensive can be more fully used.

Another advantage is that this can be achieved without requiring advanced and costly modifications o~ concentrating arrangements in general or swit~-h; ng arrangements in particular.

~RIEF DESCRIPTION OF THE DRAWINGS
The invention will in the following be further described in a non-limiting way under.reference to the accompanying drawings in which:

FIG l is a schematical illustration of flow control according to the invention, FIG 2 is a schematical illustration of a first embodiment of the invention as implemented in a switch, FIG 3 illustrates more in detail the tr~n~mi~sion of signals in the arrangement of Fig 2, WO97/17787 PCT/S~96/01413 FIG 4 illustrates a schematical flow diagram on the h~nAl j"~
of inc: i ng signals.

DETAILED DESCRIPTION
If a part of i nn~mi ng traffic signals . ises signals which are guaranteed resources or bandwidth to a proportion exceed a given threshold value, these are separated from the other signals.
These tra~fic s;gn~ , which in the following are denoted first traffic signals, are given resources in the form of separate gueue handling. F~h~ok signals ~onnerning buffering unit sizes and control flow delays etc. are used in order to enable Qaturation of the links, i.e. f~ll; ng of the links without causing congestion since the flow through is guaranteed to the first traffic signals. According to different e~hn~;~?nts flow controlling arrangements can e.g. be implemented in network nodes such as switnh; ng arrangements multiplexers etc. but flow controlling srrangements can also be implemented elsewhere in the network. Below an ~oA ~ - t relating to the implementation of a flow controll in~ arrangement in a switching arrangement or in association with a Switch~ ng arrangement will be described under reference to Fig. 2.

Fig. l illustrates a system comprising a network l0, a source end system SES 20 and a destination end system DES 30. The network c~..~lises a n1lmher of nodes 40,50,60. Two of t~e nodes 40,50 each comprise a virtual destination end system VDES 40A;50A and a virtual source end system VSES 40B;50B. The third node 60 is an ordinary node such as a switch or a multiplexer. Generally the invention can be implemented in a no~c~trating arrangemen~ or similar (switching arrangement, multiplexer, etc.) needing a buffer or s;~il~r, C. f. node 60 which will be more thoroughly explained under reference to figs 2 and 3 or it can be implemented as control purpose elements; c.f. nodes 40,50 in Fig.
l.

CA 02237201 1998-0~-08 WO97/17787 PCT/SEs6/01413 From the VDES 40A of node 40 control signals are fed back via an ABR flow control fee~h~-k loop 70. When signals relating to measul.~ ~nt results, cellrate measul- -nts and/or feedback measu..~ - ts on the first and ~on~ signals respectively, are fed back to the real source, a source end ~ys~- SES 20, they must be expressed in terms of cellrate or ABR Explicit Cellrate as will be further illustrated under reference to Fig. 3. Only if ~n~l~ are fed back to a virtual source end sy~e,.l (within the network) they may ~_ _ ise credit hAQ~A information according to a ~l~G~ol defined by the networks.

Credit based flow control (cell credit flow control) here means that the calculation of f~h~ck signals is done t~ki ng into account the buffering capacity that is re~uired in order to be able to handle the flow according to the ABR controlling algorithm and line delays even if no positive f~e~h~-k has taken place.

Cellrate flow control here c , ises a calculation of the f~h~Ck signal in relation to the available bandwidth. In both cases a value on a~able rate is fed back (e.g. in agree~~nt with the ATM ABR specifications).

However, the internal flow control loops 80,90 are specified for the particular network. The loop parameters may e.g. directly give the available buffer space. This is however non-transparent in the network interface.

The ordinary node 60 which as already referred to above e.g. can be switch or a multiplexer does not have to close or complete the control loop itself. The control parameters describing the results of the measurements are included into resource management cells RM. Such RM cells are generally included in every c~nnection in a regular ~nn~, Such resource management cells RM
are generated by the source, SES or VSES. The destination systems, DES or VDES, always return the RM cells via ~eedback CA 02237201 1998-0~-08 WO97/17787 pcT/sEs6lol4l3 loops to the source (SES or VSES).

An ordinary node 60 may alternatively close the loop by including, as ; n~ ~-Ated by 100 ~ RM cells in the feedback loop 9O.
This is e.g. a way of accelerating the fe~i n~ back of signals and thus to speed up the pro~ll~e.

In Fig. 2 an implementation relating to a switchl ng arrangement is illustrated. Signals from a n~ b~ of sources, here merely denoted S, which is int~n~ to mean a number of different sources are,_- ~ng in on a number of input links la, 2a, 3a (lA) to a multipl~i ng device 2A in which they are ~,~c~ntrated or multiplexed. In the demultiplexer 3A the traffic streams or the traffic signals are arranged at least ~-ren~ng on QoS. It should however be clear that it is not nec~ary for the functioning of the present invention that a separation deF~n~ n~ on QoS is done but this merely relates to a particular e~ho~ 1 ~?nt . What is important for the present invention is that a separation is done for signals having different proportions of guaranteed resources, either into two groups or into more groups. The~ may addi~~
be divided dep~nA;ng on addressed output port or according to other criteria. According to the present invention traffic streams having a significant amount of guaranteed bandwidth are separated from the other traffic streams. This means that a queue separation per connection/communication is not necessary which would give a complicated queue h~n~l;ng which also is ~Xp~n~ve to implement. However, the traffic signals are separated into traffic signals which to a significant proportion, or degree, are guaranteed bandwidth, called first traffic signals, and second traffic signals which do not comprise traffic signals which to a significant extent are guaranteed bandwidth. A buffering unit 5A
is provided which comprises two different buffering areas, the first buffering area 5A1, for example for ABR signals having a signiflcant proportion of guaranteed bandwidth which then e.g.
are stored in ~ueues 5a4, 5a5and the second buffering area 5A2 for signals not having a high proportion of guaranted bandwidth or CA 02237201 1998-0~-08 WO97/17787 pcT/sEs6/ol4l3 more generally second signals as defined above.

~ The highest priority is e.g. given to CBR signals (if such are present), constant bit rate signals which are very sensitive to buffering which thus for ~YAmrle may be stored in queue 5a1. ~he ~o~A queue 5az is for eYr _le used for VBR signals i.e.
variable bit rate signals which are somewhat less sensitive to bu~fering. Of course this is just an example, in many cases there may not even be any VBR (or CBR~ signals, these are merely included for exemplifying reasons. The third queue 5A3 iS used for signals not being guaranteed bandwidth to any significant proportion, such as ABR signals or more generally second signals as defined above. 5a4, 5aS denote queues of the first area 5A1 intenAeA for ABR signals or other signals which are guaranteed bandwidth and which can be stored but for which no cells or substantially no cells should be lost. Measuring means are further provided, (not further illustrated in this figure since their functioning should be known per se) for measuring the cellrate of the second signals in a ~-nne~ known per se and for measuring the ~ueue status of the second signals or low priority signals which also can be done in different ways in some known -nn~r, The results of these measurements are then fe~ back to the sources so that they can control their s~nAi ng of cells correspondingly. It should however be noted that the data resulting from the measurements, i.e. the results, have to be converted into ABR Explicit Rate parameters before f~A~ ng back if fed back to a real source end system S~S as discussed above under reference to Fig. l. According to the priorities the signals are then switched through the switch core 8 in a manner known per se and output on the destination output links llal-lla4 also in any m~nner known per se.

The arrangements as described above are int~nA~A to use the available bandwidth to the greatest possible extent and at the same time use the buffering areas to a certain extent for that part of the traffic streams which can be queued in order to get CA 02237201 1998-0~-08 hold of the r~in~ng bandwidth which otherwise could not be fully exploited. This means that output links of the swit~h ~ ng arrangement can be more efficiently used, leaving in practice none or very little c~r~ ty unused. An arrangement according to the present invention gets more efficient the h~g~ the proportion of traffic having a guaranteed bandwidth.

~enerally, by separating the tra~fic streams into a first and a ~e-cond traffic stream (or first and ~c~ traffic signals), the composition of c lnications get more homogenous so that the level of acceptance as to storing in queues is more ~ m~
within the respective streams. By separating those conn~tions which are not, or only to a very low extent, affected by being ~ueued, a ~ueue of an adequate size can be formed for using the ~5 last available bandwidth of e.g. an expensive output link.

The flow controlling arrangement of the invention combines cellrate flow controlling with cell credit flow controlling.

Fig. 3 illustrates in a more detailed m~nne~ the tr~n~m~ssion of data and the feedback flow control signals.

Fig. 3 in principle corresponds to Fig. 2. The more detailed explanation of buffering alternatives, multiplexing/-demultiplexing arrangements is there~ore omitted. Although a switch core 8' is illustrated (like the switch core 8 of Fig.2 ) it should be clear that it does not have to be a switch core. It can be any kind of signal ~-onc~ntrating arrangement which motivates the use of some buffering arrangement comprising separation e.g. into different QoS.

Like in Fig. 2 a concentration of signals on a number of input links lA' is done in a multiplexing arrangement 2A'. The streams of signals are in the demultiplexing arrangement 3A' separated into different groups depending on QoS and stored in ~ueues in the buffering arrangement 5A' e.g.as described under reference to CA 02237201 1998-0~-08 ~$g. 2. Through monitoring arrangement 12' cellrate measurements and queue status measu~- ?nts are undertaken. Since the signal - source in this case is a source end ~Le, SES 20' the queue status results are converted in conversion arrangement 13' into ABR Explicit Rate parameters and used in the modification arran~ - t for modification of resource manay~r t cells RM.
These are by the destination terminal (not illustrated in the figure) via a f~e~hA~k loop sent to the originating te ~n~l, i.e. SES 20'.

In one particular advantageous , h~ i ~ ~t the swit~hi ng arrangement can take the form of a SWitCh; ng arrangement as described in the above cited patent application which is incorporated herein by reference. The switch core 8;8' then ,_ _ ises a number (two or more) of inlet units and a number outlet units wherein to each inlet unit a main buffer unit SA,5A' is provided which in this case also comprises the functionality as described above.

Fig. 4 is schematical flow diagram. For an innn~ing signal the proportion of guaranteed resources is ~x ;ne~ lOl. If it ~xc~
a given threshold value, the QoS, is establ;sh~ 102 and the cell is stored in the appropriate queue in the first buffer area 103.
Then the queue status of the queue QoS1 is measured 104 and the result is fed back to the senA;ng sources 107 in which the s~n~ i ~g of cells is controlled accordingly 108 e.g. the s~nA; ng rate can be increased, decreased or kept at the same level. As discussed in the foregoing, a conversion has to be done if the result is fed back to a real end source. If on the other hand it is established that the proportion of guaranteed resources does not ~xc~ the threshold value, these signals are given a higher priority and the cells are stored in the appropriate queue in the second buffer area 105 or not stored at all< The cellrate parameters of the cellrate are measured 106 and the results are also sent to the sources 107 via a the ~eedback loop for controlling purposes in the sources 108.

WO97/17787 PCT~96/01413 Of course no storing is carried out unless n~e~ since the intention is to use the links in the network, e.g. particularl~
output links from e.g. a switch core associated with the flow control arrangement or located after said arrangement as effectively as possible.

Many variations are possible within the ~cope of the invention.
For eX~ple the arranging or combination of flow controlling arrangements in a network, either as separate or implemented at the input part or inlet unit of a swit~h~ ng arrangement. The invention also applies likewise to any QoS or any service classes as ABR etc., irrespectively of whether the cells are within the same service class, such as ABR, or in different classes as far as the p~ ion of guaranteed resources is ~o~c~ned. It is also possible to divide the cells into more than those two groups correspon~ng to those having a significant proportion guaranteed bandwidth and those who do not, such as for example into more groups for which di~erent threshold values are given etc.

Claims (30)

1. An arrangement for controlling the flow of signals comprising a number of information packets in a communications network, said arrangement comprising means for separating the signals in at least first traffic signals and second traffic signals, c h a r a c t e r i z e d in, that the first traffic signals are signals having a higher proportion of guaranteed resources than the second traffic signals, and in that means further are provided for handling the first and second traffic signals separately and in that the first traffic signals are given a lower priority than the second traffic signals.
2. The arrangement of claim 1, c h a r a c t e r i z e d i n, that the first traffic signals are signals having a significant proportion of guaranteed bandwidth.
3. The arrangement of claim 1 or 2, c h a r a c t e r i z e d i n, that a traffic stream comprising traffic signals having a lower proportion of packets that are guaranteed resources e.g. in the form of bandwidth, have a higher priority.
4. The arrangement of claim 3, c h a r a c t e r i z e d i n, that it further comprises a buffering arrangement (5A;5A') in which packets can be arranged in at least one queue.
5. The arrangement of claim 4, c h a r a c t e r i z e d i n, that the buffering arrangement (5A;5A') at least comprises a first buffering area(5A2) in which low priority packets can be stored.
6. The arrangement of claim 5, c h a r a c t e r i z e d i n, that packets originating from terminals having different QoS are arranged in a number of different queues, at least depending on QoS, in the buffering arrangement (5A;5A').
7. The arrangement of claim 6, c h a r a c t e r i z e d i n, that a queue arranging means arranges the packets of the traffic streams in the buffering arrangement (5A;5A') depending on at least QoS and on proportion of guaranteed bandwidth and wherein packets can be arranged in different buffering areas even if they have the same QoS.
8. The arrangement of anyone of claims 4-7, c h a r a c t e r i z e d i n, that monitoring means (12') are provided for measuring the cellrate of signals having a high priority and means are provided for monitoring the queue status in buffer areas for signals having a lower priority thus providing first and second flow control signals to be used for flow controlling purposes.
9. The arrangement of anyone of the preceding claims, c h a r a c t e r i z e d i n, that cell credit flow control is combined with cellrate flow control for maximizing the use of link capacity without causing link congestion.
10. The arrangement of anyone of claims 4-9, c h a r a c t e r i z e d i n, that the buffering arrangement (5A;5A') and the queue arranging means are implemented at the input unit and the corresponding input buffering means of a switch core (8;8').
11. The arrangement of anyone of the preceding claims, c h a r a c t e r i z e d i n, that the signals comprise ATM cells, the arrangement thus operating in ATM-mode.
12. The arrangement of claim 11, c h a r a c t e r i z e d i n, that at least some of the signals are ABR-signals.
13. The arrangement of anyone of claims 1-12, c h a r a c t e r i z e d i n, that it comprises a virtual flow controlling element arranged internally in a network comprising a virtual source end system (VSES) and a virtual destination end system (VDES).
14. A switching arrangement for switching information packets incoming to at least one inlet unit on a number of input links through a switch core (8;8') on to a number of output links (11a1,...11a4;11A',1A;1A') said arrangement comprising:
means (3A;3A') for separating or arranging incoming packets into at least a first and a second traffic stream, c h a r a c t e r i z e d i n, that the first traffic stream comprises packets to a higher proportion guaranteed resources, i.e. bandwidth, than the second traffic stream, the flow control of at least one of said traffic streams being handled separately from the flow control of the other traffic stream(s) and in that packets of said first traffic stream are given a lower priority than packets of said second traffic stream.
15. The arrangement of claim 14, c h a r a c t e r i z e d i n, that the first traffic stream comprises signals having a significant proportion of guaranteed bandwidth.
16. The arrangement of claims 14 or 15, c h a r a c t e r i z e d i n, that traffic streams comprising signals having a higher proportion of packets that are guaranteed resources have a lower priority whereas the traffic stream having the lowest proportion packets guaranteed bandwidth is given the highest priority.
17. The arrangement of anyone of claims 14-16, c h a r a c t e r i z e d i n, that the packets incoming from terminals having different QoS are arranged in different queues, at least depending on QoS, in an input buffering unit by queue arranging means, said queue arranging means furthermore arranging the packets of the traffic streams in the buffering arrangement depending on the proportion of guaranteed bandwidth.
18. The arrangement of claim 17, c h a r a c t e r i z e d i n, that signals of the same QoS are arranged in different queues (5a1,...,5a5) depending on whether having a significant portion of guaranteed bandwidth or not.
19. The arrangement of claim 18, c h a r a c t e r i z e d i n, that the buffering handling of said first and second traffic streams is separate and/or different and wherein a first buffering area of the input buffering unit (5A;5A') is used for buffering traffic signals having a lower priority.
20. The arrangement of claim 19, c h a r a c t e r i z e d i n, that first flow control signals relating to cellrate measurement on signals having a high priority and second flow control signals relating to queue status in buffers for signals given a lower priority are provided to the destination arrangement and that they are used for flow controlling purposes with the use of resource management cells (RM) sent by said destination arrangement to the sending arrangements (20').
21. The arrangement of anyone of claims 15-20, c h a r a c t e r i z e d i n, that it operates in ATM mode and in that at least some signals comprise ABR-signals.
22. An arrangement for controlling the flow of information packets in a communications system, characterized in that said arrangement comprises:
- means (3A;3A') for separating streams of packets having a proportion of packets being guaranteed bandwidth exceeding a given value, thus at least providing first and second traffic streams, - means for measuring the cellrate of said second packet streams, - buffering means (5A;5A') for temporarily storing packets of said first traffic streams separately from said second traffic stream packets, - means for measuring the fullness of said buffering means, - means for feeding back the cellrate measurement results and cell credit measurement results relating to buffering fullness to the sending sources/system(s) for controlling the flow, - and in that a higher priority is given to said second packets.
23. The arrangement of claim 22, c h a r a c t e r i z e d i n, that the streams of packets are at least to some extent ATM ABR
signals and wherein the capacity on output links via the controlling is maximally exploited.
24. The arrangement of claim 22 or 23, c h a r a c t e r i z e d i n, that the sending system is a virtual sending end system (VSES,40B;50B).
25. The arrangement of claim 23, c h a r a c t e r i z e d i n, that the sending system is a real source end system (SES 20;21') and in that a converting arrangement (13') is provided for converting queue status measurement results into ABR Explioit Rate parameters for modifying resource management cells (RM) which are fed back to the real source end system (SES20;21').
26. A system for controlling the flow of cells from a source end system (SES20;21') to a destination end system (DES30) through a network (10) comprising a number of real nodes (60) and a number of virtual nodes (40,50), c h a r a c t e r i z e d i n, that at least a number of the nodes comprise(s) means for separating (3A) first signals having at least a given proportion of guaranteed bandwidth from second signals having not, buffering means (5A;5A') for temporarily storing at least the first signals and monitoring means (12') for measuring the queue status for said first signals and for measuring the cell rate of said second signals and feeding back the results of said measurements to a preceding sending source (20,40,50;20') to control the transmission of signals.
27. A method of controlling the flow of signals in the form of information packets incoming on a number of input links, comprising the steps of:
- separating the signals at least into first signals having a proportion of guaranteed bandwidth exceeding a given threshold value from second signals thus providing at least first and second signals respectively, - controlling the flow of said first signals separately from said second signals through feeding results about measurements on said first and second signals respectively to sending sources, - giving priority to said second signals having a lower proportion of guaranteed bandwidth.
28. The method of claim 27, further comprising the step of:

- storing said first signals separately from said second signals in buffering means for said first signals.
29. The method of claim 28, further comprising the steps of:
- carrying out cellrate measurements on said first signals, - measuring the buffering status of the queues of the buffering area intended for said first signals, - converting the latter results into ABR Explicit Rate parameters, - feeding the results back to an originating real end source.
30. The method of anyone of claims 27-29, c h a r a c t e r i z e d i n, that the signals having different proportions of guaranteed bandwidth are signals of one and the same service class such as e.g. ABR signals.
CA 2237201 1995-11-09 1996-11-04 Arrangement and method relating to packet flow control Abandoned CA2237201A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
SE9503967-3 1995-11-09
SE9503967A SE508328C2 (en) 1995-11-09 1995-11-09 Device flow and method for packet flow control
PCT/SE1996/001413 WO1997017787A1 (en) 1995-11-09 1996-11-04 Arrangement and method relating to packet flow control

Publications (1)

Publication Number Publication Date
CA2237201A1 true CA2237201A1 (en) 1997-05-15

Family

ID=29405519

Family Applications (1)

Application Number Title Priority Date Filing Date
CA 2237201 Abandoned CA2237201A1 (en) 1995-11-09 1996-11-04 Arrangement and method relating to packet flow control

Country Status (1)

Country Link
CA (1) CA2237201A1 (en)

Similar Documents

Publication Publication Date Title
EP0860070B1 (en) Arrangement and method relating to packet flow control
US6229788B1 (en) Method and apparatus for traffic shaping in a broadband fiber-based access system
KR100229558B1 (en) The low-delay or low-loss switch for asynchronous transfer mode
CA2220889C (en) Switch control circuit and switch control method of atm switchboard
EP0817428B1 (en) Traffic shaper with multiply queued virtual paths
US5719865A (en) Traffic shaping method and apparatus for ATM switching unit
AU695106B2 (en) Method and equipment for prioritizing traffic in an ATM network
US6574223B1 (en) Adaption layer switching
US20010026551A1 (en) Arrangement and method relating to packet switching
JP2004506343A (en) System and method for managing data traffic associated with various quality of service principles using conventional network node switches
CA2076803A1 (en) Arrangement for monitoring the bit rate in atm networks
JP2002532960A (en) System and method for pre-filtering low priority packets of a network node in a network service class using priority based quality of service
US6243359B1 (en) Methods and apparatus for managing traffic in an atm network
US6330222B1 (en) Traffic control apparatus and traffic control method used in exchange
EP0926917A2 (en) Converting circuits and bandwidth management apparatus in mixed network
US6404767B1 (en) Architecture for ABR processing within an ATM switch
JP3597049B2 (en) Route-selection type communication device in integrated network
CA2237201A1 (en) Arrangement and method relating to packet flow control
Makke et al. Performance of the AAL2 Protocol within the UTRAN
US6185186B1 (en) Fixed-length cell handling switching system and a method for controlling a read rate of a fixed-length cell
GB2305576A (en) ATM network having a plurality of input buffers for congestion avoidance
CA2263400C (en) Process for optimising load distribution between connection sections of data package transmission systems
EP1039774B1 (en) An ATM buffer controller and a method thereof
Saito Effectiveness of UBR VC approach in AAL2 networks and Its application to IMT-2000
JPH1155278A (en) Priority control circuit

Legal Events

Date Code Title Description
EEER Examination request
FZDE Dead