Sciweavers

474 search results - page 11 / 95
» On Multicast Path Finding Algorithms
Sort
View
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
14 years 2 days ago
On-Line Multicasting in All-Optical Networks
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...
Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno
ACISP
2007
Springer
13 years 11 months ago
A New Strategy for Finding a Differential Path of SHA-1
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
Jun Yajima, Yu Sasaki, Yusuke Naito, Terutoshi Iwa...
FTDCS
2003
IEEE
14 years 28 days ago
Resource- and Quality-Aware Application-Level Service Multicast
—Current multimedia application deployment tends to rely on composable service systems, where a complex multimedia service can be composed dynamically from multiple simpler ones ...
Jingwen Jin, Klara Nahrstedt
TMC
2008
136views more  TMC 2008»
13 years 7 months ago
Efficient Resource Allocation for Wireless Multicast
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
De-Nian Yang, Ming-Syan Chen
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq