141,576 Hits in 5.9 sec

Free network measurement for adaptive virtualized distributed computing

A. Gupta, M. Zangrilli, A.I. Sundararaj, A.I. Huang, P.A. Dinda, B.B. Lowekamp
2006 Proceedings 20th IEEE International Parallel & Distributed Processing Symposium  
In this paper we demonstrate the feasibility of such free automatic network measurement by fusing the Wren passive monitoring and analysis system with Virtuoso's virtual networking system.  ...  VMs to measure the underlying physical network.  ...  Virtuoso and Wren Virtuoso [15, 1] , is a system for virtual machine distributed computing where the virtual machines are interconnected with VNET, a virtual overlay network.  ... 
doi:10.1109/ipdps.2006.1639382 dblp:conf/ipps/GuptaZSHDL06 fatcat:s63yuhsx7jhvrf77cu63qq7gji

Adaptive Virtual Cut-Through as a Viable Routing Method

Ho Won Kim, Hyun Suk Lee, Sunggu Lee, Jong Kim
1998 Journal of Parallel and Distributed Computing  
Adaptive virtual cut-through is considered as a viable alternative to wormhole switching for fast and hardware-efficient interprocessor communication in multicomputers.  ...  Computer simulations are used to show that our implementation of a minimal-path fully-adaptive virtual cut-through algorithm outperforms both deterministic and adaptive wormhole switching methods under  ...  Realizing the need for adaptability in routing around congested or faulty nodes and links, several researchers [4, 5] used virtual channels to produce adaptive deadlock-free WH routing algorithms, in  ... 
doi:10.1006/jpdc.1998.1466 fatcat:kna74qb66fecvohloatq3xajue

Performance Modelling of Necklace Hypercubes

S. Meraji, H. Sarbazi-Azad, A. Patooghy
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
The analysis focuses on a fully adaptive routing algorithm which has been shown to be the most effective for necklace hypercube networks.  ...  This paper proposes an analytical performance model to predict message latency in wormhole-switched necklace hypercube interconnection networks with fully adaptive routing.  ...  We call the virtual channels used for base deadlock-free routing as the base virtual channels and the remaining virtual channels as the adaptive virtual channels.  ... 
doi:10.1109/ipdps.2007.370594 dblp:conf/ipps/MerajiSP07 fatcat:iqur3bkbjjcetn5ynparbunebi

Experimenting adaptive services in sea-cloud innovation environment

Jingguo Ge, Yulei Wu, Tong Li, E Yuepeng, Chi Zhang
2014 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)  
This paper pioneers to present the design of sea-cloud innovation environment (SCIE) based on the software defined networking (SDN) and network functions virtualization (NFV) paradigms to support adaptive  ...  service-oriented experimentation, where the virtualized network functions (VNFs) can be implemented or deimplemented dynamically on network devices according to ondemand requirements.  ...  SEA-CLOUD INNOVATION ENVIRONMENT (SCIE) To realize the proposed principle for adaptive serviceoriented experimentation, we developed a wide-area SCIE using 12 hardware racks with computation, networking  ... 
doi:10.1109/infcomw.2014.6849193 dblp:conf/infocom/GeWLEZ14 fatcat:moufrlyusvbazaxhah6aty5jmi

Performance Evaluation of Fully Adaptive Routing for the Torus Interconnect Networks [chapter]

F. Safaei, A. Khonsari, M. Fathy, M. Ould-Khaoua
2007 Lecture Notes in Computer Science  
Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in parallel computer networks.  ...  The analysis focuses on a fully adaptive routing which has been shown to be one of the most effective in torus networks.  ...  When blocking occurs a message has to wait for all V 1 fully adaptive virtual channels, and 2 / 2 1 V Δ − + ⎡ ⎤ ⎢ ⎥ deadlock-free virtual channels.  ... 
doi:10.1007/978-3-540-72590-9_89 fatcat:j67zdarbxjdndjfzp7htj7zo2i

An Advanced NoP Selection Strategy for Odd-Even Routing Algorithm in Network-on-Chip [chapter]

Minghua Tang, Xiaola Lin
2009 Lecture Notes in Computer Science  
Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in parallel computer networks.  ...  The analysis focuses on a fully adaptive routing which has been shown to be one of the most effective in torus networks.  ...  When blocking occurs a message has to wait for all V 1 fully adaptive virtual channels, and 2 / 2 1 V Δ − + ⎡ ⎤ ⎢ ⎥ deadlock-free virtual channels.  ... 
doi:10.1007/978-3-642-03095-6_53 fatcat:m2zwppvwn5b6jgpjrp6shugys4

Deadlock-free adaptive routing in multicomputer networks using virtual channels

W.J. Dally, H. Aoki
1993 IEEE Transactions on Parallel and Distributed Systems  
This paper describes two deadlock-free adaptive routing algorithms.  ...  We prove that these algorithms are deadlock-free and give experimental measurements of their performance.  ...  Sardegna for proofreading this manuscript, to J. Keen and D. Wallach for assistance with the network simulations, and to R. Lethin for suggesting the use of hierarchical routing tables. H.  ... 
doi:10.1109/71.219761 fatcat:ppbyz5gbqvh2pdgb2vsbrmxvyq

A family of mechanisms for congestion control in wormhole networks

