Sciweavers

858 search results - page 127 / 172
» Sharing the Cost of a Capacity Network
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
PIKE: peer intermediaries for key establishment in sensor networks
— The establishment of shared cryptographic keys between communicating neighbor nodes in sensor networks is a challenging problem due to the unsuitability of asymmetric key crypt...
Haowen Chan, Adrian Perrig
ICMCS
2008
IEEE
148views Multimedia» more  ICMCS 2008»
14 years 3 months ago
Loss tolerance scheme for 3D progressive meshes streaming over networks
– Nowadays, the Internet provides a convenient medium for sharing complex 3D models online. However, transmitting 3D progressive meshes over networks may encounter the problem of...
Hui Li, Ziying Tang, Xiaohu Guo, Balakrishnan Prab...
ICC
2007
IEEE
104views Communications» more  ICC 2007»
14 years 3 months ago
A Novel Graph Model for Maximum Survivability in Mesh Networks under Multiple Generic Risks
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
Qingya She, Xiaodong Huang, Jason P. Jue
INFOCOM
1998
IEEE
14 years 1 months ago
Dynamic Flow Switching, A New Communication Service for ATM Networks
This paper presents a new communication service for ATM networks that provides one-way, adjustable rate, on-demand communication channels. The proposed dynamic flow service is des...
Qiyong Bian, Kohei Shiomoto, Jonathan S. Turner
ESA
2010
Springer
185views Algorithms» more  ESA 2010»
13 years 10 months ago
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robe...