Pi-truncated Functions and Rough Sets in the Classification of Internet Protocols
Blekinge Institute of Technology, School of Engineering, Department of Mathematics and Natural Sciences2005 (English)Conference paper (Refereed) Published
The studies of Internet Protocol data give rise to the creation of polygons consisting of finite numbers of points tied together. Since the polygons are not formalized by some mathematical expressions, we suggest creating continuous functions, which approximate them thoroughly in spite of their irregular shapes. To warrant a high accuracy of approximating, otherwise impossible to obtain when using standard curves, we test a continuous function, which is composed of joined truncated pi-class functions with seven parameters. By operating with the functions representing polygons having unusual shapes, we attempt a classification of Internet traffic data, based on datagram sizes. We adopt rough sets to assign the members to an investigated Internet class even if their origin sometimes is unknown.
Place, publisher, year, edition, pages
Beijing, China: Tsinghua University Press - Springer , 2005.
truncated pi-functions, polygon approximation, indiscernibility relation, rough sets in IP traffic characterization
Mathematics Telecommunications Computer Science
IdentifiersURN: urn:nbn:se:bth-9913Local ID: oai:bth.se:forskinfo706EBA0419C7295AC125705B004BF88CISBN: 7-302-11377-7OAI: oai:DiVA.org:bth-9913DiVA: diva2:837896
Eleventh International Fuzzy Systems Association World Congress - IFSA 2005