نتایج جستجو برای: store and forward

تعداد نتایج: 16839693  

2017
Nurazean Maarop Sukdershan Hazara Singh Khin Than Win

The ultimate objectives of this study are to describe teleconsultation activities and explore the benefits of teleconsultation technology in the context of public health care environment in Malaysia. The materials of this study were based on an exploratory mixed method studies involving semi-structured interviews with key informants and questionnaires survey of health care providers to obtain i...

1992
James P. G. Sterbenz Anshul Kantawala Milind M. Buddhikot Guru M. Parulkar

We have proposed a new architecture called Axon that meets the challenges of delivering high performance network bandwidth directly to applications. Its pipelines network interface must perform critical per packet processing in hardware a packets flow through the pipeline, without imposing any store-and-forward buffering of packets. This requires the design of error and flow control mechanisms ...

Journal: :RFC 1982
Vinton G. Cerf

Packet Satellite technology was an outgrowth of early work in packet switching on multiaccess radio channels carried out at the University of Hawaii with the support of the Defense Advanced Research Projects Agency (DARPA). The primary difference between the earlier packet-switched ARPANET [1, 2] and the ALOHA system developed at the University of Hawaii [3] was the concept of multiple transmit...

2006
Sapon Tanachaiwiwat Ahmed Helmy

An encounter-based network is a frequently-disconnected wireless ad-hoc network requiring immediate neighbors to store and forward aggregated data for information disseminations. Using traditional approaches such as gateways or firewalls to deter worm propagation in encounter-based networks is inappropriate. We propose a worm interaction approach that relies upon automated beneficial worm gener...

Journal: :CoRR 2016
Pin-Yu Chen Meng-Hsuan Sung Shin-Ming Cheng

To achieve end-to-end delivery in intermittently connected networks, epidemic routing is proposed for data delivery at the price of excessive buffer occupancy due to its store-and-forward nature. The ultimate goal of epidemic routing protocol design is to reduce system resource usage (e.g., buffer occupancy) while simultaneously providing data delivery with statistical guarantee. Therefore the ...

2012
Thomas Rothvoss

In the store-and-forward routing problem, packets have to be routed along given paths such that the arrival time of the latest packet is minimized. A groundbreaking result of Leighton, Maggs and Rao says that this can always be done in time O(congestion+dilation), where the congestion is the maximum number of paths using an edge and the dilation is the maximum length of a path. However, the ana...

2007
Ignasi Sau Janez Žerovnik

Permutation routing is used as one of the standard tests of routing algorithms. In the permutation routing problem, each processor is the origin of at most one packet and the destination of no more than one packet. The goal is to minimize the number of time steps required to route all packets to their respective destinations. Wireless mesh networks are based on plane tessellations that divide t...

2016
Ashima Mittal Ananya Sharma Sarthak Arora Preeti Nagrath Sandhya Aneja

Delay Tolerant Network (DTN) can be defined as an approach to Computer Network Architecture which provides a promising solution that seeks to address the technical issues in the regions where end-toend network connectivity may lack continuously or is not available. These problems are aggravated by end nodes with limited power or memory resources. In DTNs, the intermediate nodes on a Transmissio...

Journal: :IEEE Trans. Parallel Distrib. Syst. 1999
Yu-Chee Tseng San-Yuan Wang Chin-Wen Ho

In this paper, a network-partitioning approach for one-to-all broadcasting on wormhole-routed networks is proposed. To broadcast a message, the scheme works in three phases. First, a number of data-distributing networks (DDNs), which can work independently, are constructed. Then the message is evenly divided into sub-messages each being sent to a representative node in one DDN. Second, the sub-...

2007
Shanchieh Jay Yang Moises Sudit

This article develops a comprehensive model for optimal data retrieval using multi-mode wireless sensors in a network setting. The proposed maximum data retrieval (MDR) problem jointly optimizes routing and scheduling decisions over time subject to spatial reuse and sensor resource (energy and storage) constraints. Optimal solutions to sample cases of the NP-Hard MDR problem leads to closed for...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید