A Survey over Mechanisms for Reducing Free Riding

Science and Technology Journal Vol. 5 Issue: II July 2017 ISSN: 2321-3388

A Survey over Mechanisms for Reducing Free

Riding Behaviour in Structured P2P Networks
Prem Nath
‡’ƒ”–‡– ‘ˆ ‘’—–‡” ‰‹‡‡”‹‰ǡ
‹œ‘”ƒ ‹˜‡”•‹–›ǡ ‹œƒ™ŽȂ ͻǡ† ‹ƒ
Ǧ ƒ‹Žǣ ’ƒ–Šʹ‰ƒ‹ŽǤ ‘

Abstract— ʹ ȋ’‡‡”Ǧ –‘Ǧ ’‡‡”Ȍ ‘˜‡”Žƒ›• Šƒ˜‡ ƒ––”ƒ –‡† ƒ› ”‡•‡ƒ” Š‡”• †—‡ –‘ ‹ ”‡ƒ•‡ ‹ –‡”‡– „ƒ•‡† ʹ ƒ’’Ž‹ ƒ–‹‘•Ǥ
ʹ ‘˜‡”Žƒ› ‹• ƒ †‹•–”‹„—–‡† •›•–‡ ‹ ™Š‹ Š –Š‡ ‹†‡’‡†‡– ‘†‡• ’ƒ”–‹ ‹’ƒ–‡ ƒ– –Š‡‹” ™‹ŽŽ –‘ Š• ƒ”‡ ”‡•‘—” ‡• ‹
distributed manner. P2P overlays are designed for wired based communication systems but today P2P applications are
„‡ ‘‹‰ ’‘’—Žƒ” ‹ ™‹”‡Ž‡• ‡–™‘”• ‡˜‡ ‹ — Ž ‹Ǧ Š‘’ ™‹”‡Ž‡• ‡ –™‘”• Ǥ ‘—–‹‰ ‡ Šƒ‹• ‹ ʹ ‘˜‡”Žƒ›• ‹• „ƒ•‡†
 –
‘ ‹ˆ”ƒ•–”— –—”‡ ƒ† ƒ› ’”‘–‘ ‘Ž• ƒ”‡ †‡’Ž‘›‡† •— ‡••ˆ—ŽŽ› ˆ‘” ‡ˆϐ‹ ‹‡– ƒ† ˆƒ‹” ʹ ƒ’’Ž‹ ƒ–‹‘•Ǥ ‘™‡˜‡” ǡ –Š‡”‡ ƒ”‡
ƒ› ŠƒŽŽ‡‰‡• ‹ †‡•‹‰‹‰ ƒ† †‡’Ž‘›‡– ‘ˆ ‡ˆϐ‹ ‹‡– ƒ† ˆƒ‹” ’”‘–‘ ‘Ž• ˆ‘” –Š‡ ʹ ‘˜‡”Žƒ›•Ǥ Š‡•‡ ‘˜‡”Žƒ›• •—ˆˆ‡” ˆ”‘
ƒ› ŠƒŽŽ‡‰‡• — • Š ƒ• †›ƒ‹ ‘˜‡”Žƒ› ƒƒ‰‡‡–ǡ Žƒ  ‘ˆ ”‘„—•– –”—•– ‘†‡Ž ǡ ‘—–‡”ˆ‡‹– ‘–‡– †‹•–”‹„—–‹‘ ǡ ˆ”‡‡
”‹†‹‰ǡ ’‘‘” ”‡•‘—” ‡ •‡ƒ” Š • ƒŽƒ„‹Ž‹–›ǡ ‡• —”‹–›ǡ ‡– Ǥ Š‡ Š—” ”ƒ–‡ ‘ˆ ‘†‡• ȋŒ‘‹ ƒ† ‡Ž ƒ˜‡ ‘ˆ ‘†‡• Ȍ ‹ –Š‡ ʹ ‘˜‡”Žƒ›
makes overlay management and resource searching more challenging. The free riding nature of the nodes in a P2P overlay
‹• —†‡•‹”ƒ„Ž‡ ƒ† ‹– ”‡ƒ–‡• —ˆƒ‹”‡• ‹ –Š‡ ʹ ‘˜‡”Žƒ›Ǥ Š‡”‡ ƒ”‡ •‡˜‡”ƒŽ ‡ Šƒ‹• ’”‘’‘•‡† •— Š ƒ• ‹‰‡ ”—•–
‘†‡Žǡ –‹–Ǧ ˆ‘”Ǧ –ƒ– ’‘Ž‹ ›ǡ ’‘‹–Ǧ „ƒ•‡† ‹ ‡–‹˜‡ ’‘Ž‹ ›ǡ ƒ‰‡ ƒ ’‘Ž‹ ›ǡ ƒŽ ›‡”‡† –ƒšƒ–‹‘ǡ ƒ†˜‡”–‹•‡‡– ‘ˆ ‹ ‡–‹˜‡ ǡ ‡– Ǥ ˆ‘”
‡ ‘—”ƒ‰‹‰ ˆƒ‹”‡• ‹ –Š‡ ʹ ‘˜‡”Žƒ›•Ǥ Šƒ˜‡ ’”‡•‡–‡† ‹Ǧ †‡’–Š — • ”˜‡› ‘˜‡” ˆ”‡‡ ”‹†‹‰ „‡Šƒ˜‹‘—” ǡ ‹–• ‡ˆˆ‡ – ǡ ƒ† ‡š‹•–‹‰
mechanisms to reduce free riding in structured P2P overlays.

Keywords: ”‡‡ ‹†‹‰ǡ ƒ‹”‡•ǡ ʹ ‡–™‘”•ǡ ‹•–”‹„—–‡† ƒ•Š ƒ„Ž‡

INTRODUCTION do not have any central directory server. Structured

