Journal articles: 'Load forwarding'

1

Weiguang Shi, M. H. MacGregor, and P. Gburzynski. "Load balancing for parallel forwarding." IEEE/ACM Transactions on Networking 13, no. 4 (August 2005): 790–801. http://dx.doi.org/10.1109/tnet.2005.852881.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wang, Xiaofeng, Wei Zhu, and Yueming Dai. "Network simulation task partition method in heterogeneous computing environment." International Journal of Modeling, Simulation, and Scientific Computing 05, no. 03 (May 5, 2014): 1450010. http://dx.doi.org/10.1142/s179396231450010x.

Full text

Abstract:

To reduce the running time of network simulation in heterogeneous computing environment, a network simulation task partition method, named LBPHCE, is put forward. In this method, the network simulation task is partitioned in comprehensive consideration of the load balance of both routing computing simulation and packet forwarding simulation. First, through benchmark experiments, the computation ability and routing simulation ability of each simulation machine are measured in the heterogeneous computing environment. Second, based on the computation ability of each simulation machine, the network simulation task is initially partitioned to meet the load balance of packet forwarding simulation in the heterogeneous computing environment, and then according to the routing computation ability, the scale of each partition is fine-tuned to satisfy the balance of the routing computing simulation, meanwhile the load balance of packet forwarding simulation is guaranteed. Experiments based on PDNS indicate that, compared to traditional uniform partition method, the LBPHCE method can reduce the total simulation running time by 26.3% in average, and compared to the liner partition method, it can reduce the running time by 18.3% in average.

APA, Harvard, Vancouver, ISO, and other styles

3

Guo, Yan Hua, Yi Min Guo, Ya Jun Guo, and Cai Mei Wang. "A Trajectory Privacy Preserving Method in Peer-to-Peer LBS System." Applied Mechanics and Materials 34-35 (October 2010): 571–75. http://dx.doi.org/10.4028/www.scientific.net/amm.34-35.571.

Full text

Abstract:

The wide application of Location-Based Service (LBS) makes location privacy and trajectory privacy receive much attention in recent years. The basic idea of current privacy preserving methods in LBS is cutting the relationship of user’s consecutive locations. This paper propose LOCMIX, a trajectory privacy protecting method which is based on neighbor node’s forwarding query in a P2P LBS system. Choose the user who have sufficient power to forward queries to LBS as the forwarding node of user u. The forwarding node must be as close to user u as possible. Then the k-Anonymity Spatial Region (k-ASR) was constructed with the forwarding node and the k-1 users whose Hilbert value is less than (or more than) the forwarding node. The experiments show that LOCMIX has good load balancing property and protect trajectory privacy effectively against the “center-of-k-ASR” attack and the correlation attack.

APA, Harvard, Vancouver, ISO, and other styles

4

박상현, Gitae Yeo, and Cha young doo. "Strategies For improvement of Less Container Load freight-forwarding service." Journal of Shipping and Logistics 33, no. 2 (June 2017): 299–319. http://dx.doi.org/10.37059/tjosal.2017.33.2.299.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Casari, Paolo, Michele Nati, Chiara Petrioli, and Michele Zorzi. "Geographic forwarding and adaptive load balancing in wireless sensor networks." ACM SIGMOBILE Mobile Computing and Communications Review 11, no. 2 (April 2007): 53–54. http://dx.doi.org/10.1145/1282221.1282232.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Isik, Sinan, Mehmet Yunus Donmez, and Cem Ersoy. "Cross layer load balanced forwarding schemes for video sensor networks." Ad Hoc Networks 9, no. 3 (May 2011): 265–84. http://dx.doi.org/10.1016/j.adhoc.2010.07.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mansour, Dima, Haidar Osman, and Christian Tschudin. "Load Balancing in the Presence of Services in Named-Data Networking." Journal of Network and Systems Management 28, no. 2 (December 21, 2019): 298–339. http://dx.doi.org/10.1007/s10922-019-09507-x.

Full text

Abstract:

AbstractLoad balancing is a mechanism to distribute client requests among several service instances. It enables resource utilization, lowers response time, and increases user satisfaction. In Named-Data Networking (NDN) and NDN-like architectures, load balancing becomes crucial when dynamic services are present, where relying solely on forwarding strategies can overload certain service instances while others are underutilized especially with the limited benefit of on-path caching when it comes to services. To understand the challenges and opportunities of load balancing in NDN, we analyze conventional load balancing in IP networks, and three closely related fields in NDN: congestion control, forwarding strategies, and data center management. We identify three possible scenarios for load balancing in NDN: facade load balancer, controller for Interest queues, and router-based load balancing. These different solutions use different metrics to identify the load on replicas, have different compliance levels with NDN, and place the load balancing functionality in different network components. From our findings, we propose and implement a new lightweight router-based load balancing approach called the communicating vessels and experimentally show how it reduces service response time and senses server capabilities without probing.

APA, Harvard, Vancouver, ISO, and other styles

8

Emad Ali, Tariq, Ameer Hussein Morad, and Mohammed A. Abdala. "Load Balance in Data Center SDN Networks." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 5 (October 1, 2018): 3084. http://dx.doi.org/10.11591/ijece.v8i5.pp3084-3091.

Full text

Abstract:

In the last two decades, networks had been changed according to the rapid changing in its requirements. The current Data Center Networks have large number of hosts (tens or thousands) with special needs of bandwidth as the cloud network and the multimedia content computing is increased. The conventional Data Center Networks (DCNs) are highlighted by the increased number of users and bandwidth requirements which in turn have many implementation limitations. The current networking devices with its control and forwarding planes coupling result in network architectures are not suitable for dynamic computing and storage needs. Software Defined networking (SDN) is introduced to change this notion of traditional networks by decoupling control and forwarding planes. So, due to the rapid increase in the number of applications, websites, storage space, and some of the network resources are being underutilized due to static routing mechanisms. To overcome these limitations, a Software Defined Network based Openflow Data Center network architecture is used to obtain better performance parameters and implementing traffic load balancing function. The load balancing distributes the traffic requests over the connected servers, to diminish network congestions, and reduce underutilization problem of servers. As a result, SDN is developed to afford more effective configuration, enhanced performance, and more flexibility to deal with huge network designs

