CA2462793A1 - Distributed transmission of traffic streams in communication networks - Google Patents

Distributed transmission of traffic streams in communication networks Download PDF

Info

Publication number
CA2462793A1
CA2462793A1 CA002462793A CA2462793A CA2462793A1 CA 2462793 A1 CA2462793 A1 CA 2462793A1 CA 002462793 A CA002462793 A CA 002462793A CA 2462793 A CA2462793 A CA 2462793A CA 2462793 A1 CA2462793 A1 CA 2462793A1
Authority
CA
Canada
Prior art keywords
queue
network node
queues
network
packet
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.)
Granted
Application number
CA002462793A
Other languages
French (fr)
Other versions
CA2462793C (en
Inventor
Karl Schrodi
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.)
Nokia Solutions and Networks GmbH and Co KG
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 DE10148893A external-priority patent/DE10148893A1/en
Application filed by Individual filed Critical Individual
Publication of CA2462793A1 publication Critical patent/CA2462793A1/en
Application granted granted Critical
Publication of CA2462793C publication Critical patent/CA2462793C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
    • H04L47/2433—Allocation of priorities to traffic types
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/302—Route determination based on requested QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/17—Interaction among intermediate nodes, e.g. hop by hop
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/28—Flow control; Congestion control in relation to timing considerations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
    • H04L2012/562—Routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5632—Bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5651—Priority, marking, classes

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 insert ed 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 th at no gaps appear on the outgoing line from said port. If a port uses a plurali ty (in this case fully or partially overlapping) of branch patterns, a search i s 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 p re- determined criteria. The packet to be emitted from said queue is then define d according to a further criterion.

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.
CA2462793A 2001-10-04 2002-10-04 Distributed transmission of traffic streams in communication networks Expired - Fee Related CA2462793C (en)

Applications Claiming Priority (7)

Application Number Priority Date Filing Date Title
DE10148893.9 2001-10-04
DE10148893A DE10148893A1 (en) 2001-10-04 2001-10-04 Method for transmitting streams of traffic in a connectionless packet-oriented communications network uses transmission nodes interconnected so as to create multiple paths between the nodes.
DE10161508.6 2001-12-14
DE10161547.7 2001-12-14
DE10161508 2001-12-14
DE10161547 2001-12-14
PCT/DE2002/003750 WO2003032676A1 (en) 2001-10-04 2002-10-04 Distributed transmission of traffic flows in communication networks

Publications (2)

Publication Number Publication Date
CA2462793A1 true CA2462793A1 (en) 2003-04-17
CA2462793C CA2462793C (en) 2010-12-21

Family

ID=27214622

Family Applications (1)

Application Number Title Priority Date Filing Date
CA2462793A Expired - Fee Related CA2462793C (en) 2001-10-04 2002-10-04 Distributed transmission of traffic streams in communication networks

Country Status (8)

Country Link
US (1) US7251242B2 (en)
EP (1) EP1433352B1 (en)
CN (1) CN1565143A (en)
AU (1) AU2002339349B2 (en)
CA (1) CA2462793C (en)
DE (1) DE50214634D1 (en)
NZ (1) NZ531355A (en)
WO (1) WO2003032676A1 (en)

