WO2000070821A3 - Packet classification state machine - Google Patents

Packet classification state machine Download PDF

Info

Publication number
WO2000070821A3
WO2000070821A3 PCT/CA2000/000580 CA0000580W WO0070821A3 WO 2000070821 A3 WO2000070821 A3 WO 2000070821A3 CA 0000580 W CA0000580 W CA 0000580W WO 0070821 A3 WO0070821 A3 WO 0070821A3
Authority
WO
WIPO (PCT)
Prior art keywords
state machine
stored
new
data
classification
Prior art date
Application number
PCT/CA2000/000580
Other languages
French (fr)
Other versions
WO2000070821A2 (en
Inventor
Feliks J Welfeld
Original Assignee
Solidum Systems Corp
Feliks J Welfeld
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US09/313,183 external-priority patent/US6424934B2/en
Priority claimed from US09/313,182 external-priority patent/US6349405B1/en
Application filed by Solidum Systems Corp, Feliks J Welfeld filed Critical Solidum Systems Corp
Priority to IL14653900A priority Critical patent/IL146539A0/en
Priority to JP2000619158A priority patent/JP2003500709A/en
Priority to EP00929186A priority patent/EP1190314A2/en
Priority to AU47395/00A priority patent/AU4739500A/en
Publication of WO2000070821A2 publication Critical patent/WO2000070821A2/en
Publication of WO2000070821A3 publication Critical patent/WO2000070821A3/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/60—Software deployment
    • G06F8/65—Updates
    • G06F8/656—Updates while running
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/448—Execution paradigms, e.g. implementations of programming paradigms
    • G06F9/4498—Finite state machines

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Debugging And Monitoring (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

A method of reprogramming classification data in a packet classification state machine without interrupting the operation of the state machine is disclosed. Data relating to a plurality of new nodes from a starting node of the classification tree within a classification tree are stored such that they accurately indicate subsequent nodes within the existing data structure. Once the data is stored, a new first node address is stored in a predetermined location. Thereby causing subsequent state machine executions to begin at a new node. Preferably, the new first node address is stored using an atomic operation such that no reading of the first node address is possible during the store operation. The method allows a plurality of state machines to simultaneously use a same classification data memory because the method does not involve overwriting existing data.
PCT/CA2000/000580 1999-05-18 2000-05-17 Packet classification state machine WO2000070821A2 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
IL14653900A IL146539A0 (en) 1999-05-18 2000-05-17 Packet classification state machine
JP2000619158A JP2003500709A (en) 1999-05-18 2000-05-17 Packet classification state machine
EP00929186A EP1190314A2 (en) 1999-05-18 2000-05-17 Packet classification state machine
AU47395/00A AU4739500A (en) 1999-05-18 2000-05-17 Packet classification state machine

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
US09/313,182 1999-05-18
US09/313,183 1999-05-18
US09/313,183 US6424934B2 (en) 1998-05-18 1999-05-18 Packet classification state machine having reduced memory storage requirements
US09/313,182 US6349405B1 (en) 1999-05-18 1999-05-18 Packet classification state machine
US45946099A 1999-12-13 1999-12-13
US09/459,460 1999-12-13

Publications (2)

Publication Number Publication Date
WO2000070821A2 WO2000070821A2 (en) 2000-11-23
WO2000070821A3 true WO2000070821A3 (en) 2001-10-25

Family

ID=27405653

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CA2000/000580 WO2000070821A2 (en) 1999-05-18 2000-05-17 Packet classification state machine

Country Status (5)

Country Link
EP (1) EP1190314A2 (en)
JP (1) JP2003500709A (en)
AU (1) AU4739500A (en)
IL (1) IL146539A0 (en)
WO (1) WO2000070821A2 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7802245B2 (en) * 2006-04-27 2010-09-21 Agere Systems Inc. Methods and apparatus for performing in-service upgrade of software in network processor
KR101448550B1 (en) 2012-11-21 2014-10-13 서울대학교산학협력단 Apparatus and Method for Traffic Classificaiton

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS59188702A (en) * 1983-03-04 1984-10-26 Mazda Motor Corp Programmable controller
EP0228053A2 (en) * 1985-12-23 1987-07-08 AT&T Corp. Control of real-time systems utilizing a nonprocedural language
EP0266505A2 (en) * 1986-09-11 1988-05-11 International Business Machines Corporation Versioning of message formats in a 24-hour operating environment
US5375248A (en) * 1990-10-05 1994-12-20 Bull Hn Information Systems Inc. Method for organizing state machine by selectively grouping status signals as inputs and classifying commands to be executed into performance sensitive and nonsensitive categories
US5826030A (en) * 1995-11-30 1998-10-20 Excel Switching Corporation Telecommunication switch having a universal API with a single call processing message including user-definable data and response message each having a generic format

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS59188702A (en) * 1983-03-04 1984-10-26 Mazda Motor Corp Programmable controller
EP0228053A2 (en) * 1985-12-23 1987-07-08 AT&T Corp. Control of real-time systems utilizing a nonprocedural language
EP0266505A2 (en) * 1986-09-11 1988-05-11 International Business Machines Corporation Versioning of message formats in a 24-hour operating environment
US5375248A (en) * 1990-10-05 1994-12-20 Bull Hn Information Systems Inc. Method for organizing state machine by selectively grouping status signals as inputs and classifying commands to be executed into performance sensitive and nonsensitive categories
US5826030A (en) * 1995-11-30 1998-10-20 Excel Switching Corporation Telecommunication switch having a universal API with a single call processing message including user-definable data and response message each having a generic format

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
"TABLE UPDATE SERIALIZATION TECHNIQUE", IBM TECHNICAL DISCLOSURE BULLETIN, vol. 21, no. 3, August 1978 (1978-08-01), New York, US, pages 1158 - 1162, XP002154926, Retrieved from the Internet <URL:http://www.delphion.com/tdbs/tdb?&order=78A+04946> [retrieved on 20001204] *
ASHAR P., DEVADAS S., NEWTON A. R.: "OPTIMUM AND HEURISTIC ALGORITHMS FOR FINITE STATE MACHINE DECOMPOSITION AND PARTITIONING", INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, US, LOS ALAMITOS, IEEE COMPUTER SOCIETY PRESS, vol. CONF. 7, 5 November 1989 (1989-11-05), pages 216 - 219, XP000164239, ISBN: 0-8186-1986-4 *
DEVADAS S., NEWTON A. R.: "DECOMPOSITION AND FACTORIZATION OF SEQUENTIAL FINITE STATE MACHINES", INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, US, WASHINGTON, IEEE COMPUTER SOCIETY PRESS, vol. CONF. 6, 7 November 1988 (1988-11-07), pages 148 - 151, XP000040350 *
LAM K., DEVADAS S.: "PERFORMANCE-ORIENTED DECOMPOSITION OF SEQUENTIAL CIRCUITS", PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, US, NEW YORK, IEEE, vol. CONF. 23, 1 May 1990 (1990-05-01), pages 2642 - 2645, XP000164086 *
PATENT ABSTRACTS OF JAPAN vol. 009, no. 050 (P - 339) 5 March 1985 (1985-03-05) *
VILLA T., SANGIOVANNI-VINCENTELLI A.: "NOVA: STATE ASSIGNMENT OF FINITE STATE MACHINES FOR OPTIMAL TWO- LEVEL LOGIC IMPLEMENTATION", IEEE TRANSACTIONS ON COMPUTER AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, US, IEEE INC., NEW YORK, vol. 9, no. 9, September 1990 (1990-09-01), pages 905 - 924, XP000159299, ISSN: 0278-0070 *

Also Published As

Publication number Publication date
WO2000070821A2 (en) 2000-11-23
JP2003500709A (en) 2003-01-07
IL146539A0 (en) 2002-07-25
EP1190314A2 (en) 2002-03-27
AU4739500A (en) 2000-12-05

Similar Documents

Publication Publication Date Title
EP1014648A3 (en) Method and network device for creating buffer structures in shared memory
GB2323747B (en) Data sending apparatus having an alternative forwarding function,data sending method and memory medium for storing a data sending program
JP2001266580A (en) Semiconductor memory
WO2004061684A3 (en) Using direct memory access for performing database operations between two or more machines
CA2569820A1 (en) A method for portable plc configurations
HK1032125A1 (en) Chip card comprising means for managing a virtual memory, associated communication method.
CN104965676B (en) A kind of access method of random access memory, device and control chip
TW430807B (en) Nested loop method of identifying synchronous memories
EP1067749A3 (en) Memory system for portable telephone
NO982517L (en) Method for space-time integration / processing of a plurality of videos as well as system for performing the same, and storage medium for storing a program of the method
CN109358908A (en) A kind of method, apparatus and storage medium of the SPD information obtaining memory bar
HK1054092A1 (en) Method and apparatus for xml data storage, query rewrites, visualization, mapping and references
WO2000070821A3 (en) Packet classification state machine
WO2003021883A1 (en) Network connection apparatus, connection system, and network connection method
CN104636151B (en) Fpga chip configuration structure and collocation method based on application memory
WO2002023942A3 (en) Method and apparatus for generating massive interrupts in random access memory (ram)
ATE269578T1 (en) METHOD FOR STORING A LOT OF DATA IN A TARGET STORAGE AREA AND STORAGE SYSTEM
CA2371029A1 (en) Data storage and retrieval
US20010007559A1 (en) Interleaved processing system for processing frames within a network router
KR970051327A (en) Nonvolatile memory having attribute data area and data storage area for storing attribute data of data storage area
NO994890D0 (en) Procedure and apparatus for storing data using a terminal
DE60100932D1 (en) A memory management device, method, program and computer readable storage medium for storing the memory management program
EP1017059B1 (en) Method for reading a memory, particularly a non-volatile memory
CN101520765B (en) Method and device for determining time sequence parameter of input/output bus
CN100390761C (en) Control apparatus

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
AK Designated states

Kind code of ref document: A3

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): GH GM KE LS MW SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

ENP Entry into the national phase

Ref country code: JP

Ref document number: 2000 619158

Kind code of ref document: A

Format of ref document f/p: F

WWE Wipo information: entry into national phase

Ref document number: 2000929186

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWP Wipo information: published in national office

Ref document number: 2000929186

Country of ref document: EP

WWW Wipo information: withdrawn in national office

Ref document number: 2000929186

Country of ref document: EP