CN100466596C - System and method for realizing joint use timer function - Google Patents

System and method for realizing joint use timer function Download PDF

Info

Publication number
CN100466596C
CN100466596C CNB2004100629965A CN200410062996A CN100466596C CN 100466596 C CN100466596 C CN 100466596C CN B2004100629965 A CNB2004100629965 A CN B2004100629965A CN 200410062996 A CN200410062996 A CN 200410062996A CN 100466596 C CN100466596 C CN 100466596C
Authority
CN
China
Prior art keywords
scheduling
timer
message
module
virtual channel
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.)
Expired - Fee Related
Application number
CNB2004100629965A
Other languages
Chinese (zh)
Other versions
CN1713615A (en
Inventor
马继彬
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CNB2004100629965A priority Critical patent/CN100466596C/en
Publication of CN1713615A publication Critical patent/CN1713615A/en
Application granted granted Critical
Publication of CN100466596C publication Critical patent/CN100466596C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/10—Code generation
    • H04J13/12—Generation of orthogonal codes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/16—Error detection or correction of the data by redundancy in hardware
    • G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
    • G06F11/2002—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where interconnections or communication control functionality are redundant
    • G06F11/2005—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where interconnections or communication control functionality are redundant using redundant communication controllers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/16—Error detection or correction of the data by redundancy in hardware
    • G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
    • G06F11/2002—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where interconnections or communication control functionality are redundant
    • G06F11/2007—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where interconnections or communication control functionality are redundant using redundant communication media
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/08—Payment architectures
    • G06Q20/10—Payment architectures specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/08—Payment architectures
    • G06Q20/12—Payment architectures specially adapted for electronic shopping systems
    • G06Q20/123—Shopping for digital content
    • G06Q20/1235—Shopping for digital content with control of digital rights management [DRM]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/385—Payment protocols; Details thereof using an alias or single-use codes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/42—Confirmation, e.g. check or permission by the legal debtor of payment
    • G06Q20/425—Confirmation, e.g. check or permission by the legal debtor of payment using two different networks, one for transaction and one for security confirmation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241—Advertisements
    • G06Q30/0277—Online advertisement
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0609—Buyer or seller confidence or verification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/18—Legal services
    • G06Q50/188—Electronic negotiation
    • G—PHYSICS
    • G07—CHECKING-DEVICES
    • G07F—COIN-FREED OR LIKE APPARATUS
    • G07F17/00—Coin-freed apparatus for hiring articles; Coin-freed facilities or services
    • G07F17/16—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for devices exhibiting advertisements, announcements, pictures or the like
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/02—Transmitters
    • H04B1/04—Circuits
    • H04B1/0483—Transmitters with multiple parallel paths
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/38—Transceivers, i.e. devices in which transmitter and receiver form a structural unit and in which at least one part is used for functions of transmitting and receiving
    • H04B1/40—Circuits
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0602—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using antenna switching
    • H04B7/0604—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using antenna switching with predefined switching scheme
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
    • H04B7/0837—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station using pre-detection combining
    • H04B7/084—Equal gain combining, only phase adjustments
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/155—Ground-based stations
    • H04B7/15528—Control of operation parameters of a relay station to exploit the physical medium
    • H04B7/15535—Control of relay amplifier gain
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0064—Concatenated codes
    • H04L1/0066—Parallel concatenated codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0067—Rate matching
    • H04L1/0068—Rate matching by puncturing
    • H04L1/0069—Puncturing patterns
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/02—Arrangements for detecting or preventing errors in the information received by diversity reception
    • H04L1/06—Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829—Arrangements specially adapted for the receiver end
    • H04L1/1835—Buffer management
    • H04L1/1841—Resequencing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829—Arrangements specially adapted for the receiver end
    • H04L1/1848—Time-out mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/12—Arrangements for remote connection or disconnection of substations or of equipment thereof
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2803—Home automation networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2803—Home automation networks
    • H04L12/2807—Exchanging configuration information on appliance services in a home automation network
    • H04L12/2809—Exchanging configuration information on appliance services in a home automation network indicating that an appliance service is present in a home automation network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2854—Wide area networks, e.g. public data networks
    • H04L12/2856—Access arrangements, e.g. Internet access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2854—Wide area networks, e.g. public data networks
    • H04L12/2856—Access arrangements, e.g. Internet access
    • H04L12/2869—Operational details of access network equipments
    • H04L12/287—Remote access server, e.g. BRAS
    • H04L12/2874—Processing of data for distribution to the subscribers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L12/40052—High-speed IEEE 1394 serial bus
    • H04L12/40078—Bus configuration
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L12/40169—Flexible bus arrangements
    • H04L12/40176—Flexible bus arrangements involving redundancy
    • H04L12/40195—Flexible bus arrangements involving redundancy by using a plurality of nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/44—Star or tree networks
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • 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/22—Traffic shaping
    • 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/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
    • 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
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/34—Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/621—Individual queue per connection or flow, e.g. per VC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0014—Three-dimensional division
    • H04L5/0023—Time-frequency-space
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0042—Intra-user or intra-terminal allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044—Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0078—Timing of allocation
    • H04L5/0082—Timing of allocation at predetermined intervals
    • H04L5/0083—Timing of allocation at predetermined intervals symbol-by-symbol
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/45—Network directories; Name-to-address mapping
    • H04L61/4541—Directories for service discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
    • H04L63/065—Network architectures or network communication protocols for network security for supporting key management in a packet data network for group communications
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/0807—Network architectures or network communication protocols for network security for authentication of entities using tickets, e.g. Kerberos
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
    • H04L63/102—Entity profiles
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
    • H04L63/1441—Countermeasures against malicious traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/10—Architectures or entities
    • H04L65/102—Gateways
    • H04L65/1023—Media gateways
    • H04L65/103—Media gateways in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/10—Architectures or entities
    • H04L65/102—Gateways
    • H04L65/1033—Signalling gateways
    • H04L65/104—Signalling gateways in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/14—Session management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/2866—Architectures; Arrangements
    • H04L67/30—Profiles
    • H04L67/306—User profiles
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/51—Discovery or management thereof, e.g. service location protocol [SLP] or web services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
    • H04L69/168—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP] specially adapted for link layer protocols, e.g. asynchronous transfer mode [ATM], synchronous optical network [SONET] or point-to-point protocol [PPP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/329—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M1/00—Substation equipment, e.g. for use by subscribers
    • H04M1/253—Telephone sets using digital voice transmission
    • H04M1/2535—Telephone sets using digital voice transmission adapted for voice communication over an Internet Protocol [IP] network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/22—Arrangements for supervision, monitoring or testing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/42—Systems providing special services or facilities to subscribers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M7/00—Arrangements for interconnection between switching centres
    • H04M7/0024—Services and arrangements where telephone services are combined with data services
    • H04M7/0057—Services where the data services network provides a telephone service in addition or as an alternative, e.g. for backup purposes, to the telephone service provided by the telephone services network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M7/00—Arrangements for interconnection between switching centres
    • H04M7/006—Networks other than PSTN/ISDN providing telephone service, e.g. Voice over Internet Protocol (VoIP), including next generation networks with a packet-switched transport layer
    • H04M7/0066—Details of access arrangements to the networks
    • H04M7/0069—Details of access arrangements to the networks comprising a residential gateway, e.g. those which provide an adapter for POTS or ISDN terminals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/61—Network physical structure; Signal processing
    • H04N21/6106—Network physical structure; Signal processing specially adapted to the downstream path of the transmission network
    • H04N21/6125—Network physical structure; Signal processing specially adapted to the downstream path of the transmission network involving transmission via Internet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
    • H04N21/647—Control signaling between network components and server or clients; Network processes for video distribution between server and clients, e.g. controlling the quality of the video stream, by dropping packets, protecting content from unauthorised alteration within the network, monitoring of network load, bridging between two different networks, e.g. between IP and wireless
    • H04N21/64723—Monitoring of network processes or resources, e.g. monitoring of network load
    • H04N21/64738—Monitoring network characteristics, e.g. bandwidth, congestion level
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
    • H04N21/647—Control signaling between network components and server or clients; Network processes for video distribution between server and clients, e.g. controlling the quality of the video stream, by dropping packets, protecting content from unauthorised alteration within the network, monitoring of network load, bridging between two different networks, e.g. between IP and wireless
    • H04N21/64784—Data processing by the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N7/00—Television systems
    • H04N7/14—Systems for two-way working
    • H04N7/141—Systems for two-way working between two video terminals, e.g. videophone
    • H04N7/148—Interfacing a video terminal to a particular transmission medium, e.g. ISDN
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04—Transmission power control [TPC]
    • H04W52/06—TPC algorithms
    • H04W52/14—Separate analysis of uplink or downlink
    • H04W52/143—Downlink power control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04—Transmission power control [TPC]
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/24—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04—Transmission power control [TPC]
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/24—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/245—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account received signal strength
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04—Transmission power control [TPC]
    • H04W52/38—TPC being performed in particular situations
    • H04W52/46—TPC being performed in particular situations in multi-hop networks, e.g. wireless relay networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04—Transmission power control [TPC]
    • H04W52/38—TPC being performed in particular situations
    • H04W52/48—TPC being performed in particular situations during retransmission after error or non-acknowledgment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/02—Hybrid access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/10—Connection setup
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/16—Error detection or correction of the data by redundancy in hardware
    • G06F11/1608—Error detection by comparing the output signals of redundant hardware
    • G06F11/1625—Error detection by comparing the output signals of redundant hardware in communications, e.g. transmission, interfaces
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/2101—Auditing as a secondary aspect
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/2141—Access rights, e.g. capability lists, access control lists, access tables, access matrices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/2149—Restricted operating environment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
    • H04B7/0891—Space-time diversity
    • H04B7/0894—Space-time diversity using different delays between antennas
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/155—Ground-based stations
    • H04B7/15507—Relay station based processing for cell extension or control of coverage area
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829—Arrangements specially adapted for the receiver end
    • H04L1/1835—Buffer management
    • H04L1/1845—Combining techniques, e.g. code combining
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L2001/0092—Error control systems characterised by the topology of the transmission link
    • H04L2001/0096—Channel splitting in point-to-point links
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L2012/40208—Bus networks characterized by the use of a particular bus standard
    • H04L2012/40241—Flexray
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L2012/40267—Bus for use in transportation systems
    • H04L2012/40273—Bus for use in transportation systems the transportation system being a vehicle
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6445—Admission control
    • H04L2012/6462—Movable boundaries in packets or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/12—Details relating to cryptographic hardware or logic circuitry
    • H04L2209/127—Trusted platform modules [TPM]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/80—Responding to QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/324—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the data link layer [OSI layer 2], e.g. HDLC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/326—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the transport layer [OSI layer 4]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/42—Systems providing special services or facilities to subscribers
    • H04M3/42025—Calling or Called party identification service
    • H04M3/42085—Called party identification service
    • H04M3/42102—Making use of the called party identifier
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/16—Discovering, processing access restriction or access information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04—Transmission power control [TPC]
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/22—TPC being performed according to specific parameters taking into account previous information or commands
    • H04W52/225—Calculation of statistics, e.g. average or variance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04—Transmission power control [TPC]
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/24—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/241—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account channel quality metrics, e.g. SIR, SNR, CIR or Eb/lo
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
    • H04W52/04—Transmission power control [TPC]
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/24—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/242—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account path loss
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/005—Discovery of network devices, e.g. terminals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
    • H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10—Small scale networks; Flat hierarchical networks
    • H04W84/12—WLAN [Wireless Local Area Networks]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/16—Gateway arrangements

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Business, Economics & Management (AREA)
  • Computer Security & Cryptography (AREA)
  • Theoretical Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Computing Systems (AREA)
  • Computer Hardware Design (AREA)
  • General Business, Economics & Management (AREA)
  • General Health & Medical Sciences (AREA)
  • Multimedia (AREA)
  • Health & Medical Sciences (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Automation & Control Theory (AREA)
  • Medical Informatics (AREA)
  • Marketing (AREA)
  • Bioethics (AREA)
  • Quality & Reliability (AREA)
  • Software Systems (AREA)
  • Tourism & Hospitality (AREA)
  • Databases & Information Systems (AREA)
  • Technology Law (AREA)
  • Human Resources & Organizations (AREA)
  • Primary Health Care (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Game Theory and Decision Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本发明涉及通信技术，公开了一种实现联合使用定时器功能的系统及其方法，使得在AAL2中实现的Timer_CU既保证定时的精度和稳定性，又能简化代码的编写，减小系统资源的消耗，增加系统的稳定性。这种实现联合使用定时器功能的系统及其方法利用了网络处理器中的多个微处理器阵列的特点，结合ATM流量控制的调度模块，通过预先定义了格式的消息在各个独立的微处理器控制的模块间进行信息的交互，在几乎不写任何代码的情况下，完全实现Timer_CU的功能。

The invention relates to communication technology, and discloses a system and a method for realizing the joint use of timer functions, so that Timer_CU implemented in AAL2 can not only ensure the accuracy and stability of timing, but also simplify the writing of codes and reduce the cost of system resources. Consumption, increase the stability of the system. The system and method for realizing the joint use of the timer function utilizes the characteristics of multiple microprocessor arrays in the network processor, combines the scheduling module of ATM flow control, and transmits messages in each independent microprocessor through pre-defined format messages. The information exchange between the modules controlled by the timer can fully realize the function of Timer_CU without writing any code.

Description

System and the method thereof of using timer function united in realization
Technical field
The present invention relates to the communication technology, particularly realize uniting the technology of using timer function in the adapting layer types of asynchronous transfer mode 2.
Background technology
Asynchronous transfer mode (Asynchronous Transfer Mode, be called for short " ATM ") be a kind of transmission mode that combines circuit switching and packet switch advantage, can provide simultaneously towards connection with towards disconnected service, it is used on the one hand " circuit of sign " replacement " circuit of allocation ", thereby can distribute bandwidth neatly; Cancelled complicated error control and flow control on the other hand, propagation delay time is reduced greatly.In ATM, information is organized into cell (cell), and because of each cell that comprises from certain user profile does not need periodically to occur, this transmission mode is asynchronous.
ATM cell, i.e. ATM protocol Data Unit (Protocol Data Unit, be called for short " PDU "), being called for short ATM-PDU is the grouping of regular length, has 53 bytes, is divided into 2 parts.5 bytes in front are the letter head, mainly finish the function of addressing; 48 bytes of back are message segment, and promptly Service Data Unit (Service Data Unit is called for short " SDU ") is used for loading from different user the information of different business.Speech, data, all digital information such as image all will be through cutting, and the cell that is packaged into consolidation form transmits in net, and reverts to required form at receiving terminal.Because atm technology simplified exchange process, removed the unnecessary data verification, adopt easy-to-handle fixedly cell format, so the ATM exchange rate is much higher than traditional data network, as x.25, frame relay etc.In addition, for the data network of high speed like this, atm network has adopted some effective service traffics monitoring mechanisms, and user on the network's data are monitored in real time, and the possibility that network congestion is taken place drops to minimum, thereby real-time transmission service can be provided.
Fig. 1 is the protocol hierarchy schematic diagram that ATM simplifies.Wherein, ATM Adaptation Layer (ATM AdaptationLayer is called for short " AAL ") is the index bed with multiple application, data transaction can be become ATM cell or ATM cell is converted to data.ATM provides different quality of service (Qualityof Service to different business, be called for short " QoS "), it is by adopting ATM Adaption Layer Type 1 (AAL1), ATM Adaptation Layer type 2 (AAL2), ATM Adaptation Layer type 3/4 (AAL3/4), ATM Adaption Layer Type 5 different adapting layer types such as (AAL5) at the AAL layer, to adapt to A level, B level, C level, four kinds of different customer services of D level, business description is as follows:
The A level is a constant bit rate service, and AAL1 supports this business, the connection-oriented business of this business support, and its bit rate is fixed, and common business is the 64Kbit/s voice service, the leased circuit of incompressible video communication of cbr (constant bit rate) and private data network.
The B level is the variable bit rate business, and AAL2 supports this business, the connection-oriented business of this business support, and its bit rate is variable.Common business is the packetized voice communication of compression and the video transmission of compression.This business has the interface of transmission and postpones rerum natura, and its reason is that receiver need re-assembly original non-compressed voice and video information.
The C level is connection-oriented data, services, and AAL3/4 supports this business.This business is connection-oriented business, is applicable to file transfers and data network business, and its connection was set up before data are transmitted.It is a variable bit rate, but does not have the interface transmission delay.
The D level does not promptly have the connection data service, and common business is datagram service and data network business.Before Data transmission, its connection can not set up.AAL3/4 or AAL5 all support this business.
Because these characteristics of ATM, at 3G (Third Generation) Moblie (the 3rd Generation, be called for short " 3G ") in, wide model has adopted the interface based on ATM, for example at Wideband Code Division Multiple Access (WCDMA) (the Wideband Code Division Multi-Access of one of 3G standard, be called for short " WCDMA ") in, the base station (NodeB) of the R99 version of comparative maturity and radio network controller (Radio NetworkController, abbreviation " RNC ") just adopt the Iub interface based on ATM between, RNC is respectively by linking to each other with packet switching with the circuit switching of core net respectively based on the Iu-CS of ATM AAL2 and the Iu-PS of AAL5.
Wherein, in using more AAL2, the AAL2 layer is divided into as shown in Figure 2 several sublayers.The AAL2 layer comprises Convergence Sublayer (Convergence Sublayer, be called for short " CS ") and common part sublayer (Common Part Sublayer, be called for short " CPS "), wherein the CS sublayer is by the Convergence Sublayer relevant with specific transactions (Service-Specific Convergence Sublayer, be called for short " SSCS ") and Common Part Convergence Sublayer (Common Part Convergence Sublayer, be called for short " CPCS ") form, the CPS sublayer is made up of CPCS sublayer and dismounting (Segmentation And Reassembly is called for short " SAR ") sublayer.The final packet that generates in the CPS sublayer is referred to as the PDU of CPS, i.e. CPS-PDU.The CPS sublayer mainly is that the CPS grouping is handled through SAR, generates CPS-PDU, and promptly the SDU of ATM layer carries out adaptive with ATM cell.The form of CPS grouping is illustrated in fig. 3 shown below.Wherein first three byte is the packet header of CPS grouping, and the back is the payload of CPS grouping, and size is the random length between 1 to 45 byte or 64 bytes.
Each layer data processing procedure of AAL2 as shown in Figure 4.The CPS sublayer receives the CPS Service Data Unit from the SSCS sublayer, promptly CPS-SDU increases the packet header (PacketHeader is called for short " PH ") that CPS divides into groups on this basis, and promptly CPS-PH generates the CPS grouping.The SDU length of an ATM cell is fixed as 48 bytes.CPS grouping can not corresponding ATM cell, if short CPS grouping is put into that an ATM cell sends then efficient is too poor, a long CPS grouping then can not be placed in the ATM cell and send.
Stipulated in the AAL2 agreement to carry out multiplexing process, be about to transmit in CPS Packet Multiplexing to an ATM cell of a plurality of AAL2 channels, or a CPS grouping is put in a plurality of ATM cell transmitted in the CPS sublayer.Realized to be carried on same PVC (Permanent VirtualCircuit by multiplexing, abbreviation " PVC ") the CPS grouping from similar and different AAL2 user in is handled through SAR and is multiplexed in the ATM cell, carry out opposite processing procedure again the recipient, it is single AAL2 user data package CPS grouping that the CPS grouping of carrying in the ATM cell is handled demultiplexing through SAR.
As shown in Figure 4, in the CPS sublayer, the CPS grouping is multiplexed with CPS-PDU, the i.e. ATM-SDU of 48 byte longs.Wherein CPS-PDU comprises the packet header, beginning territory (Start Field PackageHeader is called for short " STF-PH ") and the CPS-PDU load of a byte.
The multiplex process of CPS grouping as shown in Figure 5 in the AAL2 agreement.
If current CPS grouping can not be filled up an ATM cell, promptly 48 byte lengths of the not enough CPS-PDU of length then need to fill.In order to improve efficiency of bandwidth use, need then to wait for that new CPS grouping arrives, remainder is filled up, and then send, processing can guarantee that all cells do not have byte of padding, bandwidth availability ratio height, but indefinite wait like this, to increase the time-delay that the AAL2 bag is handled greatly, even cause the wait of unlimited time.Because the real time business that the general carrying of AAL2 is relatively more responsive to time-delay to having relatively high expectations of time-delay, requires packet to send in the time as far as possible early.Not too big in order to guarantee time-delay, inevitable requirement is not filled remainder when having new CPS grouping to arrive, and sends then.Do the requirement that has guaranteed time-delay like this, but cause bandwidth availability ratio too low.In order to solve this contradiction, stipulated in the AAL2 agreement that one is united use timer, i.e. Timer_CU.Preestablish a timer expiry cycle, when running into the situation of need filling, start timer earlier and wait for, before timer expiry, if there is new packet to arrive, then with new data multiplex in CPS-PDU, fill up the back transmission.If timer expiry does not also have new data to arrive, then fill transmission.
The technical scheme of existing realization Timer_CU mainly contains two kinds, introduces respectively below.
Technical scheme one is given the Virtual Channel (Virtual Channel is called for short " VC ") of every AAL2, and a timer is set, and waits if desired and bides one's time, and then starts corresponding VC timer, and behind the timer expiry, the notice sending module sends.
Two of technical schemes adopt the timer that all VC are public.According to certain precision, do the chained list of a classification, when needs start timer, time out period all VC in same scope are write in the table, or not do not go out to belong to that one-level table according to accuracy computation with one-level, just write in the table of appointment.Remove counter of poll with software then, after the stand-by period reaches accuracy value, remove to dispose all VC in the table of current grade, promptly notice sends, and enters wait then again.Wherein, the method for poll counter device also can adopt and regularly interrupt replacing.
In actual applications, there is following problem in such scheme: the just like employing hardware of scheme realizes that complexity is very high, if adopt software to realize, then might cause the paralysis of system, is difficult to guarantee precision;
Scheme two is difficult for realizing higher timing accuracy, can't correctly handle in some cases, if precision prescribed is higher, then needs more internal memory, can cause the decline of systematic function, and this scheme is difficult to accomplish reliable and stable.
Cause the main cause of this situation to be, employing scheme one need be provided with a lot of timers, when the VC quantity of supporting when system is very big, the quantity of timer also is very huge, and generally all is high integration in the current communication system, and the AAL2 type VC that requires to support is generally at thousands of more than, even it is more, adopt hard-wired complexity very high, adopt software to realize then may causing processor paralysis under so many timers interrupt, be difficult to guarantee precision.
The timing accuracy of employing scheme two is that therefore the timing accuracy for each bar VC can not be very high by the time interval decision of hierarchical chained list.If the cycle of Timer_CU near or equal this accuracy value, and the interval of packet also near the time, can not correctly handle.All want in each grade chained list in this scheme to deposit all VC, cause chained list very huge like this,, when VC quantity is very big, will consume very many internal memories, and the so many internal memories of visit also can cause performance decrease if precision prescribed is higher.Handle this chained list with software, code will be very complicated, and size of code is also more, is difficult to accomplish reliable and stable.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of system and method thereof of using timer function that realize uniting, and makes in AAL2 to realize that Timer_CU had both guaranteed precision and stability regularly, again can simplified code write, reduce the consumption of system resource, increase the stability of system.
For achieving the above object, the invention provides a kind of system that uses timer function that realizes uniting, in adapting layer types of asynchronous transfer mode 2, use, comprise:
Packet queue, be used for form with formation according to different Virtual Channels at buffering area stored outgoing data, uniting of management Virtual Channel used the timer dispatching sign and fallen out the scheduling sign;
Queue management module is used to receive new data packets, manages described packet queue, coordinates other module cooperative work in the described system according to the scheduling sign of falling out in scheduling that receives and the described packet queue;
Flow-control module is used to handle the scheduling of described queue management module, calculates scheduling and also determines whether to use associating use timer constantly;
Send processing module, be used to carry out overtime judgement, generate the common part sublayer protocol Data Unit and submit to atm module to handle, and send scheduling message, and associating use timer is used in application when not having data to send according to the result generation and to queue management module.
Wherein, described scheduling message comprise send scheduling, the scheduling and unite the use timer dispatching of falling out, respectively by the transmission sign in the configuration scheduling, the scheduling sign and unite and use the timer dispatching sign to realize of falling out;
Wherein, processing is not operated, only sent to described transmission scheduling to described packet queue; The described scheduling of falling out is fallen out outgoing data to described transmission processing module processing from described packet queue; The described associating uses timer dispatching not have outgoing data but the common part sublayer protocol Data Unit of current Virtual Channel starts associating use timer when also not finishing at current Virtual Channel, and the new outgoing data of falling out from current Virtual Channel formation when new outgoing data is arranged handles for described transmission processing module.
Described queue management module is that each Virtual Channel preserves a descriptor, and the content that described descriptor is used for writing down comprises: the last pointer of buffering area chain, packet number in the owner pointer of buffering area chain, the formation in the formation, the scheduling sign and unite and use the timer dispatching sign of falling out.
Connect the interface of the both direction of described transmission processing module and described queue management module, the information that is connected in the interface of both direction of described queue management module and described flow-control module comprises: adapting layer types of asynchronous transfer mode, the index number of Virtual Channel, send the scheduling sign, the scheduling of falling out indicates and unites and use the timer dispatching sign.
The information of described queue management module in the interface of described transmission processing module transmission message also comprises: the pointer of maximum 5 queue buffer descriptors.
Outgoing data is stored in the buffering area with the formation form in described packet queue, and the data of depositing in each described buffering area are less than the data of the required filling of a common part sublayer protocol Data Unit.
Each described buffering area is deposited the data of 10 bytes.
The present invention also provides scheduling and the packet on upper strata and the method handled of a kind of queue management module reception from other module, and the handling process of described queue management module comprises following steps:
A receives and handles the scheduling of flow-control module, carries out the buffering area operation of falling out according to scheduling type, constructs and dispatches and send to other described modules according to the fall out result of operation of buffering area;
B receives and also to handle the scheduling that sends processing module, carry out the management that indicates in the packet queue according to scheduling type, and the structure scheduling sends to other described module;
C receives from the packet on upper strata and falls in lines to described packet queue, manages the sign in the described packet queue, constructs and send out the row scheduling.
Wherein, described steps A also comprises following substep:
A1 judges according to the scheduling that receives whether current Virtual Channel type is adapting layer types of asynchronous transfer mode 2, if then continue, finishes described steps A otherwise directly handle the back according to other adapting layer types;
A2 then unites and uses timer dispatching to handle if the type of scheduling is an associating use timer dispatching;
A3 is if the type of scheduling is to send scheduling, and then structure sends scheduling and sends to described transmission processing module;
A4 is if the type of scheduling is the scheduling of falling out, and the scheduling of then falling out is handled.
Steps A 2 also comprises following substep:
A21 judges whether the scheduling sign of falling out of current Virtual Channel is effective, if then enter steps A 22, finishes described steps A 2 otherwise construct after overtime scheduling sends to described transmission processing module;
The A22 buffering area of from the formation of current Virtual Channel, falling out, and judge whether to fall out successfully, if then structure transmission scheduling finishes described steps A 2 after sending to described transmission processing module, after sending to described transmission processing module, overtime scheduling finishes described steps A 2 otherwise construct.
Steps A 4 also comprises following substep:
A41 judges whether the scheduling sign of falling out of current Virtual Channel is effective, if then enter steps A 42, otherwise enters steps A 44;
The A42 buffering area of from the formation of current Virtual Channel, falling out, and judge whether to fall out successfully, if then enter steps A 43, otherwise enter steps A 44;
A43 structure sends scheduling message and sends to the scheduling that finishes to fall out after the described transmission processing module and handle;
The A44 scheduling of will falling out changes into and sends scheduling and structure and send scheduling message and send to the scheduling that finishes to fall out after the described transmission processing module and handle.
Described step B also comprises following substep:
B1 judges that whether scheduling is to send scheduling, if then enter step B6, otherwise enters step B2;
B2 judges whether scheduling is associating use timer dispatching, if then enter step B3, otherwise enters step B4;
B3 is provided with and uniting of current Virtual Channel uses the timer dispatching sign and the scheduling sign of falling out, and then enters step B6;
B4 judges whether fall out scheduling sign of current Virtual Channel, if having then finish, otherwise enters step B5;
B5 is provided with the scheduling sign of falling out of current Virtual Channel, then enters step B6;
The B6 structure finishes described step B after dispatching and send to described flow-control module.
Described step C also comprises following substep:
C1 receives new data packets and judges whether it is adapting layer types of asynchronous transfer mode 2, if then enter step C2, otherwise by finishing described step C after other type of process;
C2 judges whether the formation of current Virtual Channel is empty, if then enter step C3, otherwise described step C is finished in the operation back of falling in lines;
C3 judges whether fall out scheduling sign of current Virtual Channel, if having then the operation of falling in lines, otherwise enters step C4;
The C4 operation of falling in lines, the structure scheduling of falling out is provided with the scheduling sign and send the described step C of scheduling back end that falls out to described flow-control module of falling out of current Virtual Channel.
The present invention also provides a kind of flow-control module to receive from the scheduling of queue management module and the method for handling, and comprises following steps:
D judges whether obtain scheduling from described queue management module is to send the scheduling or the scheduling of falling out, if then by the flow parameter of current Virtual Channel, dispatch normally, otherwise enter step e;
E uses the timer configuration parameter according to the flow parameter of current Virtual Channel with uniting, calculate regular scheduling and unite the concrete moment of using timer dispatching, and judge to unite and use timer dispatching constantly whether late than regular scheduling, if then enter step F, otherwise enter step G;
F constructs the scheduling of falling out earlier, and tectonic syntaxis uses timer dispatching and sends to described queue management module again;
The G tectonic syntaxis uses timer dispatching and sends to described queue management module.
The present invention also provides a kind of processing module that sends to receive from the scheduling of queue management module and the method for handling, and the handling process of described transmission processing module comprises following steps:
H judges that the scheduling that receives whether for uniting the use timer dispatching, if then enter step I, otherwise enters step K from described queue management module;
I stop to unite use timer and judge whether overtime, if then enter step J, otherwise temporary new buffering area and construct and enter step L after the common part sublayer protocol Data Unit sends;
J judges that whether current Virtual Channel also has data to send, if having then return step H, uses timer and fills and return step H after the common part sublayer protocol Data Unit sends otherwise stop to unite;
If K sends scheduling and then constructs and enter step L after the common part sublayer protocol Data Unit sends, otherwise the temporary buffering area that transmits from described queue management module and construct and enter step L after the common part sublayer protocol Data Unit sends;
L constructs scheduling according to the result of structure common part sublayer protocol Data Unit.
Wherein, step L also comprises following substep:
L1 judges whether to fill up a common part sublayer protocol Data Unit, if then enter step L2, otherwise enters step L3;
Whether L2 judges temporary storage buffer region less than five, if then construct the scheduling of falling out, otherwise structure sends scheduling;
L3 judges whether to start associating use timer, if then construct the scheduling of falling out, otherwise tectonic syntaxis uses timer dispatching;
L4 sends the scheduling back to described queue management module and finishes described step L.
The present invention also provides a kind of system that uses timer function that realizes uniting, and uses in adapting layer types of asynchronous transfer mode 2, comprises:
Packet queue is used for depositing the common part sublayer protocol Data Unit with the form of formation according to different Virtual Channels;
Queue management module is used to manage described packet queue, sends scheduling request information to flow-control module, and sends a common part sublayer protocol Data Unit after obtaining dispatching response message;
Flow-control module, be used for receiving unite use timer regularly behind the request message beginning regularly receive described scheduling request information and respond described dispatching response message, when overtime, send to unite and use the timer expiry response message to sending processing module;
Send processing module, be used for management and unite use timer sign and Virtual Channel, constitute the common part sublayer protocol Data Unit, send common part sublayer protocol Data Unit message to described queue management module, when having data, do not send the described regularly request message of use timer of uniting to flow-control module.
Wherein, described common part sublayer protocol Data Unit message, described scheduling request information, described dispatching response message, the described associating use timer expiry response message and described the associating to use timer timing request message to comprise the Virtual Channel numbering of distinguishing different Virtual Channels.
Described common part sublayer protocol Data Unit message also comprises common part sublayer protocol Data Unit buffer pointer.
Described unite use timer regularly request message also comprise to unite and use the timer timing cycle.
The present invention also provides a kind of queue management module managing packet queue and has sent the method for common part sublayer protocol Data Unit, comprises following steps:
M1 obtains common part sublayer protocol Data Unit message and judges whether the pairing Virtual Channel of described common part sublayer protocol Data Unit message has sent scheduling request information from sending processing module, if then enter step M3, otherwise enter step M2;
After sending to flow-control module, M2 structure scheduling request information enters step M3;
M3 falls in lines described common part sublayer protocol Data Unit message to the current Virtual Channel formation of described packet queue;
N1 obtains described dispatching response message from described flow-control module;
N2 is from fall out a common part sublayer protocol Data Unit and send of the current Virtual Channel formation of described packet queue;
N3 judges whether the current Virtual Channel formation of described packet queue is empty, if then obtain newly arrived common part sublayer protocol Data Unit message from described transmission processing module once more, otherwise obtain newly arrived common part sublayer protocol Data Unit message from described transmission processing module once more after constructing described scheduling request information and sending to flow-control module.The present invention also provides a kind of flow-control module to carry out time control and has sent the method for dispatching management, comprises following steps:
O1 judges from sending processing module and obtains to unite and use regularly whether success of request message of timer, if then enter step O2, otherwise continues to judge to obtain to unite from described transmission processing module and uses regularly whether success of request message of timer;
O2 calculates the time-out time of current Virtual Channel and will unite and use timer dispatching to write the scheduling time formation;
P1 obtains scheduling request information from queue management module, calculates transmitting time and writes described scheduling time formation;
P2 reads described scheduling time formation, and judge whether the described use timer dispatching of uniting is arranged in the described scheduling time formation, if structure and send to described transmission processing module and described the associating to enter step P3 after using the timer expiry response message then, otherwise directly enter step P3;
P3 constructs and sends described dispatching response message to described queue management module.
The present invention also provides a kind of method that processing module constitutes the common part sublayer protocol Data Unit that sends, and comprises following steps:
New packet is successful then to carry out entering step Q2 after the AAL protocol processes Q1 if described transmission processing module is obtained, otherwise enters step R1;
Q2 judges whether to constitute complete common part sublayer protocol Data Unit, if then enter step Q3, otherwise enters step Q4;
Q3 removes uniting of current Virtual Channel and uses timer to start sign, and structure also enters step R1 after queue management module sends described common part sublayer protocol Data Unit message;
Q4 judges whether current Virtual Channel starts to unite and uses timer to start sign, if then enter step R1, use timer startup sign co-current flow amount control module described associating of transmission to use timer regularly to enter step R1 behind the request message uniting of current Virtual Channel otherwise be provided with;
R1 obtains described the associating from described flow-control module and uses the timer expiry response message and judge the described use timer of uniting of current Virtual Channel starts to indicate whether be not eliminated, if described associating that then fill to send the common part sublayer protocol Data Unit of current Virtual Channel and remove current Virtual Channel enter step R2 after using timer to start sign, otherwise directly enter step R2;
The packet that R2 judges current Virtual Channel whether processing finishes, if end step R2 then, otherwise do not obtain new packet and continue to handle until the packet of current Virtual Channel fully processing finish.
By relatively finding, technical scheme difference with the prior art of the present invention is, the present invention program has utilized the characteristics of a plurality of microprocessor arrays in the network processing unit, scheduler module in conjunction with atm traffic control, message by pre-defined form each independently the intermodule of microprocessor control carry out the mutual of information, under the situation of writing any code hardly, realize the function of Timer_CU fully.
Difference on this technical scheme, brought comparatively significantly beneficial effect, it is the function that the present invention has not only realized Timer_CU fully, and the workload of writing code reduces greatly, make the construction cycle of system shorten greatly, saved the cost of system, the present invention does not simultaneously increase the consumption and the processor waste of time of any internal memory, guarantees the very high precision and the stability of system.
Description of drawings
The ATM protocol hierarchy schematic diagram of Fig. 1 for simplifying;
Fig. 2 is the hierarchical diagram of AAL2 agreement;
Fig. 3 is the schematic diagram of CPS packet format;
Fig. 4 is the data handling procedure of each sublayer of AAL2;
Fig. 5 is the multiplex process of CPS grouping in the AAL2 agreement;
Fig. 6 is the system's composition schematic diagram of realizing the Timer_CU function in AAL2 according to a preferred embodiment of the present invention program one;
Fig. 7 is the workflow diagram according to the flow-control module of the system that realizes the Timer_CU function in AAL2 of a preferred embodiment of the present invention program one;
Fig. 8 and Fig. 9 are the workflow diagram according to the queue management module of the system that realizes the Timer_CU function in AAL2 of a preferred embodiment of the present invention program one;
Figure 10 is the workflow diagram according to the transmission processing module of the system that realizes the Timer_CU function in AAL2 of a preferred embodiment of the present invention program one;
Figure 11 is the system's composition schematic diagram of realizing the Timer_CU function in AAL2 according to a preferred embodiment of the present invention program two;
Figure 12 is the workflow diagram according to the queue management module of the system that realizes the Timer_CU function in AAL2 of a preferred embodiment of the present invention program two;
Figure 13 is the workflow diagram according to the flow-control module of the system that realizes the Timer_CU function in AAL2 of a preferred embodiment of the present invention program two;
Figure 14 is the workflow diagram according to the transmission processing module of the system that realizes the Timer_CU function in AAL2 of a preferred embodiment of the present invention program two.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing.
The realization thought of this programme is as follows: this programme utilizes the characteristics of a plurality of microprocessor arrays in the network processing unit, the processing that each module walks abreast, by the information in the interface of module connection, the scheduler module of controlling in conjunction with atm traffic realizes the Timer_CU function fully.
According to the foregoing invention design, there are two kinds of schemes to be implemented in and realize the Time_CU function among the AAL2.The system of two kinds of invention schemes forms on the connection of system module and interface definition slightly different, and corresponding flow process is also different, for the ease of understanding, hereinafter distinguishes with invention scheme one and invention scheme two respectively.
In the invention scheme one, several independent microprocessor parallel processings communicate to exchange messages by the high-speed interface buffering area between the disparate modules that these microprocessors are controlled in the network processing unit.Scheduling sign D and Timer_CU scheduling sign T are provided with in the message that sends and send sign S, fall out, judge it is the scheduling message of which kind of type by these signs, each module decides corresponding operation by the type of scheduling message, the buffering area of for example falling out from formation operation, the overtime operation of Timer_CU etc.
Below in conjunction with preferred embodiment of the present invention the present invention program one is described.
According to the system of the realization Timer_CU function of a preferred embodiment of the present invention program one form and connected mode as shown in Figure 6.
The system that realizes the invention scheme one of Timer_CU function comprises as lower module: packet queue 11, and queue management module 12, flow-control module 13 sends processing module 14, atm module 15.
Pass through the interface buffer interactive information between above-mentioned each module.Wherein, send processing module 14 and send message to queue management module 12 by high-speed interface A buffering area; Queue management module 12 sends message by interface B buffering area to sending processing module 14; Queue management module 12 sends message by interface C buffering area to flow-control module 13; Flow-control module 13 sends message by interface D buffering area to queue management module 12; Queue management module 12 receives the packet from AAL2 upper-layer protocol or other module from interface E buffering area.
In a preferred embodiment of invention scheme one, the entire process process comprises three kinds of scheduling messages: send scheduling, fall out scheduling and Timer_CU scheduling, respectively by transmission sign S in the message is set, fall out scheduling sign D and Timer_CU scheduling sign T realize.Below in conjunction with several scheduling messages of each module declaration.
Sending scheduling refers to the scheduling packet queue 11 not operated only send processing; The scheduling of falling out is meant the scheduling that the buffering area of need falling out handles for transmission processing module 14 from packet queue 11; The Timer_CU scheduling refers to that all bags among this VC all send, there are not new data to handle, but current CPS-PDU does not also finish, the wait scheduling that starts Timer_CU this moment and send is if there is this scheduling in formation of new buffering area also to need to fall out a new buffering area to sending processing module 14 processing from the VC formation.
The following describes the message structure in each interface buffer.
Message structure among the interface A such as following table:
31～29 28 27 26 25～16 15～0
AAL? Type S D T Reverse Vc?Index
Message structure among the interface B such as following table:
Message structure among the interface C such as following table:
31～29 28 27 26 25～16 15～0
AAL? Type S D T Reverse Vc?Index
Message structure among the interface D such as following table:
31～29 28 27 26 25～16 15～0
AAL? Type S D T Reverse Vc?Index
Message structure among the interface E such as following table:
Figure C200410062996D00262
When concrete enforcement of the present invention program one, also relate to the QD of VC queue descriptor, structure such as the following table of the QD of VC queue descriptor:
In a preferred embodiment of the present invention program one, the sign S in each message is that 1 expression sends scheduling message, and D is the 1 expression scheduling message of falling out, and T is 1 expression Timer_CU scheduling message.VCIndex represents the VC index number that this message will be dispatched, and gets the interior value of VC scope of AAL2 type.Buffer Handle among the interface B represents the pointer of buffer descriptor, is that 0 expression is empty, is not 0 expression efficient buffer district, and the buffering area of falling out is filled out in order since 1, during 5 of less thaies, and clear 0 of back.AAL Type represents the AAL type of this VC, comprises AAL0, AAL1, AAL2, AAL5 etc., respectively value 0,1,2,5.
Packet queue 11 is used for depositing packet from other modules or upper-layer protocol with the form of formation.Packet queue 11 is managed according to VC, formation of every VC, and data are unit with the bag, each bag may account for a plurality of buffering areas, these buffering areas string together successively, are depositing address and other necessary informations of each buffer descriptor of each bag, are described with the QD of VC queue descriptor.Wherein, the packet that each buffering area is deposited in the formation is all smaller, and the data of depositing in each buffering area all are not enough to fill up a cell.For example, in a preferred embodiment of the present invention program one, the data that each buffering area is deposited are 10 bytes.
Queue management module 12 is used for treating that with what receive a grouping deposits packet queue 11 in and also at the appropriate time the data of buffering area fallen out, be provided with or remove the flag bit in the message in the VC formation, from each interface buffer receiving scheduling message and do corresponding processing, manage various scheduling and send according to the predefined scheduling message of each interface to corresponding module by each interface buffer.For example, in a preferred embodiment of the present invention program one, a new packet arrives queue management module 12 from interface E buffering area, and all buffering areas that queue management module 12 will be wrapped are put in the packet queue 11, the operation of promptly falling in lines.If the formation of this VC is a non-NULL by space-variant, and the scheduling sign D that do not fall out in the formation, then send the dispatch request of falling out to flow-control module 13, and the scheduling sign D that falls out is set in the VC formation by interface C buffering area; If the VC formation is original to be non-NULL just, the scheduling sign D that perhaps falls out in the formation, the operation of then only falling in lines.Again for example, in a preferred embodiment of the present invention program one, the message in the queue management module 12 receiving interface D buffering areas if send scheduling, then sends scheduling message to sending processing module 14 by interface B buffering area.If fall out scheduling message, then check the scheduling sign D that falls out of storage in the packet queue 11, if do not have, then structure sends scheduling message to sending processing module 14; If have, then fall out from packet queue 11 maximum five new buffering areas and scheduling message pass to by interface B buffering area together and send processing module 14, and remove the scheduling sign D that falls out among the VC QD of queue descriptor.New buffering area failure illustrates that the VC formation is empty if fall out, and does not have new data packets to arrive, and then remove the scheduling sign D that falls out among the QD, and structure sends scheduling message to sending processing module 14.Queue management module 12 receives the request message that sends processing module 14 from interface A buffering area, if send scheduling, just be given to flow-control module 13 by interface C buffering area, carries out new scheduling and handles.The scheduling if fall out, and the scheduling sign D that do not fall out among the QD of VC formation just are provided with the scheduling sign D that falls out in the QD of VC formation, send then and fall out dispatch request to flow-control module 13, dispatch processing; If the existing scheduling sign D that falls out then abandons this dispatch request among the QD.If Timer_CU dispatch request T, queue management module 12 is provided with Timer_CU sign T and the scheduling sign D that falls out in VC formation QD, send the Timer_CU dispatch request then to flow-control module 13.
Flow-control module 13 is responsible for receiving message and is handled accordingly according to the content of message from interface C buffering area, or constructs corresponding scheduling message transmission according to result of calculation after finishing corresponding scheduling calculating constantly.In a preferred embodiment of the present invention program one, flow-control module 13 obtains request message from interface C buffering area after,, then, dispatch normally by the flow parameter of this VC if send dispatch request or the dispatch request of falling out.If Timer_CU scheduling request information, must be according to flow parameter and the Timer_CU timer configuration parameter of this VC, calculate the concrete moment of two scheduling of regular scheduling and Timer_CU scheduling, if the moment of two scheduling messages is overlapping, perhaps the Timer_CU scheduling is constantly more Zao than regular scheduling constantly, then carries out a Timer_CU scheduling.Otherwise illustrate that Timer_CU scheduling is constantly late than regular scheduling constantly, then being used as fall out scheduling and Timer_CU and dispatching twice processing that promptly do the scheduling of once falling out earlier, the Timer_CU that tries again dispatches.
Send processing module 14 and be responsible for receiving scheduling message from interface B buffering area, the protocol processes of the data in the buffering area being carried out AAL2 sends corresponding dispatch request by interface A buffering area to queue management module 12 according to result to generate CPS-PDU and to submit to atm module 15 to handle.In a preferred embodiment of the present invention program one, do not handle if when the data in the buffering area being carried out the protocol processes of AAL2, find this buffering area, then send new transmission dispatch request to queue management module 12 by interface A buffering area.If current buffering area is handled, temporary buffering area is less than five, then sends the dispatch request of falling out by interface A buffering area.If this VC does not have data to send, temporary buffering area is handled, and illustrating does not have data to send next time, just sends the Timer_CU dispatch request by interface A buffering area.Again for example, in a preferred embodiment of the present invention, after transmission processing module 14 receives scheduling message, if be in the latent period of Timer_CU, and from interface B buffering area, obtain having the Timer_CU scheduling of new buffering area or the scheduling of falling out, then send processing.If the overtime scheduling of Timer_CU, and current VC do not have data to send, and then CPS-PDU filled full back with 0 and handles for atm module 15, if current VC has the data that can send, then directly withdraws from the Timer_CU latent period.If be not in the latent period of Timer_CU, then carry out normal consistency and handle, be divided into sending and dispatch and the scheduling of falling out, send scheduling and just from current buffering area, send a cell, the scheduling of falling out just is updated to current buffering area with the buffering area in the message, sends a cell.Send out a complete CPS-PDU inadequately if data in the Timer_CU scheduling, occur, then send and fall out scheduling message to queue management module 12.
Atm module 15 is responsible for receiving and is sent the CPS-PDU after processing module 14 is handled and carry out the processing of corresponding ATM layer.The module of this module and general ATM layer is identical, in this few explanation.
In the system of the realization Timer_CU function of a preferred embodiment of the present invention program one, the workflow diagram of flow-control module 13 such as Fig. 7.This module is controlled its work and is finished following flow process by microprocessor independently:
At first enter step 100, the scheduling current time slots is also passed through interface D buffering area to queue management module 12 transmission scheduling messages.Wherein, in a preferred embodiment of the present invention program one, the type of the current time slots and the scheduling message that sends is determined according to corresponding rule by flow-control module 13.
Then enter step 110, from interface C buffering area, read scheduling request information.In a preferred embodiment of the present invention program one, shown in the message structure table among the above-mentioned interface C, the scheduling request information that reads from interface C buffering area has comprised the type of VC, send the information such as sign of scheduling message, fall out scheduling message and Timer_CU scheduling message, below the processing of each step be exactly to handle accordingly according to these information that receive message.
Then enter step 120, judge whether the type of VC is AAL2,, otherwise enter step 130 if then enter step 160.In a preferred embodiment of the present invention program one, only AAL2 is used Timer_CU, therefore mainly AAL2 is handled.
In step 130, read the flow parameter of VC.In a preferred embodiment of the present invention program one, the flow parameter of each VC all is according to the business of this VC and different the configuring in advance of user's request, only need search to get final product when reading in table.Then enter step 140.
In step 140, calculate the moment of Peak Cell Rate (Peak Cell Rate is called for short " PCR ") or average cell rate (Sustained Cell Rate is called for short " SCR ") scheduling.Wherein, still be that SCR calculates the configuration that system is depended in scheduling constantly according to PCR.Then enter step 150.
In step 150, the structure scheduling message.In a preferred embodiment of the present invention program one, this step is dispatched the message structure in posttectonic form of this scheduling message such as the interface D buffering area constantly normally according to the PCR or the SCR that calculate.Then enter step 220.
In step 160, read flow parameter and the Timer_CU parameter of VC.In a preferred embodiment of the present invention program one, the flow parameter of VC and Timer_CU parameter are determined in advance by this VC institute's loaded service and user's request.Then enter step 170.
In step 170, judge that whether scheduling message is the Timer_CU scheduling, if then enter step 180, otherwise enters step 140.In a preferred embodiment of the present invention program one, the judgement of this step is judged by the scheduling of the Timer_CU in the message that receives from interface C buffering area sign T, if T is 1 then is the Timer_CU scheduling.
In step 180, calculate the moment of PCR or SCR scheduling and Timer_CU scheduling.In a preferred embodiment of the present invention program one, the moment of these scheduling all is some the parameter decisions by current VC.Then enter step 190.
In step 190, judge that Timer_CU scheduling whether after PCR or SCR scheduling, if then enter step 200, otherwise enters step 210.In a preferred embodiment of the present invention program one, if Timer_CU scheduling constantly early than or equal PCR or SCR scheduling constantly, then explanation is carried out PCR or SCR scheduling just can occurring after the Timer_CU scheduling, therefore only need the Timer_CU scheduling in the scheduling message of structure and the scheduling that do not need to fall out, otherwise two scheduling need all.
In step 200, the structure Timer_CU scheduling message and the scheduling message of falling out.In a preferred embodiment of the present invention program one, the structure of the Timer_CU scheduling message and the scheduling message of falling out is realized by corresponding sign T and D are set.Then enter step 220.
In step 210, structure Timer_CU scheduling message.In a preferred embodiment of the present invention program one, the structure of Timer_CU scheduling message is realized by corresponding sign T is set.Then enter step 220.
In step 220, scheduling message is write the time slot of scheduling queue.Then enter step 100.In a preferred embodiment of the present invention program one, the scheduling message that will write in the step 220 is constructed according to corresponding rule by some steps of front, for example all carries out the processing of scheduling message structure in step 150, step 210 and the step 220.
Under the control of the microprocessor of flow-control module 13, these steps are gone round and begun again and are finished the handling process of flow-control module 13.
In the system of the realization Timer_CU function of a preferred embodiment of the present invention program one, queue management module 12 handling processes such as Fig. 8 and Fig. 9.This module is controlled its work and is finished following flow process by the microprocessor in its module:
At first enter step 300, from interface D buffering area, read scheduling message.In a preferred embodiment of the present invention program one, scheduling message in the interface D buffering area is sent by flow-control module 13, specifically can be with reference to the handling process of front flow-control module 13, the structure of this scheduling message is the message structure among the interface D, comprise the VC type, information such as scheduling message.
Then enter step 310, judge that whether the VC type is AAL2, if then enter step 320, otherwise enters step 470.In a preferred embodiment of the present invention program one,,, promptly enter step 470 if therefore the VC type is not AAL2 then directly handles according to other type owing to just AAL2 is carried out the associative operation of Timer_CU.
In step 320, judge whether it is the Timer_CU scheduling, if then enter step 330, otherwise enter step 380.In a preferred embodiment of the present invention program one, the judgement of this step is determined by detecting the Timer_CU scheduling sign T that reads scheduling message from interface D buffering area.
In step 330, from the QD of VC queue descriptor of VC formation, read the Timer_CU sign and the scheduling sign of falling out.In a preferred embodiment of the present invention program one, the structure of QD as previously mentioned, wherein the Timer_CU sign and the scheduling sign of falling out are represented with T and D respectively.Then enter step 340.
In step 340, the scheduling sign of having judged whether to fall out if having then enter step 350, otherwise enters step 370.In a preferred embodiment of the present invention program one, if do not fall out the scheduling sign in this step, then expression does not need the operation of falling out.
In step 350, maximum 5 buffering areas of from the VC formation, falling out.Need to prove, in a preferred embodiment of the present invention program one,, at this moment, just cause each cell to send and all will repeatedly dispatch because the data of depositing in each buffering area all are not enough to send a cell.From first and last, even data are abundant, all in the formation of VC, the speed of VC also can reduce.If the data of depositing in each buffering area all seldom, if having only about 10 bytes, each cell needs about 4 scheduling just can send, and such result is that the speed of VC is reduced to 1/5th.Data in the buffering area are few more, then reduce many more.Take place for fear of this problem, in a preferred embodiment of the present invention, in queue management module 12, when falling out operation at every turn, from formation, take out 5 buffering areas at most, if the number of buffer in the formation is less than 5, then have and severally get severally, pass to by high-speed interface buffering area ring B and to send processing module 14.Send processing module 14 and be less than 5, perhaps during the not enough cell of the residue byte number that can send, just to the queue management module 12 transmissions dispatch request of falling out in the number of buffer of finding buffer memory.After handling like this, can significantly reduce the number of operations of falling out to the VC formation, major part is fallen out to dispatch transfers simple transmission scheduling to, has reduced the burden of queue management module 12.And the speed that has guaranteed VC can not descend.Then enter step 360.
In step 360, judge whether to obtain new buffering area, if then enter step 440, otherwise enter step 370.In a preferred embodiment of the present invention program one, this step promptly judges in the VC formation whether to also have data, if not then indicate that a current cell does not also fill up, but has not had data to fill.
In step 370, structure Timer_CU time exceeded message.Because this moment, the Timer_CU sign and the scheduling sign of falling out were all effective, and it is unsuccessful to fall out, so Timer_CU is overtime, needs structure Timer_CU time exceeded message.Then enter step 460.
In step 380, judge whether it is the scheduling of falling out, if then enter step 390, otherwise enter step 440.In a preferred embodiment of the present invention program one, this judgement judges by the scheduling sign D that falls out of message among the interface D, if D be 1 then be, otherwise be not.
In step 390, from the QD of VC formation, read the scheduling sign of falling out.Then enter step 400.Need to prove that read in this place is masked as falling out scheduling sign but not the scheduling sign of falling out of message among the interface D among the VC formation QD.
In step 400, the scheduling sign of having judged whether to fall out if having then enter step 410, otherwise enters step 430.The scheduling sign of herein judging of falling out also is the falling out scheduling sign among the VC formation QD, in a preferred embodiment of the present invention program one, with the 1 expression scheduling sign of falling out.
In step 410, maximum 5 buffering areas of from the VC formation, falling out.This step sends to interface B buffering area if successfully the buffering area in the packet queue 11 can be fallen out at the most 5.Then enter step 420.
Then enter step 420, judge whether to obtain new buffering area,, otherwise enter step 430 if having then enter step 440.This step judges promptly whether the operation of falling out is successful, i.e. whether also have data to fall out in the VC formation.
In step 430, the scheduling of will falling out changes into and sends scheduling, and structure sends scheduling message.The message of this step structure will be notified and send the associative operation that processing module 14 sends scheduling.Then enter step 450.
In step 440, structure sends scheduling message.Then enter step 450.
In step 450, send scheduling message to sending processing module 14 by interface B buffering area.The scheduling message that this step sends is made up by the step of front.Then enter step 460.
In step 460, from interface A buffering area, read the request message that sends processing module 14.In a preferred embodiment of the present invention program one, the data format in the interface A buffering area as previously mentioned.Then enter step 480.
In step 470, according to other type of process.In a preferred embodiment of the present invention program one, have only the processing of AAL2 different with known method, the processing method of other type is identical.Then enter step 550.
In step 480, judge whether dispatch request into Timer_CU, if then enter step 490, otherwise enter step 500.This judgement is that the Timer_CU according to the message that receives among the interface A indicates and judges that in a preferred embodiment of the present invention program one, Timer_CU sign T is that 1 expression is the Timer_CU scheduling equally.
In step 490, Timer_CU scheduling sign is set and the scheduling sign of falling out in the QD of VC formation.In a preferred embodiment of the present invention program one, this step realizes by the Timer_CU scheduling sign T of the QD of VC formation and the scheduling sign D that falls out are put 1.Then enter step 530.
In step 500, judge whether to be the request of falling out, if then enter step 510, otherwise enter step 530.The judgement of this step is dispatched the sign realization by the falling out of message of detecting interface A reception.
In step 510, judge the scheduling sign of whether falling out among the QD of VC formation, if having then enter step 550, otherwise enter step 520.In a preferred embodiment of the present invention program one, equal the scheduling sign of falling out among the 1 expression QD with D.
In step 520, the scheduling sign of falling out is set in the QD of VC formation.In a preferred embodiment of the present invention program one, this step is by realizing the D mark position among the QD 1.Then enter step 530.
In step 530, the structure scheduling request information.This scheduling request information will send flow-control module 13 in the step below.Then enter step 540.
In step 540, send scheduling request information to flow-control module 13 by interface C buffering area.The scheduling request information that this step sent by preceding step according to certain rule structure good.Then enter step 550.
In step 550, from interface E buffering area, receive newly arrived packet.Wherein, the packet of interface E buffering area is from other module or upper-layer protocol, for example A level, B level, C level, four kinds of different packets that customer service transmitted of D level.Then enter step 560.
In step 560, judge that whether the VC type is AAL2, if then enter step 570, otherwise enters step 630.
In step 570, from the QD of this VC formation, read the number of buffer in fall out scheduling sign and the formation.This step is to deposit formation in and do and obtain the preliminary examination parameter in order to receive data.Then enter step 580.
In step 580, judge that whether formation is empty, if then enter step 620, otherwise enters step 590.Whether the formation of this step is that sky can be learnt by the Packet Counter that watches among the QD.
In step 590, the QD that judges this VC formation scheduling sign of whether falling out if then enter step 620, otherwise enters step 600.In a preferred embodiment of the present invention program one, whether this step is 1 realization by the scheduling sign D that falls out among the QD of inquiry VC formation.
In step 600, structure is fallen out to dispatch sign and be provided with to fall out in QD and is dispatched sign and deposit buffering area in formation.The QD that this step is about to the VC formation scheduling sign of falling out puts 1.Then enter step 610.
In step 610, transmit scheduling request information by interface C buffering area and give flow-control module 13.Then enter step 300.
Under the microprocessor control of queue management module 12, these steps are gone round and begun again and are received message and finish corresponding processing from each input interface.
In the system of the realization Timer_CU function of a preferred embodiment of the present invention program one, send workflow such as Figure 10 of processing module 14.This module is controlled its work and is finished following flow process by the microprocessor in its module:
At first enter step 700, from interface B buffering area, read scheduling message.In a preferred embodiment of the present invention program one, the form of the scheduling message of interface B buffering area as previously mentioned.Then enter step 710.
In step 710, judge whether to be the scheduling of falling out, if then enter step 720, otherwise enter step 730.In a preferred embodiment of the present invention program one, the judgement in this step realizes by the scheduling sign D that falls out that detects the scheduling message that receives in the interface B buffering area.
In step 720, the temporary and structure CPS-PDU transmission with the data buffer zone of transmitting in the interface B buffering area.In a preferred embodiment of the present invention program one, the pointer of the data buffer zone of transmitting by interface B buffering area obtains data configuration CPS-PDU and send to atm module 15 after structure is finished.Then enter step 800.
In step 730, judge whether scheduling into Timer_CU, if then enter step 750, otherwise enter step 740.In a preferred embodiment of the present invention program one, the judgement in this step realizes by the Timer_CU scheduling sign T that detects the scheduling message that receives in the interface B buffering area.
In step 740, structure CPS-PDU sends to atm module 15.Then enter step 800.
In step 750, stop Timer_CU.In a preferred embodiment of the present invention, the Timer_CU scheduling sign zero clearing by the scheduling message that will receive in the interface B buffering area realizes.Then enter step 760.
In step 760, judge whether to be time exceeded message, if then enter step 780, otherwise enter step 770.In a preferred embodiment of the present invention program one, whether overtimely judge by the sign of the T in the message.
In step 770, temporary new buffering area is also constructed the CPS-PDU transmission.Then enter step 800.
In step 780, judge that whether current VC also has data to send, if then enter step 700, otherwise enters step 790.In a preferred embodiment of the present invention program one, judge whether that by the Packet Counter among the QD that reads the VC formation data can send in addition.
In step 790, fill the CPS-PDU transmission and stop Timer_CU.In a preferred embodiment of the present invention program one, the Timer_CU scheduling sign zero clearing by the message that will receive in the interface B buffering area realizes stopping Timer_CU.Then enter step 700.
In step 800, can judgement fill up a CPS-PDU, if then enter step 830, otherwise enters step 810.Step 720, step 740 and the step 770 of above-mentioned structure CPS-PDU all enters this step, judges in this step whether CPS-PDU is filled up by data.
In step 810, judge whether to start Timer_CU, if then enter step 850, otherwise enter step 820.In a preferred embodiment of the present invention program one, whether be 1 to realize by judging Timer_CU scheduling flag bit in the message, if 1 starts, otherwise be not activated.
In step 820, structure Timer_CU scheduling request information.Wherein, the message structure among the Timer_CU scheduling request information form interface A as previously described that constructs of this step.Then enter step 860.
In step 830, judge that temporary storage buffer region whether less than 5, if then enter step 850, otherwise enters step 840.In a preferred embodiment of the present invention program one, if temporary storage buffer region less than 5, the data in the temporary storage buffer region just might can not be filled up a CPS-PDU and be wrapped.
In step 840, structure sends scheduling request information.This step is enough in temporary storage buffer region, carries out in the time of can filling up a CPS-PDU bag.This step realizes by the transmission scheduling sign D that is provided with in the interface A buffering area.Then enter step 860.
In step 850, construct the scheduling request information of falling out.This step realizes by the transmission sign S that is provided with in the interface A buffering area.Then enter step 860.
In step 860, send scheduling request information to queue management module 12 by interface A.The scheduling request information that this step sent is preestablished by above-mentioned steps.Then enter step 700.
Under the microprocessor control in sending processing module 14, the handling process of finishing transmission processing module 14 that these steps are gone round and begun again.
According to scheme recited above, those of ordinary skill in the art are appreciated that and queue management module 12 wherein can be removed, and directly manage the VC buffering area formation of AAL2 type by sending processing module 14, can reduce the interface that message is transmitted like this.
In the invention scheme two, several independent microprocessor parallel processings communicate to exchange messages by interface buffer between the disparate modules that these microprocessors are controlled in the network processing unit.The different scheduling message of information representative of distinct interface, the operation of being correlated with according to the scheduling message that receives between each module.Wherein, need to prove, in scheduling message, it may be noted which VC is operated.
According to the system of the realization Timer_CU function of a preferred embodiment of the present invention program two form and connected mode as shown in figure 11.
System according to the realization Timer_CU function of a preferred embodiment of the present invention program two comprises: packet queue 21, and queue management module 22, flow-control module 23 sends processing module 24, atm module 25.
Send processing module 24 and send CPS-PDU message to queue management module 22 by interface H buffering area; Queue management module 22 sends scheduling request information to flow-control module 23 by interface I buffering area; Flow-control module 23 sends dispatching response message to queue management module 22 by interface J buffering area; Send processing module 24 from the packet of high-speed interface E buffering area reception from AAL2 upper-layer protocol or other module; Flow-control module 23 sends the overtime response message of Timer_CU to sending processing module 24 by interface F buffering area; Send processing module 24 and send Timer_CU timing request message to flow-control module 23 by interface G buffering area; 22 pairs of packet queues 21 of queue management module are fallen in lines and are fallen out operation; Queue management module 22 sends CPS-PDU to atm module 25.
In a preferred embodiment of the present invention, the message structure of each interface buffer is as follows respectively:
Message structure among the interface H such as following table:
Figure C200410062996D00391
Message structure among the interface I such as following table:
31～16 15～0
Reverse Vc?Index
Message structure among the interface J such as following table:
31～16 15～0
Reverse Vc?Index
Message structure among the interface E such as following table:
Figure C200410062996D00392
Message structure among the interface F such as following table:
31～16 15～0
Reverse Vc?Index
Message structure among the interface G such as following table:
31～16 15～0
The Timer_CU timing cycle Vc?Index
Wherein, the VC Index in the message of each interface represents the VC numbering of current message, can distinguish different VC according to this numbering.
Wherein, packet queue 21 is used for depositing CPS-PDU to be sent with the form of formation.In a preferred embodiment of the present invention program two, packet queue 21 is managed according to VC, formation of every VC, and each CPS-PDU takies a buffering area, and promptly the size of buffering area is 48 bytes.
Formation in queue management module 22 managing packet queues 2 obtains message and handles accordingly from interface H buffering area and interface J buffering area.Wherein, the message that receives from interface H buffering area is CPS-PDU message, operation such as need fall in lines; The message that receives from interface J buffering area is dispatching response message, need fall out, send operations such as CPS-PDU.
The transmitting time of VC is calculated in flow-control module 23 management and dispatching time queues, obtains corresponding message and handle accordingly from interface I buffering area and interface G buffering area.Wherein, the message that receives from interface I buffering area is the scheduling request information of queue management module 22, need carry out the operations such as management of scheduling time formation; The message that receives from interface G buffering area need be carried out the operation of falling in lines of scheduling time formation for sending the Timer_CU timing request message of processing module 24.
Send processing module 24 and be responsible for the processing of AAL2 agreements, receive from the packet of AAL2 upper-layer protocol or other module and form CPS-PDU, when overtime, fill CPS-PDU and handle accordingly.Wherein, according to the regulation of AAL2 agreement, the packet of reception forms CPS-PDU after the processing through the SSCS layer earlier again after the processing of CPS layer.
Atm module 25 is responsible for receiving and is sent the CPS-PDU after processing module 24 is handled and carry out the processing of corresponding ATM layer.The module of this module and general ATM layer is identical, in this few explanation.
Specific implementation flow process below in conjunction with each module illustrates the present invention program two.
According to the workflow of the queue management module 22 of the system of the realization Timer_CU function of a preferred embodiment of the present invention program two as shown in figure 12.
At first enter step 900, queue management module 22 is obtained newly arrived CPS-PDU message from interface H buffering area.Wherein, the form of CPS-PDU message is the message structure among the interface H as mentioned before, and this message generates by sending processing module 24.
Then enter step 910, judge that whether the affiliated formation of this VC has sent scheduling request information, if then enter step 930, otherwise enters step 920.Wherein, the message in the interface I buffering area is scheduling request information.
In step 920, queue management module 22 structure scheduling request information are also passed through interface I transmission.Wherein, the rule of scheduling request information structure as previously mentioned.
In step 930, queue management module 22 is fallen in lines this CPS-PDU.In a preferred embodiment of the present invention program two, CPS-PDU obtains by the CPS-PDU buffer pointer in the CPS-PDU message of interface I reception, and queue management module 22 stores this CPS-PDU in the packet queue 21 into then.
Then enter step 940, queue management module 22 is obtained dispatching response message from interface J buffering area.Wherein, the form of dispatching response message is shown in the message structure among the front port J.
Then enter step 950, a CPS-PDU falls out.In a preferred embodiment of the present invention program two, by obtaining the VC label in the dispatching response message that receives, queue management module 22 CPS-PDU that from the VC formation of packet queue 21 correspondences, falls out then.
Then enter step 960, the CPS-PDU that falls out is sent to atm module 25.
Then enter step 970, judge that whether formation is empty, if then enter step 900, otherwise enters step 980.Wherein the formation of being judged is the VC formation in the preceding step.
In step 980, queue management module 22 structure scheduling request information are also passed through interface I transmission.Wherein, the formation rule of scheduling request information is as described in the message structure among the front port I.
The workflow of the queue management module 22 of the system of the realization Timer_CU function of the realization invention scheme two that these steps are gone round and begun again.
According to the workflow of the flow-control module 23 of the system of the realization Timer_CU function of a preferred embodiment of the present invention program two as shown in figure 13.
At first enter steps A 00, judge that whether interface G buffering area is empty, if then enter steps A 30, otherwise enters steps A 10.Wherein, the message format in the interface G buffering area as previously mentioned.
In steps A 10, flow-control module 23 obtains regularly request message of Timer_CU from interface G buffering area.Wherein, Timer_CU timing request message generates and sends by sending processing module 24.
Then enter steps A 20, calculate time-out time and also write the scheduling time formation, enter steps A 30 after handling this step.Wherein, the time-out time formation is by flow-control module 23 management.
In steps A 30, from interface I, obtain scheduling request information.Wherein, scheduling request information is generated and sent by queue management module 22.
Then enter steps A 40, calculate transmitting time and write the scheduling time formation according to flow parameter.Wherein, transmitting time is determined according to the relevant parameter of VC by flow-control module 23.
Then enter steps A 50, read the current scheduling time queue.Wherein, the current scheduling time queue is meant in time queue, the VC that need handle in the current time.
Whether then enter steps A 60, judging has the Timer_CU scheduling message in the formation, if then enter steps A 70, otherwise enters steps A 80.Wherein, the Timer_CU scheduling message of current queue is determined by the sign of VC correspondence in the formation.
In steps A 70, flow-control module 23 sends the overtime response message of Timer_CU to interface F buffering area, then enters steps A 80.Wherein, the form of the overtime response message of Timer_CU is shown in the message structure among the front port F.
In steps A 80, flow-control module 23 sends dispatching response message to interface J buffering area.Wherein, the form of dispatching response message is shown in the message structure among the front port J.Then enter steps A 00.
The go round and begin again workflow of flow-control module 23 of system of the realization Timer_CU function that realizes the present invention program two of these steps.
According to the workflow of the transmission processing module 24 of the system of the realization Timer_CU function of a preferred embodiment of the present invention program two as shown in figure 14.
At first enter step B00, judge whether from interface E buffering area, successfully to obtain new data packets,, otherwise enter step B80 if then enter step B10.Wherein, the packet that interface E buffering area receives is from AAL2 upper-layer protocol or other module, and these packets form CPS-PDU after the AAL2 protocol processes.
In step B10, the AAL2 agreement is carried out the SSCS layer and is handled.Wherein, this step is finished in the SSCS sublayer, handles the back and forms SSCS-PDU.
Then enter step B20, carry out AAL2 agreement CPS sub-layer processes.Wherein, the rule of processing can be with reference to related protocol.
Then enter step B30, judge whether to constitute complete CPS-PDU,, otherwise enter step B60 if then enter step B40.In this step, need enter the Timer_CU timing, if can constitute the scheduling transmission that complete CPS-PDU just can deposit newly-generated CPS-PDU in the formation waiting system if can not constitute complete CPS-PDU then illustrate.
In step B40, remove Timer_CU and start sign.Then enter step B50.Wherein, Timer_CU sign can be in sending processing module 24 sign of a bit of definition in addition in the description of each VC correspondence, represent that with 1 Timer_CU starts, start as yet with 0 expression Timer_CU.
In step B50, send CPS-PDU message by interface H.Then enter step B80.Wherein, the form of CPS-PDU message is shown in the message structure among the front port H, and queue management module 22 obtains by sending the newly-generated CPS-PDU of processing module 24 by VC Index in the CPS-PDU message and CPS-PDU buffer pointer.
In step B60, judge whether to start Timer_CU regularly.Then enter step B70.In a preferred embodiment of the present invention program two, this step indicates by the Timer_CU that sends each VC correspondence in the processing module 24 to be judged and whether starts Timer_CU.
In step B70, Timer_CU is set regularly starts sign, send regularly request message of Timer_CU by interface G.Then enter step B80.Wherein, the form of Timer_CU timing request message is shown in the message structure among the front port G.
In step B80, read the overtime response message of Timer_CU from interface F.Wherein, the form of the overtime response message of Timer_CU is shown in the message structure among the front port F.
Then enter step B90, judge that the Timer_CU startup sign of the VC whether message and this message correspondence are arranged among the interface F is not eliminated,, otherwise enter step C10 if then enter step C00.Need to prove, be not eliminated, illustrate that this VC does not also constitute CPS-PDU, need to fill the back and form CPS-PDU if the Timer_CU of the VC of the overtime response message correspondence of Timer_CU among the interface F starts sign; Be eliminated if the Timer_CU of the VC of the overtime response message correspondence of Timer_CU among the interface F starts sign, illustrate that this VC has had new data packets to arrive and constituted new CPS-PDU during Timer_CU regularly, do not need to carry out timeout treatment.
In step C00, send and send and remove the Timer_CU sign by interface H after processing module 24 is filled discontented CPS-PDU.Then enter step C10.Need to prove that in order to save the space of interface buffer, what interface H sent is the VC information of this CPS-PDU correspondence and the pointer of CPS-PDU, message format is shown in the message structure among the front port H.
In step C10, the packet of judging current VC whether processing finishes, if then enter step B00, otherwise enters step B10.In a preferred embodiment of the present invention, only the packet at current VC just receives new packet after the processing end fully from interface E buffering area.
The go round and begin again workflow of transmission processing module 24 of system of the realization Timer_CU function of finishing the present invention program two of these steps.
Those of ordinary skill in the art are appreciated that above-mentioned three parallel flow processs cooperatively interact and can realize the Timer_CU function in AAL2.
Though by reference some preferred embodiment of the present invention, the present invention is illustrated and describes, but those of ordinary skill in the art should be understood that, can do various changes to it in the form and details, and the spirit and scope of the present invention that do not depart from appended claims and limited.

Claims (23)

1. the system that uses timer function is united in a realization, uses in adapting layer types of asynchronous transfer mode 2, it is characterized in that, comprises:
Packet queue, be used for form with formation according to different Virtual Channels at buffering area stored outgoing data, uniting of management Virtual Channel used the timer dispatching sign and fallen out the scheduling sign;
Queue management module is used to receive new data packets, manages described packet queue, coordinates other module cooperative work in the described system according to the scheduling sign of falling out in scheduling that receives and the described packet queue;
Flow-control module is used to handle the scheduling of described queue management module, calculates scheduling and also determines whether to use associating use timer constantly;
Send processing module, be used to carry out overtime judgement, generate the common part sublayer protocol Data Unit and submit to atm module to handle, and send scheduling message, and associating use timer is used in application when not having data to send according to the result generation and to queue management module.
2. the system that uses timer function is united in realization according to claim 1, it is characterized in that, described scheduling message comprise send scheduling, the scheduling and unite the use timer dispatching of falling out, respectively by the transmission sign in the configuration scheduling, the scheduling sign and unite and use the timer dispatching sign to realize of falling out;
Wherein, processing is not operated, only sent to described transmission scheduling to described packet queue; The described scheduling of falling out is fallen out outgoing data to described transmission processing module processing from described packet queue; The described associating uses timer dispatching not have outgoing data but the common part sublayer protocol Data Unit of current Virtual Channel starts associating use timer when also not finishing at current Virtual Channel, and the new outgoing data of falling out from current Virtual Channel formation when new outgoing data is arranged handles for described transmission processing module.
3. the system that uses timer function is united in realization according to claim 1, it is characterized in that, described queue management module is that each Virtual Channel preserves a descriptor, and the content that described descriptor is used for writing down comprises: the last pointer of buffering area chain, packet number in the owner pointer of buffering area chain, the formation in the formation, the scheduling sign and unite and use the timer dispatching sign of falling out.
4. the system that uses timer function is united in realization according to claim 1, it is characterized in that, connect the interface of the both direction of described transmission processing module and described queue management module, the information that is connected in the interface of both direction of described queue management module and described flow-control module comprises: adapting layer types of asynchronous transfer mode, the index number of Virtual Channel, send the scheduling sign, the scheduling of falling out indicates and unites and use the timer dispatching sign.
5. the system that uses timer function is united in realization according to claim 4, it is characterized in that, the information of described queue management module in the interface of described transmission processing module transmission message also comprises: the pointer of maximum 5 queue buffer descriptors.
6. the system that uses timer function is united in realization according to claim 1, it is characterized in that, outgoing data is stored in the buffering area with the formation form in described packet queue, and the data of depositing in each described buffering area are less than the data of the required filling of a common part sublayer protocol Data Unit.
7. the system that uses timer function is united in realization according to claim 6, it is characterized in that, each described buffering area is deposited the data of 10 bytes.
8. in the described system of claim 1, a kind of queue management module receives scheduling and the packet on upper strata and the method for handling from other module, it is characterized in that the handling process of described queue management module comprises following steps:
A receives and handles the scheduling of flow-control module, carries out the buffering area operation of falling out according to scheduling type, constructs and dispatches and send to other described modules according to the fall out result of operation of buffering area;
B receives and also to handle the scheduling that sends processing module, carry out the management that indicates in the packet queue according to scheduling type, and the structure scheduling sends to other described module;
C receives from the packet on upper strata and falls in lines to described packet queue, manages the sign in the described packet queue, constructs and send out the row scheduling.
9. queue management module according to claim 8 receives scheduling and the packet on upper strata and the method for handling from other module, it is characterized in that described steps A also comprises following substep:
A1 judges according to the scheduling that receives whether current Virtual Channel type is adapting layer types of asynchronous transfer mode 2, if then continue, finishes described steps A otherwise directly handle the back according to other adapting layer types;
A2 then unites and uses timer dispatching to handle if the type of scheduling is an associating use timer dispatching;
A3 is if the type of scheduling is to send scheduling, and then structure sends scheduling and sends to described transmission processing module;
A4 is if the type of scheduling is the scheduling of falling out, and the scheduling of then falling out is handled.
10. queue management module according to claim 9 receives scheduling and the packet on upper strata and the method for handling from other module, it is characterized in that steps A 2 also comprises following substep:
A21 judges whether the scheduling sign of falling out of current Virtual Channel is effective, if then enter steps A 22, finishes described steps A 2 otherwise construct after overtime scheduling sends to described transmission processing module;
The A22 buffering area of from the formation of current Virtual Channel, falling out, and judge whether to fall out successfully, if then structure transmission scheduling finishes described steps A 2 after sending to described transmission processing module, after sending to described transmission processing module, overtime scheduling finishes described steps A 2 otherwise construct.
11. queue management module according to claim 9 receives scheduling and the packet on upper strata and the method for handling from other module, and it is characterized in that steps A 4 also comprises following substep:
A41 judges whether the scheduling sign of falling out of current Virtual Channel is effective, if then enter steps A 42, otherwise enters steps A 44;
The A42 buffering area of from the formation of current Virtual Channel, falling out, and judge whether to fall out successfully, if then enter steps A 43, otherwise enter steps A 44;
A43 structure sends scheduling message and sends to the scheduling that finishes to fall out after the described transmission processing module and handle;
The A44 scheduling of will falling out changes into and sends scheduling and structure and send scheduling message and send to the scheduling that finishes to fall out after the described transmission processing module and handle.
12. queue management module according to claim 8 receives scheduling and the packet on upper strata and the method for handling from other module, and it is characterized in that described step B also comprises following substep:
B1 judges that whether scheduling is to send scheduling, if then enter step B6, otherwise enters step B2;
B2 judges whether scheduling is associating use timer dispatching, if then enter step B3, otherwise enters step B4;
B3 is provided with and uniting of current Virtual Channel uses the timer dispatching sign and the scheduling sign of falling out, and then enters step B6;
B4 judges whether fall out scheduling sign of current Virtual Channel, if having then finish, otherwise enters step B5;
B5 is provided with the scheduling sign of falling out of current Virtual Channel, then enters step B6;
The B6 structure finishes described step B after dispatching and send to described flow-control module.
13. queue management module according to claim 8 receives scheduling and the packet on upper strata and the method for handling from other module, and it is characterized in that described step C also comprises following substep:
C1 receives new data packets and judges whether it is adapting layer types of asynchronous transfer mode 2, if then enter step C2, otherwise by finishing described step C after other type of process;
C2 judges whether the formation of current Virtual Channel is empty, if then enter step C3, otherwise described step C is finished in the operation back of falling in lines;
C3 judges whether fall out scheduling sign of current Virtual Channel, if having then the operation of falling in lines, otherwise enters step C4;
The C4 operation of falling in lines, the structure scheduling of falling out is provided with the scheduling sign and send the described step C of scheduling back end that falls out to described flow-control module of falling out of current Virtual Channel.
14. in the described system of claim 1, a kind of flow-control module receives from the scheduling of queue management module and the method for handling, and it is characterized in that, comprises following steps:
D judges whether obtain scheduling from described queue management module is to send the scheduling or the scheduling of falling out, if then by the flow parameter of current Virtual Channel, dispatch normally, otherwise enter step e;
E uses the timer configuration parameter according to the flow parameter of current Virtual Channel with uniting, calculate regular scheduling and unite the concrete moment of using timer dispatching, and judge to unite and use timer dispatching constantly whether late than regular scheduling, if then enter step F, otherwise enter step G;
F constructs the scheduling of falling out earlier, and tectonic syntaxis uses timer dispatching and sends to described queue management module again;
The G tectonic syntaxis uses timer dispatching and sends to described queue management module.
15. in the described system of claim 1, a kind of processing module that sends receives from the scheduling of queue management module and the method for handling, and it is characterized in that the handling process of described transmission processing module comprises following steps:
H judges that the scheduling that receives whether for uniting the use timer dispatching, if then enter step I, otherwise enters step K from described queue management module;
I stop to unite use timer and judge whether overtime, if then enter step J, otherwise temporary new buffering area and construct and enter step L after the common part sublayer protocol Data Unit sends;
J judges that whether current Virtual Channel also has data to send, if having then return step H, uses timer and fills and return step H after the common part sublayer protocol Data Unit sends otherwise stop to unite;
If K sends scheduling and then constructs and enter step L after the common part sublayer protocol Data Unit sends, otherwise the temporary buffering area that transmits from described queue management module and construct and enter step L after the common part sublayer protocol Data Unit sends;
L constructs scheduling according to the result of structure common part sublayer protocol Data Unit.
16. transmission processing module according to claim 15 receives from the scheduling of queue management module and the method for handling, and it is characterized in that step L also comprises following substep:
L1 judges whether to fill up a common part sublayer protocol Data Unit, if then enter step L2, otherwise enters step L3;
Whether L2 judges temporary storage buffer region less than five, if then construct the scheduling of falling out, otherwise structure sends scheduling;
L3 judges whether to start associating use timer, if then construct the scheduling of falling out, otherwise tectonic syntaxis uses timer dispatching;
L4 sends the scheduling back to described queue management module and finishes described step L.
17. the system that uses timer function is united in a realization, uses in adapting layer types of asynchronous transfer mode 2, it is characterized in that, comprises:
Packet queue is used for depositing the common part sublayer protocol Data Unit with the form of formation according to different Virtual Channels;
Queue management module is used to manage described packet queue, sends scheduling request information to flow-control module, and sends a common part sublayer protocol Data Unit after obtaining dispatching response message;
Flow-control module, be used for receiving unite use timer regularly behind the request message beginning regularly receive described scheduling request information and respond described dispatching response message, when overtime, send to unite and use the timer expiry response message to sending processing module;
Send processing module, be used for management and unite use timer sign and Virtual Channel, constitute the common part sublayer protocol Data Unit, send common part sublayer protocol Data Unit message to described queue management module, when having data, do not send the described regularly request message of use timer of uniting to flow-control module.
18. the system that uses timer function is united in realization according to claim 17, it is characterized in that described common part sublayer protocol Data Unit message, described scheduling request information, described dispatching response message, the described associating use timer expiry response message and described the associating to use timer timing request message to comprise the Virtual Channel numbering of distinguishing different Virtual Channels.
19. the system that uses timer function is united in realization according to claim 18, it is characterized in that, described common part sublayer protocol Data Unit message also comprises common part sublayer protocol Data Unit buffer pointer.
20. the system that uses timer function is united in realization according to claim 18, it is characterized in that, described unite use timer regularly request message also comprise to unite and use the timer timing cycle.
21. in the described system of claim 17, a kind of queue management module managing packet queue also sends the method for common part sublayer protocol Data Unit, it is characterized in that, comprises following steps:
M1 obtains common part sublayer protocol Data Unit message and judges whether the pairing Virtual Channel of described common part sublayer protocol Data Unit message has sent scheduling request information from sending processing module, if then enter step M3, otherwise enter step M2;
After sending to flow-control module, M2 structure scheduling request information enters step M3;
M3 falls in lines described common part sublayer protocol Data Unit message to the current Virtual Channel formation of described packet queue;
N1 obtains described dispatching response message from described flow-control module;
N2 is from fall out a common part sublayer protocol Data Unit and send of the current Virtual Channel formation of described packet queue;
N3 judges whether the current Virtual Channel formation of described packet queue is empty, if then obtain newly arrived common part sublayer protocol Data Unit message from described transmission processing module once more, otherwise obtain newly arrived common part sublayer protocol Data Unit message from described transmission processing module once more after constructing described scheduling request information and sending to flow-control module.
22. in the described system of claim 17, a kind of flow-control module carries out time control and sends the method for dispatching management, it is characterized in that, comprises following steps:
O1 judges from sending processing module and obtains to unite and use regularly whether success of request message of timer, if then enter step O2, otherwise continues to judge to obtain to unite from described transmission processing module and uses regularly whether success of request message of timer;
O2 calculates the time-out time of current Virtual Channel and will unite and use timer dispatching to write the scheduling time formation;
P 1 obtains scheduling request information from queue management module, calculates transmitting time and also writes described scheduling time formation;
P2 reads described scheduling time formation, and judge whether the described use timer dispatching of uniting is arranged in the described scheduling time formation, if structure and send to described transmission processing module and described the associating to enter step P3 after using the timer expiry response message then, otherwise directly enter step P3;
P3 constructs and sends described dispatching response message to described queue management module.
23. in the described system of claim 17, a kind of method that sends processing module formation common part sublayer protocol Data Unit is characterized in that, comprises following steps:
New packet is successful then to carry out entering step Q2 after the AAL protocol processes Q1 if described transmission processing module is obtained, otherwise enters step R1;
Q2 judges whether to constitute complete common part sublayer protocol Data Unit, if then enter step Q3, otherwise enters step Q4;
Q3 removes uniting of current Virtual Channel and uses timer to start sign, and structure also enters step R1 after queue management module sends described common part sublayer protocol Data Unit message;
Q4 judges whether current Virtual Channel starts to unite and uses timer to start sign, if then enter step R1, use timer startup sign co-current flow amount control module described associating of transmission to use timer regularly to enter step R1 behind the request message uniting of current Virtual Channel otherwise be provided with;
R1 obtains described the associating from described flow-control module and uses the timer expiry response message and judge the described use timer of uniting of current Virtual Channel starts to indicate whether be not eliminated, if described associating that then fill to send the common part sublayer protocol Data Unit of current Virtual Channel and remove current Virtual Channel enter step R2 after using timer to start sign, otherwise directly enter step R2;
The packet that R2 judges current Virtual Channel whether processing finishes, if end step R2 then, otherwise do not obtain new packet and continue to handle until the packet of current Virtual Channel fully processing finish.
CNB2004100629965A 2004-06-27 2004-06-27 System and method for realizing joint use timer function Expired - Fee Related CN100466596C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2004100629965A CN100466596C (en) 2004-06-27 2004-06-27 System and method for realizing joint use timer function

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2004100629965A CN100466596C (en) 2004-06-27 2004-06-27 System and method for realizing joint use timer function

Publications (2)

Publication Number Publication Date
CN1713615A CN1713615A (en) 2005-12-28
CN100466596C true CN100466596C (en) 2009-03-04

Family

ID=35719055

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2004100629965A Expired - Fee Related CN100466596C (en) 2004-06-27 2004-06-27 System and method for realizing joint use timer function

Country Status (1)

Country Link
CN (1) CN100466596C (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101420366B (en) * 2007-10-23 2011-04-20 中兴通讯股份有限公司 Device and method for guaranteeing quality of real-time service in wideband wireless access system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1414744A (en) * 2002-04-06 2003-04-30 华为技术有限公司 Channel combined application timing control method need no timer under asynchronous transmission mode
US20030123451A1 (en) * 2001-12-27 2003-07-03 Nielsen Christopher John Combined use timer system for data communication
US6603766B1 (en) * 2000-01-31 2003-08-05 Motorola, Inc. Apparatus and method for implementing an ATM AAL2 combined use timer
CN1434592A (en) * 2002-01-23 2003-08-06 华为技术有限公司 Method for realizing type 2 adaption layer of ATM VBR real time business

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6603766B1 (en) * 2000-01-31 2003-08-05 Motorola, Inc. Apparatus and method for implementing an ATM AAL2 combined use timer
US20030123451A1 (en) * 2001-12-27 2003-07-03 Nielsen Christopher John Combined use timer system for data communication
CN1434592A (en) * 2002-01-23 2003-08-06 华为技术有限公司 Method for realizing type 2 adaption layer of ATM VBR real time business
CN1414744A (en) * 2002-04-06 2003-04-30 华为技术有限公司 Channel combined application timing control method need no timer under asynchronous transmission mode

Also Published As

Publication number Publication date
CN1713615A (en) 2005-12-28
CN100466596K3 (en)

Similar Documents

Publication Publication Date Title
TW317058B (en) Data communication system for a wireless access to an atm network
CN1745549B (en) System for content based message processing
US5946297A (en) Scheduling method and apparatus for supporting ATM connections having a guaranteed minimun bandwidth
TW387183B (en) Extending asynchronous transfer mode (ATM) QOS across local area networks
US6167030A (en) Buffer-based traffic measurement system and method for nominal bit rate (NBR) service
JPH0918435A (en) Radio atm system
CN108616458A (en) The system and method for schedule packet transmissions on client device
JP2001136193A (en) Method for controlling data flow given to communication node
CN102090030A (en) Method of data delivery across a network
JP2011024269A (en) Method for generating atm cells for low bit rate applications
CN104734991A (en) End-to-end time delay guarantee transmission scheduling method oriented to industrial backhaul network
CN100593312C (en) Scheduling using quantum and deficit values
CN100466593C (en) A Realization Method of Integrated Queue Scheduling Supporting Multiple Services
CN100403747C (en) Method for controlling data flux
CN100466596C (en) System and method for realizing joint use timer function
CN1954564A (en) Data transport in umts
CN100473047C (en) Method of transmission control for adaptation layer 2 in asynchronous transfer mode
TW317678B (en) Packet data communications system having a malfunction list
CN101883047A (en) Data concurrency transmission method of multi-network interface device
KR100343935B1 (en) Dbwrr cell scheduling device and method thereof in imt-2000 atm switch
CN100479412C (en) Method and device for dispatching permanent virtual path
JP3364410B2 (en) Communication device
CN100531114C (en) Device for carrying out grading treatment for Ethernet data pack in DSL system
CN1307841C (en) Base station internal real-time service data transmitting method
CN101237386A (en) Method for flow dispatching in Ethernet network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20090304

Termination date: 20200627

CF01 Termination of patent right due to non-payment of annual fee