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

Ernest C. Eschenauer

dblp:25/4978 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1978
—ORCID · none

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

Computer networks · 2 · 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 · 62% Transport protocols and congestion control · 38%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › error control
acknowledgement schemes
0.011976
Influence on Packet Node Behavior of the Internode Protocol · IEEE Trans. Commun. 1976
Routing and switching › packet switching
packet-switched network protocols
0.011976
Influence on Packet Node Behavior of the Internode Protocol · IEEE Trans. Commun. 1976
Routing and switching
adaptive routing
0.011976
Influence on Packet Node Behavior of the Internode Protocol · IEEE Trans. Commun. 1976
Routing and switching
routing
0.011976
Influence on Packet Node Behavior of the Internode Protocol · IEEE Trans. Commun. 1976

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

queueing analysis · 0.0discrete-event simulation · 0.0
YearPublicationVenuePosition
1978 The Network Communication Manager: A Transport Station for the SGB Network
Ernest C. Eschenauer, Vincent Obozinski
Comput. Networks1
1976 Influence on Packet Node Behavior of the Internode Protocol
abstract
Basic node-to-node protocol of a packet-switched network based on the multiplexing of the link intoNlogical channels is first described. The node structure is then described based on a set of queues, an input routine, a main-task routine, and an output routine. Three protocols which are based on different implementations of the transmission of the acknowledgment (ACK) block are then introduced. The first one is the 1972 version of the Advanced Research Projects Agency Network (ARPANET), the second places the ACK block in regular packets, and the third uses only control packets. The simulation program developed to compare these protocols is then described. It studies the behavior of a link between two nodes, which consists of a full-duplex line and of two sets of queues. The rest of the packet-switched network is simulated by a packet generator which feeds the two sides of the link. First, comparison of protocols is done using symmetrical and asymmetrical loading conditions. In this last case, interesting results are obtained in relation to momentary saturation of theNlogical channels. The influence of the limitation of buffers allocated to an output line is also discussed. Sensitivity of protocols to reverse traffic characteristics is then studied and, based on the results, choice of a protocol is discussed. Based on the dynamic behavior of the queue, some questions are raised in connection with adaptive-routing algorithms.
André A. S. Danthine, Ernest C. Eschenauer
IEEE Trans. Commun.2