Central Router Research Articles

Application of sports wearable sensor based on edge computing in sports industry

Allocation strategy is a way to find problems inside the network, and it is also a way to put problems at the edge of the network. In the central router scheme, each router decides when to transmit data packets and which data packets to reject, and at the same time notifies the host generating network traffic to send the packet number. In the central hosting scheme, the final host monitors the network status and adjusts its behavior accordingly. Ice and snow sports has gradually become a way of entertainment for people, improving their knowledge of physical exercise. Various forms of physical activities have been taken, such as shooting, running, jumping, walking, and dancing, and these exercises are usually general forms of physical exercise. This article is about the dissemination of concepts, methods and techniques of advanced training, scientific research and winter sports training, as well as the study of methods and techniques for the sustainable development of national ice and snow sports, winter sports training, and ice and snow economy.

Smart Load-Based Resource Optimization Model to Enhance the Performance of Device-to-Device Communication in 5G-WPAN

In wireless personal area networks (WPANs), devices can communicate with each other without relying on a central router or access point. They can improve performance and efficiency by allowing devices to share resources directly; however, managing resource allocation and optimizing communication between devices can be challenging. This paper proposes an intelligent load-based resource optimization model to enhance the performance of device-to-device communication in 5G-WPAN. Intelligent load-based resource optimization in device-to-device communication is a strategy used to maximize the efficiency and effectiveness of resource usage in device-to-device (D2D) communications. This optimization strategy is based on optimizing the network’s resource load by managing resource utilization and ensuring that the network is not overloaded. It is achieved by monitoring the current load on the network and then adjusting the usage of resources, such as bandwidth and power, to optimize the overall performance. This type of optimization is essential in D2D communication since it can help reduce costs and improve the system’s performance. The proposed model has achieved 86.00% network efficiency, 93.74% throughput, 91.94% reduced latency, and 92.85% scalability.

Reducing the number of passing links in the 2D-NoC for performance and reliability improvement

Purpose The routing algorithm is one of the most important components in designing a network-on-chip (NoC). An effective routing algorithm can cause better performance and throughput, and thus, have less latency, lower power consumption and high reliability. Considering the high scalability in networks and fault occurrence on links, the more the packet reaches the destination (i.e. to cross the number of fewer links), the less the loss of packets and information would be. Accordingly, the proposed algorithm is based on reducing the number of passed links to reach the destination. Design/methodology/approach This paper presents a high-performance NoC that increases telecommunication network reliability by passing fewer links to destination. A large NoC is divided into small districts with central routers. In such a system, routing in large routes is performed through these central routers district by district. Findings By reducing the number of links, the number of routers also decreases. As a result, the power consumption is reduced, the performance of the NoC is improved, and the probability of collision with a faulty link and network latency is decreased. Originality/value The simulation is performed using the Noxim simulator because of its ability to manage and inject faults. The proposed algorithm, XY routing, as a conventional algorithm for the NoC, was simulated in a 14 × 14 network size, as the typical network size in the recent works.

The Successful Usage of the DICOM Images Exchange System (ePACS) in the Czech Republic.

The picture archiving and communication system (PACS) has already replaced classic hard copy film technology. With new functions of PACS under consideration, attention turns to the sharing of medical images between different institutions. The Czech Republic is one of the few countries using a nation-wide medical images exchange system known as ePACS. It is based on dedicated hardware and one central router, although theoretical models tend to prefer cloud-based sharing. Despite its simple design and lack of advanced features, this system has successively evolved into a widely used tool. The aim of this article is to offer an overview of its use and functions and to show that even a simple system can be widely used. Using data from the producer of ePACS (the ICZ company) and from other sources, the system was described and data about its performance have been obtained. Every acute-care hospital (140) and about a quarter of outpatient facilities (105) in the Czech Republic are now equipped with ePACS and are therefore able to share medical images. The number of studies transmitted rises every year, from 12,000 in 2008 to more than 640,000 in 2018, which is approximately 4% of all studies produced. The system was primarily designed and is used to share images between acute-care hospitals but a very special usage has also evolved, as it is employed in a teleradiology service with private enterprises too. ePACS is expanding in the Czech Republic despite having only limited functions and despite its principle that simply copies a classic workflow when sending studies on Compact Discs. Although other systems for image sharing might be more advanced, ePACS brings to the Czech health care system the capability to exchange medical images on a national level.

Improving the Power Efficiency in WSN using Advanced Multi-Hop Protocol

