DocumentCode :
773479
Title :
A programmable state machine architecture for packet processing
Author :
Lai, Wangyang ; Lea, Chin-Tau
Volume :
23
Issue :
4
fYear :
2003
Firstpage :
32
Lastpage :
42
Abstract :
The Internet is expanding rapidly and constantly adding new protocols and features. To shorten the design cycle, many companies have adopted a common hardware platform for a variety of products. In these products, specialized packet processors tailored for packet processing handle multiple protocols and feature changes. A packet processor usually incorporates multiple RISC engines that are configurable as several instances of parallel processors, working simultaneously or in a pipelined fashion. In either approach, packet processors are complex and expensive. Packet processing has many levels of programmability requirements. Some tasks require only mild programmability and can´t justify the use of a full-fledged packet processor. A finite scare machine (FSM), on the other hand, has high performance but cannot adapt to protocol changes. The solution is something in between: fast, programmable, but not as complicated as a packet processor. A programmable state machine (PSM) is such an idea.
Keywords :
computer architecture; finite state machines; Internet; architecture; packet processors; programmability; programmable state machine; Computer architecture; Decoding; Fabrics; Hazards; Logic; Physical layer; Protocols; Reduced instruction set computing; Switches; Table lookup;
fLanguage :
English
Journal_Title :
Micro, IEEE
Publisher :
ieee
ISSN :
0272-1732
Type :
jour
DOI :
10.1109/MM.2003.1225965
Filename :
1225965
Link To Document :
بازگشت