New! View global litigation for patent families

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

Distributed transmission of traffic streams in communication networks

Info

Publication number
CA2462793A1
CA2462793A1 CA 2462793 CA2462793A CA2462793A1 CA 2462793 A1 CA2462793 A1 CA 2462793A1 CA 2462793 CA2462793 CA 2462793 CA 2462793 A CA2462793 A CA 2462793A CA 2462793 A1 CA2462793 A1 CA 2462793A1
Authority
CA
Grant status
Application
Patent type
Prior art keywords
according
network
preceding
node
queue
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
CA 2462793
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
Siemens Aktiengesellschaft
Karl Schrodi
Nokia Siemens Networks Gmbh & Co. Kg
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

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/24Flow control or congestion control depending on the type of traffic, e.g. priority or quality of service [QoS]
    • H04L47/2425Service specification, e.g. SLA
    • H04L47/2433Allocation of priorities to traffic types
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/30Special provisions for routing multiclass traffic
    • H04L45/302Route determination based on requested QoS
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/12Congestion avoidance or recovery
    • H04L47/125Load balancing, e.g. traffic engineering
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/17Hop by hop
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/28Flow control or congestion control using time considerations
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5619Network Node Interface, e.g. tandem connections, transit switching
    • H04L2012/562Routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5629Admission control
    • H04L2012/5631Resource management and allocation
    • H04L2012/5632Bandwidth allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/54Store-and-forward switching systems
    • H04L12/56Packet switching systems
    • H04L12/5601Transfer mode dependent, e.g. ATM
    • H04L2012/5638Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5651Priority, 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 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.

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

Priority Applications (7)

Application Number Priority Date Filing Date Title
DE10148893.9 2001-10-04
DE2001148893 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.
DE10161547.7 2001-12-14
DE10161508.6 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 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
CA 2462793 Expired - Fee Related CA2462793C (en) 2001-10-04 2002-10-04 Distributed transmission of traffic streams in communication networks

Country Status (6)

Country Link
US (1) US7251242B2 (en)
EP (1) EP1433352B1 (en)
CN (1) CN1565143A (en)
CA (1) CA2462793C (en)
DE (1) DE50214634D1 (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
US7990860B2 (en) 2006-06-16 2011-08-02 Harris Corporation Method and system for rule-based sequencing for QoS
US8064464B2 (en) 2006-06-16 2011-11-22 Harris Corporation Method and system for inbound content-based QoS
US8516153B2 (en) 2006-06-16 2013-08-20 Harris Corporation Method and system for network-independent QoS
US7856012B2 (en) 2006-06-16 2010-12-21 Harris Corporation System and methods for generic data transparent rules to support quality of service
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
US20160036733A1 (en) * 2014-07-29 2016-02-04 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
DE69331054T2 (en) * 1993-07-30 2002-06-20 Ibm Method and apparatus for automatic distribution of a network topology in major and minor Topology
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
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
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
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
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
CA2460998C (en) * 2001-09-20 2011-08-02 Siemens Aktiengesellschaft Transmission of information in a packet-oriented communication network
CN1326375C (en) * 2002-05-08 2007-07-11 诺基亚公司 Distributing scheme for distributing information in network

Also Published As

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

Similar Documents

Publication Publication Date Title
Ramaswami et al. Design of logical topologies for wavelength-routed optical networks
Vokkarane et al. Prioritized burst segmentation and composite burst-assembly techniques for QoS support in optical burst-switched networks
US6973053B1 (en) Using direct cluster member to cluster member links to improve performance in mobile communication systems
US5128932A (en) Traffic flow control and call set-up in multi-hop broadband networks
US6888797B1 (en) Hashing-based network load balancing
US7142536B1 (en) Communications network quality of service system and method for real time information
US6714517B1 (en) Method and apparatus for interconnection of packet switches with guaranteed bandwidth
US6920133B1 (en) Techniques for introducing in-band network management packets in multi-protocol label switching networks
US7774461B2 (en) Mechanism for determining a congestion metric for a path in a network
Subramaniam et al. On optiml converter placement in wavelength-routed networks
US6693909B1 (en) Method and system for transporting traffic in a packet-switched network
US6654374B1 (en) Method and apparatus to reduce Jitter in packet switched networks
US7177946B1 (en) Optimal sync for rapid spanning tree protocol
Lee et al. A constrained multipath traffic engineering scheme for MPLS networks
US4811337A (en) Distributed load sharing
US6473815B1 (en) Queue sharing
US7486681B2 (en) Scheduling of realtime communication in switched networks
US5959990A (en) VLAN frame format
US20030198220A1 (en) Method for reducing packet data delay variation in an internet protocol network
US20050100035A1 (en) Adaptive source routing and packet processing
US20070286185A1 (en) Control of Mobile Packet Streams
US20060168317A1 (en) Method and arrangement for routing data packets in a packet-switching data network
US7212490B1 (en) Dynamic load balancing for dual ring topology networks
Li et al. Maximizing throughput for optical burst switching networks
US6898205B1 (en) Robust transport of IP traffic over wdm using optical burst switching

Legal Events

Date Code Title Description
EEER Examination request
MKLA Lapsed

Effective date: 20141006