Server Location Research Articles

Shield Advanced Mitigation System of Distributed Denial of Service Attack in integration of Internet of Things and Cloud Computing Environment

Cloud services among public and business companies have become popular in recent years. For production activities, many companies rely on cloud technology. Distributed Denial of Services (DDoS) attack is an extremely damaging general and critical type of cloud attacks. Several efforts have been made in recent years to identify numerous types of DDoS attacks. This paper discusses the different types of DDoS attacks and their cloud computing consequences. Distributed Denial of Service attack (DDoS) is a malicious attempt to disrupt the normal movement of a targeted server, service or network through influx of internet traffic overwhelming the target or its infrastructure. The use of multiple affected computer systems as a source of attacks makes DDoS attacks effective. Computers and other networked tools, including IoT phones, may be included on exploited machines. A DDoS attack from a high level resembles a traffic jam that is caused by roads that prevents normal travel at their desired destination. So DDoS Attack is a major challenging problem in integrated Cloud and IoT. Hence, this paper proposes Shield Advanced Mitigation System of Distributed Denial of Service Attack in the integration of Internet of Things and Cloud Computing Environment. This secure architecture use two verification process to identify whether user is legitimate or malicious. Dynamic Captcha Testing with Equal Probability test for first verification process, moreover Zigsaw Image Puzzle Test is used for second verification process, and Intrusion Detection Prevention System is used to identify and prevent malicious user, moreover reverse proxy is used to hide server location. These functional components and flow could strengthen security in Client side network to provide cloud services furthermore to overcome distributed denial of service attack in the integration of Internet of Things and Cloud Environment.

Cache Servers Placement Based on Important Switches for SDN-Based ICN

In centralized cache management for SDN-based ICN, it is an optimization problem to compute the location of cache servers and takes a longer time. We solve this problem by proposing to use singular-value-decomposition (SVD) and QR-factorization with column pivoting methods of linear algebra as follows. The traffic matrix of the network is lower-rank. Therefore, we compute the most important switches in the network by using SVD and QR-factorization with column pivoting methods. By using real network traces, the results show that our proposed approach reduces the computation time significantly, and also decreases the traffic overhead and energy consumption as compared to the existing approach.

Cost minimization in placing service chains for virtualized network functions

SummaryNetwork function virtualization (NFV) places network functions onto the virtual machines (VMs) of physical machines (PMs) located in data centers. In practice, a data flow may pass through multiple network functions, which collectively form a service chain across multiple VMs residing on the same or different PMs. Given a set of service chains, network operators have two options for placing them: (a) minimizing the number of VMs and PMs so as to reduce the server rental cost or (b) placing VMs running network functions belonging to the same service chain on the same or nearby PMs so as to reduce the network delay. In determining the optimal service chain placement, operators face the problem of minimizing the server cost while still satisfying the end‐to‐end delay constraint. The present study proposes an optimization model to solve this problem using a nonlinear programming (NLP) approach. The proposed model is used to explore various operational problems in the service chain placement field. The results suggest that the optimal cost ratio for PMs with high, hybrid, and low capacity, respectively, is equal to 4:2:1. Meanwhile, the maximum operating utilization rate should be limited to 55% in order to minimize the rental cost. Regarding quality of service (QoS) relaxation, the server cost reduces by 20%, 30%, and 32% as the end‐to‐end delay constraint is relaxed from 40 to 60, 80, and 100 ms, respectively. For the server location, the cost decreases by 25% when the high‐capacity PMs are decentralized rather than centralized. Finally, the cost reduces by 40% as the repetition rate in the service chain increases from 0 to 2. A heuristic algorithm, designated as common sub chain placement first (CPF), is proposed to solve the service chain placement problem for large‐scale problems (eg, 256 PMs). It is shown that the proposed algorithm reduces the solution time by up to 86% compared with the NLP optimization model, with an accuracy reduction of just 8%.

Cloud computing adoption and its impact on SMEs’ performance for cloud supported operations: A dual-stage analytical approach

