Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberCA2462793 A1
Publication typeApplication
Application numberCA 2462793
PCT numberPCT/DE2002/003750
Publication date17 Apr 2003
Filing date4 Oct 2002
Priority date4 Oct 2001
Also published asCA2462793C, CN1565143A, DE50214634D1, EP1433352A1, EP1433352B1, US7251242, US20040264450, WO2003032676A1
Publication numberCA 2462793, CA 2462793 A1, CA 2462793A1, CA-A1-2462793, CA2462793 A1, CA2462793A1, PCT/2002/3750, PCT/DE/2/003750, PCT/DE/2/03750, PCT/DE/2002/003750, PCT/DE/2002/03750, PCT/DE2/003750, PCT/DE2/03750, PCT/DE2002/003750, PCT/DE2002/03750, PCT/DE2002003750, PCT/DE200203750, PCT/DE2003750, PCT/DE203750
InventorsKarl Schrodi
ApplicantSiemens Aktiengesellschaft, Karl Schrodi, Nokia Siemens Networks Gmbh & Co. Kg
Export CitationBiBTeX, EndNote, RefMan
External Links: CIPO, Espacenet
Distributed transmission of traffic streams in communication networks
CA 2462793 A1
Abstract
At least one queue is provided per current branch pattern in a network node.
In this way, a queue can be jointly used for a plurality of distribution compartments which are imaged onto the same branch pattern in said node.
Arriving packets are differentiated according to the particular distribution compartment to which they belong (i.e. not according to a particular flow to which they belong inside the distribution compartment). They are then inserted into a corresponding queue accordingly. Said queues are used by the ports belonging to each branch pattern. As soon as a port is free, it selects the next queue to use. The selection thus begins in sufficient time to ensure that no gaps appear on the outgoing line from said port. If a port uses a plurality (in this case fully or partially overlapping) of branch patterns, a search is then carried out for non-empty queues in all of said branch patterns, during the selection. If a plurality of non-empty queues are found in different branch patterns, the following queue to be used is selected according to a pre-determined criteria. The packet to be emitted from said queue is then defined according to a further criterion.
Description  available in
Claims(26)
1. ~Network nodes (1-15) of a packet-oriented communication network (100), the nodes of which are interconnected according to the topology of the network in such a way that a plurality of paths exists between the network nodes, with the following features:
- the network node is contained in at least one distribution fan (VF) that is derived from the network topology for a specific communication relation between a network node configured as a transmitting node (A, C) and a network node configured as a receiving node (B, D) and comprises all the network nodes and routes that can expediently be used for distributed transmission of traffic streams (VS) assigned to the communication relation in the communication network, - a branch pattern (i, t, d) is defined for the network node, onto which the distribution fan is mapped and by means of which a group (B) of outgoing ports (P) of the network node is determined, to which the traffic streams assigned to the distribution fan are to be distributed, whereby the routes assigned to the ports lead to at least two different adjacent network nodes, - at least when at least one traffic stream is currently transmitted in a distributed manner by the network node according to the branch pattern, the network node comprises at least one queuing system (Q11-Q1n) for the branch pattern that comprises at least one queue (Q11).
2. ~Network node according to Claim l, with a separate queuing system (Q21-Q2n, Q31-Q3n) for each branch pattern (t, d), the groups of which differ from the groups of the other branch patterns in at least one port.
3. ~Network node according to one of the preceding Claims, in which in the event that a plurality of different distribution fans are mapped onto the same branch pattern, either a separate queuing system is provided for each different distribution fan or a single queuing system is provided for all the distribution fans.
4. ~Network node according to one of the preceding Claims, with which at least one queuing system comprises at least two queues, whereby at least one of the two queues is flagged with a priority (401-403).
5. ~Network node according to one of the preceding Claims, with a time information element (501-503) at least for the packets waiting in a (high) priority, queue, from which it can be read when the packets were entered in the queue or how long they have been there.
6. ~Network node according to the preceding Claim, with a value range for the time information element that is selected taking into account the transmission time of the shortest possible packet on the fastest port so that an overrun does not occur within a given maximum delay time for a priority packet.
7. ~Network node according to one of the two preceding Claims, comprising a separate, parallel process for sorting and/or rejecting packets, the further transmission of which no longer appears expedient taking into account the time information element.
8. ~Network node according to one of the preceding Claims, comprising a second time information element for at least one of the queues, by means of which the last processing time of the respective queue is indicated for every port of the group assigned to the queue.
9. ~Method for transmitting traffic streams (VS) in a packet-oriented communication network (100) by a network node (1-15), which is configured according to one of the preceding device Claims, with the following stages:
- incoming packets are entered in a queue (Q) assigned to the respective distribution fan taking into account the distribution fan (VF), to which they are assigned and - the packets are transmitted via a port (P) of a group (B) that is determined by mapping the respective relevant distribution fan onto a network-node-specific branch pattern, whereby the routes assigned to the ports of a group each lead to at least two different adjacent network nodes.
10. ~Method according to one of the preceding Claims, with which the traffic streams of a branch group are transmitted in a deliberately irregularly distributed manner via the ports of the assigned group.
11. ~Method according to one of the preceding Claims, with which a scheduling process is initiated by one of the outgoing ports to decide about the outputting of a next packet from one of the queues, said decision taking into account scheduling rules.
12. Method according to the preceding Claim, with which the scheduling process is initiated so promptly by the port before its release that the decision about the next packet to be output and the next packet itself are available so promptly that the next packet can be transmitted from the port immediately after the previous packet.
13. Method according to one of the two preceding Claims, with which in the event of a plurality of filled queues that is assigned to the port, the scheduling rules contain a first predefined criterion, according to which it is decided which queue is processed next.
14. Method according to the preceding Claim, with which in the event of at least partial flagging of the queues with priorities (401-403), when the decision is made, the filled queues with low priority are not taken into account as long as at least one filled queue with a higher priority compared with these queues has to be taken into account.
15. Method according to one of the two preceding Claims, with which the first criterion is configured as one of the following criteria:
- random principle, - cyclical sequence, - size of group, - shortest queue first, - longest queue first, - as a function of queue weighting, - time elapsed since last time said queue was processed, in particular configured as the FIFO principle, with which the queue not processed for longest is processed next, or - number of ports competent to process them.

