scholarly journals Estimation of the ABW for Mobile Broadband over SDN using SFC-Constrained Shortest Path Algorithm

Software-Defined Networking (SDN) is an evolving algorithm which is depended upon the computer network transformation. In SDN, Bandwidth Utilization is a critical aspect to enhance network performance. To obtain the accessible bandwidth for the Mobile Broadband over SDN and in sequence enhance the accessible Mobile Broadband is the main objective. A significant characteristic is ABW (ABW), having a robust influence on a wide range of applications. However, this metric is very complex to estimate using traditional or conventional methodologies. The Traditional Bandwidth Estimation Technique has limited accuracy along with huge convergence time. The Estimation Time cannot be predicted as it depends on the existence of appropriate traffic produced through any thirdparty applications. 50% of Systematic Errors are not uncommon. In order to overcome the above-mentioned issues, in this paper, a novel approach is introduced for the estimation of ABW over SDN using three different scenarios. In which, SFC constraint shortest distance algorithm is employed for solving the classical max-flow issue that occurs in multiple scenarios while evaluating the ABW. The experiment result is carried out using Mininet testbed for network emulation and Floodlight as an SDN controller. Some of the interesting cases are considered, and the ABW is measured for the proposed software-defined network and compared with the existing traditional network and existing software-defined network

Author(s):  
KUKUH NUGROHO ◽  
DHIMAS PRABOWO SETYANUGROHO

ABSTRAKPerangkat controller dalam jaringan SDN berfungsi untuk memberikan informasi tabel flow ke perangkat switch sebagai acuan dalam menentukan informasi rute. Kecepatan dalam memproses permintaan tabel flow yang dilakukan oleh perangkat switch tergantung dari pemilihan jenis controller yang digunakan. Terdapat beberapa jenis controller yang bisa digunakan untuk mengatur aliran trafik data dalam jaringan SDN. Pada penelitian ini akan digunakan jenis controller RouteFlow dengan menggunakan algoritma routing Djikstra. Jaringan uji menggunakan topologi Full-Mesh yang menyediakan koneksi penuh ke semua switch, dimana terdapat dua protokol layer transport yang digunakan untuk mengirimkan data dalam jaringan SDN yaitu TCP dan UDP. Hasil pengukuran kualitas jaringan menunjukkan bahwa penggunaan protokol UDP menghasilkan nilai delay, jitter, dan throughput yang lebih baik dibandingkan dengan TCP. Waktu konvergensi jaringan yang dihasilkan sebesar 12,18 ms ketika ukuran data yang dipertukarkan sebesar 64 Byte.Kata kunci: Controller, Full-Mesh, RouteFlow, Software Defined Network ABSTRACTThe controller device in the SDN network is applied to provide flow table information for all switches as a reference in determining route information. The speed in processing the flow table requests that are made by the switches depends on the choice of the type of controller used. There are several types of controllers that can be used to manage the data traffic flow in the SDN network. This research utilizes the RouteFlow controller and the Djikstra routing algorithm. The test network applies the Full-Mesh topology that provides fully connections to all switches, wherein two transport protocols are used to transmit data in SDN networks, i.e., TCP and UDP. The results of network performance measurements show that the use of the UDP obtains better values in delay, jitter, and throughput than TCP. The network convergence time is 12.18 ms when the size of data exchanged is set to 64 Bytes.Keywords: Controller, Full-Mesh, RouteFlow, Software Defined Network


2021 ◽  
Vol 5 (EICS) ◽  
pp. 1-23
Author(s):  
Markku Laine ◽  
Yu Zhang ◽  
Simo Santala ◽  
Jussi P. P. Jokinen ◽  
Antti Oulasvirta

Over the past decade, responsive web design (RWD) has become the de facto standard for adapting web pages to a wide range of devices used for browsing. While RWD has improved the usability of web pages, it is not without drawbacks and limitations: designers and developers must manually design the web layouts for multiple screen sizes and implement associated adaptation rules, and its "one responsive design fits all" approach lacks support for personalization. This paper presents a novel approach for automated generation of responsive and personalized web layouts. Given an existing web page design and preferences related to design objectives, our integer programming -based optimizer generates a consistent set of web designs. Where relevant data is available, these can be further automatically personalized for the user and browsing device. The paper includes presentation of techniques for runtime adaptation of the designs generated into a fully responsive grid layout for web browsing. Results from our ratings-based online studies with end users (N = 86) and designers (N = 64) show that the proposed approach can automatically create high-quality responsive web layouts for a variety of real-world websites.


2021 ◽  
Vol 15 (5) ◽  
pp. 1-32
Author(s):  
Quang-huy Duong ◽  
Heri Ramampiaro ◽  
Kjetil Nørvåg ◽  
Thu-lan Dam

