scholarly journals PERBANDINGAN FASTETHERNET , GIGABITETHERNET DAN SERIAL DALAM JARINGAN BERBASIS ROUTING PROTOKOL EIGRP

2017 ◽  
Author(s):  
Oris Krianto Sulaiman ◽  
Adi Widarma
Keyword(s):  
Routing Protocol ◽  
Large Scale ◽  
Network Performance ◽  
Computer Network ◽  
Network Access ◽  
Improve Performance ◽  
Technological Developments ◽  
Increasing Demand ◽  
Large Scale Networks ◽  
Selection Of

Technological developments in the computer network gradually grew rapidly along with the increasing demand for network access that is efficient, stable and fast . One of the factors that affect the speed of the network is to use ethernet and a serial technology in which each of these technologies has its own characteristics to improve performance in the network. This technology is supported by a good network design . In large-scale networks is needed a high ability to improve network performance , EIGRP routing protocol enables improved network performance effectively where one of them for ethernet and serial technologies . Selection of Ethernet and serial technologies within EIGRP routing protocol would greatly assist in improving the performance of the network , with the calculation of EIGRP metric to compare which technology is better in the EIGRP routing protocol.

scholarly journals Performance Analysis of Routing Protocol for Low Power and Lossy Networks (RPL) in Large Scale Networks

2017 ◽  
Vol 4 (6) ◽  
pp. 2172-2185 ◽  
Author(s):  
Xiyuan Liu ◽  
Zhengguo Sheng ◽  
Changchuan Yin ◽  
Falah Ali ◽  
Daniel Roggen
Keyword(s):  
Performance Analysis ◽  
Low Power ◽  
Routing Protocol ◽  
Large Scale ◽  
Lossy Networks ◽  
Large Scale Networks

scholarly journals A comprehensive evaluation of cache utilization characteristics in large scale WSN considering network driven cache replacement techniques

2018 ◽  
Vol 188 ◽  
pp. 05004
Author(s):  
Christos Panagiotou ◽  
Christos Antonopoulos ◽  
Stavros Koubias
Keyword(s):  
Smart City ◽  
Large Scale ◽  
Network Performance ◽  
Comprehensive Evaluation ◽  
Resource Conservation ◽  
Data Sources ◽  
Data Cache ◽  
Cache Replacement ◽  
Large Scale Networks ◽  
Result Analysis

WSNs as adopted in current smart city deployments, must address demanding traffic factors and resilience in failures. Furthermore, caching of data in WSN can significantly benefit resource conservation and network performance. However, data sources generate data volumes that could not fit in the restricted data cache resources of the caching nodes. This unavoidably leads to data items been evicted and replaced. This paper aims to experimentally evaluate the prominent caching techniques in large scale networks that resemble the Smart city paradigm regarding network performance with respect to critical application and network parameters. Through respective result analysis valuable insights are provided concerning the behaviour of caching in typical large scale WSN scenarios.

scholarly journals Software Defined Networking Flow Table Management of OpenFlow Switches Performance and Security Challenges: A Survey

2020 ◽  
Vol 12 (9) ◽  
pp. 147 ◽  
Author(s):  
Babangida Isyaku ◽  
Mohd Soperi Mohd Zahid ◽  
Maznah Bte Kamat ◽  
Kamalrulnizam Abu Bakar ◽  
Fuad A. Ghaleb
Keyword(s):  
Large Scale ◽  
Network Performance ◽  
Software Defined Networking ◽  
Cloud Services ◽  
Future Research ◽  
Control Plane ◽  
Processing Load ◽  
Flow Table ◽  
Data Plane ◽  
Large Scale Networks