This paper investigates the key predictors of cloud computing adoption, and further, assesses how cloud computing adoption affects small and medium enterprises' (SMEs') performance. To test the proposed model, we have applied a dual-stage analytical approach by combining structural equation modeling (SEM) and artificial neural network (ANN). SEM results reveal that relative advantage, service quality, perceived risks, top management supports, facilitating conditions, cloud providers influence, server location, computer self-efficacy, and resistance to change have a significant effect on the adoption of cloud computing. Also, this study confirms the positive impact of cloud computing adoption on firm performance. The results of importance-performance map analysis (IPMA) suggest that managerial actions should focus more on improving perceived risk, relative advantage, and top management support. Besides, the results of neural network analysis indicate that the most significant predictor of cloud adoption is server location followed by facilitating conditions, relative advantage, service quality, top management support, computer self-efficacy, perceived risks, cloud provider's influence, and resistance to change. We also discuss the implications of the research that can assist researchers, owners/managers, policymakers, and cloud providers by offering valuable insights regarding cloud computing adoption in SMEs.

Detection Method of Fast Flux Service Network Based on Decision Tree Algorithm

Fast Flux service network is the main threats to network security at present. By quickly changing IP address, the location of servers can be hidden and agents can be provided for botnet. In this paper, a detection method of fast flux service network is proposed, which narrows the detection range through pretreatment, then constructs the detection features, and accurately distinguishes FFSN from legitimate network. Finally, decision tree algorithm is used to obtain the ideal results.

Database Migration using Data Synchronization and Transactional Replication

Database migration is one of the important thing to make the data can be stored optimally and minimize risk of data lost. Data Synchronization and Transactional Replication can be used to do it. Transactional Replication is working on services area to migrate database stored in cloud to another cloud storage. Data Synchronization is used to synchronize migrated database with origin database. Data lost concerns remain as the big consideration to widespread the adoption. Many ways can be done to minimize the risks, one of them is by migrate the database that is already stored in cloud to another database in cloud. This research will conduct database migration using data synchronization and transaction replication. By using Azure and Amazon Web Services as Database Migration Services, these techniques allow SQL Database data to be easily replicated, and allows multiple SQL Databases to isolate mission-critical workloads from analytic queries that run relatively longer. The evaluation is by comparing these two migration services based on the synchronizing time of full loaded database migration. Migration result shows that database migration using transactional replication and data synchronization is influenced by the number of rows as well as size of the table, server location, also uploading and downloading speed in each database migration service.

Principles for Determining Territorial Jurisdiction of the State in Cyberspace

The paper is devoted to the conditions of realization of sovereignty and jurisdiction of the state in respect of extraterritorial information and communication space on the platform of cyberspace. The author attempts to consider the constructability of the concept of «territory of the state», the legal meaning of which is to determine the spatial limits of the territorial sovereignty and full jurisdiction of the state in relation to cyberspace. The paper examines the extent to which Russian law reflects the principles of establishing jurisdiction based on the principle of server location and domain name registration proposed in the foreign and Russian doctrine. The author also raises a question whether the solution of the jurisdictional issue in relation to the national segment of the Internet is covered by the attempt of the centralized management of the Internet, i.e. the creation of a national system of routing Internet traffic in order to establish protective measures to ensure long-term and sustainable operation of the Internet network in Russia, regardless of external or internal conditions, in the bill «On amendments to the Federal law «On communications» and the Federal law «On information, information technology and information protection» adopted in the third reading by the State Duma on April 16, 2019.

Security and Controlling System at Home by using GSM Technology

Home security framework is required for comfort and wellbeing. Security is one of the fundamental worry of the present day. In this present universe of innovative progression legitimate measure ought to be taken to keep up the security and the solace of homes, banks and workplaces. By utilizing legitimate security frameworks billions of rupees spent on offices like fire detachment, police, and so forth can be controlled. With the help of internet electrical devices can be monitored for use which were reported in literature using firmwares. These in turn could be done using Smart Switch. For linking purpose internet is necessary and accessed through computers but all these require programming using internet protocol. The server associated with switch should have the information of the network being used by the user. The mode of operation should be involuntary and data should be entered by the user after selecting the type of safety required. Furthermore, after the necessary things have been sent, the user will have to again start the switch for availing the internet and operate the switch suitably by sending “1/0”. The core of all these is the availability of internet with the user. But in developing countries like India where there is no internet facility or very poor internet speed it becomes very important that an alternate system is also in place i.e, it should also be done with the help of local network without the use of internet. One more drawback with using internet is the server location and date security. It should not be hacked through internet. To avoid these drawbacks we are going to implement these systems by using GSM technology and it works via Short Messaging Service (SMS) based on alert system.

Optimized Provisioning of Edge Computing Resources With Heterogeneous Workload in IoT Networks