APA, Harvard, Vancouver, ISO, and other styles

9

Liang, Shih Tsung, Bo Yi Song, and Yu Yao Su. "Opportunistic Frame Forwarding in Wireless Mesh Networks." Applied Mechanics and Materials 764-765 (May 2015): 941–45. http://dx.doi.org/10.4028/www.scientific.net/amm.764-765.941.

Full text

Abstract:

Opportunistic routing has been shown to achieve the high throughput of the wireless mesh network with lossy channels. Different from deterministic routing mechanisms in which a frame is transmitted and forwarded along with a fixed and predetermined path, the opportunistic routing technique allows multiple nodes hearing the frame to form the forwarder set containing promising candidates for the frame forwarding. Existing opportunistic routing protocols typically choose among forwarding candidates based on the decision made from the transmitter disregarding the current loads in candidates. In this paper, the opportunistic frame forwarding mechanism with considering backlog of frames among forwarders is proposed and analyzed. Specifically, in addition to take into account the delivery probability, our proposal restricts members of the forwarder set for a given transmitter to those wireless nodes whose transmission range covers one another and makes the true forwarder picked from the forward set of a given transmitting frame being the one who gains access to wireless channel for the frame before others do. Therefore, the efficient and load-balanced opportunistic routing for wireless mesh networks can be achieved. Analytic results show that the proposed method compared to the deterministic routing methodology can achieve the high frame delivery ratio.

APA, Harvard, Vancouver, ISO, and other styles

10

Yu, Haisheng, Keqiu Li, and Heng Qi. "An Active Controller Selection Scheme for Minimizing Packet-In Processing Latency in SDN." Security and Communication Networks 2019 (October 13, 2019): 1–11. http://dx.doi.org/10.1155/2019/1949343.

Full text

Abstract:

In software-defined network, the use of distributed controllers to control forwarding devices has been proposed to solve the issues of scalability and load balance. However, the forwarding devices are statically assigned to the controllers in these distributed systems, which can overload some controllers while others are underutilized. In this paper, we propose an architecture named ASLB (active controller selection load balance), which proactively selects appropriate controllers for load balancing and minimize packet processing delays. We also present a novel active controller selection algorithm (ACS) for ASLB that efficiently schedules traffic from the switch to the controller and designs an intermediate coordinator for actively selecting a controller to serve a request. We built a system and evaluated it on a physical platform. The results show that ASLB is much better than the static allocation scheme in terms of minimizing latency, bandwidth utilization, and throughput.

APA, Harvard, Vancouver, ISO, and other styles

11

Abondo, Charles, and Samuel Pierre. "Dynamic Location and Forwarding Pointers for Mobility Management." Mobile Information Systems 1, no. 1 (2005): 3–24. http://dx.doi.org/10.1155/2005/656715.

Full text

Abstract:

GSM and IS-41 are two mobility management standards widely used in second generation networks. These two standards lean on a centralized architecture made up of home location registers (HLRs) and visitor location registers (VLRs). From these standards, the location update and search procedures always imply interrogation of the HLR, even if the two mobile terminals that want to communicate are in the same location area. Given the limited bandwidth of the radio operator channel and the new time sensitive applications of third-generation systems, such an approach of mobility management is not convenient for the next generation mobile networks. This paper proposes a method for reducing the processing load and the signalization traffic generated by update and search location procedures compared to IS-41 standard. Taking into account the specific characteristics of the traffic in the mobile networks, it introduces a semi-dynamic approach based on a hybrid architecture using forwarding pointers without the load related to the dynamic models. Numerical results show that such a method significantly improves the efficiency of location procedures.

APA, Harvard, Vancouver, ISO, and other styles

12

Bazmi, Parisa, and Manijeh Keshtgary. "A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING." IIUM Engineering Journal 17, no. 2 (November 30, 2016): 59–69. http://dx.doi.org/10.31436/iiumej.v17i2.617.

Full text

Abstract:

Named Data Networking (NDN) is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN) Based Traffic-aware Forwarding strategy (NNTF) is introduced in order to determine an optimal path for Interest forwarding. NN is embedded in NDN routers to select next hop dynamically based on the path overload probability achieved from the NN. This solution is characterized by load balancing and QoS-awareness via monitoring the available path and forwarding data on the traffic-aware shortest path. The performance of NNTF is evaluated using ndnSIM which shows the efficiency of this scheme in terms of network QoS improvementof17.5% and 72% reduction in network delay and packet drop respectively.

APA, Harvard, Vancouver, ISO, and other styles

13

Mingyu Lim, Hyungseok Kim, and JeeIn Kim. "Lessening Forwarding Load of Application Server in Distributed Multi-User Systems." Journal of Next Generation Information Technology 2, no. 2 (May 31, 2011): 22–30. http://dx.doi.org/10.4156/jnit.vol2.issue2.4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Kumar, Shreyansh, and Parvathi R. "Back-End Forwarding Scheme in Server Load Balancing using Client Virtualization." International Journal of Computer Applications 95, no. 18 (June 18, 2014): 38–44. http://dx.doi.org/10.5120/16698-6829.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

