Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 9,277 papers for “data forwarding”

Dahu: Improved Data Center Multipath Forwarding

Radhakrishnan, Sivasankar, Kapoor, Rishi, Tewari, Malveeka et al. · eScholarship (California Digital Library) · 2013

Solving "Big Data" problems requires bridging massive quantities of\ncompute, memory, and storage, which requires significant amounts of bisection\nbandwidth. Topologies like Fat-tree, VL2, and HyperX achieve a scale-out design\nby leveraging multiple paths from source to destination. However, traditional\nrouting protocols are not able to effectively utilize these links while also\nharnessing spare network capacity to better statistically multiplex network\nresources. In this work we present Dahu, a switch mechanism for efficiently\nload balancing traffic in multipath networks. Dahu avoids congestion hot-spots\nby dynamically spreading traffic uniformly across links, and forwarding traffic\nover non-minimal paths where possible. By performing load balancing primarily\nusing local information, Dahu can act more quickly than centralized approaches,\nand responds to failure gracefully. Our evaluation shows that Dahu delivers up\nto 50% higher throughput relative to ECMP in an 8,192 server Fat-tree network\nand up to 500% improvement in throughput in large scale HyperX networks with\nover 130,000 servers.Pre-2018 CSE ID: CS2013-0992

Cited by 0

Data Forwarding in Wireless Relay Networks

Tzu-Ming Lin, Wen-Tsuen Chen, Shiao‐Li Tsao · Contact-less Assessment of In-vivo Body Signals Using Microwave Doppler Radar (InTech) · 2011

Broadband wireless communication has brought users a number of multimedia services for years. As wireless broadband markets mature, system operators face new problems. First, system capacity is bounded by finite radio resources. Second, service providers increasing spend on network deployments and services provisions. With limited radio resource and increased costs, operators have no choice but to force users to pay higher rates to preserve the same service quality than they had several years ago. The expectation is that these problems are solved by introducing relay station (RS) into traditional wireless systems. The relaying technology has proven to be a feasible technology to expand system capacity and reduce deployment costs simultaneously. One of the most popular technologies is cooperative communications that boost network throughput significantly by improving the radio quality for transmission and reception (Nosratinia et al., 2004); (Mohr, 2005); (Doppler et al., 2007). Numerical results (Soldani & Dixit, 2008) showed the cost saving benefits when conventional communication networks adopt relay functionality. From this, a commercial cellular system can save more than 56 % on capital expenditures when RSs are deployed. RS is a wireless communication station that provides relay services for receiving and forwarding radio signals between two stations. In a cellular system, RS is in charge of receiving, decoding, and forwarding data between the Base Station (BS) and the Subscriber Stations (SSs). During the relaying, RS provides additional features to assist data transmissions. For example, (Tao et al., 2007) proposed a novel data forwarding scheme in this environment. The novel data forwarding scheme improved the transmission efficiency by approximately 66 %. Although data relay shows superior performances in throughput enhancements and cost savings. Multi-hop relaying introduces new issues that impact overall performance. To indicate a routing path in multi-hop circumstances, additional control information should be introduced. The routing indication design for multiple radio links introduces new overhead and may impact transmission efficiency during relay. Imprecise indications may waste RS computation and storage since it does not know what it shall relay and where to forward. Moreover, there may be a case that data destined to others are received by the RS that is not in charge. Imprecise relay indication will not only increase overheads but also lead RS to use its processor and storage inefficiently. In other words, data forwarding with ambiguous control information would increase RS complexity and buffer storage unnecessarily. During

Cited by 0Open access

ADAPTIVE FORWARDING IN NAMED DATA NETWORKING

Yi Cheng, Cheng Yi, Christopher Gniady et al. · 2014

Rights Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.

Cited by 0

Data Forwarding in Wireless Relay Networks

Tzu-Ming Lin, Wen-Tsuen Chen, Shiao‐Li Tsao · InTech eBooks · 2011

