An acceleration simulation method for power law priority traffic

A method for accelerated simulation for simulated self-similar processes is proposed. This technique simplifies the simulation model and improves the efficiency by using excess packets instead of packet-by-packet source traffic for a FIFO and non-FIFO buffer scheduler. In this research is focusing on developing an equivalent model of the conventional packet buffer that can produce an output analysis (which in this case will be the steady state probability) much faster. This acceleration simulation method is a further development of the Traffic Aggregation technique, which had previously been applied to FIFO buffers only and applies the Generalized Ballot Theorem to calculate the waiting time for the low priority traffic (combined with prior work on traffic aggregation). This hybrid method is shown to provide a significant reduction in the process time, while maintaining queuing behavior in the buffer that is highly accurate when compared to results from a conventional simulatio

Handover Algorithm based VLP using Mobility Prediction Database for Vehicular Network

This paper proposes an improved handover algorithm method for vehicle location prediction (VLP-HA) using mobility prediction database. The main advantage of this method is the mobility prediction database is based on real traffic data traces. Furthermore, the proposed method has the ability to reduce handover decision time and solve resource allocation problem. The algorithm is simple and can be computed very rapidly; thus, its implementation for a high-speed vehicle is possible. To evaluate the effectiveness of the proposed method, QualNet simulation is carried out under different velocity scenarios. Its performance is compared with conventional handover method. The superiority of the proposed method over conventional handover method in deciding the best handover location and choosing candidate access points is highlighted by simulation. It was found that VLP-HA has clearly reduced handover delay by 45% compared to handover without VLP, give high accuracy, hence low complexity algorithm

Detection and Classification of Conflict Flows in SDN Using Machine Learning Algorithms

Software-Defined Networking (SDN) is a new type of technology that embraces high flexibility and adaptability. The applications in SDN have the ability to manage and control networks while ensuring load balancing, access control, and routing. These are considered the most significant benefits of SDN. However, SDN can be influenced by several types of conflicting flows which may lead to deterioration in network performance in terms of efficiency and optimisation. Besides, SDN conflicts occur due to the impact and adjustment of certain features such as priority and action. Moreover, applying machine learning algorithms in the identification and classification of conflicting flows has limitations. As a result, this paper presents several machine learning algorithms that include Decision Tree (DT), Support Vector Machine (SVM), Extremely Fast Decision Tree (EFDT) and Hybrid (DT-SVM) for detecting and classifying conflicting flows in SDNs. The EFDT and hybrid DT-SVM algorithms were designed and deployed based on DT and SVM algorithms to achieve improved performance. Using a range flows from 1000 to 100000 with an increment of 10000 flows per step in two network topologies namely, Fat Tree and Simple Tree Topologies, that were created using the Mininet simulator and connected to the Ryu controller, the performance of the proposed algorithms was evaluated for efficiency and effectiveness across a variety of evaluation metrics. The experimental results of the detection of conflict flows show that the DT and SVM algorithms achieve accuracies of 99.27% and 98.53% respectively while the EFDT and hybrid DT-SVM algorithms achieve respective accuracies of 99.49% and 99.27%. In addition, the proposed EFDT algorithm achieves 95.73% accuracy on the task of classification between conflict flow types. The proposed EFDT and hybrid DT-SVM algorithms show a high capability of SDN applications to offer fast detection and classification of conflict flows

Development of IPv6 network with location assisted transfer for real time applications

An approach is presented to develop a system that has a location tracking mechanism to track the position of tile mobile unit (such as WiFi enabled devices or POA) so that a device switching can be done to switch session from one device to another in order to provide roaming in an IPv6 network. In this work an IPv6 framework will be formulated and set up as a read lest bed. Meanwhile a location tracking mechanism will be deve loped and Integrated into the IMS IPv6 network with real time application and soft switch module to ensure continuous muft im€dia communication in the Internet whIle roaming. The proposed location tracking will be based on Received Signal Strength Indicator (RSSI). An accurate Path Loss Exponent will be calculated based on the RSSI and accurate pos itioning will be de/ermined for soft switching of devices. The IMS based on IPv6 network will be developed and integrate with the location tracking system. The location tracking will be purely software based with minimum hardware dependen