The proliferation of smart connected Internet of Things (IoT) devices is bringing tremendous challenges in meeting the performance requirement of their supported real-time applications due to their limited resources in terms of computing, storage, and battery life. In addition, the considerable amount of data they generate brings extra burden to the existing wireless network infrastructure. By enabling distributed computing and storage capabilities at the edge of the network, multi-access edge computing (MEC) serves delay sensitive, computationally intensive applications. Managing the heterogeneity of the workload generated by IoT devices, especially in terms of computing and delay requirements, while being cognizant of the cost to network operators, requires an efficient dimensioning of the MEC-enabled network infrastructure. Hence, in this paper, we study and formulate the problem of MEC resource provisioning and workload assignment for IoT services (RPWA) as a mixed integer program to jointly decide on the number and the location of edge servers and applications to deploy, in addition to the workload assignment. Given its complexity, we propose a decomposition approach to solve it which consists of decomposing RPWA into the delay aware load assignment sub-problem and the mobile edge servers dimensioning sub-problem. We analyze the effectiveness of the proposed algorithm through extensive simulations and highlight valuable performance trends and trade-offs as a function of various system parameters.

Observational data-based quality assessment of scenario generation for stochastic programs

In minimization problems with uncertain parameters, cost savings can be achieved by solving stochastic programming (SP) formulations instead of using expected parameter values in a deterministic formulation. To obtain such savings, it is crucial to employ scenarios of high quality. An appealing way to assess the quality of scenarios produced by a given method is to conduct a re-enactment of historical instances in which the scenarios produced are used when solving the SP problem and the costs are assessed under the observed values of the uncertain parameters. Such studies are computationally very demanding. We propose two approaches for assessment of scenario generation methods using past instances that do not require solving SP instances. Instead of comparing scenarios to observations directly, these approaches consider the impact of each scenario in the SP problem. The methods are tested in simulation studies of server location and unit commitment, and then demonstrated in a case study of unit commitment with uncertain variable renewable energy generation.

An exact solution approach for risk-averse mixed-integer multi-stage stochastic programming problems

Risk-averse mixed-integer multi-stage stochastic programming problems are challenging, large scale and non-convex optimization problems. In this study, we propose an exact solution algorithm for a type of these problems with an objective of dynamic mean-CVaR risk measure and binary first stage decision variables. The proposed algorithm is based on an evaluate-and-cut procedure and uses lower bounds obtained from a scenario tree decomposition method called as group subproblem approach. We also show that, under the assumption that the first stage integer variables are bounded, our algorithm solves problems with mixed-integer variables in all stages. Computational experiments on risk-averse multi-stage stochastic server location and generation expansion problems reveal that the proposed algorithm is able to solve problem instances with more than one million binary variables within a reasonable time under a modest computational setting.

Data flows and the digital economy: information as a mobile factor of production

PurposeThis paper aims to analyze the direction and balance of transnational information flows and look at how nonpriced digital information exchanges related to international trade in goods and services.Design/methodology/approachThe authors obtained quantitative data about Web-related data flows between countries and regions using Telegeography data on “Server Location as a Percentage of Top Websites.” They then explore how those flows are correlated to trade in goods.FindingsWeb traffic is highly transnational. More than half of the top 100 websites in 9 of the world’s 13 sub-regions are hosted in the USA. More than 15 per cent of the top 100 websites in 9 of the 13 subregions are hosted in Western Europe. East Asia has the largest negative balance in the relationship between incoming and outgoing Web requests. The authors found a very strong negative correlation (−0.878) between Web traffic balances and the balance of trade in goods across all subregions. A similarly strong positive correlation was found with services trade; however, the incompleteness of the data does not allow for strong conclusions yet.Research limitations/implicationsFurther research is needed to correlate Web traffic flows with capital flows. The authors also do not have a well-developed theory to explain the strong negative correlation between information flows and goods trade.Practical implicationsThe data and analysis have useful implications for digital economy policy. It indicates that digital protectionism of the sort practice by China may succeed in increasing domestic producers’ share of Web requests, but does not make them globally competitive. The strong negative correlation between the balance of unpriced Web information and the balance of trade in goods indicates interdependence rather than domination, challenging narratives that information flow imbalances are caused by market power of the big platforms.Social implicationsThe paper demonstrates the degree to which unpriced digital exchanges are transnational and how various countries are more or less globally competitive in the supply of information that the rest of the world finds attractive.Originality/valueNo other published papers have used the data on website traffic data, and previous research has not explored empirically the correlation between information flows and goods trade.

