• Title/Summary/Keyword: AQT

Search Result 5, Processing Time 0.016 seconds

A Packet Classification Algorithm Using Bloom Filter Pre-Searching on Area-based Quad-Trie (영역 분할 사분 트라이에 블룸 필터 선 검색을 사용한 패킷 분류 알고리즘)

  • Byun, Hayoung;Lim, Hyesook
    • Journal of KIISE
    • /
    • v.42 no.8
    • /
    • pp.961-971
    • /
    • 2015
  • As a representative area-decomposed algorithm, an area-based quad-trie (AQT) has an issue of search performance. The search procedure must continue to follow the path to its end, due to the possibility of the higher priority-matching rule, even though a matching rule is encountered in a node. A leaf-pushing AQT improves the search performance of the AQT by making a single rule node exist in each search path. This paper proposes a new algorithm to further improve the search performance of the leaf-pushing AQT. The proposed algorithm implements a leaf-pushing AQT using a hash table and an on-chip Bloom filter. In the proposed algorithm, by sequentially querying the Bloom filter, the level of the rule node in the leaf-pushing AQT is identified first. After this procedure, the rule database, which is usually stored in an off-chip memory, is accessed. Simulation results show that packet classification can be performed through a single hash table access using a reasonable sized Bloom filter. The proposed algorithm is compared with existing algorithms in terms of the memory requirement and the search performance.

Two-dimensional Binary Search Tree for Packet Classification at Internet Routers (인터넷 라우터에서의 패킷 분류를 위한 2차원 이진 검색 트리)

  • Lee, Goeun;Lim, Hyesook
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.6
    • /
    • pp.21-31
    • /
    • 2015
  • The Internet users want to get real-time services for various multi-media applications. Network traffic rate has been rapidly increased, and data amounts that the Internet has to carry have been exponentially increased. A packet is the basic unit in transferring data at the Internet, and packet classification is one of the most challenging functionalities that routers should perform at wire-speed. Among various known packet classification algorithms, area-based quad-trie (AQT) algorithm is one of the efficient algorithms which can lookup five header fields simultaneously. As a representative space decomposition algorithm, the AQT requires a small amount of memory in storing classification rules, but it does not provide high-speed classification performance. In this paper, we propose a new packet classification algorithm by applying a binary search for the codewords of the AQT to overcome the issue of the AQT. Throughout simulation, it is shown that the proposed algorithm provides a better performance than the AQT in the number of rule comparisons with each input packet.

2-Dimensional Bitmap Tries for Fast Packet Classification (고속 패킷 분류를 위한 2차원 비트맵 트라이)

  • Seo, Ji-hee;Lim, Hye-sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1754-1766
    • /
    • 2015
  • Packet classification carried out in Internet routers is one of the challenging tasks, because it has to be performed at wire-speed using five header fields at the same time. In this paper, we propose a leaf-pushed AQT bitmap trie. The proposed architecture applies the leaf-pushing to an area-based quad-trie (AQT) to reduce unnecessary off-chip memory accesses. The proposed architecture also applies a bitmap trie, which is a kind of multi-bit tries, to improve search performance and scalability. For performance evaluation, simulations are conducted by using rule sets ACL, FW, and IPC, with the sizes of 1k, 5k, and 10k. Simulation results show that the number of off-chip memory accesses is less than one regardless of set types or set sizes. Additionally, since the proposed architecture applies a bitmap trie, the required number of on-chip memory accesses is the 50% of the leaf-pushed AQT trie. In addition, our proposed architecture shows good scalability in the required on-chip memory size, where the scalability is identified by the stable change in the required memory sizes, as the size of rule sets increases.

Poultry Meat Quality in Relation to Muscle Growth and Muscle Fiber Characteristics

  • Ismail, Ishamri;Joo, Seon-Tea
    • Food Science of Animal Resources
    • /
    • v.37 no.6
    • /
    • pp.873-883
    • /
    • 2017
  • Variations in the definition of poultry meat quality exist because the quality traits are not solely based on intrinsic and extrinsic factors but also consumers' preference. Appearance quality traits (AQT), eating quality traits (EQT), and reliance quality traits (RQT) are the major factors focused by the consumer before buying good quality of poultry meat. AQT and EQT of poultry meat are controlled by physical and biochemical characteristics of muscle fibers which can be categorized into a total number of fibers (TNF), cross-sectional area of fibers (CSAF), and fiber type composition (FTC). In poultry meat, it has been shown that muscle fiber properties play a key role in meat quality because numerous studies have reported the relationships between quality traits and fiber characteristics. Despite intensive research has been carried out to manipulate the muscle fiber to improve poultry meat quality, demand in a rapid growth of poultry muscle has correlated to the deterioration in the meat quality. The present paper reviews the definition of poultry meat quality, meat quality traits, and variations of meat quality. Also, this review presents recent knowledge underlying the relationship between poultry meat quality traits and muscle fiber characteristics.

KISS Korea Computer Congress 2006 (RFID시스템에서 향상된 쿼리 트리 기반 충돌 알고리즘)

  • Han Jae-Il;Seo Hyun-Gon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06d
    • /
    • pp.16-18
    • /
    • 2006
  • RFID는 RF신호를 이용하여 물체에 부착된 태그(tag)를 읽어 물체를 식별하는 비 접촉 인식 기술이다. RFID 리더의 식별영역에 여러 개의 태그가 있는 경우 이들 사이의 충돌(collision)이 발생되기 때문에 이들을 식별할 수 있는 메커니즘이 있어야 한다. 본 논문에서는 먼저 기존에 제안된 트리 기반 메모래스 충돌방지 알고리즘들을 살펴보고, 본 논문에서 제안하는 향상된 쿼리 기반 충돌 알고리즘(AQT : Advanced Query Tree based Collision Algorithm)을 소개한다.

  • PDF