KIM, Ki-Il, Min-Jung BAEK, and Tae-Eung SUNG. "Load Balancing for Greedy Forwarding of Geographic Routing in Wireless Networks." IEICE Transactions on Communications E93-B, no. 8 (2010): 2184–87. http://dx.doi.org/10.1587/transcom.e93.b.2184.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Dadhich, Reena, and Aditya Shastri. "Load Balancing In Wireless Ad-Hoc Networks With Low Forwarding Index." International Journal of Wireless & Mobile Networks 3, no. 1 (February 24, 2011): 40–48. http://dx.doi.org/10.5121/ijwmn.2011.3104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Chen, Wenlong, Zhe Zheng, Rong Xiao, Fan Li, and Zhenzhen Sun. "HRVN: A Highly Reliable Forwarding Model Based on Virtual Nodes in Node-Intensive WSNs." International Journal of Distributed Sensor Networks 2015 (2015): 1–12. http://dx.doi.org/10.1155/2015/829589.

Full text

Abstract:

Transmission links in wireless sensor networks (WSNs) are prone to failure because of breakdown, movement, and energy depletion of nodes. Aiming at node-intensive environment, this paper proposes a highly reliable forwarding model based on virtual nodes (HRVN) in tree-based topology networks. A virtual node (VN) consists of several neighboring physical sensor nodes, which have common parent node and children nodes. Normally, the physical sensor nodes in the same VN forward packets in a load-balancing scheme. When a sensor node in a VN is in failure, the others would take over its forwarding work immediately. Moreover, the internal changes of a VN are transparent to its parent and children nodes. The experiments prove the model can provide load-balance and fast recovery from failure with low cost.

APA, Harvard, Vancouver, ISO, and other styles

18

Zhao, Xiu Mei, Fang Ai Liu, and Song Qin. "Chord-Based Indexing Model to Support Complex Query and Load Balancing." Key Engineering Materials 474-476 (April 2011): 1781–86. http://dx.doi.org/10.4028/www.scientific.net/kem.474-476.1781.

Full text

Abstract:

This paper presents a new model (SMF-Chord) which is expanded from Chord. SMF-Chord uses double-fingerprint, double-mapping and dynamic forwarding mechanism to support multi-attribute multi-keyword fuzzy-matching query, and also has a load balancing mechanism which includes three parts: similar-close transposition, forward balancing and hot-set cache. The experiment results show SMF-Chord has high recall rate with low storage redundancy, and it can effectively balance load when node mapping load, file storage load, or query load is unbalanced.

APA, Harvard, Vancouver, ISO, and other styles

19

Idoudi, Hanen. "Efficient Forwarding With Power Saving and Load Balancing In Wireless Sensor Networks." International Journal of Business Data Communications and Networking 9, no. 2 (April 2013): 45–60. http://dx.doi.org/10.4018/jbdcn.2013040104.

Full text

Abstract:

Energy efficiency is still a challenging issue in wireless sensor networks (WSNs). Balancing nodes’ activities and duty cycling are efficient ways that could enhance WSN’s performances. In this paper the authors introduce a new asynchronous power saving mechanism that provides an adaptive duty cycle and a minimum overhead to achieve load balancing and energy saving. This mechanism relies on two basic functions: an asynchronous duty cycling for activity balancing and a lightweight geographic routing. Extensive simulations showed the effectiveness of the proposed approach in terms of residual energy, energy consumption balancing and packet delivery ratio.

APA, Harvard, Vancouver, ISO, and other styles

20

Wang, Qingwen, and Haitao Yu. "A novel routing protocol considering the boundary effects for ad hoc networks." International Journal of Distributed Sensor Networks 16, no. 1 (January 2020): 155014772090363. http://dx.doi.org/10.1177/1550147720903635.

Full text

Abstract:

To alleviate the broadcast storm problem in the route discovery process, this article proposes a novel routing protocol considering the boundary effects for ad hoc networks, named NRP. The novelty of NRP lies in the following: first, NRP defines a forwarding area criterion considering the effects of the node transmission area boundary to reduce the broken links due to the mobility of nodes; second, NRP adopts the idea of a piecewise function to estimate the node degree when the nodes are in the center, borderline, and corner areas, respectively, which considers the effects of both network boundaries and node communication boundaries without broadcasting Hello messages periodically; third, NRP applies the static game forwarding strategy to calculate the forwarding probability during the route discovery process. NRP reduces the redundant retransmissions and collision probability among neighboring nodes, thus improving the forwarding efficiency. The extensive simulation results by NS-2 simulator have shown that NRP performs better than AODV + FDG, AODV + Hello, ad hoc on-demand distance vector, ad hoc on-demand multipath distance vector, and energy-efficient ant-based routing in terms of packet delivery ratio, routing overhead, normalized medium access control load, throughput, and network lifetime.

APA, Harvard, Vancouver, ISO, and other styles

21

Jiří, Dvořák, Natov Pavel, and Lieskovský Martin. "Modelling of forwarding distance to maximize the utilization of medium and high-power harvester technology." Journal of Forest Science 63, No. 1 (January 30, 2017): 45–52. http://dx.doi.org/10.17221/114/2016-jfs.

Full text

Abstract:

Every technologist aims to maximize the performance and capacity of vehicles, particularly when deployed in technological lines. To maximize the utilization of harvester technology, particularly of forwarders following the work of harvesters, it is useful to determine the maximum forwarding distance for consequent transport of timber, which was the aim of this study. The analysis presented in this study was conducted in medium and high-power vehicles which are dominantly deployed in the Czech Republic. The same performance of harvesters and forwarders is achieved by the calculation of the maximum forwarding distance. Other variables are constant for the time models (average load volume of forwarders is 12.1 m3 and the mean-tree volume is constant for every logged stem). Our conclusions suggested a maximum forwarding distance ranging from 116 to 1,052 m, depending on the decreasing mean-tree volume which ranged from 0.3 to 1.0 m3 per tree in the monitored logged stand.

APA, Harvard, Vancouver, ISO, and other styles

22