Broadband wireless communication has brought users a number of multimedia services for years. As wireless broadband markets mature, system operators face new problems. First, system capacity is bounded by finite radio resources. Second, service providers increasing spend on network deployments and services provisions. With limited radio resource and increased costs, operators have no choice but to force users to pay higher rates to preserve the same service quality than they had several years ago. The expectation is that these problems are solved by introducing relay station (RS) into traditional wireless systems. The relaying technology has proven to be a feasible technology to expand system capacity and reduce deployment costs simultaneously. One of the most popular technologies is cooperative communications that boost network throughput significantly by improving the radio quality for transmission and reception (Nosratinia et al., 2004); (Mohr, 2005); (Doppler et al., 2007). Numerical results (Soldani & Dixit, 2008) showed the cost saving benefits when conventional communication networks adopt relay functionality. From this, a commercial cellular system can save more than 56 % on capital expenditures when RSs are deployed. RS is a wireless communication station that provides relay services for receiving and forwarding radio signals between two stations. In a cellular system, RS is in charge of receiving, decoding, and forwarding data between the Base Station (BS) and the Subscriber Stations (SSs). During the relaying, RS provides additional features to assist data transmissions. For example, (Tao et al., 2007) proposed a novel data forwarding scheme in this environment. The novel data forwarding scheme improved the transmission efficiency by approximately 66 %. Although data relay shows superior performances in throughput enhancements and cost savings. Multi-hop relaying introduces new issues that impact overall performance. To indicate a routing path in multi-hop circumstances, additional control information should be introduced. The routing indication design for multiple radio links introduces new overhead and may impact transmission efficiency during relay. Imprecise indications may waste RS computation and storage since it does not know what it shall relay and where to forward. Moreover, there may be a case that data destined to others are received by the RS that is not in charge. Imprecise relay indication will not only increase overheads but also lead RS to use its processor and storage inefficiently. In other words, data forwarding with ambiguous control information would increase RS complexity and buffer storage unnecessarily. During

Cited by 0Open access

Superscalar Execution With Dynamic Data Forwarding

Onder Rajiv Gupta · 1998

We empirically demonstrate that in order to take advantage of increasing issue widths, superscalar processors require quadratically growing instruction window sizes. Since conventional central window design aims to provide full data fan-out to all the instructions which are in the window, designing large instruction windows using conventional techniques is not feasible. We show that full data fan-out is not necessary for achieving high performance when a novel approach is used to distribute the values. We use direct matching using a small on chip memory called the wait memory to implement the instruction window and bring in a small subset of instructions which are likely to become ready into a match unit where instruction selection and operand matching tasks are performed. We show that the match unit needs to grow only linearly with the issue width. We use SPEC95 benchmarks to demonstrate that at a given instruction window size our algorithm provides over 90 percent of the IPC that ca...

Cited by 0

HANDLE IDENTIFICATION-BASED DATA FORWARDING UNIT

Yu HB(于海斌), Zeng P(曾鹏), Li D(李栋) et al. · SIA OpenIR (Chinese Academy of Sciences) · 2020

The present invention discloses a Handle identification-based data forwarding unit, which comprises a dynamic configuration module, a Handle identification data recognition module, and a matching-forwarding module. The present invention system is applied to a network device such as a switch and a router, carries out data interaction with a network system such as an SDN manager, supports dynamic configurations of data packet parsing, matching and forwarding rules, so that the network device can recognize the Handle identification-based data packets, and perform designated operations on data packets with the designated Handle identification according to the dynamic configuration rules.

Cited by 0

MADF: Mobile-Assisted Data Forwarding for Wireless Data Network

X Wu, G Chan, B Mukherjee et al. · 2002

Abstract: In a cellular network, if there are too many data users in a cell, data may suffer long delay, and system’s quality-of-service (QoS) will degrade. Some traditional schemes such as dynamic channel-allocation scheme (DCA) will assign more channels to hot (or overloaded) cells through a central control system (CC), and the throughput increase will be upper bounded by the number of new channels assigned to the cell. In mobile-assisted data forwarding (MADF), we add an ad-hoc overlay to the fixed cellular infrastructure and special channels–called forwarding channels – are used to connect mobile units in a hot cell and its surrounding cold cells without going through the hot cell’s base station. Thus, mobile units in a hot cell can forward data to other cold cells to achieve load balancing. Most of the forwardingchannel management work in MADF is done by mobile units themselves in order to relieve the load from the CC. The traffic increase in a certain cell will not be upper bounded by the number of forwarding channels. It can be more if the users in hot cell are significantly far away from one another, and these users can use the same forwarding channels to forward data to different cold neighboring cells without interference. We find that, in a system using MADF, under a certain delay requirement, the throughput in a certain cell or for the whole network can be greatly improved. Index Terms: Wireless data networking, cellular network, multi-hop, ad-hoc network, load balancing.

Cited by 0

Push-Hybrid Data Forwarding in Underwater Named Data Networking

Ruoyu Wang, Yingjian Liu, Jinhui Liu et al. · IEEE Internet of Things Journal · 2024