Software defined networking (SDN) is an emerging network paradigm that decouples the control plane from the data plane. The data plane is composed of forwarding elements called switches and the control plane is composed of controllers. SDN is gaining popularity from industry and academics due to its advantages such as centralized, flexible, and programmable network management. The increasing number of traffics due to the proliferation of the Internet of Thing (IoT) devices may result in two problems: (1) increased processing load of the controller, and (2) insufficient space in the switches’ flow table to accommodate the flow entries. These problems may cause undesired network behavior and unstable network performance, especially in large-scale networks. Many solutions have been proposed to improve the management of the flow table, reducing controller processing load, and mitigating security threats and vulnerabilities on the controllers and switches. This paper provides comprehensive surveys of existing schemes to ensure SDN meets the quality of service (QoS) demands of various applications and cloud services. Finally, potential future research directions are identified and discussed such as management of flow table using machine learning.

scholarly journals Strategies for Monitoring Multiuse Trail Networks

2017 ◽  
Vol 2644 (1) ◽  
pp. 100-110 ◽  
Author(s):  
Greg Lindsey ◽  
Jeffrey S. Wilson ◽  
Jueyu Wang ◽  
Tracy Hadden-Loh
Keyword(s):  
Nonprofit Organizations ◽  
Large Scale ◽  
Low Cost ◽  
Facility Planning ◽  
Monitoring Networks ◽  
Site Specific ◽  
New Challenges ◽  
Large Scale Networks ◽  
Selection Of

Many municipalities, park districts, and nonprofit organizations have begun monitoring nonmotorized traffic on multiuse trails as the need for information about the use of facilities has grown and relatively low-cost sensors for automated monitoring have become available. As they have gained experience, they have begun to move from site-specific monitoring on individual trails to a more comprehensive monitoring of trail networks. This case study review compares strategies developed by 10 organizations for monitoring traffic on multiuse trails, including local, multicounty, statewide, and multistate trail networks. The focus is on approaches to the design of monitoring networks, particularly the rationales or objectives for monitoring and the selection of monitoring sites. It is shown that jurisdictions are following principles of monitoring established by FHWA and that the design of monitoring networks is evolving to meet new challenges, including monitoring large-scale networks. Relevant outcomes and implications for practice are summarized. The researchers concluded that FHWA guidelines can be adapted to many circumstances and can increase information for decision making. Trail monitoring is informing decisions related to facility planning, investment, and safety.

Metode PCQ dan Queue Tree untuk Implementasi Manajemen Bandwidth Berbasis Mikrotik

2021 ◽  
Vol 5 (2) ◽  
pp. 407-412
Author(s):  
Febrian Wahyu Christanto ◽  
April Firman Daru ◽  
Arif Kurniawan
Keyword(s):  
Large Scale ◽  
Network Performance ◽  
Computer Network ◽  
Local Area Network ◽  
Internet Access ◽  
Local Area ◽  
Area Network ◽  
Bandwidth Management ◽  
Available Bandwidth ◽  
Internet Networks

Bandwidth problems are the most frequently encountered problems in sharing information traffic or internet access on computer networks. The factor that causes slow internet access is the large number of devices connected to the internet that are not matched by the availability of sufficient bandwidth and the lack of available bandwidth. This can be accommodated with bandwidth management methods. Bandwidth management in Mikotik uses several bandwidth sharing methods such as PCQ (Per Connection Queue), Queue Tree, and HTB (Hierchichal Token Bucket). This research uses 2 (two) bandwidth management methods, namely PCQ and Queue Tree because these methods can divide bandwidth automatically according to the number of active users and are more effective in sharing bandwidth based on Mikrotik. PCQ is a method aimed at optimizing QoS for large-scale internet networks where all queues are the same for all sub-streams, while Queue Tree is a method designed to carry out more complex queuing tasks for network traffic. The purpose of this research is to optimize the limited internet bandwidth so that it can be accessed by all users in the Local Area Network and automate the queue of devices connected to the network according to user needs so as to produce a more stable computer network performance using the network development method, namely NDLC. The results of the tests were carried out 10 times using a bandwidth of 10 Mbps which resulted in an average jitter of 1.64 ms, ping 36.8 ms, 2 Mbps throughput, and 0.1% packet loss so that the QoS of internet access was categorized as satisfactory. It is hoped that from this research the company will be able to save on internet access expenses by maximizing a small bandwidth without having to increase the existing bandwidth.  