CARAZO, PABLO, RUBÉN APOLLONI, FERNANDO CASTRO, DANIEL CHAVER, LUIS PINUEL, and FRANCISCO TIRADO. "REDUCING CACHE HIERARCHY ENERGY CONSUMPTION BY PREDICTING FORWARDING AND DISABLING ASSOCIATIVE SETS." Journal of Circuits, Systems and Computers 21, no. 07 (November 2012): 1250057. http://dx.doi.org/10.1142/s0218126612500570.

Full text

Abstract:

The first level data cache in modern processors has become a major consumer of energy due to its increasing size and high frequency access rate. In order to reduce this high energy consumption, we propose in this paper a straightforward filtering technique based on a highly accurate forwarding predictor. Specifically, a simple structure predicts whether a load instruction will obtain its corresponding data via forwarding from the load-store structure — thus avoiding the data cache access — or if it will be provided by the data cache. This mechanism manages to reduce the data cache energy consumption by an average of 21.5% with a negligible performance penalty of less than 0.1%. Furthermore, in this paper we focus on the cache static energy consumption too by disabling a portion of sets of the L2 associative cache. Overall, when merging both proposals, the combined L1 and L2 total energy consumption is reduced by an average of 29.2% with a performance penalty of just 0.25%.

APA, Harvard, Vancouver, ISO, and other styles

23

Ji, Yun. "A Wireless Sensor Network-Based Defence Model against Selective Forwarding Attack." International Journal of Online Engineering (iJOE) 14, no. 05 (May 25, 2018): 70. http://dx.doi.org/10.3991/ijoe.v14i05.8651.

Full text

Abstract:

Due to low communication costs and convenient deployment, wireless sensor network has been widely applied in various fields. However, it still has some problems in the defence against selective forwarding attacks. To address these problems, this paper proposes a model against selective forwarding attacks, which is built on the threshold secret sharing mechanism and adopts the individualized path routing protocol. Through simulation test, this paper studies the effects of attack intensity on the successful transmission rate and communication load under the same network deployment and communication topology but at different node densities and average neighbourhood degrees. The results show that this model can effectively defend against forwarding attacks, also saves communication resource, offering a technical reference for similar studies.

APA, Harvard, Vancouver, ISO, and other styles

24

Anandakrishnan, N., and Neena Roshini. "A STUDY ON GEOGRAPHICAL ROUTING WITH ADAPTIVE POSITION UPDATE." International Journal of Engineering Technologies and Management Research 5, no. 3 (February 13, 2020): 108–15. http://dx.doi.org/10.29121/ijetmr.v5.i3.2018.181.

Full text

Abstract:

Geographical Routing is a routing methodology mainly used for wireless mobile networks (Mobile Adhoc Networks, MANETs). MANETs are comprised of mobile nodes or mobile computing devices which are free to move randomly and thus the network's wireless topology may also change randomly. In Geographical Routing, nodes need to maintain the current positions of their neighbors for making forwarding decisions and hence the Adaptive Position Update (APU) method is proposed. Based on the flexibility of the nodes and the forwarding decisions made in the network, APU dynamically keeps in track of the rate of position updates. It is based on nodes with movements which are complex to predict their updated positions frequently and also the nodes which are closer to forwarding paths and update their positions more frequently. The APU is validated by network simulations showing that APU can potentially reduce the traffic load and acknowledge the mobility of nodes. It also improves the routing performance in terms of packet delivery ratio and packet delays.

APA, Harvard, Vancouver, ISO, and other styles

25

Yuan, Peiyan, Xiaoxiao Pang, and Xiaoyan Zhao. "Influence of Crowd Participation Features on Mobile Edge Computing." Future Internet 10, no. 10 (September 25, 2018): 94. http://dx.doi.org/10.3390/fi10100094.

Full text

Abstract:

Mobile edge computing is a new communication paradigm, which stores content close to the end users, so as to reduce the backhaul delay and alleviate the traffic load of the backbone networks. Crowd participation is one of the most striking features of this technology, and it enables numerous interesting applications. The dynamics of crowd participation offer unprecedented opportunities for both content caching and data forwarding. In this paper, we investigate the influence of the dynamics of crowd participation, from the perspective of opportunistic caching and forwarding, and discuss how we can exploit such opportunities to allocate content and select relays efficiently. Some existing issues in this emerging research area are also discussed.

APA, Harvard, Vancouver, ISO, and other styles

26

Gao, Xiao Yan, Zhong Yong Wu, Xian Wang, Zhen Hua Duan, Jin Tao Qu, and Yun Han Liu. "The Research of Energy Saving Improved on Copper Anode in the Hydraulic System Based on AMESim." Advanced Materials Research 591-593 (November 2012): 785–88. http://dx.doi.org/10.4028/www.scientific.net/amr.591-593.785.

Full text

Abstract:

In response to the awareness of environmental conservation-oriented society and low carbon economy , this paper puts forwarding the load sensing control that is applied to the copper anode shaping machine hydraulic system energy transformation in the light of copper electrolytic anode shaping machine hydraulic system energy conservation issues, through the shaping machine hydraulic system energy loss analysis, and then uses AMESim software for plastic machine load sensing control system performance simulation and analysis, in order to achieve the purpose of energy saving.

APA, Harvard, Vancouver, ISO, and other styles

27

