Reduce Network Load Research Articles

Hybrid Test Data Transportation Scheme for Advanced NoC-Based SoCs

Network-on-chip (NoC) has evolved to overcome the issues of traditional bus-based on-chip interconnect. In NoC-reuse as TAM, the test schedulers are constrained with the topological position of cores and test access points, which may negatively affect the test time. This paper presents a scalable hybrid test data transportation scheme that allows to simultaneously test multiple heterogeneous cores of NoC-based SoCs, while reusing NoC as TAM. In the proposed test scheme, single test stimuli set of multiple CUTs is embedded into each flit of the test stimuli packets and those packets are multicast to the targeted CUTs. However, the test response packets of each CUT are unicast towards the tester. To reduce network load, a flit is filled with maximum possible test response sets before unicasting towards the tester. With the aid of Verilog and analytical simulations, the proposed scheme is proved effective and the results are compared with some recent techniques.

LDPA: a local data processing architecture in ambient assisted living communications

In ambient assisted living, one of the most concerning problems is how the living status of the elderly can be accurately judged through the data collected by ambient sensors. To solve this problem, environmental influences should be sufficiently considered. Some researchers have proposed collecting data comprehensively by distributed environmental sensors, but how the massive collected data were to be analyzed and transmitted was ignored. In this article, we propose a local data processing architecture on a local server to analyze collected data. In this three-layer architecture, the latest received data is stored in a data gathering layer. Afterward, a data filtering layer checks the efficiency of data. Also, this layer classifies the received data into static data reflecting sensors’ status and a realtime data stream reflecting quality of life. For static data, they are directly stored in a database, and the real-time data stream is divided into different levels. Based on these levels, a data analyzing layer reorganizes data into a neighborhood structure, which will be called RDAA. A risk factor is returned by RDAA and only abnormal data will be sent to a health care provider when its risk factor is larger than a given threshold. LDAP disperses the stress of remote centralized processing and data storage, which decreases the workload of the remote health care provider. Meanwhile, it also reduces network load and improves processing speed.

A software system for enabling real-time voice communication over existing ZigBee networks

The ZigBee wireless protocol specification, based on the IEEE 802.14.5 standard, is used in many low cost, distributed wireless sensor networks. It is widely used in various embedded applications, such as for industrial, medical, and home automation. Its popularity has spawned an increasing interest in the capability of the protocol to support multimedia applications, including real-time voice transmission. Several vendors have developed hardware codecs for developers to implement 'voice over ZigBee' solutions. However, given the already wide-spread deployment and use of ZigBee sensor nodes, we propose a system for voice transmission over a ZigBee star network using a purely software-based solution, such that it can be applied to existing commercial ZigBee network nodes without additional hardware. A voice detection system optimised for embedded systems is also proposed in order to reduce network load. The proposed system is implemented onboard a common wireless sensor network node, the Freescale MC1322x. The voice quality of the system is measured via a mean opinion score test and compared to other common voice over internet protocol solutions.

A fast, reliable and lightweight distributed dissemination protocol for safety messages in Urban Vehicular Networks

It is foreseeable that in the few upcoming years, real time traffic information, including road incidents notifications, will be collected and disseminated by mobile vehicles, thanks to their plethora of embedded sensors. Each vehicle can thus actively participate in sharing the collected information with the other peers forming an infrastructure-less self-organising network of vehicles. However, the fast development of applications in ITS field may result in an excessive load on such a network; therefore an efficient use of the available bandwidth is highly required. Not only should the size of the data inserted in the network be properly controlled, but also the extent of each message should be accurately defined. In this paper, we propose a distributed dissemination protocol for safety messages in urban areas, dubbed “Road-Casting Protocol (RCP)”, which is based on a novel cooperative forwarding mechanism. Moreover, an accurate definition of the Region of Interest (RoI) (i.e. the geographical scope) of each broadcasted safety message is also devised to ensure better control of the network load. We have evaluated the efficiency of the RCP along with the proposed RoI definition using realistic simulations, based on an accurate propagation loss model for urban vehicular ad hoc network communications, and the obtained results show a substantial improvement, compared to state of the art schemes, in terms of enhanced packet delivery ratio up to higher than 95%, lower end-to-end delay and reduced network load.