DESIGN OF FUZZY BASED MULTI-CONSTRAINED ROUTING PROTOCOL AND THE PERFORMANCE EVALUATION

2008 ◽  
Vol 09 (04) ◽  
pp. 369-387 ◽  
Author(s):  
JING ZUO ◽  
XUEFEN CHI ◽  
LIN GUAN ◽  
HONGXIA LI ◽  
IRFAN AWAN
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Large Scale ◽  
Ad Hoc ◽  
Qos Routing ◽  
Route Maintenance ◽  
Hoc Networks ◽  
Large Scale Networks

Single-constrained QoS routing protocols have inherent defects when applied into wireless ad hoc networks. Due to a single constraint parameter is only considered, they can't always cope with the problems caused by the uncertainty of ad hoc networks well. They are not robust enough. In order to overcome the drawbacks of single-constrained QoS routing protocols and improve the Quality of Service (QoS) of ad hoc networks, this paper proposed a multi-constrained QoS routing protocol based on fuzzy logic. It is developed from Dynamic Source Routing (DSR). The proposed protocol is service-aware in the sense that it considers the QoS required by different types of services and takes different network state parameters as the constraint conditions for fuzzy based routing system. New route discovery procedure and novel route maintenance mechanism are designed to support corresponding QoS requirements. Speed of packets sending is also adjusted adaptively referring to the outputs of the proposed fuzzy system. Performance of the fuzzy based DSR protocol is measured and evaluated under different conditions. Simulation results show that the improved protocol has better QoS guarantee capabilities compared to single-constrained QoS routing protocols for large-scale networks in terms of lower delay, smoother delay variation and lower packet loss rate.

scholarly journals Low Energy Routing Protocol for Oil and Gas Pipeline Internet of Things

2021 ◽  
Author(s):  
Miao Liu ◽  
Zhuo-Miao Huo ◽  
Jie Zhang ◽  
Rong Yao ◽  
Zhen-Xing Sun
Keyword(s):  
Internet Of Things ◽  
Routing Protocol ◽  
Large Scale ◽  
Network Performance ◽  
Oil And Gas ◽  
Opportunistic Routing ◽  
End To End Delay ◽  
Key Factor ◽  
Forwarding Node ◽  
End To End

Abstract Nodes in the Internet of Things of oil and gas pipelines are linearly distributed according to the direction of pipelines, so it is difficult to realize timely and large-scale battery replacement. Therefore, effective energy management has always been a key factor restricting the performance of the IoT of oil and gas pipelines.In addition, the end-to-end delay determines the response time of pipeline safety accidents and is also a key parameter to improve the real-time performance of the network. Considering energy effciency and delay comprehensively, this paper proposes PIOT-LPRP (Pipeline Internet of Things - Low Power Routing Protocol) protocol. The remaining energy of nodes and the distance between nodes and sink nodes are used as indicators to select candidate forwarding nodes in opportunistic routing to achieve energy balance in the network. The use of energy collection technology to extend the service life of the network. By choosing the node which is far away from the transmission as the forwarding node, the number of hops of data transmission can be effectively reduced, so as to reduce the end-to-end delay of the network. The simulation results show that PIOT-LPRP can effectively take into account the network life and network latency, and improve the network performance, by comparing with the classical opportunistic routing protocol EXOR, the same type of protocol RE-OR, and the HER protocol using energy harvesting technology.

scholarly journals Analisis Pengembangan Jaringan Komputer UIN Sunan Kalijaga Yogyakarta Menggunakan Perbandingan Protokol Routing Statik dan Routing Dinamis OSPF