Kim, Do Hyeon, and Choong Seon Hong. "Transmission Delay Estimation-based Forwarding Strategy for Load Distribution in Software-Defined Network." KIISE Transactions on Computing Practices 23, no. 5 (May 15, 2017): 310–15. http://dx.doi.org/10.5626/ktcp.2017.23.5.310.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Sule, Oladele Theophilus, Roberto Rojas-Cessa, Ziqian Dong, and Chuan-Bi Lin. "A Split-Central-Buffered Load-Balancing Clos-Network Switch With In-Order Forwarding." IEEE/ACM Transactions on Networking 27, no. 2 (April 2019): 467–76. http://dx.doi.org/10.1109/tnet.2018.2883747.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Zhang, Zhen-Hao, Xiao-Yin Wang, Dong Tong, Jiang-Fang Yi, Jun-Lin Lu, and Ke-Yi Wang. "Active Store Window: Enabling Far Store-Load Forwarding with Scalability and Complexity-Efficiency." Journal of Computer Science and Technology 27, no. 4 (July 2012): 769–80. http://dx.doi.org/10.1007/s11390-012-1263-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Sebastian, A., S. Sivagurunathan, and . "Load Balancing Metric Based Routing Protocol for Low Power and Lossy Networks (lbRPL)." International Journal of Engineering & Technology 7, no. 2.22 (April 20, 2018): 39. http://dx.doi.org/10.14419/ijet.v7i2.22.11806.

Full text

Abstract:

IETF ROLL working Group standardized the IPv6 Routing protocol (RPL) for applications over low-power and lossy networks (LLNs). RPL constructs a Destination Oriented Direction Acyclic Graph (DODAG) to organize network topology. RPL shows fast network setup and good scalability. However, it may suffer from load imbalance due to diverse network traffic and heavy load on preferred or forwarding parents. To optimize the load balancing of routes in RPL, this paper proposes load balancing metric based routing protocol called lbRPL. We introduce a new routing metric for RPL called load balancing index (LBI), which exploits load balancing characteristics of RPL nodes to select more load balanced parents and routes. LBI includes ETX, Parent count (Pc) and Remaining Parent Energy (Pe) metrics to make routing decisions. Simulation results show that lbRPL improves network performance, stability and improved network life time to RPL.

APA, Harvard, Vancouver, ISO, and other styles

31

Mollamotalebi, M., R. Maghami, and A. S. Ismail. "A Weight-based Query Forwarding Technique for Super-peer-based Grid Resource Discovery." Engineering, Technology & Applied Science Research 7, no. 1 (February 12, 2017): 1398–404. http://dx.doi.org/10.48084/etasr.952.

Full text

Abstract:

Grid computing environments include heterogeneous resources shared by a large number of computers to handle data and process intensive applications. The required resources must be accessible for the grid applications on demand, which makes resource discovery a critical service. In recent years, different techniques are provided to index and discover grid resources. Response time and message load during the search process highly affect the efficiency of resource discovery. This paper proposes a technique to forward the queries based on the resource types accessible through each neighbor in super-peer-based grid resource discovery approaches. The proposed technique is simulated in GridSim and the experimental results indicated that it is able to reduce the response time and message load during the search process especially when the grid environment contains a large number of nodes.

APA, Harvard, Vancouver, ISO, and other styles

32

Devikar, Rohit Nilkanth, Dipak V. Patil, and V. Chandraprakash. "Issues in Routing Mechanism for Packets Forwarding: A Survey." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 1 (February 1, 2016): 421. http://dx.doi.org/10.11591/ijece.v6i1.pp421-430.

Full text

Abstract:

Nowadays internet has become more popular to each and every one. It is very sensitive to nodes or links failure due to many known or unknown issues in the network connectivity. Routing is the important concept in wired and wireless network for packet transmission. During the packet transmission many times some of the problems occur, due to this packets are being lost or nodes not able to transmit the packets to the specific destination. This paper discusses various issues and approaches related to the routing mechanism. In this paper, we present a review and comparison of different routing algorithms and protocols proposed recently in order to address various issues. The main purpose of this study is to address issues for packet forwarding like network control management, load balancing, congestion control, convergence time and instability. We also focus on the impact of these issues on packet forwarding.

APA, Harvard, Vancouver, ISO, and other styles

33

Devikar, Rohit Nilkanth, Dipak V. Patil, and V. Chandraprakash. "Issues in Routing Mechanism for Packets Forwarding: A Survey." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 1 (February 1, 2016): 421. http://dx.doi.org/10.11591/ijece.v6n1.8151.

Full text

Abstract:

Nowadays internet has become more popular to each and every one. It is very sensitive to nodes or links failure due to many known or unknown issues in the network connectivity. Routing is the important concept in wired and wireless network for packet transmission. During the packet transmission many times some of the problems occur, due to this packets are being lost or nodes not able to transmit the packets to the specific destination. This paper discusses various issues and approaches related to the routing mechanism. In this paper, we present a review and comparison of different routing algorithms and protocols proposed recently in order to address various issues. The main purpose of this study is to address issues for packet forwarding like network control management, load balancing, congestion control, convergence time and instability. We also focus on the impact of these issues on packet forwarding.

APA, Harvard, Vancouver, ISO, and other styles

34

Li, Qiang, Liang Bin Chen, and Zhong Hua Wang. "A New P2P Streaming Media VOD System Based on Window." Applied Mechanics and Materials 325-326 (June 2013): 1770–73. http://dx.doi.org/10.4028/www.scientific.net/amm.325-326.1770.

Full text

Abstract:

Currently some P2P video-on-demand patterns using the corresponding technique to adjust and monitor network peer state, effectively reduce the multilayer peer forwarding delay, so as to ensure that the system has good stability and expansibility, but in response to the sudden resource request can not guarantee that the system load balancing. This paper presents a new P2P streaming media VOD system based on window, using a resource reservation mechanism for load balancing algorithm which can realize video server in each media stream between the rational allocation, give full play to the peer load capacity. The simulation shows that the system is able to respond to sudden resource request, and has high bandwidth utilization, effectively improves the performance of the system.

APA, Harvard, Vancouver, ISO, and other styles

35

Farooq, Muhammad Omer, and Thomas Kunz. "Contiki-Based IEEE 802.15.4 Channel Capacity Estimation and Suitability of Its CSMA-CA MAC Layer Protocol for Real-Time Multimedia Applications." Mobile Information Systems 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/398637.

Full text