Internet of Underwater Things (IoUT) is applied to ocean research by connecting underwater sensing devices. It has ability to maintain efficient communication even in challenging environments and with limited power resources. However, it hinders the efficient storage and forwarding of huge amounts of underwater data due to the traditional IP architecture. As a future network architecture, underwater named data networking (UNDN) is considered an effective architecture of IoUT. While naive UNDN cannot support active forwarding when dangers occur in underwater environments, which may cause severe consequences. In this article, we propose an event-based communication architecture called push-hybrid UNDN, which can achieve active and timely forwarding when critical events occur. To realize critical data forwarding without waiting for user requests, passively accepted interest is replaced by actively forwarded beacon during the critical events. The push-hybrid UNDN is analyzed and compared with the naive one in transmission performance to highlight the advantages of incorporating push mechanism. Energy consumption of push-hybrid UNDN, naive UNDN, and push-based UNDN is compared in different scenarios to demonstrate the advantages of hybrid design. Simulation results verify that our scheme achieves shorter transmission delay, more stable and higher packet delivery ratio, less traffics, and lower energy consumption than the existing UNDN architectures.

Cited by 0

DATA FORWARDING ENHANCEMENT STRATEGY IN SENSOR NETWORKS

Ruslan Saad Abdulrahman · Kufa Journal of Engineering · 2026

Nowadays, Internet of Things (IoT) and Sensor Networks (SNs) consider the transformative technologies that enable ubiquitous connectivity and data collection in various fields. In distributed sensor networks, the nodes are responsible on environments monitoring for sensing and collecting various conditions. The forwarding process for these data gains a significant attention in the researches because it considers the first step for the operation of any algorithm or techniques in routing process in any type of wireless networks. In general, during any routing process, the node with data needs to select its next hop efficiently and thus will affect the optimum route from source to destination. The most common techniques that utilized in this step are the flooding and gossiping. These two techniques suffer from different problems such as implosion, overlaps and blindness of any resources. Therefore, this paper proposed an efficient technique for best next hop selection by taking in consideration the main resources that effect the sensor’s power level and thus will reduce the power consumption and then will improve network lifetime. In the proposed technique, the node that has maximum power level, nearest to the current node and it does not receive or send the required packet will be selected as the next hop node. These assumptions help mitigate flooding and gossiping issues. The proposed technique has been implemented using MATLAB simulator. The results show that the proposed system has reduce the node’s power exhausting in single cycle and thus has improve network’s performance

Cited by 0Open access

Hardware Spatial Forwarding for Widely Shared Data

Marius Pirvu, et al. · 2008

Applications with widely shared data do not perform well on cc-NUMA multiprocessors due to the hot-spots they create in the system. In this paper we address this problem by enhancing the memory controller with a forwarding mechanism capable of hiding the read latency of widely shared data, while potentially decreasing the memory and network contention. Based on the influx of requests, the memory anticipates the next read references and forwards the data in advance to the processors. To identify the set of processors the data is to be forwarded to we use a heuristic based on the spatial locality of memory blocks. To increase the forwarding effectiveness and minimize the number of messages, we incorporate simple filters combined with a feedback mechanism. We also show that further improvements are possible using a combined software-prefetching/hardware-forwarding approach. Our experimental results obtained with a detailed execution driven simulator with ILP processors show significant improvements in execution time (up to 37%).

Cited by 0

DATA FORWARDING UNIT BASED ON HANDLE IDENTIFIER

Yu HB(于海斌), Zeng P(曾鹏), Li D(李栋) et al. · SIA OpenIR (Chinese Academy of Sciences) · 2021

The present invention discloses a data forwarding unit based on a Handle identifier, comprising a dynamic configuration module, a Handle identifier data identification module and a matching-forwarding module. The system of the present invention is applied to network devices such as switches and routers, and supports dynamic configuration of data packet analysis, matching and forwarding rules through data interaction with network systems such as SDN managers, so that the network devices can identify data packets based on the Handle identifier and perform the specified operation on the designated data packets with the Handle identifier according to the rules of dynamic configuration.

Cited by 0

Local Cooperative Relay in Opportunistic Data Forwarding

Zehua Wang, Cheng Li, Yuanzhu Chen · 2011

Opportunistic data forwarding draws more and more attention in the research community of wireless network after the initial work ExOR was published. However, as far as we know, all traditional opportunistic data forwarding only use the nodes that are included in the forwarder list to participate in the forwarding process. In fact, if a node is not included in the forwarder list but it is in the direction from source node to destination node, when it successfully overhears some packets by opportunity, the node can be utilized in opportunistic data forwarding. In this paper, we propose local cooperative relay for opportunistic data forwarding in mobile ad-hoc networks. In general, three contributions we have in this paper, 1) we open more node to participate in the opportunistic data forwarding even though the nodes are not included in the forwarder list, 2) the local relay node is selected after it overhears some packets, which can bridge the vulnerable links in mobile networks, 3) a coordination procedure with a new scoring function is proposed in this paper, so we need no overhead to coordinate the local relay nodes.