2021 ◽  
Vol 8 (2) ◽  
pp. 235
Author(s):  
Rahmadhan Gatra ◽  
Bambang Sugiantoro
Keyword(s):  
Routing Protocol ◽  
Packet Loss ◽  
Routing Protocols ◽  
Network Performance ◽  
Computer Network ◽  
Performance Testing ◽  
Literature Study ◽  
Simulation Based ◽  
Qos Parameters ◽  
Static Routing

<p>Penelitian ini menjelaskan tentang perbandingan <em>routing</em> sebagai salah satu manajemen jaringan komputer. Tujuan penelitian ini adalah melakukan analisis terhadap protokol <em>routing</em> statik dengan <em>routing</em> dinamis OSPF pada jaringan komputer di lingkungan Universitas Islam Negeri Sunan Kalijaga Yogyakarta dengan metode studi literatur dan wawancara dalam pengumpulan data. Penelitian dibuat berdasarkan pemodelan (simulasi) berbasis aplikasi EVE-NG. Performa yang dihasilkan dari perbandingan <em>routing </em>tersebut diukur menggunakan parameter QoS meliputi nilai dari <em>throughput, packet loss, delay</em>, dan <em>jitter</em>. Pengujian kinerja jaringan menggunakan skenario normal dan sibuk pada routing statik dan dinamis OSPF antara lain skenario normal <em>throughput</em> untuk <em>routing</em><em> </em>protokol statik sebanyak <em>598.10Bps</em> dan nilai untuk OSPF sebanyak <em>598.34Bps</em>, sedangkan skenario sibuk untuk <em>routing</em> protokol statik sebanyak <em>598.82Bps</em> dan nilai untuk OSPF sebesar <em>597.58Bps</em>. <em>Packet loss</em> skenario normal <em>routing</em> protokol statik sebanyak <em>0.2</em><em>3</em><em>%</em> dan nilai untuk OSPF sebanyak <em>0.27%</em> serta skenario sibuk untuk <em>routing</em> protokol statik sebanyak <em>0.2</em><em>4</em><em>%</em> dan OSPF sebanyak <em>0.26%</em>. Nilai <em>delay</em> skenario normal <em>routing</em> statik protokol sebanyak <em>59.</em><em>39</em><em>ms</em> dan nilai untuk OSPF sebanyak <em>59.3</em><em>6</em><em>ms</em>, sedangkan skenario sibuk untuk <em>routing</em> protokol statik sebanyak <em>59.</em><em>32</em><em>ms</em> dan nilai untuk OSPF sebanyak <em>59.44ms</em>. <em>Jitter</em> menggunakan skenario normal protokol <em>routing</em> statik sebanyak <em>0.98ms</em> dan nilai untuk OSPF sebanyak <em>0.98ms</em> serta skenario sibuk <em>routing</em> protokol statik sebanyak <em>0.98ms</em> dan nilai untuk OSPF sebanyak <em>0.99ms</em>. Parameter QoS menunjukkan bahwa <em>throughput</em> dan <em>delay</em> maka <em>routing</em> statik lebih optimal dibandingkan OSPF pada skenario sibuk, sedangkan pada skenario normal dan sibuk<em> jitter </em>dan <em>packet loss</em> lebih optimal <em>routing</em> protokol statik.</p><p> </p><p><em><strong>Abstract</strong></em></p><p><em>This study describes the comparison of routing as one of computer network management. The purpose of this study is to analyze static routing protocols with OSPF dynamic routing on computer networks in the State Islamic University of Sunan Kalijaga Yogyakarta with literature study methods and interviews in data collection. The study was made based on modeling (simulation) based on EVE-NG applications. The performance resulting from the comparison of routing is measured using QoS parameters including the value of throughput, packet loss, delay, and jitter. Network performance testing uses normal and busy scenarios on static and dynamic OSPF routing, including normal throughput scenarios for static protocol routing as much as 598.10Bps and values for OSPF as much as 598.34Bps, while busy scenarios for static protocol routing as much as 598.82Bps and values for OSPF as 597.58 Bps. Normal packet routing scenario static routing protocols are 0.23% and OSPF values are 0.27% and busy scenarios for static protocol routing are 0.24% and OSPF are 0.26%. The normal scenario static routing protocol delay value is 59.39ms and the value for OSPF is 59.36ms, while the busy scenario for static protocol routing is 59.32ms and the value for OSPF is 59.44ms. Jitter uses a normal scenario of 0.98ms static routing protocol and 0.98ms for OSPF and 0.98ms for busy routing protocol scenarios and 0.99ms for OSPF. QoS parameters indicate that throughput and delay static routing is more optimal than OSPF in busy scenarios, whereas in normal and busy scenarios jitter and packet loss are more optimal static protocol routing.</em></p><p><em><strong><br /></strong></em></p>