P2P overlays differ from conventional client/server
systems and provide the direct communication between
nodes without assistance of a central server. The main
application of ʹ ‡–™‘” ‹• •Šƒ”‹‰ ‘ˆ ϐ‹Ž‡ • „—– ‘–Š‡”
resources can be also shared. The major resources
to
„‡ Š• ƒ”‡† ƒ”‡ ϐ‹Ž‡•ǡ › ‡Ž •ǡ –• ‘”ƒ‰‡ ƒ† „ƒ†™‹†–ŠǤ
ʹ ‘˜‡”Žƒ›• ƒ”‡ Žƒ•‹ϐ‹‡† ‹ –™‘ ƒŒ‘” ƒ–‡‰‘”‹‡•ǣ
centralized and distributed. Distributed P2P overlays
are
ˆ—”–Š‡” Žƒ•‹ϐ‹‡† ‹ –™‘ •—„ ƒ–‡‰‘”‹‡•ǣ •–”— –—”‡†
ƒ†
—•–”— –—”‡†Ǥ ƒ’•–‡” ȋŠ––’ǣ Ȁ Ȁ ™ww.napster.com/) is
an example of centralized P2P overlay and it maintains
a broadcasting to the connected nodes. The number of query
‡–”ƒŽ‹œ‡† †‹”‡ –‘”› ‘ˆ –Š‡ ϐ‹Ž‡• •–‘”‡† ƒ– †‹ˆˆ‡”‡– ‘†‡•
‹ ƒ •‡”˜‡”Ǥ ‘†‡• ƒ––ƒ Š‡† –‘ –Š‡ ƒ’•–‡” ȋŠ––’ǣ Ȁ Ȁ ™™™Ǥ
napster.com/) overlay issue queries to the central directory
•‡”˜‡” –‘ ϐ‹† ™Š‹ Š ‘–Š‡” ‘ †‡• Š‘Ž† –Š‡ †‡•‹”‡† ϐ‹Ž‡•Ǥ Š‡ failure
of central entity is very much similar to the client/ server
model. Structured and unstructured P2P overlays
P2P overlays have structured overlay based on DHT
(Distributed Hash Table) (Stoica 2003; Dabek 2005;
Balakrishnan et al. 2003) but unstructured P2P overlays do
not have any
•–”— –—”‡ ‹’‘•‡† ‘˜‡” –Š‡ ‘˜‡”Žƒ›Ǥ Š‘”† ȋ –‘‹ ƒ ʹͲͲ͵Ȍ ǡ
ȋ ‘–‡– ††”‡••ƒ„Ž‡ ‡–™‘”Ȍ ȋ ›Ž˜‹ƒ ʹͲͲͳȌ ǡ ƒ† Kelips
(Gupta et al. ʹͲͲ͵Ȍ ǡ ƒ•–”› ȋ ‘™•–”‘  ʹͲͲͳȌ ǡ ƒ’‡•–”› ȋ Šƒ‘
ʹͲͲͳȌ ƒ”‡ „ƒ•‡† ƒŽ‰‘”‹–Š•Ǥ –”— –—”‡† ʹ overlays
offer scalable network overlay on a distributed data
structure that supports deterministic mechanism for
†ƒ–ƒ ƒ† ‘†‡• Ž‘‘—’ —•‹‰  Ǥ —–‡ŽŽƒ ȋŠ––’ǣ Ȁ Ȁ ‰—–‡ŽŽƒǤ
™‡‰‘Ǥ ‘Ǣ Š––’•ǣ Ȁ Ȁ ‡Ǥ™‹‹’‡†‹ƒǤ‘”‰Ȁ ™‹‹Ȁ — –‡ŽŽƒȌ
‹•
ƒ ‡šƒ’Ž‡ ‘ˆ —•–”— –—”‡† ʹ ‘˜‡”Žƒ›Ǥ ‡•‘—” ‡ •‡ƒ” Š
‡ Šƒ‹ • ‹  —  –‡ŽŽƒ ‹ • „ƒ•‡† ‘  ϐŽ‘‘†‹‰ ƒ† •‡ƒ” Š “—‡”› is
messages exponentially increases with the number of
overlay
Š‘’• ƒ† ‹– ”‡ƒ–‡• ‘‰‡•–‹‘ ƒ† Ž‘™ •‡ƒ” Š ‡ˆϐ‹ ‹‡ ›Ǥ
‘•– ‘ˆ –Š‡ ʹ •‘ˆ–™ƒ”‡• ƒ”‡ —•‡† –‘ †‘™Ž‘ƒ† ϐ‹Ž‡•Ǥ
‘” ‡šƒ’Ž‡ǡ ‹– ‘””‡– ȋŠ––’ǣ Ȁ Ȁ ™™™Ǥ„‹––‘””‡–Ǥ ‘Ȍ ‹•
Š––’ǣ Ȁ Ȁ †‘‹Ǥ‘”‰Ȁ ͳͲǤʹʹʹ͵ʹȀ •–ŒǤʹͲͳͲ
͹ǤͲ
Ͳ ʹǤͲ
͹
 A Survey over Mechanisms for Reducing Free Riding

ƒ‹Ž› —•‡† –‘ †‘™Ž‘ƒ† Žƒ”‰‡ ϐ‹Ž‡• •— Š ƒ• ‘ ˜‹‡•ǡ ˜‹†‡‘•ǡ ˆƒ‹”‡• ƒ‘‰ ‘†‡• Šƒ• „‡‡ ”‡’‘”–‡† ‹ ˜ƒ”‹‘—• studies and it is
ƒŽ„—•ǡ ‡– Ǥ ™Š‡”‡ƒ• —  –‡ŽŽƒ ȋŠ––’ǣ Ȁ Ȁ ‰—–‡ŽŽƒǤ™‡‰‘Ǥ ‘Ȍ ‹• due to free riders in the P2P overlays. Most of the
—•‡† ’ƒ”–‹ —Žƒ”Ž› ˆ‘” †‘™Ž‘ƒ†‹‰ ƒ• Ž ϐ‹Ž‡• •— Š ƒ• ‹• ‰ Ž‡ nodes are not graceful enough to share their
•‘‰Ǥ – Šƒ• „‡‡ ”‡’‘”–‡† ‹ ƒ› •–—†‹‡• –Šƒ– –Š‡ ͷ‘Ψ ˆ ”‡•‘—” ‡• ƒ† †‹•ƒ’’‡ƒ” ƒˆ–‡” †‘™Ž‘ƒ†‹‰ –Š‡ ‘–‡–Ǥ ˆ
downloaded content via the Bittorrent networks a node in the P2P overlay does not share its resources in
consists the
‘ˆ ˜‹†‡‘ ƒ† ͵ͷΨ ‘ˆ †‘™Ž‘ƒ†‡† ‘–‡– ‘•‹•–• ‘ˆ — ‹• Ǥ
‹– ‘””‡– Ž‹‡ ϐ‹Ž‡ •Šƒ”‹‰ ’”‘–‘ ‘Ž• Šƒ˜‡ ‹„—‹Ž– ‹ ‡–‹˜‡
‡ Šƒ‹• –‘ ”‡†— ‡ ˆ”‡‡ ”‹†‹‰Ǥ Š‡ †‡•‹‰ –”ƒ†‡Ǧ ‘ˆˆ• ‘ˆ
‹– ‘””‡– ‹Ž ‡ ϐ‹Ž‡ •Šƒ”‹‰ ’”‘–‘ ‘Ž• Šƒ˜‡ „‡‡ ’”‡•‡–‡†
in (Fan et al.
ʹͲͲͻȌ Ǥ

Šƒ˜‡ ’”‘’‘•‡† ƒ †‡–ƒ‹Ž‡† •—”˜‡› ‘˜‡” –Š‡ • Š‡‡•

proposed for reducing free riding and enhancing
fairness
‹ –Š‡ •–”— –—”‡† ʹ ‘˜‡”Žƒ›•Ǥ ‡•– ‘ˆ –Š‡ ’ƒ’‡” ‹•
organized as follows. The drawbacks of the free riding are
given in section 2. Mechanisms to reduce free riding
and increase fairness are discussed in detail in section
3. The category of various mechanisms has been
discussed in
•‡ –‹‘ ͶǤ Š‡ ‘ — Ž ‹• ‘ ƒ„‘—– –Š‡ ˆ”‡‡ ”‹†‹‰ǡ ‹–• ‡ˆˆ‡ –•ǡ
and mechanisms proposed to reduce free riding are given in
section 5 followed by references.

FREE RIDING EFFECTS

Free riders affect a P2P system’s operation adversely
and
”‡ƒ–‡ Š‹‰Š Ž‡˜‡Ž ‘ˆ —ˆƒ‹”‡• ‹ –Š‡ •›•–‡Ǥ – Šƒ• „‡‡
‘„•‡”˜‡† ƒ† ”‡’‘”–‡† ‹ ƒ › •–—†‹‡• –Šƒ– ‹ ƒ ˆ”‡‡Ǧ ”‹†‹‰
‡˜‹”‘‡–ǡ ƒ ƒ• Ž —„‡” ‘ˆ ‘†‡• ‡• ”˜‡ ƒ Žƒ”‰‡ —
 „ ‡”
‘ˆ ‘ †‡• ƒ† ‹– ”‡ƒ–‡• Š‘–Ǧ •’‘– ‹ –Š‡ ‘˜‡”Žƒ›Ǥ Š‡ Š‘–Ǧ •’‘–
•‹–—ƒ–‹‘  ƒ  Ž‡ƒ† –‘ • ƒŽƒ„‹Ž‹–› ƒ† •‹‰Ž‡Ǧ ’‘‹–Ǧ ‘ˆǦ ˆƒ‹Ž—”‡
problem in the P2P overlay. Free riders decrease the total
network utility as the majority of the network requests are
•‡”˜‡† „› ƒ •ƒŽ ’‘”–‹‘ ‘ˆ —•‡Žϐ‹•Š ‘†‡•ǡ –Š—• ™‡ƒ‡‹ ‰
–Š‡ ˆƒ—Ž–Ǧ –‘Ž‡”ƒ ‡ ‘ˆ ʹ ‘˜‡”Žƒ›•Ǥ – Šƒ• „‡‡ ƒŽ•‘ ‘–‹ ‡† that free
riders occupy considerable underlying available network
bandwidth. Structured P2P overlays appear to be more
susceptible to free riders than unstructured and
‡–”ƒŽ‹œ‡† ʹ ‘˜‡”Žƒ›•Ǥ  ƒ – • ”— –—”‡† ʹ ‘˜‡”Žƒ›ǡ ƒ ˆ”‡‡
rider can ignore the incoming queries and does not store
the
Ǧ Ͳ’ƒ‹”•
Ͳ ™ Š‹ Š ƒ”‡ ‡• ‡
• –‹ƒŽˆ‘” ȋ –‘‹ ƒ ʹͲͲ͵Ǣ

Dabek 2005; Balakrishnan et al. 2003) solicitation and

•–”— –—”‡ ˆ‘”ƒ–‹‘Ǥ ˆ —„‡”• ‘ˆ ˆ”‡‡ ”‹†‡”• ‰”‘™ –‘ Š‹‰Š
Ž‡˜‡Žǡ “—‡”‹‡• ‹ –Š‡ ʹ ‘˜‡”Žƒ› ƒǯ – „‡ ”‡•‘Ž˜‡† ƒ† ʹ
system might be failed (Karakaya et al.
ʹͲͲͻȌ Ǥ

1 1
 A Survey over Mechanisms for Reducing Free Riding
’”‘’‘”–‹‘ƒ–‡ –‘ –Š‡ †‘™Ž‘ƒ†ǡ •— Š •‹–—ƒ–‹‘ Ž‡ƒ†• –‘™ƒ”† incentive for P2P streaming system according to nodes’
—ˆƒ‹”‡ • ‹ –Š‡ ʹ ‘˜‡”Žƒ›Ǥ ˆ”‡‡ ”‹†‡” ‹• ƒ ’ƒ”–‹ ‹’ƒ–‹‰ node instant contributions. They have proposed a repeated game
in P2P overlay that uses P2P overlay services but
doesn’t contribute to the system or other nodes at an
acceptable level. Free riding behaviour creates
unfairness in the P2P overlays and it is undesirable for
overall P2P
‘˜‡”Žƒ› ’‡”ˆ‘”ƒ ‡Ǥ • ”‡’‘”–‡† „› — et al. ȋʹͲͳ͵Ȍ –Šƒ–
there exists extreme unfairness among peers in popular
ʹ Ž‹˜‡ ˜‹†‡‘ Š• ƒ”‹‰Ǥ • ”‡’‘”–‡† „› ƒ‰ ƒ† ‘Ž‹ƒ
ȋʹͲͲ͵Ȍ –Šƒ– ʹͷΨ ‘ˆ –Š‡ ‘ †‡• •Šƒ”‡† ‘ –Š‹‰ ƒ† ͷͲΨ ‘ˆ
‘†‡• Š• ƒ”‡† ˜‡”› ‹Ž ––Ž‡Ǥ —”–Š‡”‘”‡ǡ ƒ„‘—– ‘Ψ ˆ ‘ †‡•
’”‘˜‹†‡† ‘ ”‡ –Šƒ ͻΨ
‘ ˆ –Š‡ –‘–ƒŽ ”‡•‘—” ‡•Ǥ • ”‡’‘”–‡†
by Hughes et al. ȋʹͲͲͷȌ ǡ –Š‡ ’‡” ‡–ƒ‰‡ ‘ˆ ˆ”‡‡ ”‹†‡”•
‹
—–‡ŽŽƒ ȋŠ––’ǣ Ȁ Ȁ ‰—–‡ŽŽƒǤ™‡‰‘Ǥ ‘Ǣ
Š––’•ǣ Ȁ Ȁ ‡Ǥ™‹‹’‡†‹ƒǤ
‘”‰Ȁ ™‹‹Ȁ —–‡ŽŽƒȌ •›•–‡ ™ƒ• ‘”‡ –Šƒ ͺͷΨ ‘ˆ –Š‡ –‘–ƒŽ
’ƒ”–‹ ‹’ƒ–‡† ‘†‡•Ǥ ‘ –Š‡” ”‡’‘”– ‘ˆ ƒ‰ et al. (2005)
‹†‹ ƒ–‡• –Šƒ– ƒœ‡ ʹ ‘˜‡”Žƒ› ƒŽ•‘ Šƒ† ‘ ”‡ –Šƒ ͵ͷΨ
ˆ”‡‡ ”‹†‹‰ ’”‘„Ž‡Ǥ ƒ› – • —†‹‡• Šƒ˜‡ ˜‡”‹ϐ‹‡† –Šƒ– Š‹‰Š
degrees of free riding exist in P2P
overlays.

MECHANISMS TO REDUCE FREE RIDING

AND PROMOTE FAIRNESS
There are many incentive mechanisms proposed
to reduce free riding and promote sharing of resources
in the P2P networks. Goswami et al. ȋʹͲͳȌ Šƒ˜‡ ’”‘’‘•‡†
ƒ ”‡’—–ƒ–‹‘Ǧ „ƒ•‡† ”‡•‘—” ‡ ƒŽŽ‘ ƒ–‹‘ • Š‡‡ ˆ‘” ʹ
overlays. This paper is based on game theoretical
method
™Š‹ Š ‘’”‹•‡• –™‘ ‘Ǧ ‘‘’‡”ƒ–‹˜‡ ‰ƒ‡• ˜‹œǤǡ †‡ƒ† game and
reputation game. This scheme ensures that demands
made by nodes are proportionate to their shared capacity
and provides fairness among the nodes. Michal Feldman
et al. ȋʹȌͲ
Š ƒ˜‡ •–—†‹‡† –Š‡ —•‡”•ǯ „‡Šƒ˜‹‘—” ‹ P2P overlays
and provided comparison of user types. They have
proposed a mechanism that excludes low type users.
 ‘–Š‡” ™‘”†•ǡ ’”‘’‘•‡† • Š‡‡ ȋ ‡Ž†ƒ  et al. ʹͲͲ͸Ȍ
‹ — Ž †‡• ’‡ƒŽ‹œƒ–‹‘ ˆ‘” ˆ”‡‡Ǧ ”‹†‡”• ™‹–Š †‡‰”ƒ†‡† ‡• ”˜‹ ‡Ǥ
‹ ŠƒŽ ‡Ž†ƒǡ et al. ȋʹȌŠ ƒ˜‡ ƒŽ•‘ ‘•‹†‡”‡† –Š‡ churn rate of
users and white washers in the P2P overlays and proposed
penalty mechanism for both.
Fan et al. ȋʹͻȌ
Š ǡ ƒ˜‡ •–—†‹‡† –Š‡ †‡•‹‰ –”ƒ†‡Ǧ ‘ˆˆ
‘ˆ ‹– ‘””‡– ϐ‹Ž‡ •Šƒ”‹‰ ’”‘–‘ ‘Ž• ƒ† ’”‘˜‹†‡† –
• —†›
‘˜‡” –”ƒ†‡Ǧ ‘ˆˆ „‡–™‡‡ ˆƒ‹”‡• ƒ† •›•–‡ ’‡”ˆ‘”ƒ ‡Ǥ
‹– ‘””‡– ϐ‹Ž‡ •Šƒ”‹‰ ’”‘–‘ ‘Ž• ƒ”‡ ‰‘‘† ˆ‘” ”‡†— ‹‰ free
riding behaviour due to inbuilt incentive mechanism.
Xiao et al. ȋʹͲͳʹȌ Šƒ˜‡ ’”‘’‘•‡† ƒ •‡”˜‹ ‡ †‹ˆˆ‡”‡–‹ƒ–‹‘

1 1
A Survey over Mechanisms
Na for Reducing Free Riding

model to analyse how much the nodes should contribute in ƒ”˜‹• ȋʹͺȌ
 Ǥ ‘†‡ ƒ ‡ƒ” ’‘‹– ˆ‘” •Šƒ”‹‰ ƒ ϐ‹Ž‡ ™‹–Š
each round under to maintain fairness in the P2P ‘–Š‡” ‘†‡•Ǥ ƒ•‡† ‘ –Š‡ ‡ƒ”‡† ’‘‹–•ǡ ‘†‡• ‘’‡–‡
overlay. ™‹–Š ‡ƒ Š ‘–Š‡” ‹ ϐ‹”•–Ǧ ’”‹ ‡Ǧ ƒ— –‹‘Ǧ Ž‹‡ ƒ ‡” †—”‹‰
— et al. ȋʹͲͳ͵Ȍ Šƒ˜‡ •–—†‹‡† –Š‡ –”ƒ†‡Ǧ ‘ˆˆ „‡–™‡‡ ‡š Šƒ‰‡ ‘ˆ –Š‡ †ƒ–ƒ „Ž‘ •Ǥ  ƒ†˜‡”–‹•‡‡ –  „ƒ•‡†
fairness and P2P system performance and proposed a semi ‹ ‡–‹˜‡ ‡ Šƒ‹• Šƒ• „‡‡ ’”‘’‘•‡† „› ƒ‰ et al. ȋʹͲͳʹȌ –‘ ‡
distributed algorithm based on the sub gradient method ‘—”ƒ‰‡ —’Ž‘ƒ†‹‰ ‹ ʹ •–”‡ƒ‹‰ •›•–‡•Ǥ Sheshjavani et al.
to tune the P2P live video system toward optimal fairness ȋʹͲͳȌ Šƒ˜‡ ’”‘’‘•‡† ƒ †‹•–”‹„—–‡†
while still maintaining the targeted universal streaming ‹ ‡–‹˜‡ ‡ Šƒ‹•ǡ ™Š‹ Š ‡š–‡•‹˜‡Ž› ‡Šƒ ‡ ‡•ŠǦ
rate. Junfeng et al. ȋʹͻȌ Š ƒ˜‡ ’”‘’‘•‡† ƒ ‹•–”‹„—–‡† ƒ† „ƒ•‡† ʹ ˜‹†‡‘Ǧ ‘Ǧ †‡ƒ† ȋ ‘ Ȍ •–”‡ƒ‹‰ ›• –
• ‡•Ǥ 
‘‹–‘”‹‰Ǧ „ƒ•‡† ‡ Šƒ‹• ȋ Ȍ –‘ †‹• ‘—”ƒ‰‡ ˆ”‡‡ –Š‡ ’”‘’‘•‡† ‡ Šƒ‹•ǡ ‘ †‡• ‘”‰ƒ‹‡• –Š‡ ʹ ‘˜‡”Žƒ›
riding in P2P networks. This proposed DMM consists of ƒ• ’‡” †‡ƒ† ‘ˆ –Š‡ ˜‹†‡‘ •–”‡ƒǤ ”‡’—–ƒ–‹‘Ǧ „ƒ•‡†
four ‹ ‡–‹˜‡ • Š‡‡ Šƒ• „‡‡ ’”‘’‘•‡† „› Š‹ ƒ† ƒ‹ ȋʹͲͲ͸Ȍ
Ž‡˜‡Ž•ǣ „ƒ•‹ Ž‡˜‡Žǡ – • ƒ–‹•–‹ • Ž‡˜‡Žǡ †‡ ‹•‹‘  ‡Ž ˜‡ Ž ƒ† ‡š‡ —–‹˜‡ to determine service levels among nodes according to their
level. The basic level transmits the service acquisitions –”ƒ•ƒ –‹‘• Š‹•–‘”›Ǥ †‡ϐ‹ ‹–Ǧ „ƒ•‡† †‹•–”‹„—–‡† ƒŽ‰‘”‹–Š
to statistics level and statistics level is responsible for that accurately rewards nodes in accordance with their
calculating the utility value of the consumer node. Based on contribution has been proposed by Sherman et al. ȋʹͲͳʹȌ Ǥ
–Š‡ —–‹Ž‹–› ˜ƒŽ—‡ǡ †‡ ‹•‹‘ Ž‡˜‡Ž ’”‘ ‡•• –Š‡ •‡”˜‹ ‡ ”‡“—‡•– node simply uploads the next data block to a node to which
‘ˆ –Š‡ ‘•—‡” ‘†‡Ǥ š‡ —–‹˜‡ ‡Ž ˜‡Ž ‹• ”‡•’‘•‹„Ž‡ ˆ‘” ‹– ‘™‡• –Š‡ ‘•– †ƒ–ƒ ƒ• ‡ ƒ•—”‡† „› ƒ †‡ϐ‹ ‹– ‘—–‡”Ǥ
‘‹–‘”‹‰ –Š‡ ϐ‘Ž ™ ˆ”‘ „ƒ•‹ Ž‡˜‡Ž –‘ †‡ ‹•‹‘ Ž‡˜‡ŽǤ
Trust between two interacting peers is also a
Li et al. ȋʹͲͳͲȌ Šƒ˜‡ ’”‘’‘•‡† ƒ „ƒŽƒ ‹‰ ‡–Š‘† crucial factor in P2P networks for fairness and
‘˜‡” –Š‡ •‡”˜‹ ‡ ’”‘˜‹•‹‘ ‹ –Š‡ ʹ ‘˜‡”Žƒ›•Ǥ ˆ ƒ ϐ‹Ž‡ ‹• performance. To guarantee a minimum level of trust
downloaded successfully then transaction is successful between two interacting
and earning value of the service provider is enhanced. Free ‘†‡•ǡ ƒ –”—•– ‘†‡Ž Šƒ• „‡‡ ’”‘’‘•‡† „› ”ž ‘Ž
”‹†‡”• †‘ǯ – ”‡•’‘•‡ –Š‡ †‘™Ž‘ƒ† ”‡“—‡•–ǡ •‘ ™‡ —•‡ –Š‡ et al. ȋʹͻȌ  Ǥ  ʹ ‡–™‘”•ǡ ‡† —•‡”• Š• ‘—Ž† •Šƒ”‡
attenuation function to punish them. Through the earnings –Š‡‹” ”‡•‘—” ‡• ƒ‘‰ ƒ ‰”‘—’ ‘ˆ ‘–Š‡” —•‡”•Ǥ ”‡’‡ƒ–‡†
ˆ— –‹‘ ƒ† –Š‡ ƒ––‡—ƒ–‹‘ ˆ— –‹‘ǡ ‘†‡• ƒ”‡ ‡ ‘—”ƒ‰‡† public goods game model for P2P networks for has
to participate in sharing resources. been
Ge et al. ȋʹͲͳͲȌ Šƒ˜‡ ’”‘’‘•‡† ƒ ‹–‹‰ƒ–‹‰ ‡ Šƒ‹• for free ’”‘’‘•‡† „› ‹ ȋʹͲͳͶȌ ™Š‹ Š ‡ƒ„Ž‡• ƒ ‹–‡”ƒ –‹˜‡ •‡ŽˆǦ
riding in BitTorrent networks. They have suggested a learning mechanism for resource sharing and gradually
seeder strategy and according to which each node receives Ž‡ƒ†• –Š‡ ʹ ‡ –™‘” ‹–‘ ‡ˆϐ‹ ‹‡– ‡–™‘” ‡“—‹Ž‹„”‹—Ǥ
†ƒ–ƒ „Ž‘ • „ƒ•‡† ‘ ƒ ‘ †‡Ǧ ’• ‡ ‹ϐ‹ —‹“—‡ ‹†‡–‹ϐ‹‡”Ǥ Š‹• –‘’‘Ž‘‰› ‘•–”— –‹‘ „ƒ•‡† ‘ ‰”‘—’‹‰ ‘ˆ ‹• ‹ ƒŽ ”
‹†‡–‹ϐ‹‡” ƒ „‡ †‡”‹˜‡† ˆ”‘ —•‡”Ǧ ”‡†‡–‹ƒŽ• ‹ •›•–‡• ‹–‡”‡•– ’‡‡” ȋ Ȍ Šƒ• „‡‡ ’”‘’‘•‡† „› ‡ƒ†‡•Šƒ
where users need to authenticate or it can be derived from ƒ† Šƒ†”ƒ•‡ƒ ” ȋʹͲͳ– Ȍ ‘ ƒ˜‘‹† –Š‡ ƒŽ‹ ‹‘—• ‘”
ƒ††”‡•• ‘ˆ –Š‡ Ž‹‡–Ǥ ‹ et al. ȋʹͲͳͳȌ Šƒ˜‡ ’”‘’‘•‡† ƒ ‘’”‘‹•‡† ‘†‡ –‘ ‡Šƒ ‡ –Š‡ ‘ ȋ —ƒŽ‹–› ‘ˆ ‡”˜‹ ‡Ȍ
–™‘Ǧ ƒŽ • ϐŽ—‹† ‘†‡Ž –‘ “—ƒ–‹–ƒ–‹˜‡Ž› ƒƒ›Ž ‡• † –Š‡ ˆ”‡‡ in P2P networks.
”‹†‹‰ ‡ˆˆ‡ – ‘ –Š‡ – • ‡ƒ‹‰ ʹ ‡–™‘”•Ǥ ‹‰‡ ”—•–  ‹ ‡–‹˜‡Ǧ „ƒ•‡† ‡ Šƒ‹• ȋ ‘Ž „ƒŽ ‘–”‹„—–‹‘Ȍ
determines the global contribution of the nodes based Šƒ• „‡‡ ’”‘’‘•‡† „› ‹•Š‹†ƒ ƒ† ‰—›‡ ȋʹͲͳͲȌ Ǥ Š‡
on the contribution (upload/download) of the nodes and factor of a node is calculated as per contribution (upload/
to whom contribution has been made and calculates a global †‘™Ž‘ƒ†Ȍ ƒ†‡ „› –Š‡ ‘†‡Ǥ ˆƒ –‘” ‹• ƒŽ•‘ ƒˆˆ‡ –‡† „›
trust value for all the nodes in the P2P network –Š‡ ˆƒ –‘” ‘ˆ ‘—–‡”’ƒ”– ‘†‡ –‘ ™Š‹ Š ‘—‹ ƒ–‹‘
(Kamvar et al. ʹ͵Ȍ Š Ǥ ‹• • Š‡‡ ‹• „ƒ•‡† ‘ –”ƒ•‹–‹˜‡ –”—•–ǡ –Šƒ– ‹• ƒ †‡Ǥ ‘†‡• Šƒ˜‹‰ Š‹‰Š‡” ˆƒ –‘” ‰‡– ’”‹‘”‹–› ‘˜‡”
‹•ǡ ‹ˆ ƒ ‘ †‡ –”—•–• ‹–• ˆ”‹‡†•ǡ ‹– ™‹ŽŽ ƒŽ•‘ –”—•– ‹–• ˆ”‹‡†•ǯ ‘†‡• Šƒ˜‹‰ Ž‘™‡” Ǥ ˆƒ –‘” ƒŽ•‘ „‡ ‘‡• ‡‰ƒ–‹˜‡ ‹ˆ ƒ
ˆ”‹‡†•Ǥ Ž –Š‡ ‘ †‡• ƒ‹–ƒ‹ ƒ ‘”ƒŽ‹œ‡† Ž‘ ƒŽ –”—•– node downloads more than it uploads or it downloads from
˜ƒŽ—‡• ‹ ƒ ˜‡ –‘”Ǥ  ‹ ‡–‹˜‡Ǧ „ƒ•‡† • Š‡‡ ȋ ‹ ƒ† Š‡‰ ƒ ‘ †‡ Šƒ˜‹‰ Š‹‰Š‡” Ǥ Ž–Š‘—‰Š –Š‡ ‡‰ƒ–‹˜‡ ˜ƒŽ—‡
ʹͻȌ
ˆ ‘” ʹ ‡ †‹ƒ •–”‡ƒǡ –Š‡ ‘—‹ ƒ–‹‘• „‡–™‡‡ two peers are promotes a node to upload more but at the same time it also
made according to policy “Give and Take”. This proposed affects the node’ activities in the systems. Such nodes can’t
mechanism allows for direct exchange between nodes †‘™Ž‘ƒ† †ƒ–ƒ —Ž‡• —–‹Ž –Š‡› ”‡•–‘”‡ –Š‡‹” ˆƒ –‘”Ǥ ˆ ƒ
and encourage nodes to share their resources and ‘†‡ ‹• —ƒ„Ž‡ –‘ ”‡•–‘”‡ ‹–• ˆƒ –‘” ƒ† ‹– ƒǯ – †‘™Ž‘ƒ†
prevents free riding. The concept of earning points into †ƒ–ƒ ˆ”‘ ‘–Š‡” ‘ †‡ Šƒ˜‹‰ Š‹‰Š‡” ˆƒ –‘”Ǥ Š‹• ‹• –—ƒ–‹‘
P2P live streaming systems has been proposed by Tan and ‹• ‘™ ƒ• •–ƒ”˜ƒ–‹‘Ǥ ƒ‰ ƒ† ‘— ȋʹͲͳŠȌ ƒ˜‡ ’”‘’‘•‡†

1 1
 A Survey over Mechanisms
Na for Reducing Free Riding

ƒ ‘–”ƒ –Ǧ „ƒ•‡† ‘ †‡Ž ˆ‘” ‘„‹Ž‡ ʹ •‡”˜‹ ‡•Ǥ Š‡

’”‘’‘•‡† ‘†‡Ž ƒ••—”‡• –Š‡ ‘ „ƒ•‡† ‘ –Š‡ ‡ ‘‘‹  ‡–‹˜‡Ǧ ƒ•‡† ‡ Šƒ‹•
‘–”ƒ – „‡–™‡‡ ȋ‡† —•‡”Ȍ ƒ† ȋ‡• ”˜‹ ‡ ’”‘˜‹†‡”Ȍ Ǥ
Š‡ ‘ „ƒ•‡† •‡”˜‹ ‡ ‹• „ƒ•‡† ‘ –™‘ –Š‹‰•Ǧ „ƒ•‹ ‘–”ƒ –
and subcontract. Basic contract is a business agreement
Monetary Payment
„‡–™‡‡ ‹–‡”‡•–‡† ƒ† ƒ† •—„ ‘–”ƒ – ‹• „‡–™‡‡ ‡ ‹’”‘ ‹–›Ǧ „ƒ•‡†

‘–”ƒ –‡† ‘†‡• ƒ† –‘ ˆƒ ‹Ž‹–ƒ–‡ ‘ –‘ –Š‡ ‹–‡”‡•–‡† ‡ ‹’”‘ ‹–›Ǧ

Ǥ —–Š‘”• Šƒ˜‡ ƒŽ•‘ ’”‘’‘•‡† ƒ ’‡ƒŽ–› „ƒ•‡† • Š‡‡
to overcome of the free riding behaviour of the contracted
nodes. Schaar et al. (2008) have proposed a solution
for
ˆ”‡‡ ”‹†‹‰ „› ‹–”‘†— ‹‰ ƒ –Š”‡•Š‘Ž† ‘ –Š‡ —’Ž‘ƒ†Ǥ
‘†‡ ‹ • ƒŽŽ‘™‡† –‘ †‘™Ž‘ƒ† ‡™ ϐ‹Ž‡ ‹ˆ ‹– • —’Ž‘ƒ† ˜‘Ž—‡ of data
exceeds the threshold. The Threshold is decided by a central
entity or the participating nodes in the overlay. The
proposed solution is similar to the credit/debit notion used
in the banking system. Penalty is also proposed to maximise
the upload in the P2P overlay. Deciding the threshold
and its monitoring are essential and require a central entity
or observatory nodes which induces extra cost.
—Ǧ ‡ƒ–
Ž ›
‹š‡† ‘–”‹„—–‹‘
‹‰Ǥ ͳǣ Žƒ•‹ϐ‹ ƒ–‹‘ ‘ˆ  ‡–‹˜‡Ǧ„ƒ•‡† ‡ Šƒ‹•
Schemes under this category require a central entity to
keep eye on the resources shared by different nodes and
this is why schemes under this category are not useful
for structured and unstructured P2P overlays. Once a node
joins the overlay
—†‡” –Š‹• ƒ–‡‰‘”›ǡ ‹– †‘‡• ‘– Šƒ˜‡ ‹ ‡–‹˜‡ –‘ ‘–”‹„—–‡
ƒ› ‘ ”‡Ǥ ‘ǡ ƒ †›ƒ‹ –Š”‡•Š‘Ž† ‹• –‘ „‡ ƒ ‹–ƒ‹‡† ˆ‘”
periodic update of the incentives of the participating
nodes.

CLASSIFICATION OF MECHANISMS Most of incentive schemes proposed for structured and

PROPOSED TO REDUCE FREE RIDING —•–”— –—”‡† ʹ ‘˜‡”Žƒ›• ƒ”‡ ƒ–‡‰‘”‹•‡† ƒ• ”‡ ‹’”‘ ‹–›Ǧ
„ƒ•‡† • Š‡‡ ‘” ”‡ ‹’”‘ ‹–›Ǧ —Ǧ ’‡ƒ– Ž › • Š‡‡Ǥ šƒ’Ž‡ • of
Zhang et al. ȋʹͻȌ Š ƒ˜‡ ’”‘’‘•‡† ƒ •—”˜‡› ‘˜‡” ‹ ‡–‹˜‡
schemes in this category are mechanisms proposed in
‡ Šƒ‹• ‹ ʹ ‘˜‡”Žƒ›•Ǥ ‘”†‹‰Ž›ǡ ‹ ‡–‹˜‡ by Li et al. ȋʹͲͳͲȌ Ǣ Š‡•ŠŒƒ˜ƒ‹ et al. ȋʹͲͳȌ Ǣ ‹ ƒ† Š‡‰
‡ Šƒ‹• ƒ „‡ Žƒ•‹ϐ‹‡† ‹ –Š”‡‡ ƒ–‡‰‘”‹‡• ƒ‡Ž› ȋʹͻȌƒ Ǣ  ƒ† ƒ”˜‹• ȋʹͺȌ ƒ Ǣ ‰ et al. ȋʹͲͳʹȌ Ǣ Š‹ ƒ† ƒ‹ ȋʹͲͲȌ Ǣ
‘‡–ƒ”› ’ƒ›‡–ǡ ‹š‡† ‘–”‹„—–‹‘ ƒ† ‡ ‹’”‘ ‹–›Ǧ ž”‘ Ž et al. ȋʹͲͲͻȌ Ǣ ‹ ȋʹͲͳͶȌ Ǣ ƒ† ‘•™ƒ‹ et al. ȋʹͲͳȌ Ǥ
„ƒ•‡† • Š‡‡•Ǥ ’”‘’‘•‡ ƒ ‡ ™ ƒ–‡‰‘”› ƒ ‡ † ƒ• Š‡‡• —†‡” –Š‹• ƒ–‡‰‘”› ‘’‡”ƒ–‡ ƒ• ’‡”
‡ ‹’”‘ ‹–›Ǧ —Ǧ ‡ƒŽ–›Ǥ Š‡ Žƒ•‹ϐ‹ ƒ–‹‘ ‘ˆ ‹ ‡–‹˜‡Ǧ ’‘Ž‹ › Dz ‹˜‡ ƒ† ƒ‡dz ‘” Dz ‹–Ǧ ˆ‘”Ǧ ƒ–dzǤ ‘†‡• ™Š‹ Š
„ƒ•‡† ‡ Šƒ‹• Šƒ• „‡‡ ‹ŽŽ—•–”ƒ–‡† ‹ ‹‰Ǥ ͳǤ †‘
 • Š‡‡ǡ ƒ ‘†‡ ƒ‡• ’ƒ›‡–
 ‘ ‡ –ƒ”› ’ƒ›‡–  –‘ ‘– •Šƒ”‡ — Š ƒǯ – ‰‡– — ŠǤ ‘‘’‡”ƒ–‹‘ ƒ‘‰  ‘†‡•
the resource provider node as real money or virtual money is required to maintain the incentives. There are
other
‘” –‘‡Ǥ  ƒ•‡ ‘ˆ ”‡ƒŽ ‘ ‡ › ’ƒ›‡–ǡ ‘ ‡ › ƒ „‡
‹ ‡–‹˜‡Ǧ „ƒ•‡† • Š‡‡• ™Š‹ Š ƒ”‡ ”‡ ‹’”‘ ‹–›Ǧ „ƒ•‡† „—–
–”ƒ•ˆ‡””‡† –‘ –Š‡ „”‘‡”ǯ • ƒ ‘—–Ǥ  –‘‡ „ƒ•‡† ’ƒ›‡–ǡ
these schemes also involve penalty mechanism to
–‘‡ ƒ „‡ ‘„–ƒ‹‡† ˆ”‘ –Š‡ „”‘‡” ‘ †‡Ǥ šƒ’Ž‡• ‘ˆ –Š‹•
penalize
ƒ–‡‰‘”› ƒ”‡ Dz ƒ›dz • Š‡‡ ’”‘’‘•‡† „› Ǥ ƒ‰ et al. (2008)
–Š‡ ‘ †‡• ™Š‹ Š ƒ’’‡ƒ” ˆ”‡‡ ”‹†‡”•Ǥ šƒ’Ž‡• ‘ˆ –Š‡•‡ • Š‡‡ are Fan
ƒ† ƒ‰ ƒ† ‘— ȋʹͲͳŠȌ Ǥ ‡ ƒ ‹ Ž‹‹–ƒ–‹‘• ‘ˆ –Š‹• • Š‡‡
et al. ȋʹͻȌ ‹ Ǣ ƒ‘ et al. ȋʹͲͳʹȌ Ǣ ‹•Š‹†ƒ ƒ† ‰—›‡ ȋʹͲͳͲȌ Ǣ
ƒ”‡ ‹˜‘Ž˜‡‡– ‘ˆ –Š‹”† ’ƒ”–› ƒ• „”‘‡”ǡ ƒ‹–‡ƒ ‡ ‘ˆ
—ˆ‡‰ et al. ȋʹͻȌ Š Ǣ ‡”ƒ  et al. ȋʹͲͳʹȌ Ǣ ‡Ž†ƒ  et al. ȋʹͲͲ͸Ȍ Ǣ
ƒ ‘—– ™‹–Š „”‘‡”ǡ ‹••—‡ ‘ˆ ‡™ –‘‡ǡ ‡– Ǥ Š‡‡ • ‹
ƒ‰ ƒ† ‘— ȋʹͲͳƒȌ † ˜ƒ  †‡” Šƒƒ” et al. (2008). These
monetary payment category involve a central entity
schemes share the incentives but also include penalize
to maintain account or issue token to the customer nodes
mechanism like reducing the inventive of a node.
and hence single point of failure is suspected. Schemes
under ϐ‹š‡† ‘–”‹„—–‹‘ ƒ–‡‰‘”› ‹˜‘Ž˜‡ •‹’Ž‡ ’”‹ ‹’Ž‡Ǥ ƒ
Š node in the overlay has to contribute some resources in CONCLUSION
order to receive resources from other nodes. Schemes
(Ge and †‡–ƒ‹Ž‡† •—”˜‡› ‘˜‡” ˆ”‡‡ ”‹†‹‰ „‡Šƒ˜‹‘—” ƒ†
ƒ‘Šƒ”ƒ ʹͲͳͲǢ –  ‘‹ƒ†‹• ƒ† ”ƒ† ʹͲͲ— Ǣ ˆ ƒ‰ ƒ† mechanisms of reduce free riding in structured P2P has
ƒ‹ ʹǢƒ ˜ƒ” et al. 2003) are examples of this category. „‡‡ ’”‡•
‡ –
 ‡† ‹ –Š‹• ’ƒ’‡”Ǥ •‡”• ‹ –Š‡ ʹ ‡–™‘”•
†‘™Ž‘ƒ†Ȁ —’Ž‘ƒ† ϐ‹Ž‡• ”‡Žƒ–‡† –‘ ˜‹†‡‘ǡ ƒ—†‹‘ǡ ‘ ˜‹‡ Ž‹’•ǡ
’‹ –—”‡•ǡ ‡– Ǥ ‹˜‡ ˜‹†‡‘ •–”‡ƒ‹‰ ‹• ‰ƒ‹‹‰  ’‘’—Žƒ”‹–›
1 1
 A Survey over Mechanisms
Na for Reducing Free Riding
in P2P applications. Since services in P2P networks are

1 1
A Survey over Mechanisms
Na for Reducing Free Riding

•‡ŽˆǦ ‘–‹˜ƒ–‡† ƒ† †‘ ‘– ”‡“—‹”‡ ƒ› ‡–”ƒŽ ‡• ”˜‡” –‘ —‰Š‡• ǡ ‘—Ž•‘ ƒ† ƒŽ‡”†‹‡ ȋʹͲͲͷȌ Dz ”‡‡ ‹†‹‰ ‘
‘‘”†‹ƒ–‡Ǥ ‘ǡ ’ƒ”–‹ ‹’ƒ–‹‰ ‘†‡• ‹ ʹ ‡ –™‘”• ƒ”‡ —  –‡ŽŽƒ ‡˜‹•‹–‡†ǣ Š‡ ‡ŽŽ ‘ŽŽ• ǫǡ dz ‹•–”‹„—–‡† ›•–‡•
”‡“—‹”‡† –‘ •Šƒ”‡ –Š‡‹” ”‡•‘—” ‡• ƒ• ’‡” ”‡“—‹”‡‡–Ǥ – Šƒ• Ž‹ ‡ ǡ ‘ŽǤ ‘ǡ ͲͲͷ ‘ͳ
Ǥ ͸ǡ ʹͲ Ͳ ͷǡͳ ͳȂ ͳͺǤ
—ˆ‡‰ ǡ ‹†ƒ ǡ ‹ ƒ† ‹— ȋʹͲͲͻȌ Dz ‹•–”‹„—–‡† ƒ†
been studied in many researches that majority of the nodes ‘‹–‘”‹‰Ǧ „ƒ•‡† ‡ Šƒ‹• ˆ‘” ‹• ‘—”ƒ‰‹‰ ”‡‡ ‹†‹‰
in P2P networks did not share their resources and very low ‹ ʹ ‡–™‘”dzǡ ‘’—–ƒ–‹‘ ‘”Ž†ǣ —–—”‡ ‘’—–‹‰ǡ
percentage of nodes serves the majority of the nodes in ‡”˜‹ ‡ ‘’—–ƒ–‹‘ǡ ‘‰‹–‹˜‡ǡ †ƒ’–‹˜‡ǡ ‘–‡–ǡ ƒ––‡”•ǡ
the P2P network. The nodes which do not share resources —„Ž‹Š• ‡† „› ‘’—–‡” ‘ ‹‡–› ȋʹͲͲͻȌ ǡ ͵͹ͻȂ Ͷ ͵ͺͶǤ
ƒ˜ƒ” ǡ ŠŽ‘•‡” ƒ† ƒ” ‹ƒǦ ‘Ž‹ƒ ȋʹͲͲ͵Ȍ Dz Š‡
but use the P2P applications are called free riders. Free ‹‰‡ ”—•– Ž‰‘”‹–Š ˆ‘” ‡’—–ƒ–‹‘ ƒƒ‰‡‡–  ‹ ʹ
riders are undesirable for better use of P2P networks. ‡–™‘”•ǡ dz ”‘ ‡‡†‹‰• ‘ˆ ͳʹ–Š –‡”ƒ–‹‘ƒŽ ‘”Ž† ‹†‡
There are many mechanism proposed for reducing free ‡„ ‘ˆ‡”‡ ‡Ǥ
ƒ”ƒƒ›ƒ ǡ ‘”’‡‘‰Ž— ƒ† — Ž ‘• › ȋʹͲͲͻȌ Dz ”‡‡ ‹†‹‰ ‹ ‡‡”Ǧ
riding in P2P networks. Most of the proposed mechanisms –‘Ǧ ‡‡” ‡–™‘”•dzǡ —„Ž‹Š• ‡† „› –Š‡ ‘’—–‡” ‘ ‹‡–›ǡ
ƒ”‡ ‘ –‹˜ƒ–‡† ˆ”‘ ”‡ƒŽ ‹Ž ˆ‡ ‡šƒ’Ž‡•Ǥ  •–”— –—”‡† ʹ ƒ” ŠȀ ’”‹Ž ͻʹȂ ͻͺǤ
‡–™‘”•ǡ ƒ–‹Ǧ ˆ”‡‡ ”‹†‹‰ ‡ Šƒ‹• ‹• ƒ‹Ž› „ƒ•‡† ‹ ȋʹͲͳͶȌ Dz ‡’‡ƒ–‡† —„Ž‹ ‘‘†• ƒ‡ ‘†‡ ˆ‘” ”—•–
ƒ•‡† ʹ ‡–™‘”•dzǡ ‹”‡Ž‡• ‡”•‘ƒŽ ‘—‹ ƒ–‹‘•ǡ
on incentives. Due to lack in central entity to control the
‘ŽǤ ͹ͻȋͳȌ
ͳͶ ͷ ǡ Ͷ͹͵Ȃ ͶͺͷǤ
Ͷ
ʹ ƒ’’Ž‹ ƒ–‹‘•ǡ ‘‡ ‘ˆ –Š‡ ‡š‹•–‹‰ ‹ ‡–‹˜‡ • Š‡‡• ‹• ‹ ǡ ‹— ǡ — ƒ† Š‡ ȋʹͲͳͲȌ Dz ƒŽ›•‹• ƒ† ƒŽƒ ‡†
ƒ„Ž‡ –‘ ‘–”‘Ž ˆ”‡‡ ”‹†‹‰ „‡Šƒ˜‹‘—” ƒ• –‹•ˆƒ –‘”‹Ž›Ǥ ‘ǡ •–‹ŽŽ ‡ Šƒ‹• ‘ ”‡‡Ǧ ”‹†‡”  ʹ ‡–™‘”dzǡ ”‘ ‡‡†‹‰• ‘ˆ
–Š‡”‡ ‹• ‡‡† ‘ˆ †‡’Ž‘›‡–  ‘ˆ ‡ˆˆ‡ –‹˜‡ ƒ–‹Ǧ ˆ”‡‡ ”‹†‹‰ ‡ ‘† –  ‡”ƒ–‹‘ƒŽ ‘ˆ‡”‡ ‡ ‘ ‘’—–‡” ‘†‡Ž‹‰
ƒ† ‹—ƒŽ –‹‘ǡ —„Ž‹•Š‡† „› ‘’—–‡” ‘ ‹‡–› ȋʹͲͳͲȌ ǡ
mechanism in P2P networks. ͶʹȂ ͶǤ
‹ ƒ† Š‡‰ ȋʹͲͲͻȌ Dz „ƒ”–‡”Ǧ „ƒ•‡† ‹ ‡–‹˜‡ ‡ Šƒ‹•
ˆ‘” ’‡‡”Ǧ –‘Ǧ ’‡‡” ‡†‹ƒ •–”‡ƒ‹‰ǡ dz ”‘ ‡‡†‹‰• ‘ˆ ͵ͳ–Š
REFERENCES ǡ ͺͳ Ȃ ͺ ͷ Ǥ
”ž ‘ Ž ǡ ±”‡œ ƒ† ƒ”‡–ƒ ȋʹͲͲͻȌ Dz ǡ ƒ ”—•– ‘†‡Ž
 ‘‹ƒ†‹• ƒ† ”ƒ† ȋʹͲͲȌ Dz ‡–‹˜‡• ˆ‘” ”‡•‘—” ‡ •Šƒ”‹‰
– ˆ‘” ʹ ‡–™‘”•dzǡ ‹”‡Ž‡• ‡”•‘ƒŽ ‘—‹ ƒ–‹‘•ǡ
‹ ‡• ˆŽ Ǧ ‘”‰ƒ‹œ‡† ‘—‹ –‹‡•ǣ ”‘ ‡ ‘‘‹ • –‘ •‘ ‹ƒŽ ‘ŽǤ ͷͳȋͳȌ ǡ ͳͷ͵Ȃ ͳͶ ͸ͶǤ
’•› Š‘Ž‘‰›ǡ dz ‹‰‹–ƒŽ ˆ‘”ƒ–‹‘ ƒƒ‰‡‡–ǡ ʹͲͲǤ Ǯ Ͳ†Ǥ ʹ† ‹•Š‹†ƒ ƒ† ‰—›‡ ȋʹͲͳͲȌ Dz Ž‘„ƒŽ ‘–”‹„—–‹‘ ’’”‘ƒ Š
–‡”ƒ–‹‘ƒŽ ‘ˆ‡”‡ ‡ǡ ͷͳ ͹ͷ͸Ȃ ͹͸ͳǤ –‘ ƒ‹–ƒ‹ ƒ‹”‡• ‹ ʹ ‡–™‘”•dzǡ ”ƒ•ƒ –‹‘• ‘
ƒŽƒ” ‹•Šƒ ǡ ƒƒ•Š‘‡ ǡ ƒ”‰‡” ǡ ‘””‹• ƒ† –‘‹ ƒ ȋʹͲͲ͵Ȍ ƒ”ƒŽŽ‡Ž ƒ† ‹•–”‹„—–‡† ›•–‡•ǡ —‡ǡ ‘ŽǤ ʹͳȋ͸Ȍ ͳ ǡ ͺͳʹȂ ͺʹ͸Ǥ
Dz ‘‘‹‰ —’ †ƒ–ƒ ‹ ʹ ›• – • ‡•ǡ dz ‘—‹ ƒ–‹‘•Ǥǡ ‹ ǡ ‡‰‹Ž  ƒ† ‹ƒ•Š‡‰ ȋʹͲͳͳȌ Dz ‘†‡Ž‹‰ ƒ†
‘ŽǤ Ͷ‘ǡ Ͷ ‘Ͷ
Ǥ ʹǡ Ͷ͵Ȃ ͶͺǤ ƒ ›Ž ‹• • ‘ˆ ”‡‡ ‹†‹‰ ‹ ‡‡”Ǧ –‘Ǧ ‡‡” –”‡ƒ‹‰ ›•–‡•dzǡ
ƒ„‡ ȋʹͲͲͷȌ Dz †‹•–”‹„—–‡† Šƒ•Š –ƒ„Ž‡ǡ dz ŠǤ Ǥ ”‘ ‡‡†‹‰• ‘ˆ –Š –‡”ƒ–‹‘ƒŽ ‘ˆ‡”‡ ‡ ‘
†‹••‡”–ƒ–‹‘ǡ ‘—‹ ƒ–‹‘• ƒ† ‡–™‘”‹‰ ‹ Š‹ƒ ȋ Ȍ
ƒ••ƒ Š—•‡––• •–  ‹–—–‡ ‘ˆ ‡ Š‘‘Ž ‰› ȋ Ȍ ǡ ƒ„”‹†‰‡ǡ ʹͲͳͳǡ —„Ž‹•Š‡† „› ‘’—–‡” ‘ ‹‡–›ǡ Ͳ ͺͶ Ȃ ͹ͺͶǤ
ǡ Ǥ ‘™•–”‘ ƒ† ”—• Š‡Ž ȋʹͲͲͳȌ Dz ƒ•–”›ǣ ƒŽƒ„Ž‡ǡ †‹•–”‹„—–‡†
ƒ ǡ —‹ ƒ† Š‹— ȋʹͲͲͻȌ Dz Š‡ ‡•‹‰ ”ƒ†‡Ǧ ˆˆ• ‘„Œ‡ – Ž‘ ƒ–‹‘ ƒ† ”‘—–‹‰ ˆ‘” Žƒ”‰‡Ǧ • ƒŽ‡ ’‡‡”Ǧ –‘Ǧ ’‡‡”
‘ˆ ‹– ‘””‡–Ǧ ‹‡ ‹Ž‡ Šƒ”‹‰ ”‘–‘ ‘Ž•dzǡ Ȁ •›•–‡•ǡ dz ‹ ”‘ Ǥ ͺͳ–Š Ȁ ‘ˆǤ ‹•–”‹„Ǥ ›•–Ǥ
”ƒ•ƒ –‹‘• ‘ ‡–™‘”‹‰ ǡ ‘Ž ‘ ǡ ‘Ǥ ʹǡ ͵͸ͷȂ ͵͹͸Ǥ ƒŽ –ˆ‘”• ȋ ‹††Ž‡™ƒ”‡Ȍ ǡ ‡‹†‡Ž„‡”‰ǡ ‡”ƒ›ǡ ͵ʹͻȂ ͵ͷͲǤ
‡Ž†ƒ  ǡ ƒ’ƒ†‹‹–”‹‘— ǡ Š—ƒ‰ ǡ ƒ† –‘‹ ƒ ȋʹͲͲ”Ȍ Dz ‡‡ Ǧ —ˆƒ‰ ƒ† ƒ‹ ȋʹͲͲ‘Ȍ Dz ™‡” ”—•–ǣ ‘„—•– ƒ† ƒŽƒ„Ž‡
‹†‹‰ ƒ† Š‹–‡™ƒ•Š‹‰ ‹ ‡‡”Ǧ –‘Ǧ ‡‡” ›•–‡•dzǡ ‡’—–ƒ–‹‘ ›•–‡ ˆ‘” ”—•–‡† ‡‡”Ǧ –‘Ǧ ‡‡” ‘’—–‹‰ǡ dz
‘—”ƒŽ ‘ ‡Ž‡ –‡† ”‡ƒ• ‹ ‘—‹ ƒ–‹‘•ǡ ‘ŽǤ ʹͶǡ ‘Ǥ ͷǡ ”ƒ•ƒ –‹‘• ‘ ƒ”ƒŽŽ‡Ž ‹•–”‹„—–‡† ›•–‡•ǡ ‘ŽǤ ͳͺǡ
ͳͲͳͲǦ ͳͲͳͻǤ •—‡ Ͷǡ ͶͲ ͸Ͳ Ͷ Ȃ Ͷ͹͵Ǥ
‡ ƒ† ƒ‘Šƒ”ƒ ȋʹͲͳͲȌ Dz ‹–‹‰ƒ–‹‰ ”‡‡Ǧ ‹†‹‰ ‘ ‹– ‘””‡– Š‡”ƒ ǡ ‹‡Š ƒ† –‡‹ ȋʹͲͳʹȌ Dz ƒ‹” ‘””‡–ǣ ‡ϐ‹ ‹–Ǧ
‡–™‘”•dzǡ ”‘ ‡‡†‹‰• ‘ˆ ‹ˆ–Š –  ‡”ƒ–‹‘ƒŽ ‘ˆ‡”‡ ‡ ƒ•‡† ‹•–”‹„—–‡† ‰ Ž ‘”‹–Š –‘ •—”‡ ƒ‹”‡• ‹ ‡‡”Ǧ
‘ ‹‰‹–ƒŽ ‡Ž‡ ‘—‹ ƒ–‹‘• ʹͲͳͲǡ —„Ž‹•Š‡† „› –‘Ǧ ‡‡” ›•–‡•dzǡ Ȁ ”ƒ•ƒ –‹‘• ‘ ‡–™‘”‹‰  ǡ
‘’—–‡” ‘ ‹‡–›ǡ ͷʹȂ ͷ͸Ǥ ‘ŽǤ ʹͲȋͷȌ ǡ ͳ͵͸ͳȂ ͳͳ Ͷ ͳ͵͹ͶǤ
‘•™ƒ‹ ǡ —’–ƒ ƒ† ƒ”ƒ•Šƒ”‹ ȋʹͲͳ‡Ȍ Dz ’—–ƒ–‹‘ Ǧ ƒ•‡† Š‡•ŠŒƒ˜ƒ‹ ǡ „ƒ”‹ ƒ† Šƒ‡‹‹ ȋʹ” Ȍ Dz ‡‡ Ǧ ”‹†‹‰
‡•‘—” ‡ Ž‘ ƒ–‹‘ ‹ ʹ ›•–‡•ǣ ƒ‡ Š‡‘”‡–‹ ‡•‹‹Ž ‡ ›  ‡–‹˜‡ ‡ Šƒ‹• ˆ‘” ‘ –”‡ƒ‹‰ ˜‡”
‡”•’‡ –‹˜‡dzǡ ‘—‹ ƒ–‹‘• ‡––‡”•ǡ ‘ŽǤ ʹǡͳ ‘Ǥ ͸ǡ ›„”‹† Ǧ ʹ ‡–™‘”•dzǡ ”‘ ‡‡†‹‰• ‘ˆ ͺ–Š –  ‡”ƒ–‹‘ƒŽ
ͳʹͳ͵Ȃ ͳʹ͹͸Ǥ ›’‘•‹— ‘ ‡Ž‡ ‘—‹ ƒ–‹‘• ȋ ǯ ʹͲͳ— Ȍ ǡ „Ž‹Š• ‡†
—’–ƒ ǡ ‡”ƒ ǡ ‹‰ƒ ǡ ‡‡”• ƒ† ƒ ‡‡•‡ ȋʹͲͲ͵Ȍ „› ‘’—–‡” ‘ ‹‡–›ǡ ͳ ͹͹ͳȂ ͹͹͸Ǥ
Dz ‡Ž‹’•ǣ —‹Ž†‹‰ ƒ ‡ˆϐ‹ ‹‡– ƒ† •–ƒ„Ž‡ ʹ –Š”‘—‰Š Š‹ ƒ† ƒ‹ ȋʹͲͲȌ Dz ‘˜‡Ž ‹ ‡–‹˜‡ ‡ Šƒ‹• ‹’”‘˜‹‰
‹ ”‡ƒ•‡† ‡‘”› ƒ† „ƒ ‰”‘—† ‘˜‡”Š‡ƒ†dzǡ ”‘ ‡‡†‹‰• ’‡‡”Ǧ –‘Ǧ ’‡‡” ‘Ǧ †‡ƒ† •–”‡ƒ‹‰ǡ dz ‹ ”‘ Ǥ ‘ˆ –‡”ƒ–‹‘ƒŽ
‘ˆ ʹ† –‡”ƒ–‹‘ƒŽ ‘”•Š‘’ ‘ ‡‡”Ǧ –‘Ǧ ‡‡” ›•–‡• ‘ˆǤ ‘ ‘—‹ ƒ–‹‘ǡ ‹” —‹–• ›•–Ǥǡ ‘ŽǤ ͳ ǡ —ǡ ͻͳȂ ͻͷǤ
ȋ Ͳ͵Ȍ Ǥ

1 1
A Survey over Mechanisms
Na for Reducing Free Riding

–‘‹ ƒ ǡ ‘””‹• ǡ ‘™‡ŽŽ ǡ ƒ”‰‡” ǡ ƒƒ•Š‘‡ ǡ ƒ„‡ ‹ƒ‘ ǡ Šƒ‰ ǡ Š‹ ƒ† ƒ‘ ȋʹͲͳʹȌ Dz ‘™ — Š –‘ Šƒ”‡ǣ
ƒ† ƒŽƒ”‹•Šƒ ȋʹͲͲ͵Ȍ Dz Š‘”†ǣ ƒ • ƒŽƒ„Ž‡ ’‡‡”Ǧ –‘Ǧ ‡’‡ƒ–‡† ƒ‡ ‘†‡Ž ˆ‘” ‡‡”Ǧ –‘Ǧ ‡‡” –”‡ƒ‹‰ —†‡”
’‡‡” Ž‘‘—’ ’”‘–‘ ‘Ž ˆ‘” ‹–‡”‡– ƒ’’Ž‹ ƒ–‹‘•dzǡ Ȁ ‡”˜‹ ‡ ‹ˆˆ‡”‡–‹ƒ–‹‘  ‡–‹˜‡•dzǡ ”ƒ•ƒ –‹‘ ‘
”ƒ•ƒ –‹‘• ‘ ‡–™‘”‹‰  ǡ ‘ŽǤ ͳͳǡ •—‡ ͳǡ ͳ͹Ȃ ͵ʹǤ ƒ”ƒŽŽ‡Ž ƒ† ‹•–”‹„—–‡† ›•–‡•ǡ ‘ŽǤ ʹ͵ǡ ‘Ǥ ʹǡ ʹͺͺȂ ʹͻͷǤ
›Ž˜‹ƒ ǡ ƒ—Ž ǡ ƒ” ǡ ‹ Šƒ”† ǡ ƒ† ‘–– ȋʹͲͲͳȌ Dz • ƒŽƒ„Ž‡ ƒ‰ ƒ† ‘Ž‹ƒ ȋʹͲͲ͵Ȍ Dz ƒ›ǣ ‹ ”‘’ƒ›‡–  • ˆ‘” ’‡‡”Ǧ –‘Ǧ
‘–‡– ƒ††”‡••ƒ„Ž‡ ‡–™‘”dzǡ ”‘ ‡‡†‹‰• ‘ˆ ʹͲͲͳ • ‡•ǡ dz ”‘ ‡‡†‹‰• ‘ˆ –Š‡ ͳͲ–Š
’‡‡” ›• – ‘ˆ‡”‡ ‡ ‘
‘ˆ‡”‡ ‡ ‘ ƒ’’Ž‹ ƒ–‹‘•ǡ ‡ Š‘Ž‘‰‹‡•ǡ ” Š‹–‡ –—”‡•ǡ ‘’—–‡” ƒ† ‘—‹ ƒ–‹‘• •‡ —”‹–›ǡ ƒ•Š‹‰–‘ Ǥ Ǥǡ
ƒ† ”‘–‘ ‘Ž• ˆ‘” ‘’—–‡” ‘—‹ ƒ–‹‘•ǡ ƒ ‹‡‰‘ǡ ǣ ǡ ͵ͲͲȂ ͵ͳͲǤ
ƒŽ‹ˆ‘”‹ƒǡ Ǥ Ǥǡ ͳͳͳ ͸ͳȂ ͳ͹ʹǤ
ƒ ƒ† ƒ”˜‹• ȋʹͲͲͺȌ Dz ’ƒ›‡–Ǧ „ƒ•‡† ‹ ‡–‹˜‡ ƒ† ƒ‰ ƒ† ‘— ȋʹͲͳ‘Ȍ Dz –”ƒ – Ǧ —Ž‡† ‘‘‹ ‘†‡Ž ˆ‘” ‘
•‡”˜‹ ‡ †‹ˆˆ‡”‡–‹ƒ–‹‘ • Š‡‡ ˆ‘” ’‡‡”Ǧ –‘Ǧ ’‡‡” •–”‡ƒ‹‰ —ƒ”ƒ–‡‡ ‹ ‘„‹Ž‡ ‡‡”Ǧ –‘Ǧ ‡‡” –”‡ƒ‹‰ ‡”˜‹ ‡•dzǡ
„”‘ƒ† ƒ•–ǡ dz ”ƒ•ƒ –‹‘• ‘ ƒ”ƒŽŽ‡Ž ‹•–”‹„—–‡† ”ƒ•ƒ –‹‘• ‘ ‘„‹Ž‡ ‘’—–‹‰ǡ ‘ŽǤ ͳͷǡ ‘Ǥ ͷǡ ͳͲͶ͹Ȃ
›•–‡•ǡ ‘ŽǤ ͳͻȋ͹ȌͶͲǡ ͻͶͲ ͷ Ȃ ͻͷ͵Ǥ ͳͲͳǤ
ƒ †‡” Šƒƒ” ǡ —”ƒ‰ƒ ƒ† ‘‘† ȋʹͲͲͺȌ Dz –‘ Šƒ•–‹ ƒ‰ ǡ Šƒ‰ ǡ ‹ ƒ† ƒ‹ ȋʹͲͲͷȌ Dz  ’ ‹”‹ ƒŽ –—†› ‘ˆ ”‡‡Ǧ
’–‹‹œƒ–‹‘ ˆ‘” ‘–‡– Šƒ”‹‰ ‹ ʹ ›•–‡•dzǡ ‹†‹‰ ‡Šƒ˜‹‘—” ‹ –Š‡ ƒœ‡ ʹ ‹Ž‡Ǧ Šƒ”‹‰ ›•–‡ǡ dz
”ƒ•ƒ –‹‘• ‘ —Ž–‹‡†‹ƒǡ ‘ŽǤ ͳͲǡ ‘Ǥ ͳǡ ͳ͵ʹȂ ͳͶͶǤ ‡‡”Ǧ –‘Ǧ ‡‡” ›•–‡• ǡ ͳͺʹȂ ͳͻʹǤ
‡ƒ†‡•Šƒ ƒ† Šƒ†”ƒ•‡ƒ” ȋʹͲͳˆȌ Dz ˆ‡ –‹˜‡
Šƒ‰ ǡ –‘‘’‘—Ž‘• ƒ† ƒŠ‘‘† ȋʹͲͲͻȌ Dz ‡˜‹‡™
‘—‹ ƒ–‹‘ ‹ ʹ ‡–™‘” „› –  ”‘†— ‹‰ Ȃ
‘ˆ  ‡–‹˜‡ ‡ Šƒ‹• ‹ ‡‡”Ǧ –‘Ǧ ‡‡” ›•–‡•dzǡ ‹”•–
‰Ž ‘”‹–Š•dzǡ ‹”‡Ž‡• ‡”•‘ƒŽ ‘—‹ ƒ–‹‘•ǡ ‘ŽǤ ͺ͹ȋ͵Ȍ ǡ
ͻʹ͵Ȃ ͻ͵͹Ǥ –  ‡”ƒ–‹‘ƒŽ ‘ˆ‡”‡ ‡ ‘ †˜ƒ ‡• ‹ ʹ ›•–‡•ǡ
ƒ‰ ǡ Š‘™ ƒ† ‘Ž—„ Š‹ ȋʹͲͳʹȌ Dz ʹ •–”‡ƒ‹‰ǣ •‡ ‘ˆ ‹Ž ‡ƒǡ ƒŽ–ƒǡ ͶͷȂ ͷͲǤ
ƒ†˜‡”–‹•‡‡ –  • ƒ• ‹ ‡–‹˜‡•ǡ dz ‹ ”‘ Ǥ ‘ˆ ͵”† ›•ǡ ͹͹Ȃ ͺʹǤ Šƒ‘ ǡ —„‹ƒ–‘™‹ œ ǡ ‘•‡’Š ƒ† ƒ”–Ž‡–– ȋʹͲͲͳȌ Dz ƒ’‡•–”›ǣ
— ǡ ‹ƒ‰ ǡ ‡ ƒ† ‡‹ ȋʹͲͳ͵Ȍ Dz ƒŽƒ ‹‰ ‡”ˆ‘”ƒ ‡ ƒ†  ‹ˆ”ƒǦ •–”— –—”‡ ˆ‘” ˆƒ—Ž–Ǧ ”‡•‹‹Ž ‡– ™‹†‡Ǧ ƒ”‡ƒ ‘Ž ƒ–‹‘ ƒ†
ƒ‹”‡• ‹ ʹ ‹˜‡ ‹†‡‘ ›•–‡•dzǡ ”ƒ•ƒ –‹‘• ‘ ”‘—–‹‰ǡ dz ‘’—–Ǥ ‹Ǥ ‹˜Ǥǡ ‹˜Ǥ ƒŽ‹ˆ‘”‹ƒǡ ‡”‡‡Ž ›ǡ ǡ
‹” —‹–• ƒ† ›•–‡• ˆ‘” ‹†‡‘ ‡ Š‘‘Ž ‰›ǡ ‘ŽǤ ʹ͵ȋ͸Ȍ ͳͲǡ ͳͲ ʹͻȂ ‡ ŠǤ ‡’Ǥ Ȁ Ǧ ͲͳǦ ͳͳͶͳǤ
ͳͲ͵ͻǤ

1 1