Cited by 0

Data Forwarding through In-Memory Precomputation Threads

Wessam Hassanein · Purdue e-Pubs (Purdue University System) · 2004

ABSTRACT 1 In modern architectures, memory access latency is an increasingly performance-limiting factor. To reduce this latency, we propose concepts and implementation of a new technique that uses an inmemory processor to precompute future, critical load addresses and forward the computed values to the main processor. The acronym for this technique is IMPT for In-Memory Precomputation-based forwarding Threads. IMPT combines the advantages of precomputation-based techniques with the low memory access latency of processing-in-memory. To evaluate IMPT, we use a cycle-accurate simulation of an aggressive out-oforder processor with accurate simulation of bus and memory contention. The results show a performance gain of up to 1.47 (1.21 on average) over an aggressive superscalar processor. The average load access latency decreases by up to 55 % (32 % on average).

Cited by 0

Cooperative Data Forwarding In AODV Routing Protocol

Iosr Journals, Sarath Menon, Jose Anand · Figshare · 2015

A Wireless sensor Network uses thousands of miniature devices that communicate among each other and sense data from the environment. The success of the communication in a WSN inherently lies in the routing protocol used by the architecture. This work enables reliable communication for Reactive Routing Protocol such as, Ad hoc On-demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) in Wireless Sensor Networks. These protocols are on-demand routing protocols and has the capability to only detect Link Failures. This hampers the packet delivery ratio and increases the end-to-end delay. AODV Protocol when faced with a link failure condition has the source node reinitiate the route discovery phase by broadcasting Route Request Messages to its neighbours without considering the affected link. The system calls for a Reliable Reactive Routing Enhancement (R3E) as an extension over the AODV protocol. Here the nodes maintain a list of forwarding candidates and their priorities with the help of routing table enabling forwarding of data towards destination as per node priority and thereby removing the need for re-initiation of route discovery phase. Thus R3E successfully augments the aforementioned AODV protocol, thereby improving the packet delivery ratio and also achieving a significant reduction in end-to-end delay in the Wireless Sensor Network.

Cited by 2Open access

Trajectory-Based Data Forwarding for Light-Traffic . . .

Jaehoon Jeong, Shuo Guo, Yu Gu et al. · 2010

This paper proposes a Trajectory-Based Data Forwarding (TBD) scheme, tailored for the data forwarding for road-side reports in light-traffic vehicular ad-hoc networks. State-of-the-art schemes have demonstrated the effectiveness of their data forwarding strategies by exploiting known vehicular traffic statistics (e.g., densities and speeds). These results are encouraging, however, further improvements can be made by taking advantage of the growing popularity of GPS-based navigation systems. This paper presents the first attempt to effectively utilize vehicles’ trajectory information in a privacy-preserving manner. In our design, such trajectory information is combined with the vehicular traffic statistics for a better performance. In a distributed way, each individual vehicle computes its end-to-end expected delivery delay to the Internet access points based on its position on its vehicle trajectory and exchanges this delay with neighboring vehicles to determine the best next-hop vehicle. For the accurate end-to-end delay computation, this paper also proposes a link delay model to estimate the packet forwarding delay on a road segment. Through theoretical analysis and extensive simulation, it is shown that our link delay model provides the accurate link delay estimation and our forwarding design outperforms the existing scheme in terms of both the data delivery delay and packet delivery ratio.

Cited by 0

2. Comp Networking IJCNWMC Data Forwarding Based

Bulletin of Miscellaneous Information (Royal Gardens Kew)

Mobile networks are new emergent technology now a days. Socially aware networking (SAN) is the one of the latest technology that supports store and forward mechanism. SAN is a new paradigm to improve the network performance in today’s internet. SAN considers the social properties for routing and forwarding protocol for taking forwarding decisions. The focus of this paper is to design system based on interests of the people inspired from Artificial Bee Colony Algorithm. It considers the individuals’ identifying and learning capability to gather information of density and social tie during communication. Node division is based on the single or multiple interest to form a intra community or inter community. This system handles the dynamic environment be using learning capability and mutual cooperation of individuals. In this paper, we propose the algorithm for multiple interests based scheme for forwarding using ABC algorithm. Also the algorithms for buffer management and message scheduling are designed for improving performance. The simulation results show that this system outperforms PROPHET and Epidemic in message delivery ratio, overhead and hop count, average latency, and average buffer time.

Cited by 0