Dense subregion (subgraph & subtensor) detection is a well-studied area, with a wide range of applications, and numerous efficient approaches and algorithms have been proposed. Approximation approaches are commonly used for detecting dense subregions due to the complexity of the exact methods. Existing algorithms are generally efficient for dense subtensor and subgraph detection, and can perform well in many applications. However, most of the existing works utilize the state-or-the-art greedy 2-approximation algorithm to capably provide solutions with a loose theoretical density guarantee. The main drawback of most of these algorithms is that they can estimate only one subtensor, or subgraph, at a time, with a low guarantee on its density. While some methods can, on the other hand, estimate multiple subtensors, they can give a guarantee on the density with respect to the input tensor for the first estimated subsensor only. We address these drawbacks by providing both theoretical and practical solution for estimating multiple dense subtensors in tensor data and giving a higher lower bound of the density. In particular, we guarantee and prove a higher bound of the lower-bound density of the estimated subgraph and subtensors. We also propose a novel approach to show that there are multiple dense subtensors with a guarantee on its density that is greater than the lower bound used in the state-of-the-art algorithms. We evaluate our approach with extensive experiments on several real-world datasets, which demonstrates its efficiency and feasibility.


2021 ◽  
Vol 13 (3) ◽  
pp. 63
Author(s):  
Maghsoud Morshedi ◽  
Josef Noll

Video conferencing services based on web real-time communication (WebRTC) protocol are growing in popularity among Internet users as multi-platform solutions enabling interactive communication from anywhere, especially during this pandemic era. Meanwhile, Internet service providers (ISPs) have deployed fiber links and customer premises equipment that operate according to recent 802.11ac/ax standards and promise users the ability to establish uninterrupted video conferencing calls with ultra-high-definition video and audio quality. However, the best-effort nature of 802.11 networks and the high variability of wireless medium conditions hinder users experiencing uninterrupted high-quality video conferencing. This paper presents a novel approach to estimate the perceived quality of service (PQoS) of video conferencing using only 802.11-specific network performance parameters collected from Wi-Fi access points (APs) on customer premises. This study produced datasets comprising 802.11-specific network performance parameters collected from off-the-shelf Wi-Fi APs operating at 802.11g/n/ac/ax standards on both 2.4 and 5 GHz frequency bands to train machine learning algorithms. In this way, we achieved classification accuracies of 92–98% in estimating the level of PQoS of video conferencing services on various Wi-Fi networks. To efficiently troubleshoot wireless issues, we further analyzed the machine learning model to correlate features in the model with the root cause of quality degradation. Thus, ISPs can utilize the approach presented in this study to provide predictable and measurable wireless quality by implementing a non-intrusive quality monitoring approach in the form of edge computing that preserves customers’ privacy while reducing the operational costs of monitoring and data analytics.


Author(s):  
Primož Cigoj ◽  
Borka Jerman Blažič

This paper presents a novel approach to education in the area of digital forensics based on a multi-platform cloud-computer infrastructure and an innovative computer based tool. The tool is installed and available through the cloud-based infrastructure of the Dynamic Forensic Education Alliance. Cloud computing provides an efficient mechanism for a wide range of services that offer real-life environments for teaching and training cybersecurity and digital forensics. The cloud-based infrastructure, the virtualized environment and the developed educational tool enable the construction of a dynamic e-learning environment making the training very close to reality and to real-life situations. The paper presents the Dynamic Forensic Digital tool named EduFors and describes the different levels of college and university education where the tool is introduced and used in the training of future investigators of cybercrime events.


Author(s):  
R. K. Adhikari ◽  
P. P. Regmi ◽  
R. B Thapa ◽  
Y. D. G.C. ◽  
E. Boa

 This paper identified and examined the internal and external forces that enable or inhibit the performance of plant clinics in Nepal. The study used web-based online survey tool to collect primary information. Likert scaling and indexing techniques were used on data analysis. Pretested set of questionnaires were mailed to 209 plant doctors and the response rate was 54.54%. Being ninth country to initiate plant health clinics, Nepal is successful to adapt this novel approach into the existing extension system. It has increased access to plant health services by providing wide range of services at a place. However,limited understanding and only profit motive of local private agro-vet and input dealers has created some biased-understanding and un-trust with clinic organizers. This SWOT analysis clearly spells the scope of plant clinics to fulfill the gap between farmers need and existing services provided by public extension system.Journal of the Institute of Agriculture and Animal Science.Vol. 33-34, 2015, page: 137-146


with the changing technology customers are more aware of services available to them. They access wide range of information of available products and services which has lead to change in their perception about services and service providers. This has made telecom a hard sector to survive for telecom service providers. These changes in behavioral intentions has made it necessary to us understand what all services customers feel a mandatory part of telecom service and what attract them to reuse the service. To study these customers needs Kano model was applied to category services of SERVQUAL model on four quadrant - attractive, one dimensional, must-be and indifferent. The result stated that network performance attract telecom customers the most and tangibility factors are the ones which service providers can minimize as customers are indifferent about them. Safety and security in transaction is one dimensional factor that can increase customer satisfaction. Must be attributes need to be continued to maintained customers stay with the telecom brands. Thus study tried to understand behavior of customers and identify factors that could increase customer satisfaction.


