1 / 22

An innovative low-cost Classification Scheme for combined multi-Gigabit IP and Ethernet Networks

An innovative low-cost Classification Scheme for combined multi-Gigabit IP and Ethernet Networks. Authors ： Ioannis Papaefstathiou , and Vassilis Papaefstathiou . Publisher ： IEEE ICC 2006 Present ： Yu-Tso Chen Date ： October, 15, 2008.

izzy
Download Presentation

An innovative low-cost Classification Scheme for combined multi-Gigabit IP and Ethernet Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An innovative low-cost Classification Scheme for combined multi-Gigabit IP and Ethernet Networks Authors：Ioannis Papaefstathiou, and Vassilis Papaefstathiou . Publisher：IEEE ICC 2006 Present：Yu-Tso Chen Date：October, 15, 2008 Department of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C.

  2. Outline • 1. Introduction • 2. DLCE • 3. • 4. Performance Analysis

  3. Introduction • Double Layer Classification Engine (DLCE) • Uses a new hashing scheme and internal replacement of MAC Vendor IDs at the Ethernet layer • Same hashing scheme together with an innovative trie-based engine for the IP classificaton

  4. Double Layer Classification Engine • Every rule in the ruleset is associated to a number called FlowID • 15-bit FlowIDs, translating to 32K unique and independent network flows

  5. Original MAC Address Hashing • Hval = MAC[31:0] • MAC_TBL – Hold the FlowID of the associated rule. MAC_TBLindex

  6. MAC_TBL entries format and memory organization

  7. MAC Vendor Replacement • 24-bit vendor address space of the MAC addresses • Fewer than 8000 vendors are active instead of the 224 possible • Each MAC-address rule handled by our system is 37-bits(13+24bit) long • address space can be handled by a 24-to-13 decoder

  8. Vendor Replacement MAC Address Hashing 21 Bit

  9. IP Layer Classification • Uses strides and multi-bit trie nodes in order to traverse several bits at a time and produce fast lookups. • Its nodes are represented with bitmaps that can be processed fast in hardware and require small storage.

  10. Bitmaps • PrefixNO = PrefixValue + 2PrefixLength – 1 • TrieBMP – Efficiently the information about the subtries • PrefixBMP – The information about the active prefixes belonging to subtrie

  11. SubtrieNO = PrefixValue[0:3] + 1

  12. Bit position of the actual prefix in a specific subtrie PrefixValue 2PrefixLength – 1

  13. Trie data structure example

  14. Inside the two subtries the candidate prefixes are four Priority High

  15. DLCE Table • The interval 0-7 we have a single entry for root called TBL0 • Interval 8-15 we have 28 possible roots (TBL8) • Interval 16-23 we use a 216=65536 table called TBL16

  16. DLCE Table (cont.) • Interval 24-31 use 216 entries in table TBL24 (indexing by hashing the first 24-bits) • 32 bit prefixes we use only 212 entries in table TBL32

  17. Sequence of lookups • TBL16 → TBL24 → TBL32 → TBL8 → TBL0 • If after TBL32 a match was produced then our lookup process does not proceed to the next tables.

  18. Performance

  19. MAC Address Hashing • MAC_TBL – Hold the FlowID of the associated rule. • EXACT_TBL – The number of entries in each variable size block. (Defined by the number of rules that collide within a specific entry)

More Related