Virtual machine placement with two-path traffic routing for reduced congestion in data center networks

Virtualization-based Data Centers are increasingly becoming the hosting platform for a wide range of applications. The communication patterns in Data Center networks show the trend towards increasing bandwidth usage between virtual machines (VMs) within the Data Center resulting in higher chance of occurrence of network congestion. Thus, VM placement and routing algorithms are increasingly important to maximize application performance, provide fault tolerance, and reduce network loads. A less-than optimal placement of communicating VMs can cause inter-VM traffic to traverse bottlenecked network paths leading to large cross network traffic. The core network oversubscription and unbalanced workload placement could lead to long-lived congestion in Data Center networks. Multipath routing with traffic distributed in an appropriate proportion helps balance the load and decrease the possibility of congestion. Furthermore, by routing traffic on multiple link-disjoint paths, traffic can be protected against failures. The use of link-disjoint paths ensures the availability of at least one path for the traffic upon a link failure, thus guaranteeing a certain bandwidth (associated with the surviving paths). In this paper, we study the problem of VM placement with traffic routing on multiple paths for reduced occurrence of congestion while satisfying a certain protection grade which is defined as the fraction of rate (or bandwidth) guaranteed to be available in the event of single link failures. We develop an efficient algorithm based on a greedy technique for placing VMs onto servers satisfying the computing and memory resource requirements, taking into account the amount of inter-VM traffic and network load. In addition, we develop a two-path routing algorithm to satisfy the bandwidth and protection grade requirements so as to reduce the network congestion. Our simulation results show the effectiveness of the proposed algorithms in balancing the load and resilient when compared to other first-fit and random algorithms.

Event-Triggered Average Consensus for Multiagent Systems with Time-Varying Delay

The paper investigates average consensus for multiagent systems with time-varying delay. A reducing dimension multiagent systems model is presented firstly. Using event-triggered mechanism to reduce network load, a comprehensive model is then proposed, which considers communication delay and triggered issue. Furthermore, the event-triggered average consensus stability of multiagent systems with fixed directed/undirected graph is analyzed, and sufficient conditions are provided. Moreover, the upper bound of time-varying delay can be obtained conveniently. Finally, simulation results confirm the feasibility and effectiveness of the proposed method.

Investigating Regulative Implications for User-generated Content and a Design Proposal

The rapid increase of the Internet connectivity and the data publishing activity, like user-generated content, has lead Internet Service Providers (ISPs) to establish more efficient mechanisms for content delivery, such as caching. Mechanisms such as content-aware-networks and in-network caching reduce network load, server load, and user response time, thus, manage the network. However, caching of content also raises major implications in terms of legal acts and bills (e.g., data privacy, copyright), dealing with access control, validation scheme, and regulations (e.g., contractual obligation, legal restrictions). In general, user-generated content is linked with sensitive information, such as geographical information, medical and financial information, personal identifiable data, photos, videos, and contact information. Therefore, it is essential to secure data and regulate access. The latter, is gained by including access control mechanisms in the data exchange process, where a user requesting data must prove his access rights. Therefore, a user has to show an access ticket, which includes his rights based on legal and regulative implications. In order to secure any kind of data exchange, authentication of each participating communication entity (e.g., content owner, server, and end-user) is essential, which is part of the proposed two-way authentication handshake in this paper that is performed to generate a secure communication channel. The main contribution of this paper is to show that transmission, storage, and usage of user-generated data in caches within the network is manageable within the legal laws on sensitivity, copyright, and privacy. The scope of studying these laws, acts, and policies is restricted to Switzerland (CH), the European Union (EU), and the United States of America (USA). Finally, a solution is presented including access ticketing and two-way authentication mechanisms based oncommonstandards from IP networks.

