Mosharaka for Research and Studies
Login/Sign Up
Main Menu
Papers Menu
Quick Links
Next Congress

All Forthcoming Congresses


All Forthcoming Conferences

320 days remaining to submit papers to MIC-Power 2024 in Istanbul, Turkey
Papers Links
  • Browse
  • Subjects
  • Years
  • CPE
  • GC-CPE 2013
  • 37.Cnf-505
Papers Published at GC-CPE 2013
All 7 Papers
IDAuthors and TitlePages
37.Cnf-505 Mrs. Besat Jafarian
Prof. Nasser Yazdani
Universal B-tree Based Packet Classification(UB-PC)
37.Cnf-512 Dr. Alia Zakriti
Dr. Naima Amar Touhami
Mr. Mohamed Lamsali
Dr. Mohamed Essaidi
Improvement of Band-Width Performance of Hairpin Band-Pass Filter Using Defected Ground Structures
37.Cnf-522 Mr. Pedro M. Figueiredo E Silva
Prof. José Sanguino
Ms. Teresa Ferreira
Prof. Antonio Rodrigues
Using Predicted Doppler Measurements for Positioning in Urban Environments
37.Cnf-523 Mr. Khaled Eshteiwi
Prof. Reza Soleymani
Performance Analysis of Amplify-and-Forward Cooperative Networks with Best Relay Selection
37.Cnf-533 Dr. Labib Daloub
Challenges of Smart Grid Transformation in Libya and North Africa Region Region
37.Cnf-537 Mr. Gunnar Wahlgren
Mr. Khalid Bencherifa
Dr. Stewart Kowalski
A Framework for selecting IT Security Risk Management Methods based on ISO27005
37.Cnf-542 Mr. Yuichi Kato
Prof. Takehiko Kobayashi
Dr. Tomoaki Toda
Dr. Atsushi Tomiki
Prof. Kenichi Kagoshima

Prototype of an X/Ka Dual-Band Primary Radiatop for Satellite-Borne Cassegrain Antennas
37.Cnf-505 Paper View Page
Title Universal B-tree Based Packet Classification(UB-PC)
Authors Mrs. Besat Jafarian, University of Tehran, Tehran, Iran
Prof. Nasser Yazdani, University of Tehran, Tehran, Iran
Abstract To provide new services such as packet filtering and quality of services in the next generation network, routers need to classify incoming packets. We propose a novel and scalable packet classification method that utilizes the Universal B-tree (UB-tree) data structure. UB-tree is an index structure for multi-dimensional data which is balanced and has guaranteed performance characteristics of B-tree. A filter set consists of a number of rules for classifying packets based on header fields. Thus, packet classification is also a multi-dimensional indexing problem, then, we can use UB-tree. Based on simulation results, we believe our method has a better performance in terms of speed of classification and memory requirement compared to the previous proposed methods.
Track NIS: Network and Information Security
Conference 6th Mosharaka International Conference on Communications, Propagation, and Electronics (MIC-CPE 2013)
Congress 2013 Global Congress on Communications, Propagation, and Electronics (GC-CPE 2013), 1-3 February 2013, Kenitra, Morocco
Pages 1-6
Topics Network Security and Privacy
Network Access Control
ISSN 2227-331X
BibTeX @inproceedings{505CPE2013,
title={Universal B-tree Based Packet Classification(UB-PC) },
author={Besat Jafarian, and Nasser Yazdani},
booktitle={2013 Global Congress on Communications, Propagation, and Electronics (GC-CPE 2013)},
organization={Mosharaka for Research and Studies} }
Paper Views 93 Paper Views Rank 304/525
Paper Downloads 68 Paper Downloads Rank 281/525
GC-CPE 2013 Visits: 3741||MIC-CPE 2013 Visits: 2519||NIS Track Visits: 643