scholarly journals Perancangan Performansi Quality Of Service Dengan Metode Virtual Routing Redudancy Protocol (VRRP)

2019 ◽  
Vol 5 (1) ◽  
pp. 87-92
Author(s):  
Mugi Raharjo ◽  
Frengki Pernando ◽  
Ahmad Fauzi
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Computer Network ◽  
The Internet ◽  
Performance Bond ◽  
Main Activity ◽  
A Company ◽  
Computerized System ◽  
Internet Network

The need for a network is the intenet is indeed already is common at this time. Do a computerized system in each routine office as well as the occurrence of problems in computer networks in a company can make the effectiveness and flexibility in an agency or company became very disturbed. In PT. PELITA Cengkareng, Tangerang Paper needs a stable internet network is the key to a company's main activity is to do every day. For it is need for a change in the system of internet network. To support all activities in the company who need access to a computer network or the internet. A stable traffic as well as the existence of a performance bond that was always adequate internet desperately needed in an era as it is today. For that VRRP (Virtual Routing Protocol Redudancy) is the solution to increase network performance can be done by the existence of this method. The existing network of companies will have a backup connectivity to backup when there are problems at the major networks

Effects of fuelwood harvesting on biodiversity — a review focused on the situation in Europe1This article is one of a selection of papers from the International Symposium on Dynamics and Ecological Services of Deadwood in Forest Ecosystems.

2012 ◽  
Vol 42 (8) ◽  
pp. 1421-1432 ◽  
Author(s):  
Christophe Bouget ◽  
Aurore Lassauce ◽  
Mats Jonsell
Keyword(s):  
Large Scale ◽  
Landscape Scale ◽  
Peak Oil ◽  
Forest Ownership ◽  
Forest Practices ◽  
Research Findings ◽  
Increasing Demand ◽  
Whole Tree Harvesting ◽  
Selection Of

A continually increasing demand for energy and concerns about climate change, greenhouse gas emissions and peak oil have prompted countries to develop policies that promote renewable energy including forest-based bioenergy. In Europe, fuelwood-driven changes in forestry are likely to impact habitat conditions for forest biodiversity. We conducted a systematic literature overview based on 88 papers to synthesize research findings and gaps in knowledge. At the stand scale, but also on a landscape scale, deadwood availability and profile are altered by several practices: whole-tree harvesting and postharvest recovery of logging residues and stumps, for instance. Large-scale fuelwood removal may, on a landscape scale, jeopardize the amounts and diversity of substrate that saproxylic organisms require as food and habitat. Besides, bioenergy-related forest practices also affect nonsaproxylic biodiversity through physical (e.g., soil compaction and disturbance) and chemical changes in soil properties associated with fuelwood removal and increased machine traffic. Moreover, the extended density of internal edges threatens interior forest species populations. Important effects differ substantially between boreal and nemoral forests because of contrasts in management systems, structure of forest ownership, and ecological properties. Developing relevant operational guidelines to partially mitigate ecological damage on biodiversity should be based on our compiled cautionary statements but require further large-scale and long-term research.

Sign in / Sign up

Export Citation Format

Share Document