Loading...
Search for:
network-traffic
0.006 seconds
Total 49 records
Braess' phenomenon in the management of networks and dissociation of equilibrium concepts
, Article Transportation Planning and Technology ; Volume 27, Issue 6 , 2004 , Pages 469-482 ; 03081060 (ISSN) ; Poorzahedy, H ; Sharif University of Technology
2004
Abstract
Braess' phenomenon, also known as Braess' paradox, is a phenomenon that has received considerable attention in transportation engineering and planning, as well as in other fields. It has an important implication in the area of investment in transportation networks, namely that adding a new link in a network may increase the cost to the users of that network. In this paper we show this phenomenon in a new environment. Unlike traditional examples, which involve the physical addition of a link to a network (a 0/1 integer decision variable), an example is presented where the decision variable is continuous in nature. Moreover, this example conveys two new messages. First, it is shown that some...
Analyzing TOR Network Data Through Deep Learning
, M.Sc. Thesis Sharif University of Technology ; Jafari Siavoshani, Mahdi (Supervisor)
Abstract
Today, we live in an information age where all people can access the vast amount of data in the world by connecting to the Internet.Since the Internet has expanded significantly to share information, some individuals and organizations seek to be able to prevent the possible sabotage of some people by monitoring network users. Analysis of computer network traffic is one of the importance issues that many activities have been done in this area. One of the most important questions in traffic analysis is to identify the main content of traffic on the encrypted network. Numerous studies have shown that the traffic of websites visited through the Tor network, including Specific information that...
Benford's law behavior of internet traffic
, Article Journal of Network and Computer Applications ; Vol. 40, issue. 1 , April , 2014 , p. 194-205 ; Jahangir, A. H ; Sharif University of Technology
Abstract
In this paper, we analyze the Internet traffic from a different point of view based on Benford's law, an empirical law that describes the distribution of leading digits in a collection of numbers met in naturally occurring phenomena. We claim that Benford's law holds for the inter-arrival times of TCP flows in case of normal traffic. Consequently, any type of anomalies affecting TCP flows, including intentional intrusions or unintended faults and network failures in general, can be detected by investigating the first-digit distributions of the inter-arrival times of TCP SYN packets. In this paper we apply our findings to the detection of intentional attacks, and leave other types of...
Improving The Performance of Network Processors Based of the Advanced Processors Schemes
, M.Sc. Thesis Sharif University of Technology ; Jahangir, Amir Hossein (Supervisor)
Abstract
Up to now two kinds of hardware have been used in routers: ASIC processors or general purpose processors. These two solutions have their own flaws. ASIC hardwares are fast but they are not flexible for implementation or development of new applications. And general purpose processors are not fast enough for fast data rate of network. On the other hand, there is an ever increasing gap between the memory access speed and network data rate. At this time the main bottleneck in packet processing systems is memory. For solving this problem, two groups of solution have been introduced. The first group tries to reduce the demand for memory by using cache or longer system words. The second group uses...
Network Traffic Analysis & Anomaly Detection based on Benford’s Law
, Ph.D. Dissertation Sharif University of Technology ; Jahangir, Amir Hossein (Supervisor)
Abstract
The attempt of this project is to propose a simple model for traffic analysis which eventually leads to the presentation of an online classifier for network traffic anomaly detection. In this research, e show empirically that despite the variety of data networks in size, number of users, applications, and load, the inter-arrival times of normal TCP flows comply with the Weibull distribution whereas specific irregularities (anomalies) causes deviations from the distribution. Consequently, any type of anomalies affecting TCP flows, including intentional intrusions or unintended faults and network failures in general, can be detected by analyzing the discrepancy of TCP flow inter-arrival times...
Online Policy Enforcement on Heavy Network Traffic Using Protocol Parsers
, M.Sc. Thesis Sharif University of Technology ; Jalili, Rasool (Supervisor)
Abstract
In recent years, internet traffic is experiencing an explosive growth. High performance networking in large scale computer networks creates several security challenges. Exploiting Deep Packet Inspection (DPI) is regarded as a big challenge especially for massive data when number of concurrent connections grows. Using simple security based on network layer data can easily avaded by attackers and also can not detect more sophisticated attacks like DDoS. In this paper we proposed a new grammar model named bidirectional asynchronous counting grammar and it’s automata. With this grammar model we can define policies based on extracted fields in both request and response flows. Using new model of...
Improving Payload Attribution Systems for Network Forensic Applications
, Ph.D. Dissertation Sharif University of Technology ; Jahangir, Amir Hossein (Supervisor)
Abstract
Payload Attribution Systems (PAS) are one of the most important tools of network forensics for detecting offenders and victims after the occurrence of a cybercrime. A PAS stores the network traffic history in order to detect the source and destination pair of a certain data stream in case a malicious activity occurs on the network. The huge volume of information that is daily transferred in the network means that the data stored by a PAS must be as compact and concise as possible. Moreover, the investigation of this large volume of data for a malicious data stream must be handled within a reasonable time. For this purpose, several techniques based on storing a digest of traffic using Bloom...
A heuristic methodology to tackle the Braess Paradox detecting problem tailored for real road networks
, Article Transportmetrica A: Transport Science ; Vol. 10, issue. 5 , 2014 , p. 437-456 ; Ceder, A ; Tavana, M ; Bozic, C ; Sharif University of Technology
Abstract
Adding a new road to help traffic flow in a congested urban network may at first appear to be a good idea. The Braess Paradox (BP) says, adding new capacity may actually worsen traffic flow. BP does not only call for extra vigilance in expanding a network, it also highlights a question: Does BP exist in existing networks? Literature reveals that BP is rife in real world. This study proposes a methodology to find a set of roads in a real network, whose closure improve traffic flow. It is called the Braess Paradox Detection (BPD) problem. Literature proves that the BPD problem is highly intractable especially in real networks and no efficient method has been introduced. We developed a...
An empirical study on TCP flow interarrival time distribution for normal and anomalous traffic
, Article International Journal of Communication Systems ; 2015 ; 10745351 (ISSN) ; Jahangir, A. H ; Sharif University of Technology
Abstract
SUMMARY: In this paper, we study the effects of anomalies on the distribution of TCP flow interarrival time process. We show empirically that despite the variety of data networks in size, number of users, applications, and load, the interarrival times of normal flows comply with the Weibull distribution, whereas specific irregularities (anomalies) causes deviations from the distribution. We first estimate the scale and shape parameters and then check the discrepancy of the data from a Weibull distribution with the estimated parameters. We also utilize the Weibull counting model to recheck the conformance of small flow interarrival times with the distribution. We perform our experiments on a...
Estimation of Network Parameters for use in Congestion Control Algorithm
, M.Sc. Thesis Sharif University of Technology ; Jahangir, Amir Hossein (Supervisor)
Abstract
Many congestion control protocols proposed so far to alleviate the problems encountered by TCP protocol in high-speed networks and wireless links have to estimate the parameters of the network. For example, the TCP WESTWOOD congestion window is adjusted based on available bandwidth estimation, or TCP Vegas detects the congestion status based on RTT (Round Trip Time) estimation, and XCP protocol operates according to network traffic load. In this paper, we proposed a novel estimation algorithm that is based on burst identification techniques in router. we show through analysis and simulation that during burst periods this method can estimate the congestion window size of the specific flow...
The Application of Deep Learning on Network Traffic Classification
, M.Sc. Thesis Sharif University of Technology ; Jafari Siavoshani, Mahdi (Supervisor)
Abstract
Almost all of the network traffic classification systems use pre-defined extracted features by the experts in computer network. These features include regular expressions, port number, information in the header of different layers and statistical feature of the flow. The main problem of the traffic analysis and anomaly detection system lies in finding appropriate features. The feature extraction is a time consuming process which needs an expert to be done. It is notable that the classification of special kinds of traffic like encrypted traffic is impossible using some subset of mentioned features.The lack of integration in feature detection and classification is also another important issue...
Online High-bandwidth Network Application Detection Using Stream Classification
, M.Sc. Thesis Sharif University of Technology ; Jalili, Rasool (Supervisor)
Abstract
Trac classication in today’s high-bandwidth networks is challenging, resource consuming, and inaccurate due to the high volume, velocity, and variety aracteristics of the network trac. Trac aracterization and Application identication teniques are widely addressed in the current literature. Due to the massive volume and streaming data in recent years, stream algorithms have been considered by many researers in dierent areas. Online application detection is an issue that has been addressed less frequently in literature. In this thesis, we investigate the performance of 10 dierent stream classication algorithms along with traditional classication algorithms. To generate a robust classier for...
Trafic Prediction in MANET by Computational Intelligence Techniques
, M.Sc. Thesis Sharif University of Technology ; Manzuri, Mohammad Taghi (Supervisor)
Abstract
Mobile Ad-Hoc Networks (MANETs) have been studied as one of the most important technologies in the mid to late 1990s. There are several research works on types of network traffic modeling and prediction. Therefore, a very important issue is to make prediction on traffic-flows that each node handles. Because of this, prediction permits us to improve and increase the performance of the network. This project is a contributing effort to improve the traffic packets prediction by Neural Networks in MANET. The main goal of this thesis is about the recovery of data after crisis in phenomenal roads and highways. Our goal is recognizing phenomenal crisis-points in roads. In this thesis packets are...
A Deep Learning-Based Network Traffic Classifier with the Ability to Detect Novelty
, M.Sc. Thesis Sharif University of Technology ; Jafari Siavoshani, Mahdi (Supervisor)
Abstract
Network traffic classification has been an essential element for security monitoring in the network security scope and also for quality of service purposes. Every now and then, new traffic classes are added to the available groups which are unknown to the system. In an security scope, the novelties are actually the zero-day attacks which can have huge effects on the system environment. There have been many methods developed for traffic classification which are able to distinguish known traffic using signatures or learning-based methods. In a real world scenario, The primary challenge that new traffic classifiers face, is to detect novelty and separate them from the previously known labels....
On the gaussian characteristics of aggregated short-lived flows on high-bandwidth links
, Article Proceedings - 27th International Conference on Advanced Information Networking and Applications Workshops ; 2013 , Pages 860-865 ; 9780769549521 (ISBN) ; Jahangir, A. H ; Sharif University of Technology
2013
Abstract
Traffic modeling, traffic decomposition, and traffic engineering are some of the applications of traffic characterization that are mainly based on statistical characteristics of the network traffic. Many empirical analyses on Internet traffic traces show that the flow inter-arrival time distribution generally follows the Weibull distribution. As the scale of the network becomes larger, the Weibull distribution degrades to the Poisson distribution and when the flow arrival rate is high, it asymptotically converges to the Normal distribution. The aggregated traffic on high bandwidth links is the result of statistical multiplexing of many traffic sources, and the flow arrival rate on these...
Payload attribution via character dependent multi-bloom filters
, Article IEEE Transactions on Information Forensics and Security ; Volume 8, Issue 5 , 2013 , Pages 705-716 ; 15566013 (ISSN) ; Tavakoli, M ; Kharrazi, M ; Sharif University of Technology
2013
Abstract
Network forensic analysts employ payload attribution systems (PAS) as an investigative tool, which enables them to store and summarize large amounts of network traffic, including full packet payload. Hence an investigator could query the system for a specific string and check whether any of the packets transmitted previously in the network contained that specific string. As a shortcoming, the previously proposed techniques are unable to support wildcard queries. Wildcards are an important type of query that allow the investigator to locate strings in the payload when only part of the string is known. In this paper, a new data structure for payload attribution, named Character Dependent...
The effect of using cube connected cycle for improving locality awareness in peer-to-peer networks
, Article UKSim2010 - UKSim 12th International Conference on Computer Modelling and Simulation, 24 March 2010 through 26 March 2010 ; March , 2010 , Pages 491-496 ; 9780769540160 (ISBN) ; Barzegar, Z ; Habibi, J ; UK Simulation Society; Asia Modelling and Simulation Society (AMSS); European Federation of Simulation Societies (EUROSIM); IEEE UK and RI; European Council for Modelling and Simulation (ECMS) ; Sharif University of Technology
2010
Abstract
Today, peer-to-peer networks are become more popular among internet users and more than millions peers share high volume of data from anywhere. Sending and receiving these data increase the network traffics terribly. By improving the performance of these networks not only the efficiency of these networks increase but also the overall performance of the internet augments. To achieve high performance and resilience to failures, a peer can make connections with those other peers that are geographically closer to it. There are many solutions that are suggested for locality problem. In this paper, we suggest a Cube Connected Cycle as an overlay network to improve locality with higher performance
An empirical study on TCP flow interarrival time distribution for normal and anomalous traffic
, Article International Journal of Communication Systems ; Volume 30, Issue 1 , 2017 ; 10745351 (ISSN) ; Jahangir, A. H ; Sharif University of Technology
John Wiley and Sons Ltd
2017
Abstract
In this paper, we study the effects of anomalies on the distribution of TCP flow interarrival time process. We show empirically that despite the variety of data networks in size, number of users, applications, and load, the interarrival times of normal flows comply with the Weibull distribution, whereas specific irregularities (anomalies) causes deviations from the distribution. We first estimate the scale and shape parameters and then check the discrepancy of the data from a Weibull distribution with the estimated parameters. We also utilize the Weibull counting model to recheck the conformance of small flow interarrival times with the distribution. We perform our experiments on a diverse...
Inline high-bandwidth network analysis using a robust stream clustering algorithm
, Article IET Information Security ; Volume 13, Issue 5 , 2019 , Pages 486-497 ; 17518709 (ISSN) ; Jalili, R ; Sharif University of Technology
Institution of Engineering and Technology
2019
Abstract
High-bandwidth network analysis is challenging, resource consuming, and inaccurate due to the high volume, velocity, and variety characteristics of the network traffic. The infinite stream of incoming traffic forms a dynamic environment with unexpected changes, which requires analysing approaches to satisfy the high-bandwidth network processing challenges such as incremental learning, inline processing, and outlier handling. This study proposes an inline high-bandwidth network stream clustering algorithm designed to incrementally mine large amounts of continuously transmitting network traffic when some outliers can be dropped before determining the network traffic behaviour. Maintaining...
A study on routing method in P2P networks
, Article 2008 16th International Conference on Networks, ICON 2008, New Delhi, 12 December 2008 through 14 December 2008 ; February , 2008 ; 9781424438051 (ISBN) ; Movaghar, A ; Ghafari Zadeh, A. A ; Sharif University of Technology
2008
Abstract
The Gnutella protocol requires peers to broadcast messages to their neighbors when they search files. The message passing generates a lot of traffic in the network, which degrades the quality of service. We propose the new method to optimize the speed of search and to improve the quality of service in a Gnutella based peer-to-peer environment with using semantic routing and priority of nodes. Once peers generate their "friends lists", they use these lists to route queries in the network. This helps to reduce the search time and to decrease the network traffic by minimizing the number of messages circulating in the system as compared to standard Gnutella