%0 Journal Article %1 citeulike:1106664 %A Turner, Yoshio %A Tamir, Yuval %D 2007 %J Journal of Parallel and Distributed Computing %K circuits, citeulike deadlock, routing %N 1 %P 13--32 %R 10.1016/j.jpdc.2006.08.012 %T Deadlock-free connection-based adaptive routing with dynamic virtual circuits %U http://dx.doi.org/10.1016/j.jpdc.2006.08.012 %V 67 %X Virtual circuits (VCs) can reduce routing overheads with irregular topologies and provide support for a mix of quality of service (QoS) requirements. Information about network loads and traffic patterns may be used during circuit establishment to utilize network resources more efficiently than is practical with packet routing. Most VC schemes are static--each established VC remains unchanged until the connection is no longer needed. In contrast, we propose the dynamic virtual circuit (DVC) mechanism, which enables existing circuits to be quickly torn down in order to free up resources needed for other circuits or to re-establish circuits along routes that are better suited for current network conditions. We propose a deadlock avoidance technique, based on unconstrained routing of DVCs combined with a deadlock-free virtual network. We present a correctness proof for the scheme, describe key aspects of its implementation, and present performance evaluation results that explore its potential benefits.

@article{citeulike:1106664, abstract = {{Virtual circuits (VCs) can reduce routing overheads with irregular topologies and provide support for a mix of quality of service (QoS) requirements. Information about network loads and traffic patterns may be used during circuit establishment to utilize network resources more efficiently than is practical with packet routing. Most VC schemes are static--each established VC remains unchanged until the connection is no longer needed. In contrast, we propose the dynamic virtual circuit (DVC) mechanism, which enables existing circuits to be quickly torn down in order to free up resources needed for other circuits or to re-establish circuits along routes that are better suited for current network conditions. We propose a deadlock avoidance technique, based on unconstrained routing of DVCs combined with a deadlock-free virtual network. We present a correctness proof for the scheme, describe key aspects of its implementation, and present performance evaluation results that explore its potential benefits.}}, added-at = {2017-09-08T10:52:59.000+0200}, author = {Turner, Yoshio and Tamir, Yuval}, biburl = {https://www.bibsonomy.org/bibtex/2c6099d5f2d4da4581e932306e834dc67/fernand0}, citeulike-article-id = {1106664}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.jpdc.2006.08.012}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6WKJ-4M7CDDS-1/2/b9bd4c11633cd0c59fe5afbf72e3aaa8}, doi = {10.1016/j.jpdc.2006.08.012}, interhash = {f89e24efbad65750dcf7e40e10f98fd4}, intrahash = {c6099d5f2d4da4581e932306e834dc67}, journal = {Journal of Parallel and Distributed Computing}, keywords = {circuits, citeulike deadlock, routing}, month = jan, number = 1, pages = {13--32}, posted-at = {2007-02-14 10:54:39}, priority = {2}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{Deadlock-free connection-based adaptive routing with dynamic virtual circuits}}, url = {http://dx.doi.org/10.1016/j.jpdc.2006.08.012}, volume = 67, year = 2007 }