Performance Approximation of Emergency Service Systems with Priorities and Partial Backups

An approximate procedure is presented for priority emergency service systems with partial backups where requests for service with a given origin and priority can be responded to by a certain subset of response units. We introduce and analyze the family of queuing and loss systems with partial service and use them to approximate the distribution of the number of busy response units, which in turn enables us to estimate the average server workloads, immediate and delayed dispatch rates, and waiting delays as system performance measures. We consider systems with zero and infinite queue capacities and let the dispatching policies and service times depend on call priority and customer and server locations. The validity of the approximation model and its computational aspects are studied through numerous tests and a realistic application of locating a fleet of ambulances in downtown Montréal. The online appendix is available at https://doi.org/10.1287/trsc.2017.0810 .

Legal arguments used in courts regarding territoriality and cross-border production orders

This contribution reflects on recent cases involving cross-border data production orders such as Yahoo Belgium, Skype Belgium and Microsoft Ireland. Cross-border data production orders are found to generally involve conflicts regarding sovereignty and enforcement jurisdiction and to frequently include voluntary cooperation of companies for which the legal framework is lacking (Introduction). The Lotus principle, which recognizes a broad extraterritorial jurisdiction to prescribe and limits extraterritorial enforcement jurisdiction, is reconsidered concerning those issues (see the ‘International law pragmatism for jurisdiction to prescribe, but not for jurisdiction to enforce’ section) and the use of mutual legal assistances, which should be the rule, is discussed with four caveats (see the ‘Four caveats to territorial sovereignty and the need for MLAs: Unclarities and politics’ section). Twelve typical arguments are identified, which are employed in courtrooms when cross-border data production orders are discussed, for example, arguments regarding territorial sovereignty, the location of servers, the virtual presence of businesses via the Internet or the nationality of the data subject (see the ‘Arguments in courtrooms in favour or against informal-based cross-border investigations’ section). Subsequently, from fourth to seventh sections, those arguments are investigated regarding their context in the cases Yahoo! Belgium (2007–2015), Skype Belgium (2012–2017), Microsoft Ireland (2013–2018) and Google in re Search Warrant (2017). Finally, a first step to evaluate and test the strength of those arguments is undertaken (see the ‘Assessing the arguments: From logically weak, to unpractical to law enforcement utilitarianism (give us everything)’ section).

Smart collaborative distribution for privacy enhancement in moving target defense

The Moving Target Defense (MTD) has been widely discussed in many communities to upgrade the network reliability, survivability, dependability, etc. However, utilizing MTD in privacy protection still needs more investigations. In this paper, we propose a smart collaborative distribution scheme to enhance the privacy based on MTD guidelines. A target application scenario is the Domain Name System (DNS) that is experiencing serious and complex privacy issues. The preliminary and potential risks are firstly analyzed based on DNS attack approaches, DNS server locations and the vulnerability of user privacy. Then, the details of our scheme are illustrated through port number assignment patterns, main procedures of dynamic port hopping and the implementation method. To quantitatively evaluate the performance, an analytical model was established from theoretical perspectives. The relationships between multiple parameters and overall system capacity are explored as well. The validation results demonstrate that the smart collaborative distribution is able to improve the privacy without affecting the basic DNS functionality.

Is It “Trade?” Data Flows and the Digital Economy

This paper is a preliminary attempt to analyze information as a factor of production in international trade. It is a first attempt to get a handle on the direction and balance of information flows. We have obtained quantitative data about Web-related data flows between countries, and we explore how those flows are correlated to trade in goods . Using Telegeography data on “Server Location as a Percentage of Top Websites,” we found that 2/3 of all web traffic is transnational. More than half of the top 100 web sites in 9 of the world’s 13 sub-regions are hosted in the United States. Central Asia and Eastern Europe, for whom 37% and 41% of their most popular websites, respectively, are requested from the US. Even well-developed Western Europe makes almost half of its top 100 web site requests to US-based sites. For US users, on the other hand, only about 26 of the top 100 websites are hosted outside the country, and 20 of them are in Europe.Ironically, East Asia, which has a huge goods trade surplus with the developed economies, particularly with the US, has the largest negative balance in the relationship between incoming and outgoing Web requests. Indeed, we found a very strong negative correlation (-0.878) between web traffic balances and the balance of trade in goods across all subregions. Once these aspects of transnational data flows are quantified, the paper discusses the implications of these findings for policy, especially trade policy. It raises the question whether the goal of a free and open digital economy is best advanced by placing information exchanges in the trade paradigm and pushing for free trade, or by asserting a more general human right to free and open information exchanges across borders, which has social and political as well as economic consequences. These two approaches are not mutually exclusive, of course, but by making these distinctions we clarify the debate over international policy in the digital world.