This paper uses a hybrid strategy to effectively manage energy consumption by the sensor nodes present in Wireless Sensor network (WSNs). With the dynamic routing protocol, the paper's goal is to increase network lives. The proposed Advanced Multi-Hop (AMH) protocol, routing algorithm incorporates the interaction between multi-hops and direct transmissions. This method also uses the Dijkstra algorithm for routing the data packets in the mobile network between the base station and sensor nodes. This system eliminates the power of other nodes by using a central router. Different results of the proposed method have been checked. The comparison of other existing methods shows that AMH achieves lower network life and better network performance.

A new congestion-aware routing algorithm in network-on-chip: 2D and 3D comparison

Network on-Chip (NoC) is scalable, flexible, modular communication structure for Multi/Many-core architectures. It allows simpler interconnect models with higher bandwidth compared to bus-based architectures. When a message is exchanged inside an NoC, it passes through several routers. When the communication load is high, contention and congestion may appear in central routers, and lead to an increased latency and power consumption. 3D NoC has been proposed as a solution to improve the performances, especially: throughput, latency, and energy efficiency. In this paper, we first report the results of theoretical and practical comparison between 2D and 3D mesh Network-on-Chip topology. We focus on communication supports, especially routing, in the goal of reducing latency and avoiding congestion. Further, we propose a novel exhaustive routing algorithm to avoid and reduce congestion in 2D and 3D NoC. Also, we discuss the implementation of the proposed algorithm in both topologies and the trade-off between their overheads and their performances. We demonstrate the effectiveness of our algorithm using a wide set of synthetic experiments using NOXIM simulator.

A New Smart Router-Throttling Method to Mitigate DDoS Attacks

The distributed denial of service (DDoS) attack is one of the most server threats to the current Internet and brings huge losses to society. Furthermore, it is challenging to defend DDoS due to the case that the DDoS traffic can appear similar to the legitimate ones. Router throttling is an accessible approach to defend DDoS attacks. Some existing router throttling methods dynamically adjust a given threshold value to keep the server load safe. However, these methods are not ideal as they exploit the information of the current time, so the perception of time series variations is poor. The DDoS problem can be seen as a Markov decision process (MDP). Multi-agent router throttling (MART) method based on hierarchical communication mechanism has been proposed to address this problem. However, each agent is independent with each other and has no communication among them, therefore, it is hard for them to collaborate to learn an ideal policy to defend DDoS. To solve this multi-agent partially observable MDP problem, we propose a centralized reinforcement learning router throttling method based on a centralized communication mechanism. Each router sends its own traffic reading to a central router, the central router then makes a decision for each router to choose the throttling rate. We also simulate the environment of the DDoS problem more realistic while modify the reward function of the MART to make the reward function of more coherent. To decrease the communication costs, we add a deep deterministic policy gradient network for each router to decide whether or not to send information to the central agent. The experiments validate that our proposed new smart router throttling method outperforms existing methods to the DDoS instruction response.

Routing protocol based key management schemes in manet: a survey

Mobile ad-hoc networks (MANETS) are infrastructure less networks and the topology of this network is always changing. The nodes can enter and leave the network at any time. These networks require a high security in communication, as its application demands so. Effective key management is the only technique, which can implement to secure the nodes in communication. In adhocnetworks there is no central controller or router such as in wired network. This will make this network more vulnerable to attack. The intruders can easily enter the net-work and can manipulate the contents easily. Traditional key management schemes will not fit for this type of networks. This article, discuss various key management schemes based on routing protocols in mobile ad-hoc network (MANET). It also analyses them in terms of the security and applicability.

Data Center Server Provision: Distributed Asynchronous Control for Coupled Renewal Systems

This paper considers a cost minimization problem for data centers with $N$ servers and randomly arriving service requests. A central router decides which server to use for each new request. Each server has three types of states (active, idle, and setup) with different costs and time durations. The servers operate asynchronously over their own states and can choose one of multiple sleep modes when idle. We develop an online distributed control algorithm so that each server makes its own decisions. The request queues are bounded and the overall time average cost is near optimal with probability 1. First the algorithm does not need probability information for the arrival rate or job sizes. Finally, an improved algorithm that uses a single queue is developed via a “virtualization” technique, which is shown to provide the same (near optimal) costs. Simulation experiments on a real data center traffic trace demonstrate the efficiency of our algorithm compared with other existing algorithms.

Energy-efficient node selection in application-driven WSN

