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

Dave Gilbert

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

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

Computer networks · 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
1 paper
Internet architecture and protocols · 77% Optical networks · 23%

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

TopicWeightPapersLastEvidence papers
Optical networks › network survivability
p-cycle protection
0.112010
Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS · IEEE J. Sel. Areas Commun. 2010
Internet architecture and protocols
quality of service
0.112010
Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS · IEEE J. Sel. Areas Commun. 2010
Internet architecture and protocols › traffic shaping
token bucket
0.112010
Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS · IEEE J. Sel. Areas Commun. 2010
Internet architecture and protocols
traffic shaping
0.112010
Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS · IEEE J. Sel. Areas Commun. 2010

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

simulation · 0.1recursive stochastic matrix decomposition · 0.1
YearPublicationVenuePosition
2010 Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS
abstract
Over the next decades, the Internet will evolve to support increasingly complex mission-critical services such as telerobotically controlled surgery. The world's first telerobotic surgery over the public Internet was performed in 2003, and since then several hundred more have been performed. Three critical requirements of these services include: (i) essentially 100% restoration capability, (ii) small and bounded end-toend queuing delays (ie < 250 millsec), and (iii) very low-jitter communications (ie < 10 millisec). In this paper, algorithms to provision mission-critical services over the Internet with essentially 100% restoration capability and essentially-perfect QoS are proposed, building upon two theoretical foundations. Mission-critical traffic is routed using the theory of shared backup protection paths or p-cycles, while background traffic is routed using multiple edge-disjoint paths. Mission-critical traffic is scheduled using the theory of recursive stochastic matrix decomposition to achieve two constraints: (i) near-minimal end to end queuing delay and jitter and (ii) essentially-perfect QoS. Designs of the Application-Specific Token-Bucket Traffic Shaper Queues (ASTSQs) and the Application-Specific Playback Queues (ASPQs) for telerobotic services are provided. To test the theory, extensive simulations of a saturated Internet backbone network supporting telerobotic services along with competing background traffic (ie VOIP, IPTV) are reported. It is shown that all missioncritical traffic can be delivered while meeting the three critical requirements, even in fully saturated backbone IP networks.
Ted H. Szymanski, Dave Gilbert
IEEE J. Sel. Areas Commun.2