scholarly journals A Fat Client OS Architecture Supported by Semi-network Resources

2022 ◽  
Vol 6 ◽  
pp. 857-876
Author(s):  
Yin Sheng Zhang ◽  
Keyword(s):  
Data Processing ◽  
Shared Resources ◽  
Network Resources ◽  
Network Resource ◽  
Local Resources ◽  
Hardware Resource ◽  
The Stability ◽  
Storage Place ◽  
Security Verification

Purpose–This study is to explore a way toretainthe strengths and eliminatethe weaknesses of the existingarchitecture oflocal OS and cloud OS,then create an innovativeone, which is referredto as semi-network OS architecture.Method–The elements of semi-network OS architecture includes networkresources, localresources, and semi-mobile hardware resources; among them, networkresources are the expanded portionof OS, which is used to ensure the scalability of OS; local resources are the base portion of OS, which is used to ensure the stability of local computing, as well as the autonomy of user operations; the semi-mobile hardware resource is OSPU, which is used to ensure the positioning and security of dataflow.Results–Thefat client OS relies on the network shared resources,local exclusive resources,and semi-mobilehardware resources (OSPU), not relies solely on a single resource, to perform its tasks on a fat client, in thisarchitecture, most of the system files of OS on a fat client isderived from OS server, which is a network shared resources, and the rest of system files of OS is derived from OSPUof a fat client, which is a non-network resource, so the architecture of OShas "semi-network" attribute, wherein the OSPU is a key subordinate component for data processing and security verification,the OS server is a storage place rather than operating a placeof system files, and system files that stored on a server can only be downloaded to a fat client to carry out their mission.Conclusion–A complete OS is divided into base portion and expanded portion, and this "portion" division of OS enables a fat client to be dually supported by remote network resources and local non-network resources, therefore, it is expected to make a fat client more flexible, safer and more reliable, and more convenient to be operated.

Game Theory for Wireless Network Resource Management

Game Theory ◽  
2017 ◽  
pp. 383-399
Author(s):  
Sungwook Kim
Keyword(s):  
Game Theory ◽  
Computer Network ◽  
Limited Resource ◽  
Shared Resources ◽  
Network Resources ◽  
Network Resource ◽  
Network Bandwidth ◽  
Competitive Game ◽  
Network Usage ◽  
Fair Sharing

Computer network bandwidth can be viewed as a limited resource. The users on the network compete for that resource. Their competition can be simulated using game theory models. No centralized regulation of network usage is possible because of the diverse ownership of network resources. Therefore, the problem is of ensuring the fair sharing of network resources. If a centralized system could be developed which would govern the use of the shared resources, each user would get an assigned network usage time or bandwidth, thereby limiting each person's usage of network resources to his or her fair share. As of yet, however, such a system remains an impossibility, making the situation of sharing network resources a competitive game between the users of the network and decreasing everyone's utility. This chapter explores this competitive game.

Game Theory for Wireless Network Resource Management

2014 ◽  
pp. 188-203
Keyword(s):  
Game Theory ◽  
Computer Network ◽  
Limited Resource ◽  
Shared Resources ◽  
Network Resources ◽  
Network Resource ◽  
Network Bandwidth ◽  
Competitive Game ◽  
Network Usage ◽  
Fair Sharing

Computer network bandwidth can be viewed as a limited resource. The users on the network compete for that resource. Their competition can be simulated using game theory models. No centralized regulation of network usage is possible because of the diverse ownership of network resources. Therefore, the problem is of ensuring the fair sharing of network resources. If a centralized system could be developed which would govern the use of the shared resources, each user would get an assigned network usage time or bandwidth, thereby limiting each person's usage of network resources to his or her fair share. As of yet, however, such a system remains an impossibility, making the situation of sharing network resources a competitive game between the users of the network and decreasing everyone's utility. This chapter explores this competitive game.

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 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.

scholarly journals Proposed statistical-based approach for detecting distribute denial of service against the controller of software defined network (SADDCS)

2018 ◽  
Vol 218 ◽  
pp. 02012 ◽  
Author(s):  
Mohammad A. AL-Adaileh ◽  
Mohammed Anbar ◽  
Yung-Wey Chong ◽  
Ahmed Al-Ani
Keyword(s):  
Statistical Analysis ◽  
Denial Of Service ◽  
Attack Detection ◽  
Detection Accuracy ◽  
Ddos Attacks ◽  
Large Area ◽  
Network Resources ◽  
Network Resource ◽  
High Bandwidth ◽  
Sdn Controller

Software-defined networkings (SDNs) have grown rapidly in recent years be-cause of SDNs are widely used in managing large area networks and securing networks from Distributed Denial of Services (DDoS) attacks. SDNs allow net-works to be monitored and managed through centralized controller. Therefore, SDN controllers are considered as the brain of networks and are considerably vulnerable to DDoS attacks. Thus, SDN controller suffer from several challenges that exhaust network resources. For SDN controller, the main target of DDoS attacks is to prevent legitimate users from using a network resource or receiving their services. Nevertheless, some approaches have been proposed to detect DDoS attacks through the examination of the traffic behavior of networks. How-ever, these approaches take too long to process all incoming packets, thereby leading to high bandwidth consumption and delays in the detection of DDoS at-tacks. In addition, most existing approaches for the detection of DDoS attacks suffer from high positive/negative false rates and low detection accuracy. This study proposes a new approach to detecting DDoS attacks. The approach is called the statistical-based approach for detecting DDoS against the controllers of software-defined networks. The proposed approach is designed to detect the presence of DDoS attacks accurately, reduce false positive/negative flow rates, and minimize the complexity of targeting SDN controllers according to a statistical analysis of packet features. The proposed approach passively captures net-work traffic, filters traffic, and selects the most significant features that contribute to DDoS attack detection. The general stages of the proposed approach are (i) da-ta preprocessing, (ii) statistical analysis, (iii) correlation identification between two vectors, and (iv) rule-based DDoS detection.

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.

Possible Social Factors in the Exchange System of the Prehistoric Maya

1973 ◽  
Vol 38 (4) ◽  
pp. 486-489 ◽  
Author(s):  
Barbara Voorhies
Keyword(s):  
Social Factors ◽  
Exchange System ◽  
Local Resources ◽  
The Stability

AbstractPrevious discussions of the exchange system of the prehistoric Maya have been based on the assumption that their uniform environment prevented inter-group exchange of local resources. The validity of this assumption is questioned and the stability of primitive exchange systems is examined.

Data Processing in Bifurcation Analysis of Maps with Time-Delays in the Frequency Domain

2014 ◽  
Vol 685 ◽  
pp. 634-637
Author(s):  
Li Zeng ◽  
Jun Wei Wang
Keyword(s):  
Data Processing ◽  
Frequency Domain ◽  
Time Delays ◽  
Period Doubling ◽  
Feedback Systems ◽  
Bifurcation Solution ◽  
Nonlinear Maps ◽  
The Stability ◽  
Frequency Domain Approach ◽  
Period Doubling Bifurcations

A unified frequency-domain approach to analyze the NS (Neimark-Sacker) bifurcations and the period-doubling bifurcations of nonlinear maps with time-delays in the linear feed-forward term is presented. The technique relies on the HBA (harmonic balance approximation, a very important method in data processing ) and feedback systems theory. The expressions of the bifurcation solution and the stability are derived.

Sign in / Sign up

Export Citation Format

Share Document