Families Citing this family (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7554919B1 (en) * 2004-06-09 2009-06-30 Juniper Networks, Inc. Systems and methods for improving packet scheduling accuracy
US7542431B2 (en) * 2005-03-31 2009-06-02 Microsoft Corporation Nodal pattern configuration
US20070070894A1 (en) * 2005-09-26 2007-03-29 Fan Wang Method to determine a scheduling priority value for a user data connection based on a quality of service requirement
CN100450067C (en) * 2005-11-18 2009-01-07 华为技术有限公司 Service apparatus exchange network and exchange method
US20070116007A1 (en) * 2005-11-18 2007-05-24 Weimin Xiao Method and system for scheduling and resource allocation in a data communication network
US7756134B2 (en) 2006-05-02 2010-07-13 Harris Corporation Systems and methods for close queuing to support quality of service
US7894509B2 (en) 2006-05-18 2011-02-22 Harris Corporation Method and system for functional redundancy based quality of service
US8516153B2 (en) 2006-06-16 2013-08-20 Harris Corporation Method and system for network-independent QoS
US8064464B2 (en) 2006-06-16 2011-11-22 Harris Corporation Method and system for inbound content-based QoS
US7856012B2 (en) 2006-06-16 2010-12-21 Harris Corporation System and methods for generic data transparent rules to support quality of service
US7990860B2 (en) 2006-06-16 2011-08-02 Harris Corporation Method and system for rule-based sequencing for QoS
US7916626B2 (en) * 2006-06-19 2011-03-29 Harris Corporation Method and system for fault-tolerant quality of service
US8730981B2 (en) 2006-06-20 2014-05-20 Harris Corporation Method and system for compression based quality of service
US7769028B2 (en) 2006-06-21 2010-08-03 Harris Corporation Systems and methods for adaptive throughput management for event-driven message-based data
US8300653B2 (en) 2006-07-31 2012-10-30 Harris Corporation Systems and methods for assured communications with quality of service
US8031606B2 (en) 2008-06-24 2011-10-04 Intel Corporation Packet switching
US8959249B1 (en) 2010-09-15 2015-02-17 Emc Corporation Cooperative cloud I/O scheduler
US10027602B2 (en) * 2014-07-29 2018-07-17 Oracle International Corporation Packet queue depth sorting scheme for switch fabric

Family Cites Families (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0637152A1 (en) * 1993-07-30 1995-02-01 International Business Machines Corporation Method and apparatus to speed up the path selection in a packet switching network
ATE208109T1 (en) * 1993-07-30 2001-11-15 Ibm METHOD AND DEVICE FOR AUTOMATICALLY DISTRIBUTING A NETWORK TOPOLOGY INTO MAIN AND SUBJECT TOPOLOGY
US5634004A (en) * 1994-05-16 1997-05-27 Network Programs, Inc. Directly programmable distribution element
US6011804A (en) * 1995-12-20 2000-01-04 International Business Machines Corporation Dynamic bandwidth reservation for control traffic in high speed packet switching networks
US6064677A (en) * 1996-06-27 2000-05-16 Xerox Corporation Multiple rate sensitive priority queues for reducing relative data transport unit delay variations in time multiplexed outputs from output queued routing mechanisms
EP0854604A1 (en) * 1997-01-21 1998-07-22 International Business Machines Corporation Multicast group addressing
US7593321B2 (en) * 1997-02-11 2009-09-22 Cisco Technology, Inc. Method and system for a local and fast non-disruptive path switching in high speed packet switching networks
US6934249B1 (en) * 1997-04-01 2005-08-23 Cisco Technology, Inc. Method and system for minimizing the connection set up time in high speed packet switching networks
US6069895A (en) * 1997-08-29 2000-05-30 Nortel Networks Corporation Distributed route server
US6246669B1 (en) * 1997-11-28 2001-06-12 Cisco Technology, Inc. Method and system for optimizing connection set-up operations in a high speed digital network
US6233245B1 (en) * 1997-12-24 2001-05-15 Nortel Networks Limited Method and apparatus for management of bandwidth in a data communication network
US6122743A (en) * 1998-03-31 2000-09-19 Siemens Information And Communication Networks, Inc. System for providing enhanced security for transactions transmitted through a distributed network
US6646989B1 (en) * 1998-06-29 2003-11-11 Lucent Technologies Inc. Hop-by-hop routing with node-dependent topology information
GB9828144D0 (en) * 1998-12-22 1999-02-17 Power X Limited Data switching apparatus
US6865178B1 (en) * 1999-08-20 2005-03-08 International Business Machines Corporation Method and system for establishing SNA connection through data link switching access services over networking broadband services
US6349091B1 (en) * 1999-11-12 2002-02-19 Itt Manufacturing Enterprises, Inc. Method and apparatus for controlling communication links between network nodes to reduce communication protocol overhead traffic
US6819673B1 (en) * 1999-11-25 2004-11-16 International Business Machines Corporation Method and system for establishing SNA sessions over wide area networks
US7248841B2 (en) * 2000-06-13 2007-07-24 Agee Brian G Method and apparatus for optimization of wireless multipoint electromagnetic communication networks
US20020167954A1 (en) * 2001-05-11 2002-11-14 P-Com, Inc. Point-to-multipoint access network integrated with a backbone network
NZ532371A (en) * 2001-09-20 2005-08-26 Siemens Ag Data transmission in a packet-oriented communication network
AU2002258051A1 (en) * 2002-05-08 2003-11-11 Nokia Corporation Distribution scheme for distributing information in a network

Also Published As

Publication number Publication date
NZ531355A (en) 2005-07-29
US20040264450A1 (en) 2004-12-30
EP1433352A1 (en) 2004-06-30
US7251242B2 (en) 2007-07-31
WO2003032676A1 (en) 2003-04-17
CA2462793C (en) 2010-12-21
CN1565143A (en) 2005-01-12
DE50214634D1 (en) 2010-10-14
EP1433352B1 (en) 2010-09-01
AU2002339349B2 (en) 2006-06-08

Similar Documents

Publication Publication Date Title
CA2462793A1 (en) Distributed transmission of traffic streams in communication networks
US5732087A (en) ATM local area network switch with dual queues
US7016366B2 (en) Packet switch that converts variable length packets to fixed length packets and uses fewer QOS categories in the input queues that in the outout queues
US7586909B1 (en) Striping algorithm for switching fabric
Iyer et al. Analysis of a packet switch with memories running slower than the line-rate
US7701849B1 (en) Flow-based queuing of network traffic
JP3435293B2 (en) Packet scheduling apparatus and packet transfer method
US7212490B1 (en) Dynamic load balancing for dual ring topology networks
US20020110134A1 (en) Apparatus and methods for scheduling packets in a broadband data stream
CA2147400C (en) Method of regulating backpressure traffic in a packet switched network
CN1689278B (en) Methods and apparatus for network congestion control
US6934296B2 (en) Packet transfer device and packet transfer method adaptive to a large number of input ports
US6963578B2 (en) Router
US9185046B2 (en) Packet spraying for load balancing across multiple packet processors
US7619969B2 (en) Hardware self-sorting scheduling queue
CA2156654C (en) Dynamic queue length thresholds in a shared memory atm switch
US20070237074A1 (en) Configuration of congestion thresholds for a network traffic management system
CA2535545A1 (en) Method and apparatus for bandwidth guarantee and overload protection in a network switch
JP2001217836A (en) Weighted round robin engine used in case of scheduing distribution of atm cell
JPH09149051A (en) Packet transfer device
US20040151115A1 (en) Congestion control in an optical burst switched network
US7016302B1 (en) Apparatus and method for controlling queuing of data at a node on a network
US7079545B1 (en) System and method for simultaneous deficit round robin prioritization
EP0870415B1 (en) Switching apparatus
US9363186B2 (en) Hierarchical shaping of network traffic

Legal Events

Date Code Title Description
EEER Examination request
MKLA Lapsed

Effective date: 20141006