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

John Nagle 0001

dblp:37/2199 · also John B. Nagle · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1995
—ORCID · none

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

Computer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
Routing and switching · 81% Internet architecture and protocols · 19%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › packet switching
datagram network
0.011987
On Packet Switches with Infinite Storage · IEEE Trans. Commun. 1987
Internet architecture and protocols
buffer management
0.011987
On Packet Switches with Infinite Storage · IEEE Trans. Commun. 1987
Routing and switching
packet switch
0.011987
On Packet Switches with Infinite Storage · IEEE Trans. Commun. 1987

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

proof of correctness · 0.0queueing analysis · 0.0
YearPublicationVenuePosition
1995 Realistic animation of legged running on rough terrain
abstract
Animations of legged creatures running over rough terrain were generated automatically, using physical modelling and animation with newly developed techniques from robotics and artificial intelligence. The 2D animations correctly simulate gravity, inertia, balance, and friction. The running motion generated is not repetitive; each stride is different, as dictated by the terrain. Dramatic movement effects such as slips, falls, struggling on slippery surfaces, and fall recoveries were demonstrated.>
John Nagle 0001
CA1
1987 On Packet Switches with Infinite Storage
abstract
Most prior work on congestion in datagram systems focuses on buffer management. We find it illuminating to consider the case of a packet switch with infinite storage. Such a packet switch can never run out of buffers. It can, however, still become congested. The meaning of congestion in an infinite-storage system is explored. We demonstrate the unexpected result that a datagram network with infinite storage, first-in, first-out queueing, at least two packet switches, and a finite packet lifetime will, under overload, drop all packets. By attacking the problem of congestion for the infinite-storage case, we discover new solutions applicable to switches with finite storage.
John Nagle 0001
IEEE Trans. Commun.1
1983 Practical Program Verification: Automatic Program Proving for Real-Time Embedded Software
abstract
Despite the attractiveness of the concept, attempts to date to use proof of correctness techniques on production software have been generally unsuccessful. The obstacles encountered are not fundamental. We have implemented a proof of correctness system to be used for improving the realiability of certain small, real-time programs. It appears that many of the problems of past systems can be avoided.This work is supported by the Long Range Research Program of the Ford Motor Company, Dearborn, Michigan.
John Nagle 0001
POPL1