Ethernet

Metcalfe, Robert M.; Boggs, David R.

doi:10.1145/357980.358015

Cited by 737 publications

(161 citation statements)

References 10 publications

Supporting

Mentioning

158

Contrasting

Unclassified

Order By: Relevance

“…This delay, referred to as the back-off delay, has been widely used in CSMA (Carrier Sense Multiple Access) protocols to avoid packet collisions resulting from multiple simultaneous transmissions. The origin of using the back-off delay for this purpose can be traced back to Ethernet [10]. It is also used in the IEEE 802.11 protocol [11].…”

Section: The Self-selection Algorithmmentioning

confidence: 99%

A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks

2006

View full text Add to dashboard Cite

There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation of selecting a node possessing some desired properties among all the neighbors of the requestor. Self-selection employs a prioritized transmission back-off delay scheme in which each node's delay of transmitting a signal is dependent on the probability of the node's ability to best perform a pertinent task and in turn, enables the node to autonomously select itself for the task. We demonstrate the benefits of self-selection in two basic wireless ad hoc network communication algorithms: flooding and routing. By relating back-off delay to the signal strength of a received packet, we design an efficient variant of conventional flooding named Signal Strength Aware Flooding. By using distance-to-destination to derive back-off delay, we design a novel and fault-tolerant wireless ad hoc network routing protocol named Self-Selective Routing.Keywords -Wireless ad hoc networks, wireless networks, ad hoc routing, ad hoc flooding, leader election INTRODUCTIONWireless ad hoc networks (WANETs) [1] are used to provide on-demand network infrastructures. They are usually composed of small portable clients (or nodes), but they lack consistent topologies. They range in size from small Bluetooth piconets [2] used for device synchronization to large-scale networks used for supporting military and emergency-response applications. Perhaps the most popular WANET applications recently have been wireless sensor networks [3], which are most often used for the pervasive and remote monitoring of environmental or spatial phenomena.To date, a plethora of research efforts have addressed some significant challenges introduced by various aspects of WANET operation, perhaps the most fundamental being fault-tolerant and energy-efficient communication. Since communication is typically the most costly operation in WANETs because of the overhead of transceiver operation, innovative and efficient approaches to basic communication algorithms such as flooding and routing are in strong demand. Fortunately, the communication primitive in WANETs, broadcast, offers some interesting possibilities.As an instructive example, let us consider a lecture hall with a lecturer and student audience. If the lecturer wants to identify a student with a certain property (e.g., the least number of credits taken at the university) in a lecture hall with n students, it seems that n communications (verbal in this case) would be needed. However, if the lecturer and students use the broadcast nature of verbal communication, they can accomplish this task in just two communications. In the first broadcast, the lecturer asks all students to announce their total number of completed credits after a delay (in seconds, start...

show abstract

Section: The Self-selection Algorithmmentioning

confidence: 99%

A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks

2006

View full text Add to dashboard Cite

show abstract

“…The term tNM depends on the used network type. For instance, an Ethernet LAN can't theoretically guarantee the bounded time for one message sent (Metcalfe et al, 1976). In contrast, an ATM-based network can do it (Minzer, 1989).…”

Section: Time Guarantees For Memory Accessmentioning

confidence: 99%

System Support for Distributed Multimedia Applications with Guaranteed Quality of Service

Nguyen¹,

Guy²,

Belaïd³

1995

High Performance Networking

View full text Add to dashboard Cite

We consider the problem of executing distributed multimedia applications with Quality of Service (QoS) requirements. Such applications involve several resources (CPU, network, file system, memory). In order to fulfill the QoS requirements of the applications, every resource manager must provide temporal guarantees, but this is not enough. An overall QoS management scheme must be set up for admission control and execution monitoring. Based on an analysis of application memory access time, we identify the key points where temporal guarantees must be provided. We present the tasks that must be achieved for overall QoS management and propose an implementation based on a QoS manager replicated on each site and modified resource managers. Applications interact with one QoS manager only through a well-defined interface. As an illustration, we present the design of a File Server modified for providing guaranteed access time and its interactions with the QoS manager in the context of a distributed microkernel-based operating system.

show abstract

“…In the first place, most local area networks do have fixed routing. This includes ethernet-like networks [Met76,Eth8l] hand, should be implemented at the Presentation Layer (layer 6) or at the Application Layer (layer 7), as a file system service. Since all layers above the Network Layer regard the network s a fully connected grid, and the information on which the optimal routing is done is not available above that layer, it would be very difficult to make decisions at the file migration level that could influence (positively) the traffic conditions in the subnetwork.…”

Section: System Modelmentioning

confidence: 99%

File migration in distributed computer systems

Porcar¹

1983

Performance Evaluation

View full text Add to dashboard Cite

Ethernet

Cited by 737 publications

References 10 publications

A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks

A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks

System Support for Distributed Multimedia Applications with Guaranteed Quality of Service

File migration in distributed computer systems

Contact Info

Product

Resources

About