Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS

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.

[1]  Leandros Tassiulas,et al.  MNCM: A Critical Node Matching Approach to Scheduling for Input Buffered Switches With No Speedup , 2009, IEEE/ACM Transactions on Networking.

[2]  Blake Hannaford,et al.  The RAVEN: Design and Validation of a Telesurgery System , 2009, Int. J. Robotics Res..

[3]  Tim Roughgarden,et al.  Routers with Very Small Buffers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[4]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input-buffered crossbar switches for guaranteed-rate services , 2001, IEEE Trans. Commun..

[5]  Amogh Dhamdhere,et al.  Open issues in router buffer sizing , 2006, CCRV.

[6]  Ted H. Szymanski,et al.  A low-jitter guaranteed-rate scheduling algorithm for packet-switched ip routers , 2009, IEEE Transactions on Communications.

[7]  Nick McKeown,et al.  Update on buffer sizing in internet routers , 2006, CCRV.

[8]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[9]  Susanne Naegele-Jackson,et al.  Influence of compression and network impairments on the picture quality of video transmissions in tele-medicine , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[10]  R. M. Karp,et al.  Computational Complexity of Combinatorial and Graph-Theoretic Problems , 2011 .

[11]  Guido Appenzeller,et al.  Sizing router buffers , 2004, SIGCOMM '04.

[12]  Wayne D. Grover,et al.  Extending the p-cycle concept to path segment protection for span and node failure recovery , 2003, IEEE J. Sel. Areas Commun..

[13]  Giovanni Schembra,et al.  Traffic specifications for the transmission of stored MPEG video on the Internet , 2001, IEEE Trans. Multim..

[14]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[15]  윤창근 해외동향 : Global Environment for Network Innovations(GENI): 미국의 미래 인터넷 전략 , 2010 .

[16]  T.H. Szymanski Bounds on end-to-end delay and jitter in input-buffered and internally-buffered IP networks , 2009, 2009 IEEE Sarnoff Symposium.

[17]  Blake Hannaford,et al.  Evaluation of unmanned airborne vehicles and mobile robotic telesurgery in an extreme environment. , 2008, Telemedicine journal and e-health : the official journal of the American Telemedicine Association.

[18]  Dave Gilbert,et al.  Low jitter guaranteed-rate communications for cluster computing systems , 2008 .

[19]  Wayne D. Grover,et al.  Physical-Layer p-Cycles Adapted for Router-Level Node Protection: A Multi-Layer Design and Operation Strategy , 2007, IEEE Journal on Selected Areas in Communications.

[20]  A. Pirisi,et al.  Telerobotics brings surgical skills to remote communities , 2003, The Lancet.

[21]  Steven D. Wexner,et al.  The current status of robotic pelvic surgery: results of a multinational interdisciplinary consensus conference , 2009, Surgical Endoscopy.

[22]  G. Raina,et al.  Buffer sizes for large multiplexers: TCP queueing theory and instability analysis , 2005, Next Generation Internet Networks, 2005.

[23]  Laxmi N. Bhuyan,et al.  Guaranteed smooth switch scheduling with low complexity , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[24]  M Radespiel-Tröger,et al.  Tele-endoscopy: influence of data compression, bandwidth and simulated impairments on the usability of real-time digital video endoscopy transmissions for medical diagnoses. , 2002, Endoscopy.

[25]  C. Dovrolis,et al.  Router Buffer Sizing for TCP Traffic and the Role of the Output/Input Capacity Ratio , 2009, IEEE/ACM Transactions on Networking.

[26]  Can Emre Koksal,et al.  Rate quantization and service quality over single crossbar switches , 2004, IEEE INFOCOM 2004.

[27]  Murali S. Kodialam,et al.  On guaranteed smooth scheduling for input-queued switches , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[28]  Peter Kazanzides,et al.  Surgical and Interventional Robotics - Core Concepts, Technology, and Design [Tutorial] , 2008, IEEE Robotics & Automation Magazine.

[29]  Dave Gilbert,et al.  Internet Multicasting of IPTV With Essentially-Zero Delay Jitter , 2009, IEEE Transactions on Broadcasting.

[30]  T.H. Szymanski A QoS switch scheduling algorithm based on recursive fair stochastic matrix decomposition , 2006, 2006 Workshop on High Performance Switching and Routing.

[31]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[32]  K. Cleary Medical Robotics and the Operating Room of the Future , 2005, 2005 IEEE Engineering in Medicine and Biology 27th Annual Conference.

[33]  Steven E. Butner,et al.  Transforming a surgical robot for human telesurgery , 2003, IEEE Trans. Robotics Autom..

[34]  Martin Reisslein,et al.  Network performance evaluation using frame size and quality traces of single-layer and two-layer video: A tutorial , 2004, IEEE Communications Surveys & Tutorials.

[35]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[36]  Nick McKeown,et al.  Designing packet buffers for router linecards , 2008, TNET.

[37]  Rade Stanojevic,et al.  A critique of recently proposed buffer-sizing strategies , 2007, CCRV.

[38]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.