The growth of wireless networks has resulted in part from requirements for connecting people and advances in radio technologies. Wireless sensor networks are an example of these networks in which a large number of tiny devices interacting with their environments may be inter-networked together and accessible through the Internet. As these devices may be scattered in an unplanned way, a routing protocol is needed. The RPL protocol is the IETF proposed standard protocol for IPv6-based multi-hop WSN. RPL requires that communication paths go through a central router which may provide suboptimal paths, not considering the characteristics of the applications the nodes run. In this paper is proposed an Application-Driven extension to RPL which enables to increase the WSN lifetime by limiting the routing and forwarding functions of the network mainly to nodes running the same application. As nodes may join a network at a non predictable time, they must be synchronized with respect to their application duty cycles. Therefore, nodes have to wake up and sleep in a synchronized way. In this paper it is also proposed such synchronization mechanism. The results confirm that the proposed solutions provide lower energy consumption and lower number of packets exchanged than the conventional RPL solution, while maintaining fairness and the packet reception ratio high.

Research on Characteristics of Plastic Materials and Plastic Optical Fiber

Plastic materials have many uses. The plastic optical fiber with a low-cost, light weight, good flexibility, big core diameter, easy coupling, anti-electromagnetic interference and electromagnetic radiation, is used for short range communication. This paper analyzed the characteristics of plastic materials and plastic optical fiber, and proposed a novel application technology for access network. In the access network, the plastic optical fiber is used as a transmission medium, from center router to the server, and the various floors of plastic optical fiber switch to the user using plastic optical fiber connections, constitute a plastic optical fiber local area network, to realize the true meaning fiber to the home.

Multi-route query processing and optimization

A modern query optimizer typically picks a single query plan for all data based on overall data statistics. However, many have observed that real-life datasets tend to have non-uniform distributions. Selecting a single query plan may result in ineffective query execution for possibly large portions of the actual data. In addition most stream query processing systems, given the volume of data, cannot precisely model the system state much less account for uncertainty due to continuous variations. Such systems select a single query plan based upon imprecise statistics. In this paper, we present “Query Mesh” (or QM), a practical alternative to state-of-the-art data stream processing approaches. The main idea of QM is to compute multiple routes (i.e., query plans), each designed for a particular subset of the data with distinct statistical properties. We use terms “plans” and “routes” interchangeably in our work. A classifier model is induced and used to assign the best route to process incoming tuples based upon their data characteristics. We formulate the QM search space and analyze its complexity. Due to the substantial search space, we propose several cost-based query optimization heuristics designed to effectively find nearly optimal QMs. We propose the Self-Routing Fabric (SRF) infrastructure that supports query execution with multiple plans without physically constructing their topologies nor using a central router like Eddy. We also consider how to support uncertain route specification and execution in QM which can occur when imprecise statistics lead to more than one optimal route for a subset of data. Our experimental results indicate that QM consistently provides better query execution performance and incurs negligible overhead compared to the alternative state-of-the-art data stream approaches.

REPUTATION MANAGEMENT SYSTEM FOR PEER-TO-PEER COMMUNITIES

Abstract Peer-to-Peer (P2P) reputation systems are essential to evaluate the trustworthiness of participating peers and to combat the selfish, dishonest, and malicious peer behaviors. The system collects locally-generated peer feedbacks and aggregates them to yield the global reputation scores. Surprisingly, most previous work ignored the distribution of peer feedbacks. We use a trust overlay network (TON) to model the trust relationships among peers. After examining the eBay transaction trace of over 10,000 users, we discovered a power-law distribution in user feedbacks. Our mathematical analysis justifies that power-law distribution is applicable to any dynamicall yg rowing P2P systems, either structured or unstructured. We develop a robust and scalable P2P reputation system, PowerTrust, to leverage the power-law feedback characteristics. The PowerTrust system dynamically selects small number of power nodes that are most reputable using a distributed ranking mechanism. By using a look ahead random walk strategy and leveraging the power nodes, the PowerTrust significantly improves in global reputation accuracy and aggregation speed. PowerTrust is adaptable to dynamics in peer joining and leaving and robust to disturbance by malicious peers. Through P2P network simulation experiments, we find significant performance gains in using PowerTrust. This power-law guided reputation system design proves to achieve high query success rate in P2P file-sharing applications. The system also reduces the total job make span and failure rate in large-scale, parameter-sweeping P2P Grid applications. A peer to peer network exploits diverse connectivity between participants in a network and the cumulative bandwidth of network participants rather than conventional centralized resources where a relatively low number of servers provide the core value to a service or application. A pure peer to peer network doesn't have the notion of clients or servers, but only equal peer nodes that simultaneously function as both clients and servers to the other nodes on the network. Peers act as equals, merging the roles of clients and server. There is no central server managing the network. There is no central router.