Determining Server Locations in Server Migration Service to Minimize Monetary Penalty of Dynamic Server Migration

In this paper, we propose a new class of service called server migration service (SMS) to augment the existing IaaS (Infrastructure as a Service). SMS allows servers (server-side processes of a network application) to dynamically and automatically migrate as their clients (client-side processes of a network application) change their locations in order to reduce the total monetary penalty that the SMS provider pays to its SMS subscribers when failing to provide them with the guaranteed level of QoS. In this paper, we consider the monetary impact that arises from QoS degradation due to server migration and build an integer programming model to determine when and to which location servers should migrate to minimize the total monetary penalty incurred by the SMS provider. Numerical examples show that SMS achieves up to 96% lower total monetary penalty compared to that without server migration. Numerical examples also show that the integer programming model developed in this paper requires reasonable computation time under realistic parameter settings.

A Density-Based Offloading Strategy for IoT Devices in Edge Computing Systems

Collaboration spaces formed from edge servers can efficiently improve the quality of experience of service subscribers. In this paper, we first utilize a strategy based on the density of Internet of Things (IoT) devices and ${k}$ -means algorithm to partition network of edge servers, then an algorithm for IoT devices’ computation offloading decisions is proposed, i.e., whether we need to offload IoT devices’ workload to edge servers, and which edge server to choose if migration is needed. The combination of locations of edge servers and the geographic distribution of various IoT devices can significantly improve the scheduling of network resources and satisfy requirements of service subscribers. We analyze and build mathematical models about whether/how to offload tasks from various IoT devices to edge servers. In order to better simulate operations of the mobile edge servers in more realistic scenarios, the input size of each IoT device is uncertain and regarded as a random variable following some probability distribution based on long-term observations. On the basis of that, an algorithm utilizing sample average approximation method is proposed to discuss whether the tasks to be executed locally or offloaded. Besides, the algorithm proposed can also help decide whether service relocation/migration is needed or not. Finally, simulation results show that our algorithm can achieve 20% of global cost less than the benchmark on a true base station dataset of Hangzhou.

A State of Art Analysis of Telecommunication Data by k-Means and k-Medoids Clustering Algorithms

Cluster analysis is one of the major data analysis methods widely used for many practical applications in emerging areas of data mining. A good clustering method will produce high quality clusters with high intra-cluster similarity and low inter-cluster similarity. Clustering techniques are applied in different domains to predict future trends of available data and its uses for the real world. This research work is carried out to find the performance of two of the most delegated, partition based clustering algorithms namely k-Means and k-Medoids. A state of art analysis of these two algorithms is implemented and performance is analyzed based on their clustering result quality by means of its execution time and other components. Telecommunication data is the source data for this analysis. The connection oriented broadband data is given as input to find the clustering quality of the algorithms. Distance between the server locations and their connection is considered for clustering. Execution time for each algorithm is analyzed and the results are compared with one another. Results found in comparison study are satisfactory for the chosen application.

Server Location Verification (SLV) and Server Location Pinning

We introduce the first known mechanism providing realtime server location verification. Its uses include enhancing server authentication by enabling browsers to automatically interpret server location information. We describe the design of this new measurement-based technique, Server Location Verification (SLV), and evaluate it using PlanetLab. We explain how SLV is compatible with the increasing trends of geographically distributed content dissemination over the Internet, without causing any new interoperability conflicts. Additionally, we introduce the notion of (verifiable) server location pinning (conceptually similar to certificate pinning) to support SLV, and evaluate their combined impact using a server-authentication evaluation framework. The results affirm the addition of new security benefits to the existing TLS-based authentication mechanisms. We implement SLV through a location verification service, the simplest version of which requires no server-side changes. We also implement a simple browser extension that interacts seamlessly with the verification infrastructure to obtain realtime server location-verification results.