Filters








1,274 Hits in 6.8 sec

pp-mess-sim: a flexible and extensible simulator for evaluating multicomputer networks

J. Rexford, Wu-Chang Feng, J. Dolter, K.G. Shin
1997 IEEE Transactions on Parallel and Distributed Systems  
This paper presents pp-mess-sim, an object-oriented discrete-event simulation environment for evaluating interconnection networks in message-passing systems.  ...  The simulator provides a toolbox of various network topologies, communication workloads, routing-switching algorithms, and router models.  ...  Any opinions, findings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the view of the National Science Foundation.  ... 
doi:10.1109/71.569653 fatcat:u47by6qsbbhbnbfa2vs7xd5agy

A flit level simulator for wormhole routing

Denvil Smith
2000 Proceedings of the 38th annual on Southeast regional conference - ACM-SE 38  
Wormhole routing, the latest switching technique to be utilized by massively parallel computers, enjoys the distinct advantage of a low latency when compared to other switching techniques.  ...  More simulation tools would prove beneficial to the communication research community to aid in evaluating wormhole routed algorithms.  ...  Super computers address this need in the form of a parallel architecture or massively parallel computer, MPC.  ... 
doi:10.1145/1127716.1127742 dblp:conf/ACMse/Smith00a fatcat:6yoas7bw5zhxvhdgjgfmh4vewe

Wormhole routing techniques for directly connected multicomputer systems

Prasant Mohapatra
1998 ACM Computing Surveys  
Wormhole routing has emerged as the most widely used switching technique in massively parallel computers.  ...  Next, the characteristics of the wormhole routing mechanism are described in detail along with the theory behind deadlock-free routing.  ...  An extensive and detailed review of an earlier draft of the article by Professor José Duato is greatly appreciated.  ... 
doi:10.1145/292469.292472 fatcat:awgtqfbqvjfmvfibgxf3aeqlay

An improved topology discovery algorithm for networks with wormhole routing and directed links

Ying-Yi Huang, Mart L Molle
1999 Computer Networks  
We propose a new parallel topology discovery algorithm for irregular, mesh-connected networks with unidirectional links and wormhole routing.  ...  An algorithm of this type was developed for the ATOMIC high speed local area network to avoid the need for manually updating routing tables.  ...  Acknowledgements The project is partially supported by a Computer Science research fellowship from the University of California, Riverside.  ... 
doi:10.1016/s0169-7552(98)00231-1 fatcat:ajzhc5zfszgqxkhuc76uazqrre

Performance Modelling of Necklace Hypercubes

S. Meraji, H. Sarbazi-Azad, A. Patooghy
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
This paper proposes an analytical performance model to predict message latency in wormhole-switched necklace hypercube interconnection networks with fully adaptive routing.  ...  Several analytical models have been proposed in the literature for different interconnection networks, as the most cost-effective tools to evaluate the performance merits of such systems.  ...  The analytical model In this section, we derive an analytical performance model for wormhole adaptive routing in a necklace hypercube.  ... 
doi:10.1109/ipdps.2007.370594 dblp:conf/ipps/MerajiSP07 fatcat:iqur3bkbjjcetn5ynparbunebi

BSMR: Byzantine-Resilient Secure Multicast Routing in Multi-hop Wireless Networks

Reza Curtmola, Cristina Nita-Rotaru
2007 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks  
The problem of secure multicast in wireless networks was less studied and only outside attacks were addressed - [17] .  ...  The problem of secure multicast in wireless networks was less studied and only outside attacks were addressed' [17] .  ...  ACKNOWLEDGEMENTS The first author would like to thank R5zvan Mus5loiu-E. for fruitful "copy-room" discussions in the early stages of this work.  ... 
doi:10.1109/sahcn.2007.4292838 dblp:conf/secon/CurtmolaN07 fatcat:7yifkcf6kfakvp3zdzpnrmhruu

LTA based Filtering of Wormhole and Blackhole Node Packets for Reliable Multipath Communication in MANETs

Hiremath P S, Anuradha T, Prakash Pattan
2016 IJARCCE  
In this paper, a novel method (LTAWB) based on LTA multipath routing is proposed, which filters the packets of wormhole and blackhole attacks, for reliable communication in MANETs.  ...  The simulated results of the proposed algorithm are compared with that of fuzzy logic based secured MANET transmission against wormhole and blackhole attacks (SMTWB) [7] .  ...  ACKNOWLEDGMENT The authors are very thankful to the reviwers for their helpful comments which improves the quality of paper.  ... 
doi:10.17148/ijarcce.2016.512114 fatcat:jvc3az4ikbggnajojbf7dwakam

Universal wormhole routing

R.I. Greenberg, Hyeong-Cheol Oh
1997 IEEE Transactions on Parallel and Distributed Systems  
In this paper, we examine the wormhole routing problem in terms of the "congestion" c and "dilation" d for a set of packet paths.  ...  We run some simulations on the fat-tree which show that not only does wormhole routing tend to perform better than the more heavily studied store-andforward routing, but that performance superior to our  ...  Introduction An efficient routing algorithm is critical to the design of most large-scale general-purpose parallel computers.  ... 
doi:10.1109/71.584091 fatcat:rlf3fvtgfrenznjwno2agzyz34

