On Tuesday, 2 June 2009 at 17.30 the NET Group invites students and others interested in our work to our monthly Pizza Meeting. We have two interested talks prepared and there will be some food and beverages. The meeting takes place in our seminar room (IfI 3.101).
Die NET Gruppe laedt am Dienstag, den 2. Juni 2009 um 17.30 Uhr Studenten und andere Interestenten an unserer Arbeit zu unserem monatlichen Pizza Meeting ein. Wir haben zwei interessante Vortraege vorbereitet und es gibt etwas zu essen und Getraenke. Das Treffen findet in unserem Seminarraum statt (IfI 3.101).
The agenda is as follows:
17.30 - 18.10: "Interest Based Peer to Peer Group Management", Mayutan Arumaithurai
Peer-to-Peer systems become popular applications but suffer from insufficient resource availability which is caused by free-riders and inefficient lookup algorithms. To address the first cause, a number of recent works have focused on providing appropriate incentive mechanisms to encourage participants to contribute their resources to the P2P systems. To improve the lookup efficiency, locality-awareness has been introduced into the research community. However, existing proposals attempt to optimize the service performance during the data transmission period mostly after performing the neighboring lookup, which cannot address the fundamental concern of reducing lookup traffic. Therefore, this paper proposes interest-based peer-to-peer management (IPM) protocol to facilitate the peering lookup. Our design philosophy differs from existing work that IPM is a client-only approach and can be represented as either an alternative or a complementary to current proposals. With additional locality-awareness considerations, IPM can reduce the lookup overhead while optimizing the system performance. The simulation results essentially state that IPM can largely improve the efficiency and reliability of P2P media distribution systems through reducing control overhead by 50% on average and reduces average packet loss rate up to 34.7%.
18.10 - 18.40: "XOR Rescue: Exploiting Network Coding in Lossy Wireless Networks", Fang-Chun Kuo
It is well-known that wireless links are error-prone
and require retransmissions for recovering frames from errors
and losses. Network coding (NC) has been proposed for more efficient
MAC-layer retransmissions in WLANs. However, existing
schemes employed the reception report mechanism, which is both
inefficient and expensive. Furthermore, they considered neither
fairness nor the effects of time-varying heterogeneous wireless
networks. These issues are critical for achieving full benefit
of network coding. Without addressing them, these schemes
may even impair system performance. In this paper, a novel
MAC-layer retransmission scheme, namely XOR Rescue(XORR)
is proposed. It estimates the reception status without extra
overheads and devises a new coding metric, which accommodates
the effects of the frames size and the channel condition. Finally,
XORR employs NC-aware fair opportunistic scheduling, which
is theoretically proven to be fair, i.e. not only the service time is
evenly allocated, but also it always improves the expected goodput
for every wireless station. It is further verified by theoretic
analyses, extensive simulations and testbed experiments. Our results
show that XORR outperforms the non-coding fair opportunistic
scheduling and 802.11 by 25% and 40%, respectively.
After the meeting, we will continue in a more informal and relaxed atmosphere on the roof terrace.