Architecting the Network for the Cloud using Security Guidelines

computing is the latest emerging technology which offers reduced capital expenditure, complexity, operational risks, maintenance, and increased scalability while providing the services at different abstraction levels, namely Infrastructure-as-a-Service (IaaS), Platform-as-a-Service (PaaS), and Software-as-a-Service (SaaS). A new approach called cloud networking that enables and adds the networking functions and resources to cloud computing and provide the means of dynamic and flexible placement of virtual resources that crossing over provider borders. It also allows various kinds of functionalities and optimization techniques, e.g., reducing network load. This approach brings out and enables new security challenges. This paper presents a new security architecture, which enables the user of cloud networking to illustrate the security requirements and apply them in the cloud networking infrastructure.

Web Crawler Based on Mobile Agent and Java Aglets

With the huge growth of the Internet, many web pages are available online. Search engines use web crawlers to collect these web pages from World Wide Web for the purpose of storage and indexing. Basically Web Crawler is a program, which finds information from the World Wide Web in a systematic and automated manner. This network load farther will be reduced by using mobile agents. The proposed approach uses mobile agents to crawl the pages. A mobile agent is not bound to the system in which it starts execution. It has the unique ability to transfer itself from one system in a network to another system. The main advantages of web crawler based on Mobile Agents are that the analysis part of the crawling process is done locally rather than remote side. This drastically reduces network load and traffic which can improve the performance and efficiency of the whole crawling process.

The Design of Wireless Sensor Node for Industrial Bearing Monitoring

This paper proposes one kind of design method of wireless sensor node which is used to monitor industrial rolling bearing faults. The authors elaborate the hardware design, software design and wireless communication strategy of the node. Compared with the traditional application of wireless sensor network (WSN), in this special situation, industrial wireless sensor networks (IWSN) faces more severe requirments such as larger data processing quantity, higher transmission stability and longer service life. This paper emphasizes on enhancing the processing ability of sensor node, and chooses to extract fault features in node level by which reduces network load and energy consumption effectively. Through a series of experiments, the authors prove the feasibility and superiority of this method.

VoxGrid: a mobile voice verification system

PurposeThe purpose of this paper is to introduce VoxGrid, a mobile voice verification system intended for improving the security of the username‐password authentication scheme.Design/methodology/approachThe system incorporates text‐dependant speaker verification via mobile devices that provides for a three‐factor authentication scheme for granting authorised access to certain websites or applications. The same speech recognition engine used by Google Voice Search is utilised to provide voice‐to‐text feature. All verification tasks are performed on a centralised server to minimise computing requirements on mobile platforms where feature extractions is executed using Mel Frequency Cepstral Coefficients. The resulting features are transmitted to the server instead of raw voice data to reduce network load. Actual voice verification takes place in the central server using Vector Quantisation.FindingsThe initial results have indicated that VoxGrid is capable of providing an additional level of security on user authentications at a low cost and without using extra security tokens other than one's voice with a good enough performance given the limited resources available during testing.Originality/valuePast speaker verification experiments have been conducted but we see that this is the first time it is done on mobile devices with a client‐server architecture using K‐Means Clustering and Vector Quantisation. Future improvements on performance and testing could result in a more secure mobile computing environment.

Modeling in-network caching and bandwidth sharing performance in information-centric networking

Information-centric networking (ICN) proposes a content-centric paradigm which has some attractive advantages, such as network load reduction, low dissemination latency, and energy efficiency. In this paper, based on the analytical model of ICN with receiver-driven transport protocol employing least-recently used (LRU) replacement policy, we derive expressions to compute the average content delivery time of the requests' arrival sequence of a single cache, and then we extend the expressions to a cascade of caches’ scenario. From the expressions, we know the quantitative relationship among the delivery time, cache size and bandwidth. Our results, analyzing the trade-offs between performance and resources in ICN, can be used as a guide to design ICN and to evaluation its performance.

