- By
**raina** - Follow User

- 121 Views
- Uploaded on

Download Presentation
## PowerPoint Slideshow about ' Topology Mapping' - raina

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

Outline

- Overview
- Solutions
- LTM
- ACE
- Problems and discussion
- Conclusion

Introduction

- Topology mapping
- Mismatch between overlay and physical infrastructure
- Topology optimization

Introduction

- Traffic problem
- Facts
- 95% of any pairs of Gnutella nodes are within 7 hops
- 50,000 nodes generate 1G/second, 330T/month
- Reasons
- Blind flooding
- Cycles, merge of multiple paths, neighbors exchange
- Topology problem
- Multiple times over a physical link

Topology Mismatch

- Problems
- Unnecessary traffic
- Inefficient utilization of bandwidth
- Only 2%~5% Gnutella connections link nodes within a single AS (autonomous system)
- More than 40% Gnutella nodes are located within top 10 AS
- Delayed response
- Do we need long-distance neighbors?

Topology Mismatch

- Solutions to traffic problem
- Selective flooding
- Topology optimization
- Avoid cycles
- Mapping

For each message, how many times it is delivered over a single physical link?

Performance Metrics

- Traffic cost
- Search scope
- Response time
- Overhead

Approaches

- Location-aware Topology Matching (LTM), INFOCOM 2004
- Adaptive Connection Establishment (ACE), ICDCS 2004

LTM

- Three main operations
- TTL-2-detector flooding
- Message format
- Short Source IP& timestamp
- Long Source IP& timestamp, TTL1 IP& timestamp
- d(i,S,v)
- Link cost

IP(S),T(S)

S

N1

N2

IP(S),T(S)

IP(N1),T(N1)

d(i,S,1)

d(i,S,0)

LTM

- Three main operations
- Low productive connection cutting
- Case1: P receives d(i,S,1) and d(i,S,0)

S

N

P

will-cut list

LTM

- Three main operations
- Low productive connection cutting
- Case3: P receives one d(i,S,1) and multiple d(i,S,0)

S

N1

N2

P

cut list

LTM

- Performance
- Traffic
- Search scope
- Overhead

ACE

- Step1:
- Probe link costs with neighbors
- Build neighbor cost table
- Exchange neighbors cost table with neighbors

ACE

- Depth of optimization (h-neighbor closure)

A

15

10

D

20

B

8

12

14

C

E

7

A->B=10

A->D=15

E->C=7

E->D=14

B->E=8

D->E=14

Total:68

Discussion

- Measurement
- Link cost is not accurate
- Link cutting and cycles
- Heuristic to theoretical support
- f (Pn,Tn)=?

Conclusion

- Importance
- Effectiveness vs. cost
- Future work

Download Presentation

Connecting to Server..