Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
775
End-To-End Arguments In System Design
, 1984
"... This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the end-to-end argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost o ..."
Abstract
-
Cited by 1037 (10 self)
- Add to MetaCart
of providing them at that low level. Examples discussed in the paper include bit error recovery, security using encryption, duplicate message suppression, recovery from system crashes, and delivery acknowledgement. Low level mechanisms to support these functions are justified only as performance enhancements
On the reduction of broadcast redundancy in mobile ad hoc networks
"... Abst rac t- Flooding in mobile ad hoc networks has poor scalability as it leads to serious redundancy, contention and collision. In this paper, we propose an efficient approach to reduce the broadcast redundancy. In our approach, local topology information and the statistical information about the d ..."
Abstract
-
Cited by 241 (0 self)
- Add to MetaCart
the duplicate broadcasts are utilized to avoid unnecessary rebroadcasts. Simulation is conducted to compare the performance of our approach and flooding. The simulation results demonstrate the advantages of our approach. It can greatly reduce the redundant messages, thus saving much network bandwidth and energy
Building Secure and Reliable Network Applications
, 1996
"... ly, the remote procedure call problem, which an RPC protocol undertakes to solve, consists of emulating LPC using message passing. LPC has a number of "properties" -- a single procedure invocation results in exactly one execution of the procedure body, the result returned is reliably deliv ..."
Abstract
-
Cited by 230 (16 self)
- Add to MetaCart
delivered to the invoker, and exceptions are raised if (and only if) an error occurs. Given a completely reliable communication environment, which never loses, duplicates, or reorders messages, and given client and server processes that never fail, RPC would be trivial to solve. The sender would merely
Location-Based Flooding Techniques for Vehicular Emergency Messaging Sangho Oh
"... Abstract — This paper analyzes the scalability of message flooding protocols in networks with various node densities, which can be expected in vehicular scenarios. Vehicle safety applications require reliable delivery of warning messages to nearby and approaching vehicles. Due to potentially large d ..."
Abstract
- Add to MetaCart
distances and shadowing the delivery protocol must forward messages over multiple hops, thereby increasing network congestion and packet collisions. In addition to application-layer backoff delay and duplicate message suppression mechanisms, location-based backoff techniques have been proposed for vehicular
SALTZER ET AL. End-to-End Arguments in System Design 1 END-TO-END ARGUMENTS IN SYSTEM DESIGN
"... This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the end-to-end argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost o ..."
Abstract
- Add to MetaCart
of providing them at that low level. Examples discussed in the paper include bit error recovery, security using encryption, duplicate message suppression, recovery from system crashes, and delivery acknowledgement. Low level mechanisms to support these functions are justified only as performance enhancements.
Iterative type analysis and extended message splitting: Optimizing dynamically-typed object-oriented programs
- In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation
, 1990
"... Abstract. Object-oriented languages have suffered from poor performance caused by frequent and slow dynamically-bound procedure calls. The best way to speed up a procedure call is to compile it out, but dynamic binding of object-oriented procedure calls without static receiver type information precl ..."
Abstract
-
Cited by 128 (19 self)
- Add to MetaCart
by a running program. The compiler constructs a control flow graph annotated with type information by simultaneously performing type analysis and inlining. Extended message splitting preserves type information that would otherwise be lost by a control-flow merge by duplicating all the code between
Weak Duplicate Address Detection in Mobile Ad Hoc Networks
- in Proc. of ACM MobiHoc 2002
, 2002
"... Auto-configuration is a desirable goal in implementing mobile ad hoc networks. Specifically, automated dynamic assignment (without manual intervention) of IP addresses is desirable. In traditional networks, such dynamic address assignment is often performed using the Dynamic Host Configuration Proto ..."
Abstract
-
Cited by 97 (1 self)
- Add to MetaCart
in presence of partitions. In networks where message delays cannot be bounded, use of timeouts can lead to unreliability. Therefore, we propose an alternative approach (which can be used in conjunction with previously proposed schemes). We refer to the proposed approach as "weak" duplicate address
On Exploiting Task Duplication in Parallel Program Scheduling
, 1998
"... One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executing on different processors exchange data. Given a task graph, duplication-based scheduling can mitigate this overhead by all ..."
Abstract
-
Cited by 70 (6 self)
- Add to MetaCart
One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executing on different processors exchange data. Given a task graph, duplication-based scheduling can mitigate this overhead
END-TO-END ARGUMENTS IN SYSTEM DESIGN J.H. Saltzer, D.P. Reed and D.D. Clark
- ACM Transactions on Computer Systems
, 1984
"... This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the end-to-end argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost o ..."
Abstract
- Add to MetaCart
of providing them at that low level. Examples discussed in the paper include bit error recovery, security using encryption, duplicate message suppression, recovery from system crashes, and delivery acknowledgement. Low level mechanisms to support these functions are justified only as performance enhancements
A Feedback-based Approach to Reduce Duplicate Messages
- in Unstructured Peer-to-Peer Networks”, Integrated Workshop on Grid Research
, 2005
"... Abstract. Unstructured P2P systems have used flooding as their prevailing resource location method. Flooding dictates that each node should forward each incoming query messages to all of its neighbours until the query propagates up to a predefined maximum number of hops away from its origin. Althoug ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
the feedback-based approach that aims to improve the scalability of flooding. The main idea behind our feedback-based algorithm is to monitor the number of duplicate messages transmitted over each network connection, and to forward query messages preferably over connections which do not produce excessive
Results 1 - 10
of
775