E. Baydal, P. Lopez, J. Duato
2005 IEEE Transactions on Parallel and Distributed Systems  
The mechanisms are evaluated and compared for several network loads and topologies, noticeably improving network performance with high loads but without penalizing network behavior for low and medium traffic  ...  Unfortunately, many of the mechanisms proposed in the literature for congestion control either suffer from a lack of robustness, being unable to work properly with different traffic patterns or message  ...  He proposed a powerful theory of deadlock-free adaptive routing for wormhole networks.  ... 
doi:10.1109/tpds.2005.102 fatcat:qedlqpuo4jenra7oeyqobtxmy4

Evaluating the Performance of Adaptive Fault-Tolerant Routing Algorithms for Wormhole-Switched Mesh Interconnect Networks

F. Safaei, A. Khonsari, M. Fathy, A. H. Shantia, M. Ould-Khaoua
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
The performance measures studied are the throughput, average message latency and average usage of virtual channels per node.  ...  The suggested scheme is widely used in the literature to achieve high adaptivity and support inter-processor communications in parallel computer systems due to its ability to preserve both communication  ...  In the fault-free case, the traffic load distribution for the nodes on the f-rings is equivalent with that of other nodes in the network.  ... 
doi:10.1109/ipdps.2007.370596 dblp:conf/ipps/SafaeiKFSO07 fatcat:oqabl5i4cjdopbqwcogjloombu

Autonomic live adaptation of virtual networked environments in a multidomain infrastructure

Paul Ruth, Junghwan Rhee, Dongyan Xu, Sebastien Goasguen, Rick Kennell
2011 Journal of Internet Services and Applications  
The core technologies enabling these distributed clouds are machine and network virtualization.  ...  In this paper, we go beyond supporting applications in the cloud and support autonomic adaptation of virtual computation environments as active, integrated entities.  ...  Acknowledgements We would like to thank the anonymous reviewers for their constructive comments and suggestions.  ... 
doi:10.1007/s13174-011-0031-1 fatcat:vychk7dmhff4ljkatqtbfcmigi

An experimental distributed framework for distributed Simultaneous Localization and Mapping

Ruwan Gamage, Mihran Tuceryan
2016 2016 IEEE International Conference on Electro Information Technology (EIT)  
Furthermore, we describe a way to measure communication statistics of the distributed SLAM system.  ...  The distributed SLAM research would benefit if there is a framework where the complexities of network communication is already handled.  ...  As shown in Figure1, each virtual machines are configured to contain 2 network adapters. • First network adapter operates in host-only mode.  ... 
doi:10.1109/eit.2016.7535318 dblp:conf/eit/GamageT16 fatcat:boquomjf5nftvmhmq45pi7fcbu

Table of Contents

2021 2021 IEEE 46th Conference on Local Computer Networks (LCN)  
Computing Framework over Information Centric Networking 589 Revenue Maximization Leveraging Elastic Service Provisioning in Flexible Optical Networks iv ASER: Scalable Distributed Routing Protocol for  ...  COVID-19 Case Prediction Using Cellular Network Logs 479 EADAS: Edge Assisted Adaptation Scheme for HTTP Adaptive Streaming 487  ... 
doi:10.1109/lcn52139.2021.9524933 fatcat:bopsc4l2qrc7bobzfyb6343iou

MagicLink: Weaving Multi-site Wireless Sensor Networks for Large-Scale Experiments [chapter]

Xinxin Liu, Li Yu, Di Wang, Xiaolin Li
2012 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
"clouds" of sensors for sensor network research and experiments at scale and on demand.  ...  To address such challenges, we propose the MagicLink middleware to "magically" weave geographically distributed sensor networks into a large-scale sensor network testbed.  ...  Adaptation and dispatching Virtual link adaptation and message dispatching is the core operation that actually achieves resource stitching among distributed sensor network sites.  ... 
doi:10.1007/978-3-642-35576-9_18 fatcat:ogw7t6jjh5f4zdpgofj52qjzma

Virtual Machines And Networks - Installation, Performance, Study, Advantages And Virtualization Options

Ishtiaq Ali, Natarajan Meghanathan
2011 International journal of network security and its applications  
system, virtualization options and a performance study measuring the throughput obtained on a network of virtual machines and physical host machines.  ...  be feasible enough to be conducted in a physical network of personal computers; but could be conducted only using virtual machines.  ...  For example, the virtual machine image can be distributed for Computer Networks or Network Security classes with all the required software installed on it.  ... 
doi:10.5121/ijnsa.2011.3101 fatcat:fswvfhfdajctjh45sowjqcapl4

A new routing mechanism for networks with irregular topology

V. Puente, J. A. Gregorio, R. Beivide, F. Vallejo, A. Ibañez
2001 Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '01  
For a 512-node network, uniform traffic, and virtual cut-through flow control, our mechanism can outperform, in some cases, the classic up*/down* algorithm by almost a factor of 2.  ...  The most spectacular gains were obtained for big networks.  ...  It is a distributed deadlock-free routing scheme that provides partial adaptability in irregular networks.  ... 
doi:10.1145/582034.582065 dblp:conf/sc/PuenteGBVI01 fatcat:c36ed77srbb2hlkdtev5zuwqw4
« Previous Showing results 1 — 15 out of 141,576 results