Adaptive Handoff Algorithm for Efficient Network Resource Utilization in Mobile Internet Environments

2003 ◽  
Vol 04 (03) ◽  
pp. 361-375
Author(s):  
Satoshi Ohzahata ◽  
Shigetomo Kimura ◽  
Yoshihiko Ebihara
Keyword(s):  
Mobile Ip ◽  
Base Station ◽  
Mobile Internet ◽  
Mobile Nodes ◽  
Network Resources ◽  
Simulation Experiments ◽  
Network Resource ◽  
Decision Mechanism ◽  
Blocking Rate ◽  
Network Utilization

In this paper, we propose an adaptive handoff algorithm based on the "threshold-with-hysteresis." In general, such handoff algorithms are proposed to improve their handoff decision mechanism for only one user. Our algorithm aims to provide efficient network utilization and effect for all users. The proposed method dynamically changes the timing of handoff by the number of calls in the base station (BS). In our algorithm, when a BS has quite many calls, each MN tends to easily go out from the cell. On the other hand, in case that the BS is less crowded, every MN tries to keep the current connection as long as possible. From above control, the network resource is efficiently used, because our proposed method works as if the network resources are traded among the adjacent BSs. To implement our algorithm in Mobile IP, we also propose a system architecture with QoS mechanism. To realize the handoff decision based on the mobile nodes, the periodical agent advertisements in Mobile IP include information of the congestion status at the BS for our algorithm. The simulation experiments show that our proposed algorithm improves the average handoff blocking rate without decreasing throughput of the entire networks.

scholarly journals An Efficient Network Resource Management in SDN for Cloud Services

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1556
Author(s):  
Myunghoon Jeon ◽  
Namgi Kim ◽  
Yehoon Jang ◽  
Byoung-Dai Lee
Keyword(s):  
Cloud Services ◽  
Computing Technology ◽  
Network Efficiency ◽  
Network Resources ◽  
Network Resource ◽  
Service Flow ◽  
Network Utilization ◽  
Network Resource Management ◽  
Flow Information

With the recent advancements in cloud computing technology, the number of cloud-based services has been gradually increasing. Symmetrically, users are asking for quality of experience (QoE) to be maintained or improved. To do this, it has become necessary to manage network resources more efficiently inside the cloud. Many theoretical studies for improving the users’ QoE have been proposed. However, there are few practical solutions due to the lack of symmetry between implementation and theoretical researches. Hence, in this study, we propose a ranking table-based network resource allocation method that dynamically allocates network resources per service flow based on flow information periodically collected from a software defined network (SDN). It dynamically identifies the size of the data transmission for each service flow on the SDN and differentially allocates network resources to each service flow based on this size. As a result, it maintains the maximum QoE for the user by increasing the network utilization. The experimental results show that the proposed method achieves 29.4% higher network efficiency than the general Open Shortest Path First (OSPF) method on average.

scholarly journals Artificial Intelligence Control Logic in Next-Generation Programmable Networks

2021 ◽  
Vol 11 (19) ◽  
pp. 9163
Author(s):  
Mateusz Żotkiewicz ◽  
Wiktor Szałyga ◽  
Jaroslaw Domaszewicz ◽  
Andrzej Bąk ◽  
Zbigniew Kopertowski ◽  
...  
Keyword(s):  
Artificial Intelligence ◽  
Bandwidth Allocation ◽  
Network Performance ◽  
Next Generation ◽  
Control Logic ◽  
Network Resources ◽  
Network Resource ◽  
Programmable Networks ◽  
Network Utilization ◽  
Effective Network

The new generation of programmable networks allow mechanisms to be deployed for the efficient control of dynamic bandwidth allocation and ensure Quality of Service (QoS) in terms of Key Performance Indicators (KPIs) for delay or loss sensitive Internet of Things (IoT) services. To achieve flexible, dynamic and automated network resource management in Software-Defined Networking (SDN), Artificial Intelligence (AI) algorithms can provide an effective solution. In the paper, we propose the solution for network resources allocation, where the AI algorithm is responsible for controlling intent-based routing in SDN. The paper focuses on the problem of optimal switching of intents between two designated paths using the Deep-Q-Learning approach based on an artificial neural network. The proposed algorithm is the main novelty of this paper. The Developed Networked Application Emulation System (NAPES) allows the AI solution to be tested with different patterns to evaluate the performance of the proposed solution. The AI algorithm was trained to maximize the total throughput in the network and effective network utilization. The results presented confirm the validity of applied AI approach to the problem of improving network performance in next-generation networks and the usefulness of the NAPES traffic generator for efficient economical and technical deployment in IoT networking systems evaluation.

