658 search results - page 77 / 132 » Lower bounds for sorting networks |
ICNP
2006
IEEE
14 years 1 months ago
2006
IEEE
We describe a family of ÐÓ Ò protocols for assigning symmetric keys to Ò processes in a network so that each process can use its assigned keys to communicate securely with eve...
IWQOS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Network operators would like their network to support current and future traffic matrices, even when links and routers fail. Not surprisingly, no backbone network can do ...
WCNC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We consider a scenario in which frequency agile radios opportunistically share a fixed spectrum resource with a set of primary nodes. We develop a collaborative scheme...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract-- This paper deals with the mean square stabilization problem for multi-input networked systems via single packet or multiple packets transmission, where the unreliability...
PODC
2003
ACM
14 years 1 months ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...