2008 - Fellow of the Royal Society of Canada Academy of Science
In his works, Wayne D. Grover undertakes multidisciplinary study on Surgery and Blood transfusion. He performs multidisciplinary study in the fields of Blood transfusion and Autotransfusion via his papers. In his research, he performs multidisciplinary study on Autotransfusion and Surgery. His studies link Anesthesia with Autologous blood. His Anesthesia study typically links adjacent topics like Autologous blood. His study on Graph partition is mostly dedicated to connecting different topics, such as Theoretical computer science. His studies link Graph with Theoretical computer science. His Graph study often links to related topics such as Graph partition. Wayne D. Grover combines Computer network and Distributed computing in his research.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Wayne D. Grover.
(2003)
Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration
W.D. Grover;D. Stamatelakis.
international conference on communications (1998)
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
Rainer R. Iraschko;M. H. MacGregor;Wayne D. Grover.
IEEE ACM Transactions on Networking (1998)
Availability analysis of span-restorable mesh networks
M. Clouqueur;W.D. Grover.
IEEE Journal on Selected Areas in Communications (2002)
Comparison of k-shortest paths and maximum flow routing for network facility restoration
D.A. Dunn;W.D. Grover;M.H. MacGregor.
IEEE Journal on Selected Areas in Communications (1994)
IP layer restoration and network planning based on virtual protection cycles
D. Stamatelakis;W.D. Grover.
IEEE Journal on Selected Areas in Communications (2000)
Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles ("p-cycles")
D. Stamatelakis;W.D. Grover.
IEEE Transactions on Communications (2000)
Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design
J. Doucette;D. He;W.D. Grover;O. Yang.
design of reliable communication networks (2003)
Extending the p-cycle concept to path segment protection for span and node failure recovery
Gangxiang Shen;W.D. Grover.
IEEE Journal on Selected Areas in Communications (2003)
Synchronization of asynchronous data signals
James Angus Mceachern;Wayne Davy Grover.
(1987)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Osaka University
Chalmers University of Technology
University of Pittsburgh
University of Manchester
University of Cambridge
University of Hong Kong
Nanzan University
University of the Balearic Islands
Frantsevich Institute for Problems in Materials Science
Smithsonian Institution
University College Cork
Seoul National University
Johns Hopkins University
St. Jude Children's Research Hospital
Centre national de la recherche scientifique, CNRS
Liaocheng University
Fordham University
University of Oxford
University of Amsterdam