Abstract:

Real-time multimedia applications require quality of service (QoS) provisioning in terms of bounds on delay and packet loss along with soft bandwidth guarantees. The shared nature of the wireless communication medium results in interference. Interference combined with the overheads, associated with a medium access control (MAC) protocol, and the implementation of a networking protocol stack limit the available bandwidth in IEEE 802.15.4-based networks and can result in congestion, even if the transmission rates of nodes are well below the maximum bandwidth supported by an underlying communication technology. Congestion degrades the performance of admitted real-time multimedia flow(s). Therefore, in this paper, we experimentally derive the IEEE 802.15.4 channel capacity using an unslotted CSMA-CA MAC protocol. We experimentally derive channel capacity for two cases, that is, when the CSMA-CA protocol is working without ACKs and when it is working with ACKs. Moreover, for both cases, we plot the relationship of offered data load with delay and packet loss rate. Simulation results demonstrate that the parameters that affect the choice of a CSMA-CA MAC layer protocol are end-to-end delay and packet loss requirements of a real-time multimedia flow, data load within the interference range of transmitters along the forwarding path, and length of the forwarding path.

APA, Harvard, Vancouver, ISO, and other styles

36

Yu, Chih-Min, Mohammad Tala’t, Chun-Hao Chiu, and Chin-Yao Huang. "Joint Balanced Routing and Energy Harvesting Strategy for Maximizing Network Lifetime in WSNs." Energies 12, no. 12 (June 18, 2019): 2336. http://dx.doi.org/10.3390/en12122336.

Full text

Abstract:

Nowadays, wireless sensor networks (WSNs) are becoming increasingly popular due to the wide variety of applications. The network can be utilized to collect and transmit numerous types of messages to a data sink in a many-to-one fashion. The WSNs usually contain sensors with low communication ability and limited battery power, and the battery replacement is difficult in WSNs for large amount embedded nodes, which indicates a balanced routing strategy is essential to be developed for an extensive operation lifecycle. To realize the goal, the research challenges require not only to minimize the energy consumption in each node but also to balance the whole WSNs traffic load. In this article, a Shortest Path Tree with Energy Balance Routing strategy (SPT-EBR) based on a forward awareness factor is proposed. In SPT-EBR, Two methods are presented including the power consumption and the energy harvesting schemes to select the forwarding node according to the awareness factors of link weight. First, the packet forwarding rate factor is considered in the power consumption scheme to update the link weight for the sensors with higher power consumption and mitigate the traffic load of hotspot nodes to achieve the energy balance network. With the assistance of the power consumption scheme, hotspot nodes can be transferred from the irregular location to the same intra-layer from the sink. Based on this feature, the energy harvesting scheme combines both the packet forwarding rate and the power charging rate factors together to update the link weight with a new battery charging rate factor for hotspot nodes. Finally, simulation results validate that both power consumption and energy harvesting schemes in SPT-EBR achieve better energy balance performance and save more charging power than the conventional shortest path algorithm and thus improve the overall network lifecycle.

APA, Harvard, Vancouver, ISO, and other styles

37

Kaur, Prabhjot, Jasmeen Kaur Chahal, and Abhinav Bhandari. "Load Balancing in Software Defined Networking: A Review." Asian Journal of Computer Science and Technology 7, no. 2 (August 5, 2018): 1–5. http://dx.doi.org/10.51983/ajcst-2018.7.2.1859.

Full text

Abstract:

Software Defined Networking is an adaptable way of networking, which disconnects data forwarding plane and control-plane of system equipment’s and also solves issues in existing network infrastructure. More specifically, the control-plane of software defined network decides the advancing way of network flow with Centralized Control Manner (CCM). SDN (Software Defined Networking) is a strategy for making, planning and overseeing systems which intend to change this present unfortunate circumstance. It has been used in dissimilar areas, like a campus networks and data center systems. In this survey paper, we’ve reviewed the concept of (SDNs) Software Defined Networks, its architecture and applications. In the survey, it has been found that SDN load balancing has become more smart and efficient and reduces the statistic collection overhead and maintain better QoS (Quality of Service) data rates. In addition, we reviewed the direct routing based algorithms of Load Balancer and compare with Round Robin Strategy. Furthermore, we’ve reviewed and compared the existing work to get better idea about the concept of Load balancing.

APA, Harvard, Vancouver, ISO, and other styles

38

S.Shetty, Bharati, and Suresha . "Survey on Energy Efficient Routing Protocols by Clustering and Load balancing in Wireless Sensor Networks." International Journal of Engineering & Technology 7, no. 3.12 (July 20, 2018): 153. http://dx.doi.org/10.14419/ijet.v7i3.12.15907.

Full text

Abstract:

Wireless Sensor Network (WSN) is consisting of nodes which deployed to sense the physical environment. In WSN there is excessive growth in performance evaluation and analysis techniques, because of fast development in Information and Communication Technologies (ICT). The main resource problem in WSN is the energy of sensor nodes. There is need of routing protocol which consumes less energy during communication. A reliable and robust routing protocol which limits the excess energy consumed by nodes during forwarding and receiving messages results in energy efficiency protocol. This survey work provides the advantages, drawbacks and comparison of five energy efficient routing protocols.

APA, Harvard, Vancouver, ISO, and other styles

39

Duan, Wenxuan, Xing Tang, Junwei Zhou, Jing Wang, and Guosheng Zhou. "Load Balancing Opportunistic Routing for Cognitive Radio Ad Hoc Networks." Wireless Communications and Mobile Computing 2018 (December 2, 2018): 1–16. http://dx.doi.org/10.1155/2018/9412782.

Full text

Abstract:

