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.

David Moreland

dblp:69/916 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none

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

Computer networks · 2Human-computer interaction and ubiquitous computing · 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
Optical networks · 41% Transport protocols and congestion control · 41% Internet architecture and protocols · 18%

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

TopicWeightPapersLastEvidence papers
Optical networks › optical switching
optical packet switching
0.222009
Packet pacing in small buffer optical packet switched networks · IEEE/ACM Trans. Netw. 2009
Packet Pacing in Short Buffer Optical Packet Switched Networks · INFOCOM 2006
Transport protocols and congestion control › rate control
packet pacing
0.222009
Packet pacing in small buffer optical packet switched networks · IEEE/ACM Trans. Netw. 2009
Packet Pacing in Short Buffer Optical Packet Switched Networks · INFOCOM 2006
Internet architecture and protocols › buffer management
buffer sizing
0.112009
Packet pacing in small buffer optical packet switched networks · IEEE/ACM Trans. Netw. 2009
Optical networks
packet-switched optical network
0.112006
Packet Pacing in Short Buffer Optical Packet Switched Networks · INFOCOM 2006
Transport protocols and congestion control
TCP performance
0.112006
Packet Pacing in Short Buffer Optical Packet Switched Networks · INFOCOM 2006

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

queueing theory · 0.1simulation · 0.1poly-logarithmic complexity algorithm · 0.1pacing algorithm · 0.1
YearPublicationVenuePosition
2010 A snapshot of trusted personal devices applicable to transaction processing
David Moreland, Surya Nepal, Hon Hwang, John Zic
Pers. Ubiquitous Comput.1
2009 Packet pacing in small buffer optical packet switched networks
Vijay Sivaraman, Hossam A. ElGindy, David Moreland, Diethelm Ostry
IEEE/ACM Trans. Netw.3
2008 Secure and Conditional Resource Coordination for Successful Collaborations
Dongxi Liu, Surya Nepal, David Moreland, Shiping Chen 0001, Chen Wang 0008, John Zic
CollaborateCom3
2006 Packet Pacing in Short Buffer Optical Packet Switched Networks
abstract
Abstract — In the absence of a cost-effective technology for storing optical signals, emerging optical packet switched (OPS) networks are expected to have severely limited buffering capability. This paper investigates the resulting impact on end-to-end loss and throughput, and proposes that the optical edge switches “pace ” packets into the OPS core to improve performance without adversely affecting end-to-end delays. In this context, our contributions are three-fold. We first evaluate the impact of short buffers on the performance of real-time and TCP traffic. This helps us identify short-time-scale burstiness as the major contributor to performance degradation, so we propose that the optical edge switches pace the transmission of packets into the OPS core while respecting their delay-constraints. Our second contribution develops algorithms of poly-logarithmic complexity that can perform optimal real-time pacing of high data rate traffic. Lastly, we show via simulations of a realistic network carrying real-time traffic that pacing can significantly reduce losses at the expense of a bounded increase in end-to-end delay. The loss-delay trade-off mechanism provided by pacing can help achieve desired OPS network performance. I.
Vijay Sivaraman, Hossam A. ElGindy, David Moreland, Diethelm Ostry
INFOCOM3