23~
16. ~Method according to one of Claims 11 to 15, with which in the event of a queue with more than one packet, the scheduling rules comprise a second criterion, according to which the next packet to be transmitted is determined.
17. ~Method according to the preceding Claim, with which the second criteria is configured as FIFO.
18. ~Method according to one of Claims 11 to 17, with which approximation to a required target distribution value is achieved by adaptive adjustment of the scheduling rules.
19. ~Method according to the preceding Claim, with which the necessary adjustment is calculated beforehand and taken into account when defining the scheduling rules.
20. ~Method according to one of the two preceding Claims, with which the scheduling rules are adaptively adjusted during ongoing operation of the communication network.
21. ~Method according to the preceding Claim, with which adjustment of the scheduling rules takes place in the network node autonomously and/or by initiation from outside.
22. ~Method according to one of the two preceding Claims, with which the adjustment is made taking into account a regulating criterion.
23. Method according to the preceding Claim, with which the regulating criterion comprises a comparison between the distribution actually achieved and the required target distribution value, a measurement of the frequency of processing of the different queues, a measurement of the resulting load on the ports per traffic class, a measurement of the mean length of the different queues and/or a measurement of the maximum occurring length of the different queues.
24. Method according to the preceding Claim, with which measurements are based on the number of packets and/or take into account the individual length of the individual packets.
25. Method according to one of the preceding Claims, with which the queues are only created as necessary and unused queues are released again.
26. Communication network (100), comprising at least one network node according to one of the preceding Claims and/or at least one network node with means for implementing the stages of a method according to one of the preceding Claims.
Classifications
International ClassificationH04L12/54, H04L12/841, H04L12/701, H04L12/725, H04L12/70, H04L12/801, H04L12/803, H04L12/851
Cooperative ClassificationH04L47/28, H04L12/5601, H04L47/125, H04L2012/5651, H04L2012/562, H04L47/17, H04L47/10, H04L2012/5632, H04L45/00, H04L45/302, H04L47/2433
European ClassificationH04L47/17, H04L47/12B, H04L47/28, H04L45/00, H04L47/24C1, H04L45/302, H04L47/10, H04L12/56A
Legal Events
DateCodeEventDescription
2 Oct 2007EEERExamination request
17 Nov 2014MKLALapsed
Effective date: 20141006