CN1855881A - Method for dynamically sharing space of memory - Google Patents

Method for dynamically sharing space of memory Download PDF

Info

Publication number
CN1855881A
CN1855881A CNA2005100665824A CN200510066582A CN1855881A CN 1855881 A CN1855881 A CN 1855881A CN A2005100665824 A CNA2005100665824 A CN A2005100665824A CN 200510066582 A CN200510066582 A CN 200510066582A CN 1855881 A CN1855881 A CN 1855881A
Authority
CN
China
Prior art keywords
chain
storage
memory
data
piecemeal
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CNA2005100665824A
Other languages
Chinese (zh)
Other versions
CN100466602C (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 CNB2005100665824A priority Critical patent/CN100466602C/en
Publication of CN1855881A publication Critical patent/CN1855881A/en
Application granted granted Critical
Publication of CN100466602C publication Critical patent/CN100466602C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023—Free address space management
    • 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—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/18—Legal services; Handling legal documents
    • 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
    • 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—Arrangements for allocating sub-channels of the transmission path 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—Arrangements for allocating sub-channels of the transmission path allocation of payload
    • 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. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—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. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—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. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—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. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—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. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—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, e.g. scheduled or random access
    • H04W74/02—Hybrid access techniques
    • 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
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/0284—Multiple user address space allocation, e.g. using different base addresses
    • 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. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—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, variance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—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, Eb/lo
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—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

Abstract

A memory space realization method of dynamic share memorizer, including: first, divide the memory space of the memorizer into some memory blocks, and distribute the corresponding address finger information to every block and string to memory block chain; then, dynamic divide a data memory block chain which consists of one or some memory blocks based on the address finger information and make data memory; releases the memory block back the memory block chain when the memory block do not need to memorize data. The invention can improve the using of the RAM space especially processing some channel data memory because every channel can use the whole RAM space theoretically.

Description

The implementation method of dynamic shared storage memory space
Technical field
The present invention relates to the data storage management technology, relate in particular to a kind of implementation method of dynamic shared storage memory space.
Background technology
In the chip design field, chip often needs the buffer memory lot of data, these data are typically buffered in chip internal or the plug-in memory, particularly in the design of communication chip, a chip usually needs to handle a plurality of service channels, therefore the memory space of chip must satisfy the storage demand of a plurality of service channels simultaneously, and the discharge characteristic of different business passage and they all are very different to the requirement of memory capacity, therefore, how efficient, the memory space in the allocate memory carries out being stored as in order to carry out of multi-channel data flexibly needs one of subject matter of considering in the chip design process.
As shown in Figure 1, chip relates generally to memory read/write interface module and memory reference address administration module two parts to the visit of memory.Wherein, described memory reference address administration module is used to finish management and the scheduling to the memory reference address, playing a part core control in the visit of memory, is exactly that implementation by this module determines to the effect quality of the distribution of memory space and scheduling.
Describe at existing two kinds of memory reference address administration module implementations respectively below.
The implementation of first kind of memory reference address administration module is:
According to service channel metadata cache space requirement, RAM (random asccess memory) space is divided, be one section continuous memory space of each service channel independent allocation.The memory reference address administration module of chip is being managed the address of visiting inner each memory cell of ram space, and as shown in Figure 2, described address comprises passage spatial cache first address and offset address.Wherein the first address of the memory space of corresponding each service channel is unique and fixing, described offset address then is the internal blas address of distributing to the memory space of this service channel, it is divided into reads offset address and writes offset address, changes with the read and write access operation.One " passage spatial cache address table " formed in described address.Access entrance that should " passage spatial cache address table " is a service channel number.
When the data of certain service channel of access, at first number visit " passage spatial cache address table " obtains the externally reference address in metadata cache space of this service channel according to service channel, this comprises first address and reads (or writing) offset address, according to described address the data in the corresponding memory space of service channel is carried out read and write access then.
In this implementation, to distribute to the memory space of each service channel and fix, its size is by above-mentioned offset address decision.And, at first owing to need consider the sudden of metadata cache, also needing certain tolerance limit, the spatial cache of promptly distributing to each service channel is always much bigger than average data buffer memory capacity, causes the ram space that need provide enough big.Secondly, if the demand that adds the new business passage is at any time arranged, therefore also need to remain with in advance idle spatial cache in system's running, this has just further increased the capacity requirement to ram space.In addition, in system's running, when partial service passage buffer storage space, can't reclaim to other passages and use, cause the waste in space.In a word, dumb in this a kind of implementation at the method for service channel fixed allocation spatial cache, can not dynamically adjust the waste that causes ram space according to the real data buffer memory demand of service channel, required ram space causes cost higher greatly.
The implementation of second kind of memory reference address administration module is come the diode-capacitor storage space for the mode that adopts loop chain:
At first ram space is divided into memory partitioning one by one, the memory partitioning that when initialization, distributes some according to the metadata cache flow requirements of each service channel, these memory partitionings can be any one piecemeals of dividing the back ram space, the memory partitioning of each service channel is connected in series and forms one " chain ", and chain is end to end, thereby has formed the chain of a ring-type.The data access of each service channel all circulates in the piecemeal of this " loop chain " and carries out.
Concrete implementation as shown in Figure 3, at first ram space is divided into n RAM Block (memory block), the reference address of these RAM Block is indicated by one " piecemeal address pointer linked list ", comprised n block (piece) in this table, the content of each block storage comprises the reference address of corresponding RAMBlock and points to the pointer of another one block, by this pointer, a plurality of block can be conspired to create " chain ", also just the RAM Block of correspondence has been conspired to create one " chain ".
For example, as shown in Figure 3,,, and conspired to create " loop chain " of a closure by the pointer among each block for it has distributed block7,9 and 100 3 piecemeals according to passage 0 data storage requirement.
During initialization, the RAM reference address pointer of respective channel 0 obtains by a block who arbitrarily points to " loop chain ", block7 for example, then beginning to read and write is that RAM Block7 from the block7 correspondence begins, when writing data when RAM Block7 write full after data can be write RAM Block9 and RAM Block100 successively.Read data also is earlier from RAM Block7 after the initialization; Space in the loop chain is the circulation read-write, has write RAM Block7, RAM Block9 and RAMBlock100 successively such as data, reads also to read to RAM Block100 from RAM Block7, RAM Block9 successively, successively circulation.
In this implementation, by ram space has been carried out piecemeal, the size of piecemeal can be controlled neatly, according to the metadata cache demand of each service channel, the number that can distribute piecemeal when system initialization more neatly can improve the utilization ratio of ram space.
Yet from essence, this implementation still belongs to the mode for each service channel fixed allocation spatial cache.Therefore, the buffer memory demand that need consider each service channel when initial configuration is carried out the block count purpose and is distributed, and still need consider the bursty data storage demand that the data traffic of passage exists and carry out the allowance configuration.And, if there is the possibility of newly-increased passage in the running in system, then must the standby piecemeal of reserved part.In addition, this method can not be adjusted the piecemeal quantity on the storage loop chain of service channel equally in data handling procedure, makes described reservation piecemeal, and the idle piecemeal that the passage of deleting in the running produces all can't be used by other passages again.As seen, in this scheme, still be unrealized at reasonable, the effectively application of ram space.
In addition, in the communications field, for the requirement of QoS (service quality), different service message types are labeled as different priority levels usually.Message received storage, handle in the message handling system that sends then at those, need treat with a certain discrimination other message of different priorities usually, other message of high priority can be by priority treatment and preferential the transmission.
The message of message handling system to receiving, generally can store in a RAM (random asccess memory) space and go, if the message to different priorities is stored without distinction, can bring difficulty for follow-up processed, therefore, message handling system is treated with regard to the differentiation of having carried out priority during these messages in storage, and when handling and send, equally according to the difference of priority and differentiating and processing.
In order to realize that the message of different priorities is distinguished memory sequencing to be handled in ram space.The method that adopts is mainly at present: distribute a segment memory space to carry out the storage of message at be fixed as it for the message of each priority level, detailed process is:
1, ram space Shuo be divided into the spatial cache of plurality of sections according to message priority.One section space of each priority level fixed allocation;
2, when receiving storage, the message of different priority is put into respectively according to certain priority orders in that section spatial cache of its correspondence, has finished priority of messages by such operation and has received memory sequencing;
3, when needs are handled message and send, message is read from memory space, also needed to carry out the ordering of message priority here, for example, the message of high priority is preferentially read and is handled, the processed message that just removes to handle low priority after intact of the message of high priority.
As can be seen, the shortcoming of said method comprises:
The first, too low to the utilance of ram space.For finishing the memory sequencing of priority, to each priority level fixed allocation one section ram space, but the real-time flow of the message of different priorities differs greatly in the real system, the message flow of some priority is very little, the spatial cache of this part priority packet may be empty in a period of time, and the spatial cache of other priority packets may be not enough.The space must be distributed according to the message flow of each priority in minute timing like this, and considers allowance, and space availability ratio is low, and general ram space is to adopt memory device to realize, has increased cost so greatly.
The second, when the QoS changes in demand, when need increasing priority number, prior art need be distributed again or increases memory space memory space, causes the increase of bigger design change and cost; And when needs reduced some priority, the space that the priority of minimizing is distributed can not be used for other priority, if reuse, then needed to design to change and redistributed memory space.
Summary of the invention
In view of above-mentioned existing in prior technology problem, the purpose of this invention is to provide a kind of implementation method of dynamic shared storage memory space, thereby make and to realize rationally, to effectively utilize at storage space in the communication system.
The objective of the invention is to be achieved through the following technical solutions:
The invention provides a kind of implementation method of dynamic shared storage memory space, comprising:
A, the memory space of memory is divided into several memory partitionings, and is that each memory partitioning distributes the corresponding address pointer information;
B, when data storage requirement takes place when, dynamically be storage piecemeal chain of forming based on described address pointer information by one or more memory partitionings of its distribution, and utilize described storage piecemeal chain to carry out the storage of data;
C, when the memory partitioning in the described storage piecemeal chain need not to store data, then it is released to the memory partitioning that can distribute to other data storage requirement.
Described steps A comprises:
Described several memory partitionings are formed the memory partitioning chain;
And each memory partitioning corresponding address pointer information comprises:
Piecemeal first address: be used in reference to the position of memory partitioning in memory storage space;
Indicator linking: be used in reference to pointer information to the next memory partitioning of this memory partitioning link;
The last-of-chain mark: the independent flag bit that is provided with, when memory partitioning was last-of-chain, this mark was effective; Perhaps when memory partitioning was last-of-chain, indicator linking was set to particular value as the last-of-chain mark.
Described step B also comprises:
To divide the storage piecemeal chain of the indicator linking information composition of determining for one or more memory partitionings that described data storage requirement is distributed based on storage, set up storage piecemeal first-in-chain(FIC) tail pointer table for described storage piecemeal chain, writing down the head and the tail pointer information of described storage piecemeal chain in the table.
Described step B also comprises:
When the storage piecemeal chain that distributes for described data storage requirement can't satisfy data storage requirement, then continue as described data storage requirement and distribute new memory partitioning, new memory partitioning string is to the last-of-chain of existing storage piecemeal chain, and modification storage piecemeal first-in-chain(FIC) tail pointer table information.
Described step C comprises:
When described data storage requirement needed data quantity stored to reduce or no longer needs to carry out the storage of data, the part or all of piecemeal in the then described storage piecemeal chain determined to need not to store data.
Described step C also comprises:
With the memory partitioning string that the discharges last-of-chain to idle memory partitioning chain, and last-of-chain mark that should the free time piecemeal in the idle memory partitioning chain corresponding address information is set to effectively, and it is invalid that the last-of-chain mark of former last-of-chain free time piecemeal is set to.
The implementation method of described dynamic shared storage memory space also comprises:
According to the size of data storage requirement, distribute corresponding storage piecemeal chain for each service channel in the communication system in advance.
The implementation method of described dynamic shared storage memory space also comprises:
When needs from described storage piecemeal chain during reading of data, then need from the head and the tail pointer gauge of this storage piecemeal chain correspondence, to obtain the pointer information of its first-in-chain(FIC) piecemeal, obtain its address information, and read data in each memory partitioning according to described address information.
Described data storage requirement comprises:
The data storage requirement of service channel that has been configured in the chip of communication equipment and the service channel that increases newly.
In the method for the present invention, the described memory partitioning corresponding address of steps A pointer information can be stored in the chip or external memory storage in.
Among the present invention, when the data of service channel need be divided the priority storage, this method comprised:
D, determine the priority level of each service channel data message to be stored, and distribute corresponding storage piecemeal chain to carry out the storage of data respectively for the identical message of rank;
E, when reading of data, successively corresponding storage piecemeal chain carried out read data operation by high priority to low priority according to the priority level of storage piecemeal chain stored messages.
Among the present invention:
Described step D also comprises:
For described storage piecemeal chain is provided with the corresponding priority level sign;
And described step e also comprises:
When reading of data, read data in each storage piecemeal chain successively according to described priority tag.
Among the present invention, when the data of service channel need be divided the priority storage, this method comprised:
F, determine the priority level of data message to be stored, and with described data message according to the priority level sequential storage in the storage piecemeal chain of this service channel correspondence;
G, when carrying out data read, obtain the first address information of the memory partitioning of storage high priority other message, and reading of data from storage piecemeal chain successively.
Described step F further comprises:
Set up priority data memory partitioning chain, be respectively arranged with priority tag in each first address pointer entries of the memory partitioning correspondence in the chain, storage piecemeal first-in-chain(FIC) tail pointer is set points to this chain.
Described step F further comprises:
For data message to be stored distributes idle memory partitioning from the memory partitioning chain;
Search each memory partitioning corresponding priorities sign in the described priority data memory partitioning chain, and according to the priority of data message to be stored and the definite position of memory partitioning in priority data memory partitioning chain of storing this message of priority tag that finds;
Described memory partitioning is sealed on the position of determining in the priority data memory partitioning chain.
Described step F also comprises:
When system initialization, be provided with the priority level territory that is used for the loading priority sign in each first address pointer entries of a memory partitioning chain that will conspire to create, and all initialization is set to lowest priority by all memory partitionings;
When needs storage data, be the memory partitioning of this data allocations free time from the memory partitioning chain, and it sealed in the priority data memory partitioning chain by revising the corresponding first address pointer entries of described memory partitioning content.
The message that is stored in same memory partitioning in the described priority data memory partitioning chain all should belong to same priority level.
As seen from the above technical solution provided by the invention, the present invention has the following advantages:
1, provided by the present inventionly ram space is carried out the dynamic catena of piecemeal and piecemeal realizes the method that storage space is shared, the utilization that has greatly improved ram space; In the occasion of handling a plurality of channel data storages, each passage can use whole ram space in theory especially, and the ram space utilance can reach maximum 100%, has saved cost greatly; The present invention can be used for based on any need to memory conduct interviews the management application.
2, method provided by the present invention is because only at the real-time memory space dynamic allocation of the data storage requirement of service channel, the piecemeal that data storage requirement is greatly then distributed is many, and the little piecemeal that then distributes of storage demand is few.This method can adapt to the burst of the flow of service channel in real time, is difficult to estimate that for those there are the application of great changes in channel data flow or channel data flow in running, has important practical value.
3, method provided by the invention can simply and neatly not influence the normal storage of current other channel datas for newly-increased channel allocation memory space in the normal course of operation of system, and automatically realized deleting the recovery and reuse of passage memory space in the running, for the application of those frequent additions and deletions memory channels, have important use and be worth.
Description of drawings
Fig. 1 is the access control structural representation of communication equipment chips to memory;
Fig. 2 and Fig. 3 are respectively existing two kinds of storage space address administration schematic diagrames;
Fig. 4 is the processing procedure schematic diagram of method of the present invention;
Fig. 5, Fig. 6 and Fig. 7 are respectively dynamic management storage space address schematic diagram among the present invention.
Embodiment
The invention provides the implementation method in a kind of dynamic RAM Shared space, the core of this method is to adopt the mode of ram space being carried out piecemeal and the dynamic catena of piecemeal, memory partitioning is carried out dynamic allocation schedule and retrieval management, thereby realize ram space shared fully between each service channel, and be embodied as Added Business channel allocation spatial cache neatly, and will delete the passage buffer storage space reclamation and function such as reuse.Certainly, the present invention is not only applicable to the chip design field in the communication equipment, and in other occasions that need carry out memory stores control higher utility is arranged also.
The specific implementation of method of the present invention comprises:
(1) at first, described memory is divided into several memory partitionings, and be respectively each memory partitioning and distribute corresponding address information, each memory partitioning comprises a plurality of data storage cells usually, and the address information of each memory partitioning comprises the first address information and the offset address information of memory partitioning, wherein, first address information has been indicated the position of memory partitioning in memory storage space, and offset address is used for when concrete each memory partitioning of read/write, as each memory cell in the low order address addressing piecemeal;
(2) secondly, described several piecemeals are formed corresponding memory partitioning chain based on corresponding address information, form idle memory partitioning chain by the indicator linking link between memory partitioning;
The method that is adopted is for setting up a first address pointer gauge, a first address pointer entries in the described memory partitioning correspondence table, write down the address pointer information of memory partitioning in the list item, specifically comprise: first address information, indicator linking and last-of-chain label information, indicator linking is used for the next memory partitioning of indicating this memory partitioning to link at chain and its, described last-of-chain mark is used for then indicating whether this memory partitioning is the last-of-chain of chain, if, then this is labeled as effectively, otherwise is invalid;
(3) last, when data storage requirement takes place when, perhaps initiatively be that contingent data storage requirement is distributed one or more memory partitionings from idle memory partitioning chain, one or more memory partitionings are formed corresponding storage piecemeal chain, the first-in-chain(FIC) of the memory access pointed storage piecemeal chain of corresponding data storage demand by the indicator linking link equally;
Usually need distribute a data memory partitioning chain at data storage demand, as the data storage requirement of a service channel etc.;
Be in the data storage requirement memory allocated blocking process, both can once distribute the memory partitioning of respective numbers according to the size of data storage requirement for it, also can adopt one or several memory partitioning that at every turn only distributes fixed qty, after being filled with data in the memory partitioning that distributes, if also need to store other data, then again for it distributes new storage piecemeal, up to satisfying data storage requirement;
In the time the data in the storage piecemeal chain need being read, then from described first address pointer gauge, obtain the address information of the piecemeal of the first-in-chain(FIC) in this storage piecemeal chain, and from storage piecemeal chain, carry out reading of data according to described address information.
(4) in addition, the present invention also comprises when distributing to one or more memory partitionings in the storage piecemeal chain of corresponding data storage requirement and no longer need to carry out the storage of data, when being idle condition, then its release is made the return trip empty in the not busy memory partitioning chain, use so that when implementation (3), distribute to other data storage requirement;
A certain data storage requirement specifically comprises: when need be stored the data volume minimizing, or a certain data storage requirement is not when existing, then need the list item information in the first address pointer gauge of the part or all of memory partitioning correspondence in the storage piecemeal chain that it is corresponding to adjust, thereby make described part or all of memory partitioning seal in again in the idle memory partitioning chain.
As can be seen, among the present invention, both realized being the corresponding storage piecemeal of each data storage requirement dynamic assignment chain, realized the memory partitioning of the idle condition in the dynamic data collection memory partitioning chain again, thereby made more flexible at the utilization of memory storage space.
Be applied as routine specific implementation with the control of the memory stores in the chip design process in the communication equipment below and be described further, as shown in Figure 4 and Figure 5, specifically comprise method of the present invention:
Step 41: whole ram space is divided into several memory partitionings RAM Block, and the quantity of supposing memory partitioning is M, and the size of described RAM Block can be divided flexibly according to specific design, generally includes several memory cell;
The reference address of each RAM Block is made up of first address and offset address, wherein first address has been indicated the position of RAM Block in ram space, and offset address when being used for specifically reading and writing each RAMBlock as each memory cell of low order address addressing piecemeal.
Step 42: set up the first address pointer gauge of corresponding memory partitioning, just described each memory partitioning can be formed corresponding memory partitioning chain by this first address pointer gauge;
At this moment, because therefore also unallocated storage of being used for data for the corresponding business passage can be called idle memory partitioning chain, corresponding memory partitioning then can be called idle memory partitioning;
Described first address pointer gauge is made up of M the first address pointer entries consistent with described RAM Block number, and the address pointer information field of each first address pointer entries comprises: the first address of corresponding RAM Block; Chain concatenation pointer CI; Last-of-chain mark end; The last-of-chain mark is effective, and promptly the CI value in the first address pointer entries during end=1 will be left in the basket, and described last-of-chain mark also can be represented with other modes, for example adopts a specific CI value, and this CI value is not pointed to any already present piecemeal;
In actual chips, this piecemeal first address pointer gauge can be deposited among the RAM of chip internal or outside;
The process of each memory partitioning being formed the memory partitioning chain comprises: the content of the CI of a first address pointer entries A is pointed to another " first address pointer entries " B, and promptly the CI content by A can be addressed to B, and A and B just have been connected in series like this; And the like, all first address pointer entries persons can be connected in series forms a chain; Because each first address pointer entries all has the first address information of a RAM Block, in this way, each outside RAM Block has also been conspired to create a chain, and the last-of-chain mark end of first address pointer entries that is in the RAM Block correspondence of last-of-chain is set to effectively; Like this, when system initialization, all memory partitionings have at first conspired to create an idle memory partitioning chain by such mode, the first address pointer entries of the memory partitioning correspondence of these free time memory partitioning chain head and the tail is pointed by idle chain head and the tail pointer, and promptly described idle chain head and the tail pointer is used in reference to the first address pointer entries to the head and the tail memory partitioning correspondence of idle memory partitioning chain.
Step 43: corresponding each service channel that has disposed is respectively it and distributes corresponding memory partitioning from described memory partitioning chain, and conspires to create corresponding storage piecemeal chain, is used to carry out the storage of the data of service channel;
At first, in the design process of chip, the beginning and end address pointer of a data memory partitioning chain need all be set at each service channel, this pointed a storage piecemeal chain; When certain service channel has data storage requirement, apply for that a new memory partitioning first address distributes to this service channel, promptly from idle memory partitioning chain, get an idle memory partitioning and distribute to this service channel, for example read the piecemeal first address information in the first address pointer entries of first-in-chain(FIC) correspondence of idle memory partitioning chain, and distribute to this service channel, and this first address pointer entries is also sealed in the last-of-chain of the storage piecemeal chain of this service channel simultaneously;
As shown in Figure 5, for service channel CH0,, at this moment, can determine that the storage piecemeal chain of this service channel comprises: block9,10,11 3 memory partitionings for the beginning and end address pointer of its setting is respectively CI (B)=9 and CI (E)=11;
After the memory partitioning that distributes for service channel is write full data, then can be the new idle memory partitioning of this service channel application once more, each service channel memory partitioning of having stored data also conspires to create a chain like this.
Step 44: when needs are read the data of certain service channel, only need obtain the address information of memory partitioning of first-in-chain(FIC) of the storage piecemeal chain of this service channel, can begin the data message preserved in each memory partitioning the reading of data memory partitioning chain successively from this memory partitioning;
Be example still with service channel CH0, when needs are read the data of storing in the storage piecemeal chain of this service channel correspondence, then inquire about the address information of first address pointer gauge, and begin to carry out the read operation of data from this address information with the memory partitioning that obtains first-in-chain(FIC).
Describe as can be seen from said process, the present invention can be at the demand of service channel storage, in the chip design process, determine and adjust the size of the memory space of distributing to each service channel according to actual needs flexibly, thereby help reasonable utilization the limited memory space.
In addition, the present invention can also realize carrying out neatly at the Added Business passage distribution of memory space, and the function that reclaims the memory space of having distributed to the corresponding service passage effectively.To be described respectively below:
1, when newly-increased service channel occurring in the communication system, only need to get final product for this service channel distributes a data memory partitioning first-in-chain(FIC) tail pointer again, concrete processing procedure is identical with above-mentioned steps 43, and the accessing operation process afterwards equally operation process of service channel with other is identical; And the entire process process does not influence the data access of other passages.
2, when the memory partitioning of distributing to the corresponding service passage does not need to carry out storage again, then can reclaim, thereby realize recovery at memory storage space to described memory partitioning; Usually under following two kinds of situations, need to carry out the reclaimer operation of memory partitioning:
(1) after the content of the memory partitioning storage of the memory partitioning chain first-in-chain(FIC) of service channel is read, need this memory partitioning is released to idle memory partitioning, the first address pointer entries of this memory partitioning correspondence will be sealed in the last-of-chain place of idle memory partitioning chain; Concrete processing method comprises: the chain owner pointer of corresponding service channel is changed to and points to the chain next memory partitioning that this memory partitioning connects that neutralizes; The last-of-chain mark end of this memory partitioning is changed to effectively, and the indicator linking CI of the memory partitioning of the last-of-chain of original idle memory partitioning chain changed into points to this memory partitioning, and its last-of-chain mark end be revised as invalid;
(2) for the service channel of deletion, the memory partitioning that needs to distribute to it recycles, and simultaneously, also needing to delete was the storage piecemeal first-in-chain(FIC) tail pointer of its distribution originally, and the memory partitioning of recovery can be shared for other service channels again and use; For example, in the time will deleting certain passage, at first no longer be the new memory partitioning of its application; Then the memory partitioning of having stored data in this passage is read empty and release, corresponding each memory partitioning will be recovered to join in the idle memory partitioning chain and use for other passages, concrete processing method is each memory partitioning to be sealed in successively the last-of-chain place of idle memory partitioning chain, and revises the indicator linking CI and the last-of-chain mark end of memory partitioning of the last-of-chain of each memory partitioning and former idle memory partitioning chain; At last, delete the storage piecemeal first-in-chain(FIC) tail pointer of this service channel correspondence.
The present invention can also make reasonably shared storage memory space of different priorities message, and concrete implementation can have two kinds, will describe respectively below.
First kind for setting up corresponding storage piecemeal chain respectively at the other message of different priorities:
Can regard each priority of setting in the business transmission as same data storage requirement, be provided with a priority " storage piecemeal chain " at all independent correspondence of each priority, described priority " storage piecemeal chain " comprises one or more memory partitionings, and the message that each memory partitioning is stored all should belong to same priority; And, also need to be provided with respectively a priority " storage piecemeal first-in-chain(FIC) tail pointer " at each priority " storage piecemeal chain " and be used in reference to this chain.
When needs are stored the message of respective priority, then from " idle memory partitioning chain ", apply for a new memory partitioning, and it is not joined in the respective priority " storage piecemeal chain " according to this priority of messages, " the first address pointer entries " that be about to this memory partitioning correspondence seals in the last-of-chain of " the storage piecemeal chain " of corresponding priority; Simultaneously, this memory partitioning that to apply for from " idle memory partitioning chain " is distributed to the message that needs storage, the piecemeal first address information that for example reads in " the first address pointer entries " of this memory partitioning correspondence is distributed to this message, is used to carry out the storage operation of message.Like this, each memory partitioning in the priority " storage piecemeal chain " just can be connected in series successively according to the sequencing of storage.
In the time need according to priority reading to the stored messages in the priority " storage piecemeal chain ", then because all corresponding same priority of every priority " storage piecemeal chain ", promptly can realize the processing requirements of reading and sending message according to priority so only need that message is read processing to corresponding priority level " storage piecemeal chain " successively according to the difference of priority level.For example, the message of high priority is by priority treatment, then go to judge each priority " storage piecemeal chain " successively, if string has the piecemeal of stored messages data in other priority of high priority " storage piecemeal chain ", then preferentially read processing, handle the message of storage in the lower priority corresponding priorities " storage piecemeal chain " afterwards, promptly successively by high priority to low priority.Thereby guarantee that other message of high priority can have been satisfied the demand that the message priority ordering is handled by priority treatment.
Simultaneously, at different priorities other message set up respectively in the method for priority " storage piecemeal chain ", if during the priority that needs increase to handle owing to the QoS changes in demand, then need to increase corresponding priority level " storage piecemeal chain "; Because the present invention can realize memory partitioning and share, memory partitioning can distribute automatically according to the storage request, therefore, when needs increase corresponding priority level " storage piecemeal chain ", only need to get final product for this priority is provided with a priority " storage piecemeal first-in-chain(FIC) tail pointer " again, afterwards when needs are stored data in this priority " storage piecemeal chain ", from idle memory partitioning chain,, and can not have influence on the message access processing procedure of other priority for it distributes corresponding memory partitioning just passable.
Delete priority corresponding priorities " storage piecemeal chain " if desired, then need and to reclaim for its memory allocated piecemeal, and deletion was " the priority memory partitioning first-in-chain(FIC) tail pointer " of its distribution originally, the recycling mode of concrete memory partitioning is identical at the recycling mode of the memory partitioning in other chains with the front, does not give unnecessary details herein.
Second kind be with each message according to the priority level sequential storage in same storage piecemeal chain:
When system initialization, all memory partitionings are conspired to create one " idle memory partitioning chain ", wherein also be provided with CLS (priority level) territory in each " first address pointer entries ", be used to be recorded in the corresponding priority level identification information, and all initialization is set to lowest priority, for example CLS=0; " first address pointer entries " quilt " idle memory partitioning first-in-chain(FIC) tail pointer " that is somebody's turn to do " idle memory partitioning chain " head and the tail is pointed.
When the message data storage demand, new memory partitioning first address of application from " idle memory partitioning chain ", to from " idle memory partitioning chain ", get an idle memory partitioning and distribute to message, such as the piecemeal first address information in the correspondence that reads idle first-in-chain(FIC) " first address pointer entries ", distribute to this message and store.The message data that requires storage to advance same memory partitioning all is to belong to same priority level CLS.The address that writes this memory partitioning comprises the offset address of writing when distributing the first address that obtains and write operation.
For all memory partitionings of having stored message, corresponding one " storage piecemeal chain " is provided with " storage piecemeal first-in-chain(FIC) tail pointer " and points to this piecemeal chain.When stored messages, the other CLS of described priority of messages has determined in the corresponding position of memory partitioning in " storage piecemeal chain ", that is to say that memory partitioning in " storage piecemeal chain " is according to the other CLS of its message priority of the storing catena that sorts, equally, the memory partitioning catena is finished by correspondence " first address pointer entries " catena.
The processing procedure that will conspire to create memory partitioning " storage piecemeal chain " below describes:
Suppose priorities sorts to low by high, 0～7 priority is for example arranged, 7 for the highest, 0 is minimum, then the process with the memory partitioning catena is: at first, one is assigned with and just at the memory partitioning of stored messages, the CLS territory of its " first address pointer entries " X will be updated to consistent with the other CLS of the priority of messages of its storage; Then, first-in-chain(FIC) from " storage piecemeal chain ", reading the CLS territory of " first address pointer entries " and the CLS territory of X successively compares, if the former CLS value is more than or equal to the CLS value of X (be priority equate with this message or higher), the CLS territory of then reading next " first address pointer entries " in the chain again compares, the CLS of " first address pointer entries " M in finding chain then is inserted into X the front of M than the CLS value little (priority ratio X is low) of X; If relatively all can't find the CLS territory of " first address pointer entries " littler always than X to last-of-chain, illustrate that then the current priority of messages of this memory partitioning storage is minimum, then just join in the last-of-chain.In this way, each memory partitioning just can be arranged from high to low according to priority orders and the order that writes storage in " storage piecemeal chain ".
In the second way, the priority of stored messages reads process: because the memory partitioning of institute's stored messages is for pressing the message priority ordering, so only need from corresponding " storage piecemeal chain ", begin to read the piecemeal first address by first-in-chain(FIC) successively when reading message, read message from this memory partitioning then and get final product.
In the second way, can carry out the recycling of memory partitioning according to the storage situation equally, concrete recycling mode is identical with the recycling mode that the front was described.Simultaneously, in this mode,, may need newly-increased priority level or delete some priority level for the changes in demand of QoS; When newly-increased priority of needs and deletion priority, the priority memory partitioning catena method that adopts in this mode can be supported priority level arbitrarily, and memory partitioning is the mode of sharing, only when message data storage request is arranged, just can distribute the branch block space, all can finish automatically and need not design change so newly-increased priority level and some priority level of deletion are operated above-mentioned storage and prioritization.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claims.

Claims (17)

1, a kind of implementation method of dynamic shared storage memory space is characterized in that, comprising:
A, the memory space of memory is divided into several memory partitionings, and is that each memory partitioning distributes the corresponding address pointer information;
B, when data storage requirement takes place when, dynamically be storage piecemeal chain of forming based on described address pointer information by one or more memory partitionings of its distribution, and utilize described storage piecemeal chain to carry out the storage of data;
C, when the memory partitioning in the described storage piecemeal chain need not to store data, then it is released to the memory partitioning that can distribute to other data storage requirement.
2, the implementation method of dynamic shared storage memory space according to claim 1 is characterized in that, described steps A comprises:
Described several memory partitionings are formed the memory partitioning chain;
And each memory partitioning corresponding address pointer information comprises:
Piecemeal first address: be used in reference to the position of memory partitioning in memory storage space;
Indicator linking: be used in reference to pointer information to the next memory partitioning of this memory partitioning link;
The last-of-chain mark: the independent flag bit that is provided with, when memory partitioning was last-of-chain, this mark was effective; Perhaps when memory partitioning was last-of-chain, indicator linking was set to particular value as the last-of-chain mark.
3, the implementation method of dynamic shared storage memory space according to claim 1 is characterized in that, described step B also comprises:
The storage piecemeal chain that to form based on the indicator linking information of memory partitioning for one or more memory partitionings that described data storage requirement is distributed, set up storage piecemeal first-in-chain(FIC) tail pointer table for described storage piecemeal chain, writing down the head and the tail pointer information of described storage piecemeal chain in the table.
4, the implementation method of the dynamic shared storage memory space of stating according to claim 1,2 or 3 is characterized in that described step B also comprises:
When the storage piecemeal chain that distributes for described data storage requirement can't satisfy data storage requirement, then continue as described data storage requirement and distribute new memory partitioning, new memory partitioning string is to the last-of-chain of existing storage piecemeal chain, and modification storage piecemeal first-in-chain(FIC) tail pointer table information.
According to the implementation method of claim 1,2 or 3 described dynamic shared storage memory spaces, it is characterized in that 5, described step C comprises:
When described data storage requirement needed data quantity stored to reduce or no longer needs to carry out the storage of data, the part or all of piecemeal in the then described storage piecemeal chain determined to need not to store data.
According to the implementation method of claim 1,2 or 3 described dynamic shared storage memory spaces, it is characterized in that 6, described step C also comprises:
With the memory partitioning string that the discharges last-of-chain to idle memory partitioning chain, and last-of-chain mark that should the free time piecemeal in the idle memory partitioning chain corresponding address information is set to effectively, and it is invalid that the last-of-chain mark of former last-of-chain free time piecemeal is set to.
According to the implementation method of claim 1,2 or 3 described dynamic shared storage memory spaces, it is characterized in that 7, this method also comprises:
According to the size of data storage requirement, distribute corresponding storage piecemeal chain for each service channel in the communication system in advance.
According to the implementation method of claim 1,2 or 3 described dynamic shared storage memory spaces, it is characterized in that 8, this method also comprises:
When needs from described storage piecemeal chain during reading of data, then need from the head and the tail pointer gauge of this storage piecemeal chain correspondence, to obtain the pointer information of its first-in-chain(FIC) piecemeal, obtain its address information, and read data in each memory partitioning according to described address information.
According to the implementation method of claim 1,2 or 3 described dynamic shared storage memory spaces, it is characterized in that 9, described data storage requirement comprises:
The data storage requirement of service channel that has been configured in the chip of communication equipment and the service channel that increases newly.
10, the implementation method of dynamic shared storage memory space according to claim 9 is characterized in that, the described memory partitioning corresponding address of steps A pointer information can be stored in the chip or external memory storage in.
11, the implementation method of dynamic shared storage memory space according to claim 9 is characterized in that, when the data of service channel need be divided the priority storage, this method comprised:
D, determine the priority level of each service channel data message to be stored, and distribute corresponding storage piecemeal chain to carry out the storage of data respectively for the identical message of rank;
E, when reading of data, successively corresponding storage piecemeal chain carried out read data operation by high priority to low priority according to the priority level of storage piecemeal chain stored messages.
12, the implementation method of dynamic shared storage memory space according to claim 11 is characterized in that:
Described step D also comprises:
For described storage piecemeal chain is provided with the corresponding priority level sign;
And described step e also comprises:
When reading of data, read data in each storage piecemeal chain successively according to described priority tag.
13, the implementation method of dynamic shared storage memory space according to claim 9 is characterized in that, when the data of service channel need be divided the priority storage, this method comprised:
F, determine the priority level of data message to be stored, and with described data message according to the priority level sequential storage in the storage piecemeal chain of this service channel correspondence;
G, when carrying out data read, obtain the first address information of the memory partitioning of storage high priority other message, and reading of data from storage piecemeal chain successively.
14, the implementation method of dynamic shared storage memory space according to claim 13 is characterized in that, described step F further comprises:
Set up priority data memory partitioning chain, be respectively arranged with priority tag in each first address pointer entries of the memory partitioning correspondence in the chain, storage piecemeal first-in-chain(FIC) tail pointer is set points to this chain.
15, the implementation method of dynamic shared storage memory space according to claim 14 is characterized in that, described step F further comprises:
For data message to be stored distributes idle memory partitioning from the memory partitioning chain;
Search each memory partitioning corresponding priorities sign in the described priority data memory partitioning chain, and according to the priority of data message to be stored and the definite position of memory partitioning in priority data memory partitioning chain of storing this message of priority tag that finds;
Described memory partitioning is sealed on the position of determining in the priority data memory partitioning chain.
16, the implementation method of dynamic shared storage memory space according to claim 13 is characterized in that, described step F also comprises:
When system initialization, be provided with the priority level territory that is used for the loading priority sign in each first address pointer entries of a memory partitioning chain that will conspire to create, and all initialization is set to lowest priority by all memory partitionings;
When needs storage data, be the memory partitioning of this data allocations free time from the memory partitioning chain, and it sealed in the priority data memory partitioning chain by revising the corresponding first address pointer entries of described memory partitioning content.
17, the implementation method of dynamic shared storage memory space according to claim 16 is characterized in that, the message that is stored in same memory partitioning in the described priority data memory partitioning chain all should belong to same priority level.
CNB2005100665824A 2005-04-28 2005-04-28 Method for dynamically sharing space of memory Expired - Fee Related CN100466602C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2005100665824A CN100466602C (en) 2005-04-28 2005-04-28 Method for dynamically sharing space of memory

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2005100665824A CN100466602C (en) 2005-04-28 2005-04-28 Method for dynamically sharing space of memory

Publications (2)

Publication Number Publication Date
CN1855881A true CN1855881A (en) 2006-11-01
CN100466602C CN100466602C (en) 2009-03-04

Family

ID=37195730

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2005100665824A Expired - Fee Related CN100466602C (en) 2005-04-28 2005-04-28 Method for dynamically sharing space of memory

Country Status (1)

Country Link
CN (1) CN100466602C (en)

Cited By (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102541506A (en) * 2010-12-29 2012-07-04 深圳市恒扬科技有限公司 First-in-first-out (FIFO) data register, chip and equipment
CN102591789A (en) * 2011-12-26 2012-07-18 成都市华为赛门铁克科技有限公司 Storage space recovery method and storage space recovery device
CN102694784A (en) * 2011-03-25 2012-09-26 北京网鼎芯睿科技有限公司 Optimized server IP data sending method and apparatus thereof
CN102710981A (en) * 2012-05-08 2012-10-03 深圳市九洲电器有限公司 Set top box-based method and device for receiving and processing data
CN102999581A (en) * 2012-11-14 2013-03-27 北京北纬点易信息技术有限公司 Large-user-amount data access and real-time ordering system applied to service
CN103164490A (en) * 2011-12-19 2013-06-19 北京新媒传信科技有限公司 Method and device for achieving high-efficient storage of data with non-fixed lengths
WO2013155673A1 (en) * 2012-04-17 2013-10-24 中兴通讯股份有限公司 Management method and apparatus for on-chip shared cache
CN103455442A (en) * 2013-08-30 2013-12-18 华为技术有限公司 Multi-channel first-in first-out buffer queue controller and access method
CN103902463A (en) * 2012-12-31 2014-07-02 杨威锋 High-speed physical address assignment technology of memory device based on flash memories
CN104934067A (en) * 2014-03-21 2015-09-23 三星电子株式会社 Nonvolatile Memory Device And Storage Device Having The Same And Operation Method Thereof
CN105138278A (en) * 2015-07-27 2015-12-09 云南电力调度控制中心 Method for storing network messages of intelligent substation in bare disk
CN106339431A (en) * 2016-08-18 2017-01-18 佛山智能装备技术研究院 Processing method and system for robot program files based on text blocks
CN106649136A (en) * 2015-11-03 2017-05-10 西安中兴新软件有限责任公司 Data storage method and storage device
CN107977273A (en) * 2016-10-25 2018-05-01 郑州云海信息技术有限公司 The Memory Optimize Method of node information collection memory sharing in a kind of cabinet
CN108496382A (en) * 2016-01-05 2018-09-04 科因普拉格株式会社 Security information transmitting system and method for personal identification
CN109189793A (en) * 2018-09-13 2019-01-11 杭州晨晓科技股份有限公司 A kind of storage of linked list method and device of business datum
CN109302353A (en) * 2017-07-24 2019-02-01 深圳市中兴微电子技术有限公司 A kind of method and device of assignment message spatial cache
CN110011924A (en) * 2018-01-04 2019-07-12 深圳市中兴微电子技术有限公司 A kind of method and apparatus for removing cache congestion
CN110489085A (en) * 2019-02-21 2019-11-22 贵州广思信息网络有限公司 A kind of method of WORD content control extension storage data
CN110502450A (en) * 2019-02-21 2019-11-26 贵州广思信息网络有限公司 Storage manager in a kind of WORD
CN110806986A (en) * 2019-11-04 2020-02-18 盛科网络（苏州）有限公司 Method, equipment and storage medium for improving message storage efficiency of network chip
WO2020051839A1 (en) * 2018-09-13 2020-03-19 Micron Technology, Inc. Class-based dynamic memory slot allocation
CN110968270A (en) * 2019-11-22 2020-04-07 中山优感科技有限公司 Efficient storage method and device for Flash space
CN111181874A (en) * 2018-11-09 2020-05-19 深圳市中兴微电子技术有限公司 Message processing method, device and storage medium
CN111352723A (en) * 2018-12-21 2020-06-30 创发信息科技（苏州）有限公司 Method for dynamic allocation of cross-process shared memory
CN113821191A (en) * 2021-10-13 2021-12-21 芯河半导体科技(无锡)有限公司 Device and method capable of configuring FIFO depth
CN113904997A (en) * 2021-10-21 2022-01-07 烽火通信科技股份有限公司 Method and device for caching and scheduling multi-priority service at receiving end of switching chip
CN113986131A (en) * 2021-10-27 2022-01-28 致真存储(北京)科技有限公司 MCU of double MRAM and method for caching data
CN115190089A (en) * 2022-05-26 2022-10-14 中科驭数（北京）科技有限公司 Message storage method, device, equipment and storage medium

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020062303A1 (en) * 2000-10-31 2002-05-23 Kabushiki Kaisha Toshiba Data management method and storage medium storing data management program
CN1183453C (en) * 2001-12-21 2005-01-05 上海贝尔有限公司 Internal storage management system and its distribution method
CN100490383C (en) * 2003-09-29 2009-05-20 中国人民解放军理工大学通信工程学院 A high-speed Crossbar scheduling method for supporting multipriority

Cited By (51)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102541506B (en) * 2010-12-29 2014-02-26 深圳市恒扬科技有限公司 First-in-first-out (FIFO) data register, chip and equipment
CN102541506A (en) * 2010-12-29 2012-07-04 深圳市恒扬科技有限公司 First-in-first-out (FIFO) data register, chip and equipment
CN102694784A (en) * 2011-03-25 2012-09-26 北京网鼎芯睿科技有限公司 Optimized server IP data sending method and apparatus thereof
CN103164490B (en) * 2011-12-19 2016-02-17 北京新媒传信科技有限公司 A kind of efficient storage implementation method of not fixed-length data and device
CN103164490A (en) * 2011-12-19 2013-06-19 北京新媒传信科技有限公司 Method and device for achieving high-efficient storage of data with non-fixed lengths
CN102591789A (en) * 2011-12-26 2012-07-18 成都市华为赛门铁克科技有限公司 Storage space recovery method and storage space recovery device
CN102591789B (en) * 2011-12-26 2014-11-05 华为数字技术（成都）有限公司 Storage space recovery method and storage space recovery device
EP2840502A4 (en) * 2012-04-17 2015-06-03 Zte Corp Management method and apparatus for on-chip shared cache
WO2013155673A1 (en) * 2012-04-17 2013-10-24 中兴通讯股份有限公司 Management method and apparatus for on-chip shared cache
CN104246723A (en) * 2012-04-17 2014-12-24 中兴通讯股份有限公司 Management method and apparatus for on-chip shared cache
CN104246723B (en) * 2012-04-17 2018-08-10 深圳市中兴微电子技术有限公司 The management method and device of shared buffer memory in piece
CN102710981A (en) * 2012-05-08 2012-10-03 深圳市九洲电器有限公司 Set top box-based method and device for receiving and processing data
CN102999581A (en) * 2012-11-14 2013-03-27 北京北纬点易信息技术有限公司 Large-user-amount data access and real-time ordering system applied to service
CN102999581B (en) * 2012-11-14 2016-05-11 北京北纬点易信息技术有限公司 Measure data access and real-time ordering system for business large user
CN103902463A (en) * 2012-12-31 2014-07-02 杨威锋 High-speed physical address assignment technology of memory device based on flash memories
CN103455442B (en) * 2013-08-30 2016-06-08 华为技术有限公司 Hyperchannel first outer buffer queue controller and access method
CN103455442A (en) * 2013-08-30 2013-12-18 华为技术有限公司 Multi-channel first-in first-out buffer queue controller and access method
CN104934067B (en) * 2014-03-21 2019-11-01 三星电子株式会社 Non-volatile memory device and storage device and its operating method
CN104934067A (en) * 2014-03-21 2015-09-23 三星电子株式会社 Nonvolatile Memory Device And Storage Device Having The Same And Operation Method Thereof
CN105138278B (en) * 2015-07-27 2018-05-25 云南电力调度控制中心 A kind of the naked of intelligent substation network message takes inventory method for storing
CN105138278A (en) * 2015-07-27 2015-12-09 云南电力调度控制中心 Method for storing network messages of intelligent substation in bare disk
CN106649136A (en) * 2015-11-03 2017-05-10 西安中兴新软件有限责任公司 Data storage method and storage device
CN106649136B (en) * 2015-11-03 2022-09-23 西安中兴新软件有限责任公司 Data storage method and storage device
CN108496382A (en) * 2016-01-05 2018-09-04 科因普拉格株式会社 Security information transmitting system and method for personal identification
CN108496382B (en) * 2016-01-05 2021-10-01 科因普拉格株式会社 Secure information transmission system and method for personal identity authentication
CN106339431A (en) * 2016-08-18 2017-01-18 佛山智能装备技术研究院 Processing method and system for robot program files based on text blocks
CN107977273A (en) * 2016-10-25 2018-05-01 郑州云海信息技术有限公司 The Memory Optimize Method of node information collection memory sharing in a kind of cabinet
CN109302353A (en) * 2017-07-24 2019-02-01 深圳市中兴微电子技术有限公司 A kind of method and device of assignment message spatial cache
CN109302353B (en) * 2017-07-24 2022-03-25 深圳市中兴微电子技术有限公司 Method and device for distributing message cache space
CN110011924B (en) * 2018-01-04 2023-03-10 深圳市中兴微电子技术有限公司 Method and device for clearing cache congestion
CN110011924A (en) * 2018-01-04 2019-07-12 深圳市中兴微电子技术有限公司 A kind of method and apparatus for removing cache congestion
CN112889036A (en) * 2018-09-13 2021-06-01 美光科技公司 Category-based dynamic memory slot allocation
CN112889036B (en) * 2018-09-13 2024-01-02 美光科技公司 Class-based dynamic memory slot allocation
WO2020051839A1 (en) * 2018-09-13 2020-03-19 Micron Technology, Inc. Class-based dynamic memory slot allocation
CN109189793A (en) * 2018-09-13 2019-01-11 杭州晨晓科技股份有限公司 A kind of storage of linked list method and device of business datum
US11409562B2 (en) 2018-09-13 2022-08-09 Micron Technology, Inc. Class-based dynamic memory slot allocation
CN111181874A (en) * 2018-11-09 2020-05-19 深圳市中兴微电子技术有限公司 Message processing method, device and storage medium
CN111181874B (en) * 2018-11-09 2023-10-10 深圳市中兴微电子技术有限公司 Message processing method, device and storage medium
CN111352723A (en) * 2018-12-21 2020-06-30 创发信息科技（苏州）有限公司 Method for dynamic allocation of cross-process shared memory
CN110502450A (en) * 2019-02-21 2019-11-26 贵州广思信息网络有限公司 Storage manager in a kind of WORD
CN110489085A (en) * 2019-02-21 2019-11-22 贵州广思信息网络有限公司 A kind of method of WORD content control extension storage data
CN110806986A (en) * 2019-11-04 2020-02-18 盛科网络（苏州）有限公司 Method, equipment and storage medium for improving message storage efficiency of network chip
CN110806986B (en) * 2019-11-04 2022-02-15 苏州盛科通信股份有限公司 Method, equipment and storage medium for improving message storage efficiency of network chip
WO2021088466A1 (en) * 2019-11-04 2021-05-14 盛科网络（苏州）有限公司 Method for improving message storage efficiency of network chip, device, and storage medium
CN110968270A (en) * 2019-11-22 2020-04-07 中山优感科技有限公司 Efficient storage method and device for Flash space
CN113821191A (en) * 2021-10-13 2021-12-21 芯河半导体科技(无锡)有限公司 Device and method capable of configuring FIFO depth
CN113904997A (en) * 2021-10-21 2022-01-07 烽火通信科技股份有限公司 Method and device for caching and scheduling multi-priority service at receiving end of switching chip
CN113904997B (en) * 2021-10-21 2024-02-23 烽火通信科技股份有限公司 Method and device for caching and scheduling multi-priority service of receiving end of switching chip
CN113986131A (en) * 2021-10-27 2022-01-28 致真存储(北京)科技有限公司 MCU of double MRAM and method for caching data
CN115190089A (en) * 2022-05-26 2022-10-14 中科驭数（北京）科技有限公司 Message storage method, device, equipment and storage medium
CN115190089B (en) * 2022-05-26 2024-03-22 中科驭数（北京）科技有限公司 Message storage method, device, equipment and storage medium

Also Published As

Publication number Publication date
CN100466602C (en) 2009-03-04

Similar Documents

Publication Publication Date Title
CN1855881A (en) Method for dynamically sharing space of memory
CN1085863C (en) Memory management system of computer system
CN1154928C (en) Resource management method and apparatus for information processing system of multitasking facility
CN1205549C (en) Method and device of memory distribution for multi-line range virtual machine
CN1043942C (en) Improved allocation of paging capacity in cellular applications
CN1129848C (en) Method for performing continuous over-write of file in nonvolatile memory
CN1606097A (en) Flash memory control apparatus, memory management method, and memory chip
CN101042696A (en) Smart card storage system and managing method for file creation in the system
CN1099678C (en) Nonvolatile semiconductor disk device
CN1664790A (en) Method and apparatus for increasing data storage capacity
CN101055589A (en) Embedded database storage management method
CN1648876A (en) Data management apparatus and method of flash memory
CN1701307A (en) Method and apparatus for managing an erase count block
CN1701308A (en) Maintaining erase counts in non-volatile storage systems
CN1147648A (en) Data storage apparatus and it storage method
CN101034372A (en) Nonvolatile memory system and management method for nonvolatile memory
CN1819544A (en) Buffer management based on bitmap list
CN1679005A (en) Dynamic memory management
CN1358363A (en) Apapratus and method for assigning supplemental channel in mobile communication system
CN1717661A (en) Data recording apparatus
CN1538456A (en) Flash memory access apparatus and method
CN101076181A (en) Method for selecting access frequency point N frequency-point domain in TD-SCDMA system
CN103425435A (en) Disk storage method and disk storage system
CN1658194A (en) File system control apparatus and file system control method
CN1581732A (en) Communication method in radio honeycomb communication system

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20090304