Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,723
DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks”, in Ad Hoc Networking, edited by Charles E.
- Perkins, Chapter
, 2001
"... Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network ..."
Abstract
-
Cited by 764 (8 self)
- Add to MetaCart
-demand, allowing the routing packet overhead of DSR to scale automatically to only that needed to react to changes in the routes currently in use. We have evaluated the operation of DSR through detailed simulation on a variety of movement and communication patterns, and through implementation and significant
How People revisit Web Pages: empirical findings and implications for the design of history systems
- International Journal of Human Computer Studies
, 1997
"... We report on users ’ revisitation patterns to World Wide Web (web) pages, and use the results to lay an empirical foundation for the design of history mechanisms in web browsers. Through history, a user can return quickly to a previously visited page, possibly reducing the cognitive and physical ove ..."
Abstract
-
Cited by 313 (10 self)
- Add to MetaCart
We report on users ’ revisitation patterns to World Wide Web (web) pages, and use the results to lay an empirical foundation for the design of history mechanisms in web browsers. Through history, a user can return quickly to a previously visited page, possibly reducing the cognitive and physical
Virtualizing Transactional Memory
, 2005
"... Writing concurrent programs is difficult because of the complexity of ensuring proper synchronization. Conventional lock-based synchronization suffers from wellknown limitations, so researchers have considered nonblocking transactions as an alternative. Recent hardware proposals have demonstrated ho ..."
Abstract
-
Cited by 337 (3 self)
- Add to MetaCart
, and process migrations. If the transactional model is to gain wide acceptance, hardware support for transactions must be virtualized to hide these limitations in much the same way that virtual memory shields the programmer from platform-specific limitations of physical memory. This paper proposes Virtual
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
"... This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compared to most other software distributed shared memory systems is that shared data can be kept coherent at a fine granulari ..."
Abstract
-
Cited by 236 (5 self)
- Add to MetaCart
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compared to most other software distributed shared memory systems is that shared data can be kept coherent at a fine
Performance evaluation of mobile wimax with dynamic overhead
- In Vehicular Technology Conference, VTC2008-Fall. IEEE
, 2008
"... Abstract—Mobile WiMAX has become one of the 3 rd Generation communication systems and its performance has been widely evaluated. The physical overhead is a critical factor that may affect the overall performance significantly. But almost no attention has been paid to the impact of overhead on system ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
Abstract—Mobile WiMAX has become one of the 3 rd Generation communication systems and its performance has been widely evaluated. The physical overhead is a critical factor that may affect the overall performance significantly. But almost no attention has been paid to the impact of overhead
Information exchange in wireless networks with network coding and physical-layer broadcast,”
- in Proceedings of the 39th Annual Conference on information Sciences and Systems (CISS ’05),
, 2005
"... Abstract-We show that mutual exchange of independent information between two nodes in a wireless network can be efficiently performed by exploiting network coding and the physicallayer broadcast property offered by the wireless medium. The proposed approach improves upon conventional solutions that ..."
Abstract
-
Cited by 196 (5 self)
- Add to MetaCart
minor overhead. I. INTRODUCTION In this paper, we investigate the mutual exchange of independent information between two nodes in a wireless network. Let us name the two nodes in consideration a and b, respectively. Consider a packet-based communication network with all packets of equal size. The basic
Low overhead fault-tolerant FPGA systems
- IEEE Transactions on VLSI Systems
, 1998
"... Abstract- Fault-tolerance is an important system metric for many operating environments, from automotive to space exploration. The conventional technique for improving system reliability is through component replication, which usually comes at significant cost: increased design time, testing, power ..."
Abstract
-
Cited by 56 (9 self)
- Add to MetaCart
consumption, volume, and weight. We have developed a new fault-tolerance approach that capitalizes on the unique reconfiguration capabilities of FPGAs. The physical design is partitioned into a set of tiles. In response to a component failure, a functionally equivalent tile that does not rely on the faulty
MANETs: Routing Overhead and Reliability
"... Abstract — Node mobility and physical channel effects cause the quality of links in wireless networks to fluctuate randomly. At the network layer, these changes are accommodated by the control information (overhead) of routing protocols. We provide lower bounds on the minimum average control overhea ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Abstract — Node mobility and physical channel effects cause the quality of links in wireless networks to fluctuate randomly. At the network layer, these changes are accommodated by the control information (overhead) of routing protocols. We provide lower bounds on the minimum average control
Analysis Of Communications and Overhead Reduction . . .
- PROC. INT. CONF. ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES PACT'95, JULY 1995, LIMASSOL, CYPRUS, C 1995 IFIP.
, 1995
"... In a multithreaded execution, each thread can be thought of as running on its own virtual processor, with several virtual processors multiplexed onto a single physical processor. At any given time, some of these virtual processors are either sending or waiting for messages. When the degree of multit ..."
Abstract
- Add to MetaCart
In a multithreaded execution, each thread can be thought of as running on its own virtual processor, with several virtual processors multiplexed onto a single physical processor. At any given time, some of these virtual processors are either sending or waiting for messages. When the degree
Distributed top-k monitoring
- In SIGMOD
, 2003
"... The querying and analysis of data streams has been a topic of much recent interest, motivated by applications from the fields of networking, web usage analysis, sensor instrumentation, telecommunications, and others. Many of these applications involve monitoring answers to continuous queries over da ..."
Abstract
-
Cited by 203 (2 self)
- Add to MetaCart
data streams produced at physically distributed locations, and most previous approaches require streams to be transmitted to a single location for centralized processing. Unfortunately, the continual transmission of a large number of rapid data streams to a central location can be impractical
Results 1 - 10
of
1,723