scholarly journals A Comprehensive Analysis of QoS in Wired and Wireless SDN Based on Mobile IP

2021 ◽  
Vol 13 (5) ◽  
pp. 18-28
Author(s):  
Nazrul Islam ◽  
◽  
Md. Habibur Rahman ◽  
Mostofa Kamal Nasir
Keyword(s):  
Quality Of Service ◽  
Wireless Network ◽  
Task Force ◽  
Mobile Ip ◽  
Mobile Internet ◽  
Large Network ◽  
Mobile Nodes ◽  
Mobile Internet Protocol ◽  
Primary Focus

Software-Defined Networking (SDN) is the new network paradigm whose primary focus is to create a dynamic, scalable and flexible network. It provides programmable functions for implementation of network configuration management. The demand for wireless network functionality is rising simultaneously. Mobility management for a large network is an issue in Internet Engineering Task Force (IETF). There are also a number of solutions to support mobility within the network. The Mobile Internet Protocol (MIP) is used for managing mobility. Furthermore, for the SDN platform, mobility adds roaming capability for mobile nodes in the software-defined wireless network (SDWN). In the wired scenario, SDN has different capabilities to deliver network services according to the fixed node. This study provides a quality of service (QoS) analysis in both SDN and SDWN. Mininet WiFi and RYU network emulator as a controller is used to implement the mobility API. The random walk model is applied as mobility functionality toward the final nodes. Moreover, several QoS measurement matrices are analyzed according to the network topology. At the end, round trip time (RTT), cumulative distributed function (CDF), packet loss and throughput are analyzed for quality of service comparable in the SDN and SDWN scenarios according to the MIP.

Software Defined Cognitive Radio Network Framework

2015 ◽  
Vol 7 (1) ◽  
pp. 15-31 ◽  
Author(s):  
Yaser Jararweh ◽  
Mahmoud Al-Ayyoub ◽  
Ahmad Doulat ◽  
Ahmad Al Abed Al Aziz ◽  
Haythem A. Bany Salameh ◽  
...  
Keyword(s):  
Cognitive Radio ◽  
Resource Management ◽  
Dynamic Spectrum Access ◽  
Network Performance ◽  
Base Station ◽  
Network Resources ◽  
Network Resource ◽  
Management Framework ◽  
Control Overhead ◽  
Control Scheme

Software defined networking (SDN) provides a novel network resource management framework that overcomes several challenges related to network resources management. On the other hand, Cognitive Radio (CR) technology is a promising paradigm for addressing the spectrum scarcity problem through efficient dynamic spectrum access (DSA). In this paper, the authors introduce a virtualization based SDN resource management framework for cognitive radio networks (CRNs). The framework uses the concept of multilayer hypervisors for efficient resources allocation. It also introduces a semi-decentralized control scheme that allows the CRN Base Station (BS) to delegate some of the management responsibilities to the network users. The main objective of the proposed framework is to reduce the CR users' reliance on the CRN BS and physical network resources while improving the network performance by reducing the control overhead.

A Optimization Traffic Grooming Algorithm Based on Bidirectional SONET Ring Topology Network

2015 ◽  
Vol 727-728 ◽  
pp. 996-999 ◽  
Author(s):  
Su Xia Cui
Keyword(s):  
Resource Utilization ◽  
Network Performance ◽  
Minimum Weight ◽  
Routing Algorithm ◽  
Traffic Grooming ◽  
Network Routing ◽  
Ring Network ◽  
Network Resource ◽  
Blocking Rate ◽  
The Impact

The issue of WDM network traffic grooming has been a hot in the field of research. The implementation of traffic grooming technology can improve the utilization of wavelength channels, reducing the link delay and the blocking rate of the network, which to improve network resource utilization and optimize network performance. This article mainly studies all-optical network routing algorithm utilizing WDM technology to achieve the dynamic traffic grooming and propose a optimization grooming policy -HaffmanGroom (M) algorithms which based on SONET / WDM ring network. The most important feature of this algorithm is that the SONET / WDM ring network of multiple multicast request packet , with a minimum weight of the light path priority selection method, the flow of requests each group effectively optimize ease . The algorithm takes into account the impact of the link request factor and link hops to optimize the link selection. The simulation results show that under the conditions of factors and the number of hop a request fully consider the impact of these two factors to the link, and can achieve optimal link with the smallest weights for effective data transmission, improving resource utilization, reducing blocking rate in order to achieve the purpose of optimizing network performance.

Network resource mobilisation limitations and the alliance portfolio network

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Luis Miguel Bolivar ◽  
Ignacio Castro-Abancéns ◽  
Cristóbal Casanueva ◽  
Angeles Gallego
Keyword(s):  
Financial Performance ◽  
Curvilinear Relationship ◽  
Network Resources ◽  
Network Resource ◽  
Alliance Portfolio ◽  
Value Capture ◽  
Content Type ◽  
Network Parameters ◽  
Resource Mobilisation ◽  
Practical Implications

PurposeThe purpose of this study is to examine how access and mobilisation of network resources influence a firm's performance. It has been established that alliance portfolio (AP) network parameters shape the access to network resources; however, resource access understood as value creation differs from resource mobilisation understood as value capture. Hence, the paper contributes towards the comprehension of AP performance by examining the extent to which a firm's level of network resource mobilisation (NRM) plays a role in improving financial performance and how this strategy conditions the benefits obtained from a firm's AP.Design/methodology/approachThis study employs an interorganisational network approach to describe the APs of firms; subsequently, it examines how AP network parameters and resource mobilisation determine financial performance. To this end, sequential multiple regression models are applied to a sample from the Top International Airlines database, covering 135 portfolios that correspond to 1117 codeshare partnerships.FindingsThe analyses show that the NRM level has an inverted U-shaped relationship with revenue performance, thereby revealing the limitations and considerations in the strategic alliance strategy. In addition, the authors show how the resource mobilisation decision moderates the faculty of AP parameters to influence a firm's financial performance, thereby exposing the nuanced relationship between AP size, diversity and redundancy. The findings convey strategic and practical implications for managers regarding how to capture value from their APs.Practical implicationsThe findings suggest the need for NRM to form part of a firm's AP management capability, so that, by acquiring superior strategic knowledge in NRM, the firm is able to extract value from its AP through the optimal exploitation of complementary assets.Originality/valuePrevious research has highlighted the multidimensional nature of APs at the theoretical level; however, no simultaneous empirical analysis of various AP parameters has yet been produced. The research empirically analyses an AP network and how its parameters affect financial performance in the presence of a resource mobilisation strategy. Not only do the authors introduce the analysis of the curvilinear relationship between the level of NRM and a firm's performance, but also of its role in advancing the AP literature.

scholarly journals An Effective and Efficient Adaptive Probability Data Dissemination Protocol in VANET

Data ◽  
2018 ◽  
Vol 4 (1) ◽  
pp. 1 ◽  
Author(s):  
John Sospeter ◽  
Di Wu ◽  
Saajid Hussain ◽  
Tesfanesh Tesfa
Keyword(s):  
Data Dissemination ◽  
Probabilistic Approach ◽  
Mobile Network ◽  
Delivery Ratio ◽  
Network Resources ◽  
Network Resource ◽  
V2v Communication ◽  
End To End Delay ◽  
End To End ◽  
Road Segments

Mobile network topology changes dynamically over time because of the high velocity of vehicles. Therefore, the concept of the data dissemination scheme in a VANET environment has become an issue of debate for many research scientists. The main purpose of VANET is to ensure passenger safety application by considering the critical emergency message. The design of the message dissemination protocol should take into consideration effective data dissemination to provide a high packet data ratio and low end-to-end delay by using network resources at a minimal level. In this paper, an effective and efficient adaptive probability data dissemination protocol (EEAPD) is proposed. EEAPD comprises a delay scheme and probabilistic approach. The redundancy ratio (r) metric is used to explain the correlation between road segments and vehicles’ density in rebroadcast probability decisions. The uniqueness of the EEAPD protocol comes from taking into account the number of road segments to decide which nodes are suitable for rebroadcasting the emergency message. The last road segment is considered in the transmission range because of the probability of it having small vehicle density. From simulation results, the proposed protocol provides a better high-packet delivery ratio and low-packet drop ratio by providing better use of the network resource within low end-to-end delay. This protocol is designed for only V2V communication by considering a beaconless strategy. the simulations in this study were conducted using Ns-3.26 and traffic simulator called “SUMO”.