Secure neighbor discovery and wormhole localization in mobile ad hoc networks

Radu Stoleru, Haijie Wu, Harsha Chenji
2012 Ad hoc networks  
Neighbor discovery is an important part of many protocols for wireless adhoc networks, including localization and routing.  ...  To the best of our knowledge, this work is the first to secure neighbor discovery in mobile adhoc networks and to localize a wormhole.  ...  Acknowledgements This work was funded in part by NSF Grants 0923203 and 1127449.  ... 
doi:10.1016/j.adhoc.2012.03.004 fatcat:tpyz5al3m5f4zksxom3fvgtkyq

Effects of Adaptive Wormhole Routing in Event Builder Networks

G. Bauer, V. Boyer, J. Branson, A. Brett, E. Cano, A. Carboni, M. Ciganek, S. Cittolin, S. Erhan, D. Gigi, F. Glege, R. Gomez-Reino (+28 others)
2007 2007 15th IEEE-NPSS Real-Time Conference  
with wormhole routing.  ...  with wormhole routing.  ...  ACKNOWLEDGMENTS We acknowledge support from the DOE and NSF (USA), KRF (Korea), Marie Curie Program and Eva Kühn (Vienna University of Technology, Austria).  ... 
doi:10.1109/rtc.2007.4382749 fatcat:wgwosooo7vafnfwqkne7vqcxsa

Effects of Adaptive Wormhole Routing in Event Builder Networks

Gerry Bauer, Vincent Boyer, James Branson, Angela Brett, Eric Cano, Andrea Carboni, Marek Ciganek, Sergio Cittolin, Samim Erhan, Dominique Gigi, Frank Glege, Robert Gomez-Reino (+28 others)
2008 IEEE Transactions on Nuclear Science  
with wormhole routing.  ...  with wormhole routing.  ...  ACKNOWLEDGMENTS We acknowledge support from the DOE and NSF (USA), KRF (Korea), Marie Curie Program and Eva Kühn (Vienna University of Technology, Austria).  ... 
doi:10.1109/tns.2008.915925 fatcat:t4tqodn5qvdvzectegaliz6rbe

Simulating Parallel Architectures with BSPlab [chapter]

Lasse Natvig
2001 Lecture Notes in Computer Science  
BSPlab is a simulation environment for studying the interplay between hardware and software in parallel computing.  ...  Then it presents the architectural models and their parameters, and discusses how they can be used to make experiments that show how the different aspects of a computer affect the performance of an application  ...  An important way of studying the HW/SW interplay in such complex parallel computing systems is by simulation.  ... 
doi:10.1007/3-540-48228-8_57 fatcat:t64bvetokfhsniy2wxdxmlvubq

Data Structures and Algorithms for Packet Forwarding and Classification

Sartaj Sahni
2009 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks  
Dynamic traffic grooming for survivable mobile networks -fairness control p. 1113 An efficient cache access protocol in a mobile computing environment p. 1123 Implementation and performance study of route  ...  pancake graphs p. 479 A cost optimal parallel quicksorting and its implementation on a shared memory parallel computer p. 491 Near optimal routing in a small-world network with augmented local  ... 
doi:10.1109/i-span.2009.122 dblp:conf/ispan/Sahni09 fatcat:p44oexvkrzbobdwhmrc4lkpglu

Performance evaluation of Butterfly on-Chip Network for MPSoCs

Mohammad Arjomand, Hamid Sarbazi-Azad
2008 2008 International SoC Design Conference  
Comparative analysis of results with common NoC infrastructures shows that in bandwidth requirement applications, Butterfly with extra stages and wormhole (and sometimes virtual cut through) switching  ...  As case studies, design space exploration including different topologies, routing and switching strategies for two video decoders are presented.  ...  A number of different topologies are used for MPSoC interconnects. Most of them emerge from parallel computing field. Topology determines how nodes are connected to each other.  ... 
doi:10.1109/socdc.2008.4815631 fatcat:zlxshmmbu5chtlmdhe2k3heimy

Secure Neighbor Discovery in Mobile Ad Hoc Networks

R. Stoleru, H. Wu, H. Chenji
2011 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems  
Neighbor discovery is an important part of many protocols for wireless adhoc networks, including localization and routing.  ...  To the best of our knowledge, this work is the first to secure neighbor discovery in mobile adhoc networks. MSND leverages concepts of graph rigidity for wormhole detection.  ...  Acknowledgements: This work was funded in part by NSF grant CNS 0923203. The authors thank Stephen George for help with some implementation and editing of the paper, and Sejun Song for feedback.  ... 
doi:10.1109/mass.2011.15 dblp:conf/mass/StoleruWC11 fatcat:6zpyoetmebet5hstzc6i3wnjzy
« Previous Showing results 1 — 15 out of 1,274 results