Recent research activities have shown that opportunistic routing can achieve considerable performance gains in Cognitive Radio Ad hoc Networks (CRAHNs). Most of these studies focused on designing appropriate metrics to select and prioritize the forwarding candidates. However, in multiple-flow networks, a small number of nodes may always be with the higher priority order for different flows. Thus, some nodes may easily become overloaded with too much traffic and be severely congested. To overcome this problem, we propose a load balancing opportunistic routing (LBOR) scheme to maximize the total throughput of the whole network. We first formulate the problem of maximizing the total throughput of the network as a linear programming problem. Then, we develop heuristic load balancing candidate forwarder sorting and selection algorithms. Simulation results and comparisons demonstrate that our proposed LBOR scheme outperforms existing opportunistic routing protocols with nonload balancing methods in CRAHNs.

APA, Harvard, Vancouver, ISO, and other styles

40

Hildt, Eduardo, Andrés Leszczuk, Patricio Mac Donagh, and Tomás Schlichter. "Time Consumption Analysis of Forwarder Activities in Thinning." Croatian journal of forest engineering 41, no. 1 (December 9, 2019): 13–24. http://dx.doi.org/10.5552/crojfe.2020.615.

Full text

Abstract:

Forwarding can be divided into separate work elements. These are affected by several factors: forwarding distance, load volume, and types of assortments harvested. For a detailed planning of thinning, productivity models should include these factors. This study analysed the time consumption of forwarder thinning operations in five pine plantations in the north-east of Argentina, determining how the log size and log concentration affect each work element. Time-and-motion studies were carried out, recording the activities with digital video cameras, and tracking the forwarder movements with global navigation satellite system (GNSS) receivers. Different linear mixed models were fitted to estimate the time consumption of each work element in relation to different predictive factors. When driving on the road, the forwarders had an average speed of 71.6 m min-1 empty and 75.7 m min-1 loaded. When driving in the stand, the average speed was 56.9 m min-1 empty and 52.2 m min-1 loaded. These speeds did not correlate with the forwarder size or load volume. For the loading and unloading elements, the linear mixed model explained 56% and 49% of the variability considering only the fixed effect of the logs size and the load volume. For driving while loading, the total volume loaded, and the log concentration of the assortment loaded explained 50% of the time consumption variability, with 17% being explained by random effects. The general time and productivity model developed can be applied to support accurate decisions in the process of thinning planning.

APA, Harvard, Vancouver, ISO, and other styles

41

Xiao, Guangbing, Haibo Zhang, Ning Sun, Yong Chen, Jiamin Shi, and Yong Zhang. "Cooperative Bargain for the Autonomous Separation of Traffic Flows in Smart Reversible Lanes." Complexity 2019 (October 30, 2019): 1–12. http://dx.doi.org/10.1155/2019/2893732.

Full text

Abstract:

Spacer bars in the smart reversible lanes make periodically broadcast of messages to share their local observed traffic information with each other. This aims to help other spacer bars acquire the global traffic information and make consistent movement when separating the flows. However, radio interference and vehicles in the traffic may degrade the qualities of wireless communication links and cause frequent message losses in the broadcast. Existing solutions tend to use data forwarding to enhance the message dissemination, which may cause imbalanced load in the spacer bars. For instance, the nodes close to the sink have to forward more messages, whereas the ones far away from the sink have fewer messages for forwarding. The unbalanced distribution of network load has a high risk of blocking the wireless communication links and yield inconsistent movement in the reversible lanes. In this paper, we propose a Cooperative Bargain (CoB) scheme where each spacer bar carries some received messages to help other spacer bars recover their lost messages. Since the spacer bars can only acquire the local information, we formulate a cooperative bargain game to negotiate how to allocate the task of message recovery with a balanced network load until a consensus is achieved. CoB is evaluated with the real-world Wi-Fi communication traces in Isti/rural. Simulation results show that CoB can recover an average of 98.6% messages within 100 milliseconds in a 50-node network. CoB does not require the global network information but it can still achieve a comparable performance to other broadcast schemes.

APA, Harvard, Vancouver, ISO, and other styles

42

Dhiman, Kirti. "Design Test-bed for assessing load utilising using Multicast Forwarding Approach in Wireless Mesh Networks." IOSR Journal of Computer Engineering 13, no. 6 (2013): 37–40. http://dx.doi.org/10.9790/0661-1363740.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Du, Xue-Kai, Zhi-Hui Lu, Qiang Duan, Jie Wu, and Cheng-Rong Wu. "LTSS: Load-Adaptive Traffic Steering and Forwarding for Security Services in Multi-Tenant Cloud Datacenters." Journal of Computer Science and Technology 32, no. 6 (November 2017): 1265–78. http://dx.doi.org/10.1007/s11390-017-1799-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Chen, Fei, ChunMing Wu, Bin Wang, YaGuan Qian, and XiaoChun Wu. "Dynamic load distribution with hop-by-hop forwarding based on max-min one-way delay." Science China Information Sciences 57, no. 6 (April 24, 2014): 1–12. http://dx.doi.org/10.1007/s11432-013-4956-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Yin, Hang, Xu Zhang, Xianlin Huang, and Hongqian Lu. "Two novel robust tracking control strategies for eliminating aircraft wing rock." Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering 233, no. 8 (August 16, 2018): 3042–55. http://dx.doi.org/10.1177/0954410018794807.

Full text

Abstract:

Nonlinearities are essential features in the model of aircraft wing rock system and limit cycle is a typical phenomenon when flying without any control force. In this work, we concentrate on two robust tracking control schemes for automatic flight control systems by using forwarding technique. Combining forwarding technique with adaptive control and disturbance observer, manifolds are represented as insensitivity to parameter uncertainties and external disturbances. A second-order filter is employed to compute mappings and their analytic derivatives at each step of the design. The global, uniform, and ultimate boundedness of all trajectories are guaranteed by internal stability of filters. Unlike some of the existing control methodologies, modularization and no differential operations together with reduction of computational load are the main advantages for practical applications. Scheme 1 requires no prior knowledge of unknown parameters and scheme 2 analyzes the convergence rate of uncertainty observers. Controller performance and comparison between two approaches are demonstrated via simulations.

