scholarly journals Packet Loss and Packet Delivery Evaluation Using Network Simulator for Multicast Enabled Network Mobility Management

Author(s):  
Azana Hafizah Mohd Aman ◽  
Aisha-Hassan A. Hashim ◽  
Huda Adibah Mohd Ramli ◽  
Shayla Islam
Author(s):  
Azana Hafizah Mohd Aman ◽  
Aisha-Hassan A. Hashim ◽  
Huda Adibah Mohd Ramli ◽  
Shayla Islam

Author(s):  
Istabraq M. Al-Joboury ◽  
Emad H. Al-Hemiary

Fog Computing is a new concept made by Cisco to provide same functionalities of Cloud Computing but near to Things to enhance performance such as reduce delay and response time. Packet loss may occur on single Fog server over a huge number of messages from Things because of several factors like limited bandwidth and capacity of queues in server. In this paper, Internet of Things based Fog-to-Cloud architecture is proposed to solve the problem of packet loss on Fog server using Load Balancing and virtualization. The architecture consists of 5 layers, namely: Things, gateway, Fog, Cloud, and application. Fog layer is virtualized to specified number of Fog servers using Graphical Network Simulator-3 and VirtualBox on local physical server. Server Load Balancing router is configured to distribute the huge traffic in Weighted Round Robin technique using Message Queue Telemetry Transport protocol. Then, maximum message from Fog layer are selected and sent to Cloud layer and the rest of messages are deleted within 1 hour using our proposed Data-in-Motion technique for storage, processing, and monitoring of messages. Thus, improving the performance of the Fog layer for storage and processing of messages, as well as reducing the packet loss to half and increasing throughput to 4 times than using single Fog server.


Author(s):  
Neetika Jain ◽  
Sangeeta Mittal

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.


Author(s):  
László Bokor ◽  
Zoltán Faigl ◽  
Sándor Imre

This paper is committed to give an overview of the Host Identity Protocol (HIP), to introduce the basic ideas and the main paradigms behind it, and to make an exhaustive survey of mobility management schemes in the Host Identity Layer. The authors' goal is to show how HIP emerges from the list of potential alternatives with its wild range of possible usability, complex feature set and power to create a novel framework for future Mobile Internet architectures. In order to achieve this, the authors also perform an extensive simulation evaluation of four selected mobility solutions in the Host Identity Layer: the standard HIP mobility/multihoming (RFC5206), a micromobility solution (µHIP), a network mobility management scheme (HIP-NEMO) and a proactive, cross-layer optimized, distributed proposal designed for flat architectures (UFA-HIP).


Author(s):  
Sihem Trabelsi ◽  
Noureddine Boudriga

Simulations show that the proposed scheme achieves better results than those of other resource reservation schemes for metrics like bandwidth utilization, handoff latency, and packet loss.


Author(s):  
Pawan Singh ◽  
Suhel Ahmad Khan ◽  
Pramod Kumar Goyal

VANET is a subclass of MANET that makes the dream of intelligent transportation systems come true. As per the report of the Ministry of Road Transport and Highways, India, 1.5 million people were killed in road accidents in 2015. To reduce casualty and provide some kind of comfort during the journey, India must also implement VANETs. Applicability of VANET in Indian roads must be tested before implementation in reality. In this chapter, the real maps of Connaught Place, New Delhi from Open Street maps websites is considered. The SUMO for traffic and flow modeling is used. Many scenarios have been used to reflect real Indian road conditions to measure the performance of AODV, DSDV, and DSR routing protocols. The CBR traffic is used for the dissemination of emergency messages in urban vehicular traffic scenarios. The throughput, packet delivery ratio, and end-to-end delay are considered for performance analysis through the NS-2.35 network simulator.


2019 ◽  
Vol 18 (2) ◽  
Author(s):  
Made Dinda Pradnya Pramita ◽  
Lie Jasa

Seiring dengan perkembangan teknologi, pengimplementasian jaringan komputer dapat menggunakan simulator jaringan. Pengunaan simulator jaringan yang sering digunakan salah satunya adalah Graphical User Interface (GUI) dan sistem operasinya disediakan dari pihak pengguna karena sistem operasi yang digunakan berasal dari sistem operasi asli perangkat jaringan tersebut. Perkembangan pesat terhadap kebutuhan data mendorong masyarakat untuk melakukan pertukaran informasi antara satu dengan lainnya melalui satu jaringan. Komunikasi data dilakukan melalui pengiriman paket data antara jaringan berdasarkan internet protocol (IP) address. IP dibagi menjadi dua yaitu IPV4 dan IPV6 dalam proses pengiriman data dibantu dengan router. Pada penelitian ini akan berfokus pada analis kinerja routing protocol tersebut dengan menggunakan IPV6 dengan memperhatikan beberapa parameter seperti delay, packet loss, throughput dan waktu konversi. Berdasarkan hasil penelitian menunjukkan OSPF lebih baik dibandingkan EIGRP pada nilai delay dan throughput  yaitu 2-15%. EIGRP lebih baik ketika koneksi mengalami down yaitu sebesar 45 – 52%. EIGRP memiliki waktu konvergensi yang lebih cepat dibandingkan OSPF yaitu dengan waktu 2 – 6 detik sedangkan OSPF sebesar 8 – 10 detik. Kata Kunci—EIGRP, OSPF, IPV6 dan Simulator


Sign in / Sign up

Export Citation Format

Share Document