Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Peter E. Staples

dblp:138/3868 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 43% Routing and switching · 38% Cellular and mobile networks · 19%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › packet radio network
frequency-hop network
0.011999
Routing for multimedia traffic in wireless frequency-hop communication networks · IEEE J. Sel. Areas Commun. 1999
Cellular and mobile networks
multimedia traffic
0.011999
Routing for multimedia traffic in wireless frequency-hop communication networks · IEEE J. Sel. Areas Commun. 1999
Wireless networking
packet radio network
0.011999
Routing for multimedia traffic in wireless frequency-hop communication networks · IEEE J. Sel. Areas Commun. 1999
Routing and switching
qos routing
0.011999
Routing for multimedia traffic in wireless frequency-hop communication networks · IEEE J. Sel. Areas Commun. 1999
Routing and switching
routing protocol
0.011999
Routing for multimedia traffic in wireless frequency-hop communication networks · IEEE J. Sel. Areas Commun. 1999

Methods — techniques the papers use, named apart from their topics

least-resistance routing · 0.0
YearPublicationVenuePosition
1999 Routing for multimedia traffic in wireless frequency-hop communication networks
abstract
A new method is described for routing multimedia traffic in a frequency-hop (FH) store-and-forward packet radio network. The method is illustrated for traffic of two types, each type having its own throughput, delay, and error-rate requirements. A typical application is the routing of voice and data packets in a distributed multiple-hop network. In such an application, voice packets cannot tolerate much delay, but they are allowed to contain a small number of frame erasures while data packets must be delivered error-free even if a moderate delay is required to do so. The fully distributed routing protocol presented in the paper takes into account the type of service required for each type of traffic, and it adapts to the interference as seen by the FH radio receivers in the network. Our approach to multimedia routing is based on least-resistance routing with different link and path resistance metrics for different message types. Each of the resistance metrics for a link reflects the ability of the link to provide the service required by the one of the message types. This includes, but is not limited to, a measure of the likelihood of successful reception by the FH radio receiver for that link. The route selection for a particular type of packet depends on the resistances of the links along the routes from that packet's source to its destination. In general, different routes may be selected for different types of packets. The primary conclusion of this paper is that the quality of service increases for each of the two types of multimedia traffic if the routing protocol accounts for the type of message that is being relayed.
Michael B. Pursley, Harlan B. Russell, Peter E. Staples
IEEE J. Sel. Areas Commun.3