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

Edwin L. Althouse

dblp:122/1465 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1993
—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
2 papers
Network optimization and economics · 75% Optical networks · 25%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › network design
link assignment
0.011993
An adaptive link assignment algorithm for dynamically changing topologies · IEEE Trans. Commun. 1993
Optical networks
optical fiber
0.011985
Design, Construction, and Test Results for Three Different Fiber Optic Tow Cables · IEEE J. Sel. Areas Commun. 1985
Distributed systems
fault tolerance
0.011993
An adaptive link assignment algorithm for dynamically changing topologies · IEEE Trans. Commun. 1993

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

distributed optimization · 0.0graph-theoretic algorithms · 0.0graph-theoretic algorithm · 0.0optical time-domain reflectometry · 0.0attenuation measurement · 0.0
YearPublicationVenuePosition
1993 An adaptive link assignment algorithm for dynamically changing topologies
abstract
An adaptive link assignment algorithm for the distributed optimization of dynamically changing network topologies is presented. The algorithm is responsible for determining the network connectivity by controlling the selection of links to be established and disconnected. This algorithm is designed to recover from predictable link outages as well as massive unpredictable failures. To minimize computational time complexity as well as to improve transient response. Some known graph-theoretic algorithms are utilized.>
Michael D. Noakes, J. Bibb Cain, John W. Nieto, Edwin L. Althouse
IEEE Trans. Commun.4
1985 Design, Construction, and Test Results for Three Different Fiber Optic Tow Cables
abstract
The design, manufacture, and testing of three armored fiber optic tow cables is discussed. The motivation for these developments was the technical need to have low-loss high-bandwidth transmission lines, that function with negligible crosstalk and absence of ground loops, placed within the limited core space of the cable. General guidelines for avoiding serious microbending loss in this type of cable structure are reviewed, and different methods of implementing the design principles are demonstrated by way of discussions specific to the three electrooptic core designs that were manufactured. A discussion is given regarding some of the practical problems associated with manufacturing. For two of the cable designS, measurements of optical attenuation with a Tektronix model 150 optical time-domain reflectometer are presented for several stages of manufacture, and approximate changes in attenuation are given for a tension loading of 33kN.
Edwin L. Althouse
IEEE J. Sel. Areas Commun.1