An Effective Parallel Web Crawler based on Mobile Agent and Incremental Crawling

A huge amount of new information is placed on the Web every day. Large scale search engines frequently update their index gradually and are not capable to present such information in a timely behavior. An incremental crawler downloads customized contents only from the web for a search engine, thereby helps falling the network load. This network load farther will be reduced by using mobile agents. It is reported in the previous literature that the 40% of the current Internet traffic and bandwidth utilization is due to these crawlers. These crawlers also effect load on the remote server by using its CPU cycles and memory, these loads must be taken into account in order to get high performance at a reasonable cost. This paper deal with all those problems by proposing a system based on parallel web crawler using mobile agent. The proposed approach uses mobile agents to crawl the pages. The main advantages of parallel web crawler based on Mobile Agents are that the analysis part of the crawling process is done locally. This drastically reduces network load and traffic which can improve the performance and efficiency of the crawling process. 

모바일 에이전트 시스템의 구성적 임베딩을 위한 컴포넌트 기반의 프레임워크

Rapid evolution of wired and wireless technologies results in various types of embedded systems, and the software to be embedded into those devices now needs the flexibility rather than the fixedness which was well-known property for the embedded software in the past. Mobile agent is one of the useful distributed technologies of reducing network load and latency because of its disconnected operations and high asynchrony. In this paper, a component-based mobile agent framework, called EmHUMAN, is designed and implemented for structural embedding into the devices showing different functions and resource constraints. It consists of 3 layers of components. Based on those components, a structural embedding, considering resource constraints of required functions, amount of storage space, computing power, network bandwidth, etc can be performed. The components in each layer can be extended with addition of new components, removing some components and modifying components. EmHUMAN plays the role of a framework for developing mobile agent based distributed systems. It is also a mobile agent system by itself. EmHUMAN provides several utilities as built-in API`s, and thus high effectiveness in programming mobile agents can be achieved.

Lightweight PIM—a new multicast routing protocol

SUMMARYMulticast holds out great promise to significantly reduce network load between the sender and a group of receivers by delivering a single data stream to many recipients. Protocol‐Independent Multicast (PIM) Sparse Mode and its variant PIM Source‐Specific Multicast (PIM SSM) are the most widely used IP multicast protocols. Protocols offer low latency data delivery capabilities with relatively high reliability and are characterized by large signaling overhead. This article presents a new multicast protocol, called Lightweight PIM (LPIM), tackling the main problem hindering widespread usage of IP multicast protocols, which is a large volume of signaling traffic. Given the existing usability of the PIM family protocols, a decision was made to base the new LPIM protocol on PIM SSM. The improvements used in LPIM lead to a considerable reduction of state data and signaling messages required by LPIM as compared with PIM SSM. Similar to its predecessor, LPIM is capable of handling large groups, although with significantly lower overhead. Copyright © 2012 John Wiley & Sons, Ltd.

Calculating the Effect of Dispersion Wind Power Plants in the Electrical Network Reliability

Demand for renewable energy in electric power systems is growing as fast. Reasons, including the desire of countries to increase production capacity of wind power are the great advantages of this method production of electrical energy. Because wind energy is many, renewable and clean. The high penetration of renewable energy can reduce fuel costs, but can affect the electrical system reliability. Using probabilistic methods, and estimates can be combined to achieve high reliability in the electrical system is combined with new energy. In this article, the reliability of power delivery is calculated and reduced network load caused a definite increase in the dispersion of wind power plants has been studied using Monte Carlo simulation method. In this paper, collect data on wind speed of wind sites in Binalood and Manjil areas in Iran have a minute, and over the years have been doing. Simulations based on Monte Carlo method and frequency, and is performed using softwares Matlab and Excel. And reliability indices and algorithms based on the calculated reliability indices LOLE and LOEE are performed.

A Fault Tolerant Mobile Agent Information Retrieval System

Problem statement: Most of the information retrieval systems used only client-server architectures. The client-server model though powerful, had some limitations. In mobile computing environment which has both wired network and wireless networks with limited communication capabilities, the performance of the system was very low. Approach: Mobile agents are considered a suitable technology to develop applications such as information retrieval system for mobile computing environment. Mobile agents are autonomous and dynamic entities that can migrate between various nodes in the network. They offer many advantages over traditional design methodologies like: reduction in network load, overcoming network latency and disconnected operations. Since the mobile agents do not need continuous communication with the mobile host, they are not affected by the sudden disconnection of wireless network and the situation of turning mobile host off for power saving. In order to get the complete benefit of mobile agent system, the system must be fault tolerant. In the context of mobile agents, fault-tolerance prevents a partial or complete loss of the agent. Results: Our system in mobile computing environment ensured that the agent arrived at its destination with result and performance of the system improved by the way of reduction in the response time. And also, the system allowed sending more requests by the way of creating many mobile agents without affecting the performance. Conclusion: Our research compared the performance of client-server architecture and fault tolerant mobile agent information retrieval system and proved that our system solved the limitations faced by the client server architecture. The system can also be extended to adhoc networks.

A distributed energy-efficient clustering protocol for wireless sensor networks

Minimizing energy dissipation and maximizing network lifetime are among the central concerns when designing applications and protocols for sensor networks. Clustering has been proven to be energy-efficient in sensor networks since data routing and relaying are only operated by cluster heads. Besides, cluster heads can process, filter and aggregate data sent by cluster members, thus reducing network load and alleviating the bandwidth. In this paper, we propose a novel distributed clustering algorithm where cluster heads are elected following a three-way message exchange between each sensor and its neighbors. Sensor’s eligibility to be elected cluster head is based on its residual energy and its degree. Our protocol has a message exchange complexity of O ( 1 ) and a worst-case convergence time complexity of O ( N ) . Simulations show that our algorithm outperforms EESH, one of the most recently published distributed clustering algorithms, in terms of network lifetime and ratio of elected cluster heads.

A CORBA-based simulation and control framework for mobile robots

SUMMARYThis paper presents a distributed multiple mobile robots framework which allows programming and control of virtual and real mobile robots. The system provides the map building, path planning, robot task planning, simulation, and actual robot control functions in an indoor environment. Users can program the virtual robots in a customized simulation environment and check the performance of execution, i.e., if the simulation result is satisfying, users can download the code to a real robot. The paper focuses on the distributed architecture and key technologies of virtual robots simulation and control of real robots. A method for construction and transfer of a key index value (which stores the robot configuration) is proposed. Using this method, only the robot key configuration index is needed to build the robot in the virtual environment. This results in reduced network load and improved real time performance of the distributed system. Experiments were conducted to compare the performance of the proposed system with the performance of a centralized system. The results show that the distributed system uses less system resources and has better real time performance. What is more, this framework has been applied to Yaskawa's robot “SmartPal.” The simulation and experiment results show that our robotic framework can simulate and control the robot to perform complex tasks.

Facilitating Effective Resource Publishing and Searching in DHT Networks

As a structured overlay network, DHT (Distributed Hash Table) has been widely used in P2P systems. Existing resource publishing algorithms, including One-step publishing in eMule, do not completely exploit features of DHTs and incur heavy network load. In this paper, we propose a novel resource publishing algorithm: Step-by-step publishing, in DHT networks. It is more effective and scalable with lower network load than the existing publishing algorithms. We also utilise the techniques of vector space model and user relevance feedback to optimise the Step-bystep publishing algorithm, which effectively improves search hit ratio and reduces network load. After analysing the dynamics of P2P systems, we present index maintenance schemes under highly dynamic P2P networks. Based on real datasets from Maze system, simulation experiment results show that this proposed approach has low network overhead and publishing cost, high search and download hit ratio.