Results 11 - 20 of 312

1 GTPP: General Truncated Pyramid Peer-to-Peer Architecture over Structured DHT Networks

by Zhonghong Ou, Erkki Harjula, Timo Koskela, Mika Ylianttila
"... Abstract — Hierarchical Distributed Hash Table (DHT) architectures have been among the most interesting research topics since the birth of flat DHT architecture. However, most of the previous work has merely focused on the two-tier hierarchy. In this paper, we study and analyze General Truncated Pyr ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Abstract — Hierarchical Distributed Hash Table (DHT) architectures have been among the most interesting research topics since the birth of flat DHT architecture. However, most of the previous work has merely focused on the two-tier hierarchy. In this paper, we study and analyze General Truncated

ACOM: Any-source Capacity-constrained Overlay Multicast in Non-DHT P2P Networks

by Shiping Chen, Baile Shi, Shigang Chen, Ye Xia - IEEE Trans. Paral. Dis. Sys. 2007
"... Abstract—Application-level multicast is a promising alternative to IP multicast due to its independence from the IP routing infrastructure and its flexibility in constructing the delivery trees. The existing overlaymulticast systems either support a single data source or have high maintenance overhe ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
Abstract—Application-level multicast is a promising alternative to IP multicast due to its independence from the IP routing infrastructure and its flexibility in constructing the delivery trees. The existing overlaymulticast systems either support a single data source or have high maintenance

Multilevel Coding over Two-Hop Single-User 1 Networks

by Vahid Pourahmadi, Alireza Bayesteh, Amir K. Kh , 905
"... In this paper, a two-hop network in which information is transmitted from a source via a relay to a destination is considered. It is assumed that the channels are static fading with additive white Gaussian noise. All nodes are equipped with a single antenna and the Channel State Information (CSI) of ..."
Abstract - Add to MetaCart
In this paper, a two-hop network in which information is transmitted from a source via a relay to a destination is considered. It is assumed that the channels are static fading with additive white Gaussian noise. All nodes are equipped with a single antenna and the Channel State Information (CSI

Single-Hop Probing Asymptotics in Available Bandwidth Estimation: Sample-Path Analysis

by Xiliang Liu, Benyuan Liu, Dmitri Loguinov, et al. , 2004
"... In this paper, we take the sample-path approach in analyzing the asymptotic behavior of single-hop bandwidth estimation under bursty cross-traffic and show that these results are provably different from those observed under fluid models of prior work. This difference, which we call the probing bias ..."
Abstract - Add to MetaCart
In this paper, we take the sample-path approach in analyzing the asymptotic behavior of single-hop bandwidth estimation under bursty cross-traffic and show that these results are provably different from those observed under fluid models of prior work. This difference, which we call the probing

Counting-sort and Routing in a Single Hop Radio Network

by Maciej Gȩbala , Marcin Kik
"... Abstract. We consider two problems. First, sorting of n integer keys from the [0, 2 m − 1] range, stored in p stations of a single-hop and single channel radio network. Second problem is routing of the packets between the stations of the network. We introduce counting-sort algorithm which has 3mri ..."
Abstract - Add to MetaCart
Abstract. We consider two problems. First, sorting of n integer keys from the [0, 2 m − 1] range, stored in p stations of a single-hop and single channel radio network. Second problem is routing of the packets between the stations of the network. We introduce counting-sort algorithm which has 3mri

Adaptive Scheduling of Message Forwarding of DHT-based P2P Network Broadcast*

by Jeng-wei Lin, Tun Wei Wang, Ray-i Chang
"... Aggregated information, such as the total and free capacity of storages, computing power, network bandwidth, and so on, is very important for many peer-to-peer (P2P) ap-plications and P2P-based grid or cloud computing. Previous studies have proposed to build a broadcast tree for a structured P2P net ..."
Abstract - Add to MetaCart
Aggregated information, such as the total and free capacity of storages, computing power, network bandwidth, and so on, is very important for many peer-to-peer (P2P) ap-plications and P2P-based grid or cloud computing. Previous studies have proposed to build a broadcast tree for a structured P2P

Cryptanalysis of KeeLoq code-hopping using a Single FPGA

by Idan Sheetrit, Avishai Wool
"... Abstract. The KeeLoq cipher is used in many wireless car door systems and garage openers. Recently the algorithm was studied and several attacks have been published. When a random seed is not used the attack on the system is fairly straight-forward. However when a seed is shared between the remote c ..."
Abstract - Add to MetaCart
control and the receiver previous research suggested using highly parallel crypto hardware (like COPACOBANA) for breaking the cipher within reasonable time. In this paper we show that highly-parallel hardware is not necessary: our attack uses a single FPGA for breaking KeeLoq when using a 48-bit random

Minimum Length Scheduling in Single-hop Multiple Access Wireless Networks

by unknown authors
"... Abstract—In this paper, we address the minimum length scheduling problem in wireless networks, where each transmitter has a finite amount of data to deliver to a common receiver node (e.g., base station). In contrast with previous works that model wireless channels according to the Protocol or Physi ..."
Abstract - Add to MetaCart
Abstract—In this paper, we address the minimum length scheduling problem in wireless networks, where each transmitter has a finite amount of data to deliver to a common receiver node (e.g., base station). In contrast with previous works that model wireless channels according to the Protocol

Design and Implementation Tradeoffs for Wide-Area Resource Discovery

by Jeannie Albrecht, David Oppenheimer, Amin Vahdat, David A. Patterson - In Proceedings of 14th IEEE Symposium on High Performance, Research Triangle Park , 2005
"... We describe the design and implementation of SWORD, a scalable resource discovery service for wide-area distributed systems. In contrast to previous systems, SWORD allows users to describe desired resources as a topology of interconnected groups with required intra-group, inter-group, and per-node c ..."
Abstract - Cited by 98 (13 self) - Add to MetaCart
We describe the design and implementation of SWORD, a scalable resource discovery service for wide-area distributed systems. In contrast to previous systems, SWORD allows users to describe desired resources as a topology of interconnected groups with required intra-group, inter-group, and per

Modeling Energy Consumption in Single-Hop IEEE 802.11 Ad Hoc Networks

by Marcelo M. Carvalho, Cintia B. Margi, Katia Obraczka, J. J. Garcia-Luna-Aceves - In Thirteenth International Conference on Computer Communications and Networks (ICCCN’04 , 2004
"... This paper presents an analytical model to predict energy consumption in saturated IEEE 802.11 single-hop ad hoc networks under ideal channel conditions. The model we introduce takes into account the different operational modes of the IEEE 802.11 DCF MAC, and is validated against packetlevel simulat ..."
Abstract - Cited by 20 (2 self) - Add to MetaCart
This paper presents an analytical model to predict energy consumption in saturated IEEE 802.11 single-hop ad hoc networks under ideal channel conditions. The model we introduce takes into account the different operational modes of the IEEE 802.11 DCF MAC, and is validated against packetlevel
Results 11 - 20 of 312