2017 ◽  
Author(s):  
Charlie W. Zhao ◽  
Mark J. Daley ◽  
J. Andrew Pruszynski

AbstractFirst-order tactile neurons have spatially complex receptive fields. Here we use machine learning tools to show that such complexity arises for a wide range of training sets and network architectures, and benefits network performance, especially on more difficult tasks and in the presence of noise. Our work suggests that spatially complex receptive fields are normatively good given the biological constraints of the tactile periphery.


Author(s):  
PAULINE RAHMIATI ◽  
DWI ARYANTA ◽  
TAUFIQ AGUNG PRIYADI

ABSTRAKOSPF (Open Shortest Path First) adalah suatu routing protokol bersifat terbuka dan didukung oleh berbagai perangkat network. IPv4 telah mencapai batas maksimum dalam jumlah alamat sehingga IPv6 merupakan solusi dalam hal tersebut. Seperti IPv4, IPv6 juga sudah mulai diimplementasikan untuk routing protokol OSPF, oleh karena itu pada penelitian ini akan dirancang suatu routing protokol OSPF IPv6 dan sebagai bahan perbandingan akan dibandingkan dengan OSPF IPv4. Software Cisco Packet Tracer 5.3 digunakan untuk mensimulasikan perancangan jaringan yang dibuat. Pada penelitian ini akan dibandingkan 2 buah jaringan berbasis routing protokol OSPF, yaitu OSPF untuk IPv4 dan IPv6. Skenario pertama dilakukan 100 kali dalam 5 kasus untuk mengetahui nilai delay OSPF IPv4 dan OSPF IPv6. Skenario kedua dilakukan pemutusan link dilakukan sebanyak 30 kali, hal yang dilihat dari pengujian ini adalah hasil trace route dari cost yang ada. Skenario ketiga dilakukan dengan mengamati waktu konvergensi dari OSPF IPv4 dan IPv6. Secara keseluruhan nilai delay OSPF IPv6 lebih kecil dibandingkan dengan OSPF IPv4 sebesar 3-6%, Trace route dan nilai cost pada OSPF IPv6 dan OSPF IPv4 sama tetapi nilai delay OSPF IPv6 lebih kecil sebesar 3-6% dan waktu konvergensi OSPF IPv4 bernilai sama dengan OSPF IPv6 yaitu 10 detik.Kata kunci: OSPF, IPv4, Ipv6, delay, konvergensiABSTRACTOSPF (Open Shortest Path First) is a routing protocol that opened and supported by a wide range of network devices. IPv4 has reached the maximum limit on the number of addresses that IPv6 are a solution in this case. Same as IPv4, IPv6 also has begun to be implemented for the OSPF routing protocol, therefore this study wiould design an IPv6 OSPF routing protocol and as a comparison will be compared to IPv4 OSPF. Cisco Packet Tracer 5.3 software was used to simulate the made network design. This research would compare two pieces of network-based routing protocol OSPF, OSPF for IPv4 and IPv6. The first scenario was done 100 times in of 5 cases to determine the value of delay OSPF OSPF IPv4 and IPv6. The second scenario was carried out link terminations 30 times, it was seen from the tests was the result of trace route from the existing cost. The third scenario was done by observed at the convergence time of OSPF IPv4 and IPv6. The overall delay value OSPF IPv6 better than IPv4 OSPF by 3-6%, the trace route and the OSPF cost value of IPv6 and IPv4 OSPF were same but delay OSPF IPv6 was better 3-6% and convergence time was the same as IPv4 OSPF OSPF IPv6 as 10 seconds.Keywords: OSPF, IPv4, IPv6, delay, convergence


2021 ◽  
Author(s):  
Anne M Luescher ◽  
Julian Koch ◽  
Wendelin J Stark ◽  
Robert N Grass

Aerosolized particles play a significant role in human health and environmental risk management. The global importance of aerosol-related hazards, such as the circulation of pathogens and high levels of air pollutants, have led to a surging demand for suitable surrogate tracers to investigate the complex dynamics of airborne particles in real-world scenarios. In this study, we propose a novel approach using silica particles with encapsulated DNA (SPED) as a tracing agent for measuring aerosol distribution indoors. In a series of experiments with a portable setup, SPED were successfully aerosolized, re-captured and quantified using quantitative polymerase chain reaction (qPCR). Position-dependency and ventilation effects within a confined space could be shown in a quantitative fashion achieving detection limits below 0.1 ng particles per m3 of sampled air. In conclusion, SPED show promise for a flexible, cost-effective and low-impact characterization of aerosol dynamics in a wide range of settings.


Sign in / Sign up

Export Citation Format

Share Document