APA, Harvard, Vancouver, ISO, and other styles

46

Villordo-Jimenez, Iclia, Noé Torres-Cruz, Marcelo M. Carvalho, Rolando Menchaca-Mendez, Mario E. Rivero-Angeles, and Ricardo Menchaca-Mendez. "A Selective-Awakening MAC Protocol for Energy-Efficient Data Forwarding in Linear Sensor Networks." Wireless Communications and Mobile Computing 2018 (2018): 1–18. http://dx.doi.org/10.1155/2018/6351623.

Full text

Abstract:

We introduce the Selective-Awakening MAC (SA-MAC) protocol which is a synchronized duty-cycled protocol with pipelined scheduling for Linear Sensor Networks (LSNs). In the proposed protocol, nodes selectively awake depending on node density and traffic load conditions and on the state of the buffers of the receiving nodes. In order to characterize the performance of the proposed protocol, we present a Discrete-Time Markov Chain-based analysis that is validated through extensive discrete-event simulations. Our results show that SA-MAC significantly outperforms previous proposals in terms of energy consumption, throughput, and packet loss probability. This is particularly true under high node density and high traffic load conditions, which are expected to be common scenarios in the context of IoT applications. We also present an analysis by grade (i.e., the number of hops to the sink, which is located at one end of the LSN) that reveals that LSNs exhibit heterogeneous performance depending on the nodes’ grade. Such results can be used as a design guideline for future LSN implementations.

APA, Harvard, Vancouver, ISO, and other styles

47

Zhang, Yaming, Yaya H. Koura, and Yanyuan Su. "SIR approach in modeling data packets forwarding at a leaky bucket." International Journal of Modeling, Simulation, and Scientific Computing 11, no. 05 (August 7, 2020): 2050043. http://dx.doi.org/10.1142/s1793962320500439.

Full text

Abstract:

When network users are intensively interacting during rush hour, avoiding data loss and latency is a concern in guaranteeing segment reliability. Implementing a leaky bucket could be needed to achieve flows effective monitoring by generating network of queues at given output link. Packets associated with different sessions and originated from different hosts may be mixed up and queuing delay may become longer, depending on network segment state, buffering strategy, users’ behavior among other factors. It is interesting to assimilate these stages of packets traveling through network segment to the concept of epidemic control. This paper proposes a SIR (Susceptible–Infected–Recovered) approach in modeling data packets transmission at a leaky bucket at peak hour. We focused our analysis on packets buffering and recovery strategy impact on segment forwarding performance in heavy load situation. Numerical results suggested adapting buffering strategy and packets recovery to enhance transmission and network overall performance.

APA, Harvard, Vancouver, ISO, and other styles

48

Shirly, Geofrin, and N. Kumar. "A survey on energy efficiency in mobile ad hoc networks." International Journal of Engineering & Technology 7, no. 2.21 (April 20, 2018): 382. http://dx.doi.org/10.14419/ijet.v7i2.21.12447.

Full text

Abstract:

A mobile ad-hoc network is a collection of wireless mobile nodes which temporarily forms a network without any type of centralized administration which is already in use. In adhoc network, the battery lifetime of the mobile nodes is less. If suppose any nodes battery power is drained it leads to spreading of many divisions in the networks. Hence these spreader nodes are the very important spot in this network. For the purpose of data forwarding some very important nodes can drain their battery power in advance because of increase in load and processing for forwarding the data. Because of the variance in loads developed, the network of nodes will be collapsed very badly, the route lifetime will be reduced, network will be partitioned and route reliability is reduced in MANETs. Because of this, the most important criteria which have to be improved is the consumption of energy in mobile ad-hoc networks. The very important technique is power aware routing technique in MANETs. Hence minimization of energy in the network of mobile nodes individually can be done by using some of the routing techniques. The most important thing is to study the power aware protocol in order to help the new research doers and application developers to find a new idea for designing more efficient routing protocols.

APA, Harvard, Vancouver, ISO, and other styles

49

Isik, Sinan, Mehmet Yunus Donmez, and Cem Ersoy. "Multi-sink load balanced forwarding with a multi-criteria fuzzy sink selection for video sensor networks." Computer Networks 56, no. 2 (February 2012): 615–27. http://dx.doi.org/10.1016/j.comnet.2011.10.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Zhou, Jiliang, and Ziqiang Lin. "Lightweight load-balanced and authentication scheme for a cluster-based wireless sensor network." International Journal of Distributed Sensor Networks 17, no. 2 (February 2021): 155014772098032. http://dx.doi.org/10.1177/1550147720980326.

Full text

Abstract:

Clustering technology is one of the crucial technologies to prolong the lifetime in wireless sensor networks. However, most cluster schemes choose cluster head randomly to send data without considering load balancing and security. In addition, some cluster heads in the highly active area may be overloaded, while others in the low active area may be overloaded, which may easily lead to extreme imbalance in task allocation. Our research on relevant literature shows that the existing authentication schemes do not fully consider the load balancing of cluster heads, while the load balancing schemes ignore the security authentication of cluster heads. Therefore, this article effectively combines load balancing and security verification, and proposes a lightweight load balancing and verification scheme (secure load and energy balancing) based on clustered wireless sensor networks. Secure load and energy balancing implements cluster head’s authentication and confidentiality and integrity of all messages in load balancing. This scheme not only effectively maintains the energy balance of the whole network but also successfully improves the security overhead, thus prolonging the network lifetime. The simulation results show that compared with other similar schemes, this scheme has higher packet forwarding rate, longer network life, and lower overhead. This further proves that the scheme is energy-saving, safe, dynamic, stable, and sustainable.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Load forwarding'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles