Fitting Distribution Modeling and Traffic Policing on Real Live Metro-E Network Data

This paper presents a traffic characterization and statistical analysis of WAN Metro-E campus network internet traffic, addressing network congestion and delay issues.The increase in internet usage on campus can lead to various challenges, including traffic bursts that can impact the quality of service (QoS) experienced by users.The method involves traffic characterization and traffic policing on the Metro-E 50Mbps campus network using Python.The analysis will define the distribution model and policing the network of real-time internet traffic data where real live data at 50Mbps/6.5MBpresent burst traffic.The best-fitted model is the log-normal distribution model, which has the highest MLE score of -2726.Policing on inbound bytes before and after with a threshold of 50Mbps/6.5MBwas done and a total of 3422404.81MBbuckets were created and a total of 219273.88MBbuckets after policing with a reduced percentage at 99.36%.Comparing actual traffic under three different policing scenarios compared to P1 and P2, policing on P3 has the highest traffic filtering at 3197986.21MB and the largest number of bytes filled in the bucket with a reduced percentage to 90.66%.This research is significant for Wan Metro-E Network's future QoS bandwidth management control mechanisms and optimization of network traffic performance.

Authors

Publication Details

Journal
International Journal of Integrated Engineering
Published
2025-07-18
DOI
https://doi.org/10.30880/ijie.2025.17.02.010
Primary Topic
Network Security and Intrusion Detection
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fitting Distribution Modeling and Traffic Policing on Real Live Metro-E Network Data

Nor Paezah Abdullah, Sayang Mohd Deni, Murizah Kassim
International Journal of Integrated Engineering
Network Security and Intrusion Detection
article

Fitting Distribution Modeling and Traffic Policing on Real Live Metro-E Network Data

Nor Paezah Abdullah, Sayang Mohd Deni, Murizah Kassim
article en

Abstract

This paper presents a traffic characterization and statistical analysis of WAN Metro-E campus network internet traffic, addressing network congestion and delay issues.The increase in internet usage on campus can lead to various challenges, including traffic bursts that can impact the quality of service (QoS) experienced by users.The method involves traffic characterization and traffic policing on the Metro-E 50Mbps campus network using Python.The analysis will define the distribution model and policing the network of real-time internet traffic data where real live data at 50Mbps/6.5MBpresent burst traffic.The best-fitted model is the log-normal distribution model, which has the highest MLE score of -2726.Policing on inbound bytes before and after with a threshold of 50Mbps/6.5MBwas done and a total of 3422404.81MBbuckets were created and a total of 219273.88MBbuckets after policing with a reduced percentage at 99.36%.Comparing actual traffic under three different policing scenarios compared to P1 and P2, policing on P3 has the highest traffic filtering at 3197986.21MB and the largest number of bytes filled in the bucket with a reduced percentage to 90.66%.This research is significant for Wan Metro-E Network's future QoS bandwidth management control mechanisms and optimization of network traffic performance.

International Journal of Integrated EngineeringVol. 17(2)
Universiti Teknologi MARA
Openalex Percentile: Top 70%
Network Security and Intrusion Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.