Efficient accelerated simulation technique for packet switched networks : a buffer with two priority inputs

An Enhanced Traffic Aggregation (E_TA) technique for acceleration simulation of packet switched network is proposed. This technique simplifies the simulation model and improves the efficiency by using packet-train or packet rate source traffic with non FIFO scheduler in the buffer. The model employs power law traffic which recently proved to be able to capture both long-range dependence and the burstiness of aggregate broadband network traffic. Our results show that using E_TA with FIFO scheduler simulation times can be reduced by 39%, and using E_TA with non FIFO scheduler by 83 %

Accelerated Simulation Method for Power-law Traffic and Non-FIFO Scheduling

Abstract: The conventional method of simulating networks, i.e. packet-by-packet, always consumes many hours and often days of ‘real ’ time just to simulate a few hours of ‘simulation ’ time. Accelerated simulation techniques reduce the number of events simulated and decrease the time needed for an experiment. In this paper we describe our approach to accelerate simulation of a power-law aggregated ON/OFF traffic through a FIFO queue, and then extend the same idea to a non-FIFO queue. 1

Accelerated Simulation Method for Power-law Traffic and Non-FIFO Scheduling

Abstract: The conventional method of simulating networks, i.e. packet-by-packet, always consumes many hours and often days of ‘real ’ time just to simulate a few hours of ‘simulation ’ time. Accelerated simulation techniques reduce the number of events simulated and decrease the time needed for an experiment. In this paper we describe our approach to accelerate simulation of a power-law aggregated ON/OFF traffic through a FIFO queue, and then extend the same idea to a non-FIFO queue. 1

Simulation of position-based routing protocol in wireless mobile ad hoc network

New routing algorithms are being developed to reduce power consumption, effective utilization of resources and best route to a specific destination in wireless mobile ad hoc network. To simulate the algorithm, interaction between the different layers of the OSI, the link available and furthermore, employing a suitable propagation model in a wireless environment, the use of network simulators do eliminate irrelevant issues pertaining to the actual work which is testing the algorithm. This paper presents the development of the simulation model to test a new routing protocol called quadrant-based directional routing protocol (QDIR). Q-DIR uses exact location of nodes based on Cartesian-coordinate system to restrict the broadcast region to only a quadrant where the destination node and source node are located. Unlike other positionbased routing protocols, Q-DIR transmits route request to all nodes that are in the same quadrant as the source and destination instead of broadcasting in all direction. This in return will reduce not only routing overhead in route discovery phase, but also wireless bandwidth used and collision of packets in the network. Neighboring nodes that are in the same quadrant will participate in this route determination phase

Video transmission in IEEE 802.15.4 wireless sensor network using asynchronous TDMA

Nowadays, the Wireless Sensor Network (WSN) technology is extensively used in a large variety of applications. WSN has engaged humans and computers in many applications such as health monitoring and security. IEEE 802.15.4 wireless standard is the current demand on WSN which is used to transmit video or real-time data at low data rates. Reliable data transmission for video applications is a critical issue in low data rate transmissions due to the high collision from conventional protocol, which is Carrier Sense Multiple Access (CSMA). Therefore, a MAC layer with token approach protocol called MAC-TA protocol is proposed to solve this issue. In this protocol, the only node that holds the token can transmit the data. If other nodes intent to do the transmission, they have to wait for the token before sending the data. Token Holding Time (THT) is a duration time set at the node that holds the token, and the token is pass to the next node when the THT is finished. This paper is focusing on the development of the MAC-TA protocol onto test-bed TelG motes. Three types of MPEG-4 video samples have been tested which are Akiyo, Foreman, and Mobile both in Quarter Common Intermediate Format (QCIF) and Common Intermediate Format (CIF) format. The proposed protocol is compared with the existing CSMA protocol in IEEE 802.15.4 standard. The experimental results present that the MAC-TA protocol has improved the packet delivery ratio by 70%. Moreover, the results prove that MAC-TA provides good reliability of multimedia data and makes it possible to send over IEEE 802.15.4 environment