A Discovery Technology Based on Distributed Resource Management Domain

2015 ◽  
Vol 713-715 ◽  
pp. 2195-2198
Author(s):  
Jun Li Mao ◽  
Xiang Luo ◽  
Xiao Zhen Wang ◽  
Chao Hong Yang
Keyword(s):  
Resource Management ◽  
Resource Selection ◽  
Resource Discovery ◽  
Network Resources ◽  
Network Resource ◽  
Management Domain ◽  
Network Resource Management ◽  
Long Time ◽  
Resource Organization ◽  
Resource Description

Resource discovery is the key of network resource management, which includes multiple aspects, such as resource description, resource organization, and resource discovery and resource selection. For a long time, communication network resourcehas been lack of unified and standardized description, causing users difficult to precisely find related resources in demand. This paper presents a distributed resource query methods based on management domain, including distributed resource query architecture, the basic process of resource discovery, update method,query methods and so on. The method of network resources makes use of collaborative queries to realize network resource discovery according to need.

scholarly journals Blocking Probability in Pipeline Forwarding Networks

2014 ◽  
Vol 10 (1) ◽  
pp. 30
Author(s):  
Mario Baldi ◽  
Andrea Vesco
Keyword(s):  
Proper Time ◽  
Blocking Probability ◽  
Network Routing ◽  
Analytical Models ◽  
Network Resources ◽  
High Resource ◽  
Delay Sensitive ◽  
Network Utilization ◽  
Real Size ◽  
Time Frames

As multimedia communications continue to grow steadily on the Internet, pipeline forwarding (PF) of packets provides a scalable solution for engineering delay-sensitive traffic while guaranteeing deterministic Quality of Service (QoS) with high resource utilization. In PF networks resource reservation, while ensuring deterministic QoS on a per-flow basis, can result in a not null blocking probability. A reservation request may fails due to enough resources being available but not during the proper time frames. This work analyses blocking probability of reservation requests since it affects the capability of utilizing network resources to carry traffic with deterministic QoS. The blocking probability and, consequently, the achievable network utilization are analytically derived on general topology PF networks as function of the traffic intensity given the traffic matrix and the network routing. The correctness of the blocking models is also assessed by simulation in different scenarios. This work represent a valuable contribution over previous analytical models of the blocking probability as their application to real size scenarios is impractical due to their computation complexity.

scholarly journals An Edge-Based Approach for Virtual Network Embedding Based on the Graph Edit Distance

2021 ◽  
Author(s):  
Ze Xi Xu ◽  
Lei Zhuang ◽  
Meng Yang He ◽  
Si Jin Yang ◽  
Yu Song ◽  
...  
Keyword(s):  
Edit Distance ◽  
Virtual Network ◽  
Cost Ratio ◽  
Virtual Network Embedding ◽  
Network Embedding ◽  
Graph Edit Distance ◽  
Network Resources ◽  
Network Resource ◽  
Distance Method ◽  
Edge Based

Abstract Virtualization and resource isolation techniques have enabled the efficient sharing of networked resources. How to control network resource allocation accurately and flexibly has gradually become a research hotspot due to the growth in user demands. Therefore, this paper presents a new edge-based virtual network embedding approach to studying this problem that employs a graph edit distance method to accurately control resource usage. In particular, to manage network resources efficiently, we restrict the use conditions of network resources and restrict the structure based on common substructure isomorphism and an improved spider monkey optimization algorithm is employed to prune redundant information from the substrate network. Experimental results showed that the proposed method achieves better performance than existing algorithms in terms of resource management capacity, including energy savings and the revenue-cost ratio.

Sign in / Sign up

Export Citation Format

Share Document