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

Robert G. Cole

dblp:71/1923 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 5 · 2 first-authorSoftware engineering, systems software and programming languages · 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
2 papers
Internet architecture and protocols · 92% Network performance modeling · 8%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
link-layer protocols
0.011990
Comparative Performance of Interleaved and Non-Interleaved Pipelining in LAPD Terminal Adaptors · INFOCOM 1990
Internet architecture and protocols
network interconnection
0.011990
Experience and Analysis of Network Interconnection · IEEE J. Sel. Areas Commun. 1990
Internet architecture and protocols › network interconnection
protocol conversion
0.011990
Experience and Analysis of Network Interconnection · IEEE J. Sel. Areas Commun. 1990
Internet architecture and protocols › network security
access control
0.011990
Experience and Analysis of Network Interconnection · IEEE J. Sel. Areas Commun. 1990
Internet architecture and protocols › naming and addressing
addressing
0.011990
Experience and Analysis of Network Interconnection · IEEE J. Sel. Areas Commun. 1990
Network performance modeling › delay analysis
end-to-end delay analysis
0.011990
Comparative Performance of Interleaved and Non-Interleaved Pipelining in LAPD Terminal Adaptors · INFOCOM 1990

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

queueing analysis · 0.0application-layer relaying · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
2011 Performance analysis of SNMP in OLSRv2-routed MANETs
Ulrich Herberg, Robert G. Cole, Jiazi Yi
CNSM2
2010 MANET network management and performance monitoring for NHDP and OLSRv2
abstract
Mobile Ad Hoc NETworks (MANETs) are generally thought of as infrastructureless and largely “un-managed” network deployments, capable of accommodating highly dynamic network topologies. Yet, while the network infrastructure may be “un-managed”, monitoring the network performance and setting configuration parameters once deployed, remains important in order to ensure proper “tuning” and maintenance of a MANET. This paper describes a management framework for the MANET routing protocol OLSRv2, and its constituent protocol NHDP. It does so by presenting considerations for “what to monitor and manage” in an OLSRv2 network, and how. The approach developed is based on the Simple Network Management Protocol (SNMP), and thus this paper details the various Management Information Bases (MIBs) for router status monitoring and control - as well as a novel approach to history-based performance monitoring. While SNMP may not be optimally designed for MANETs, it is chosen due to it being the predominant protocol for IP network management - and thus, efforts are made in this paper to “adapt” the management tools within the SNMP framework for reasonable behavior also in a MANET environment.
Ulrich Herberg, Thomas H. Clausen, Robert G. Cole
CNSM3
2010 Methods and opportunities for rejuvenation in aging distributed software systems
Alberto Avritzer, Robert G. Cole, Elaine J. Weyuker
J. Syst. Softw.2
2009 Precedence-enabled per-hop behaviour: impact on TCP and UDP flows
abstract
The author proposes and analyses an approach to support both precedence and preemption (P&P) and QoS handling in common packet transport infrastructures. Precedence has to do with the relative importance of the information content, whereas preemption has to do with mechanisms to deny lower precedence traffic access to network resources in favour of higher precedence traffic, when necessary. The author's approach to this duality is to enhance active queue management (AQM) techniques to provide P&P capabilities and rely on standard, well-studied QoS schedulers, for example, Weighted Round Robin, Class-Based Weighted Fair Queuing, etc., for handling QoS requirements. The present scheme allows low-order queues (within the context of QoS handling) to plead up to the next higher-order queue for help in alleviating queue congestion under periods of communication link overload. The scheme is referred as the cross-queue-AQM (CQ-ACM) scheme and can be extended to higher numbers of queues and any type of scheduler. Through extensive simulation studies, the performance of CQ-AQM scheme under heavy traffic limits is investigated, where preemption is required. The performance metrics of interest to this analysis are packet delay, packet loss and throughput as a function of the packet QoS class and P-L. Further, two new metrics of merit, Gain and System Efficiency, are defined, which are specific to P&P considerations. The studies concentrated on both flow-controlled and non-flow-controlled traffic, as well as mixed traffic conditions. Simulation results show that the algorithms perform extremely well for all cases studied.
Robert G. Cole
IET Commun.1
2004 Design and analysis of optimal adaptive de-jitter buffers
Gagan L. Choudhury, Robert G. Cole
Comput. Commun.2
1995 Comparative Performance of Interleaved and Non-Interleaved Pipelining in ATM Terminal Adapters
Anurag Kumar 0001, Robert G. Cole
Comput. Networks ISDN Syst.2
1990 Comparative Performance of Interleaved and Non-Interleaved Pipelining in LAPD Terminal Adaptors
abstract
A comparison is made of the end-to-end delay performance of two service disciplines that a terminal adaptor (TA) can use to multiplex the pipelined synchronous native protocol frames arriving over the low-speed lines. In one scheme, the TA pipelines one synchronous frame at a time, waiting, if it needs to, for the successive link-access protocol D-channel (LAPD) packets from this one synchronous frame to accumulate. In the other scheme, the TA interleaves the LAPD packets from various synchronous frames. Using an analytical model for the first scheme, it is concluded that if the trunk speed (TA-to-network switch) to line speed ratio is greater than or equal to four, then over the range of useful loading, interleaved pipelining yields smaller mean delays than noninterleaved pipelining. If the ratio is less than four, interleaving yields larger mean delays for negative protocols which require a buildout delay at the egress TA.>
Anurag Kumar 0001, Robert G. Cole
INFOCOM2
1990 Experience and Analysis of Network Interconnection
abstract
A description is given of the research work at University College London on network interconnection. A particular approach to internetworking is discussed and compared to other approaches reported in the literature. The architecture of a LAN (local-area-network) based interconnection system is described, and some important concepts are deduced. These concepts are discussed in light of the current theory of protocol interaction, and two protocol conversion techniques are compared. The problems of addressing and access control in general network interconnection are described, and a case is made for application-layer relaying as the general solution.>
Robert G. Cole
IEEE J. Sel. Areas Commun.1