1. NUS.SOC.CS5248 Ooi Wei Tsang Course Matters

2. NUS.SOC.CS5248 Ooi Wei Tsang Deadlines 11 Oct: Survey Paper Due 18 Oct: Paper Reviews Due

3. NUS.SOC.CS5248 Ooi Wei Tsang Reminder No lecture next week Make-up lecture 23 rd October 2004, Saturday 1-3pm

4. NUS.SOC.CS5248 Ooi Wei Tsang Previously, on CS5248..

5. NUS.SOC.CS5248 Ooi Wei Tsang New Model: IP Multicast sender receivers

6. NUS.SOC.CS5248 Ooi Wei Tsang Multicast Router A B C S G

7. NUS.SOC.CS5248 Ooi Wei Tsang Multicast Router A B C S G G

8. NUS.SOC.CS5248 Ooi Wei Tsang Multicast Router A B C S G G

9. NUS.SOC.CS5248 Ooi Wei Tsang So, why can’t we multicast? Who assign multicast address? Who pay for multicast traffic? How to inter-operate between protocols? How can we prevent DoS?

10. NUS.SOC.CS5248 Ooi Wei Tsang Application-Level Multicast

11. NUS.SOC.CS5248 Ooi Wei Tsang You are Here Network Encoder Sender Middlebox Receiver Decoder

12. NUS.SOC.CS5248 Ooi Wei Tsang Application-Level Multicast Router A B C S A

13. NUS.SOC.CS5248 Ooi Wei Tsang Application-Level Multicast Router A B C S C B

14. NUS.SOC.CS5248 Ooi Wei Tsang Overlay Network S A BC

15. NUS.SOC.CS5248 Ooi Wei Tsang Penalty: Delay Router A B C S

16. NUS.SOC.CS5248 Ooi Wei Tsang Penalty: Network Resource Router A B C S

17. NUS.SOC.CS5248 Ooi Wei Tsang Link Stress Router A B C S

18. NUS.SOC.CS5248 Ooi Wei Tsang Questions How to construct overlay multicast tree? How to maintain overlay multicast tree?

19. NUS.SOC.CS5248 Ooi Wei Tsang A Case for End-System Multicast Y. Chu, S. Rao, S. Seshan, H. Zhang JSAC 2002

20. NUS.SOC.CS5248 Ooi Wei Tsang Narada’s Idea Build a mesh, then build a tree S A BC S A BC

21. NUS.SOC.CS5248 Ooi Wei Tsang Why Build Mesh?

22. NUS.SOC.CS5248 Ooi Wei Tsang Desirable Property of Mesh Path between any two nodes must be “good” Cannot be too sparse or too dense

23. NUS.SOC.CS5248 Ooi Wei Tsang How to build Mesh? Node join Randomly choose some existing members as neighbour S A BC

24. NUS.SOC.CS5248 Ooi Wei Tsang How to maintain Mesh? Everybody knows everybody Each node maintains a table AddressLast Seq NoLast Update 151210:00am 260310:03am 334110:02am 470409:59am

25. NUS.SOC.CS5248 Ooi Wei Tsang How to update table? Refresh messages Exchange of tables

26. NUS.SOC.CS5248 Ooi Wei Tsang How to maintain Mesh? Node failure Probes if no refresh messages for a while S A BC

27. NUS.SOC.CS5248 Ooi Wei Tsang How to maintain Mesh? Mesh Partition Probes if no refresh messages for a while, add random edges if alive S A BC

28. NUS.SOC.CS5248 Ooi Wei Tsang How to Optimize Mesh? Mesh needs to periodically updated because: nodes join and leave network condition changes partition repair add unneeded edges initial constructions are random

29. NUS.SOC.CS5248 Ooi Wei Tsang Adding a Link Node i periodically probe randomly selected members j Ask “what if I add (i,j)?”

30. NUS.SOC.CS5248 Ooi Wei Tsang Adding a Link S A BC S A BC

31. NUS.SOC.CS5248 Ooi Wei Tsang Removing a Link Harder to ask “what if I remove link (i,j)?” compute cost(i,j) instead: number of nodes for which i uses j as next hop

32. NUS.SOC.CS5248 Ooi Wei Tsang cost(i,j) S A BC cost(S,A) = 2

33. NUS.SOC.CS5248 Ooi Wei Tsang cost(i,j) S A BC cost(S,A) = 3 cost(A,S) = 1 D E

34. NUS.SOC.CS5248 Ooi Wei Tsang Removing a link if max(cost(i,j), cost(j,i)) < Threshold drop (i,j) (Threshold should depends on group size)

35. NUS.SOC.CS5248 Ooi Wei Tsang Narada’s Idea Build a mesh, then build a tree S A BC S A BC

36. NUS.SOC.CS5248 Ooi Wei Tsang How to build tree? Modify DVMRP Cost definition Pick widest path Break ties by latency

37. NUS.SOC.CS5248 Ooi Wei Tsang Evaluation: Bandwidth

38. NUS.SOC.CS5248 Ooi Wei Tsang Evaluation: RTT

39. NUS.SOC.CS5248 Ooi Wei Tsang Evaluation: Link Stress

40. NUS.SOC.CS5248 Ooi Wei Tsang Evaluation: Resource Usage

41. NUS.SOC.CS5248 Ooi Wei Tsang Scalable Application Layer Multicast S. Banerjee, B. Bhattacharjee, and C. Kommareddy SIGCOMM 2002

42. NUS.SOC.CS5248 Ooi Wei Tsang Problem Narada does not scale State maintenance Message overhead

43. NUS.SOC.CS5248 Ooi Wei Tsang NICE NICE is scalable State maintenance Message overhead

44. NUS.SOC.CS5248 Ooi Wei Tsang Members

45. NUS.SOC.CS5248 Ooi Wei Tsang Clusters

46. NUS.SOC.CS5248 Ooi Wei Tsang Leader

47. NUS.SOC.CS5248 Ooi Wei Tsang Layer

48. NUS.SOC.CS5248 Ooi Wei Tsang Nodes per Cluster [k, 3k-1]

49. NUS.SOC.CS5248 Ooi Wei Tsang Control Topology

50. NUS.SOC.CS5248 Ooi Wei Tsang Multicast Tree

51. NUS.SOC.CS5248 Ooi Wei Tsang Analysis height =

52. NUS.SOC.CS5248 Ooi Wei Tsang Analysis Control Message Overhead =

53. NUS.SOC.CS5248 Ooi Wei Tsang Analysis Worst Case Control Message Overhead = Average Case Control Message Overhead =

54. NUS.SOC.CS5248 Ooi Wei Tsang Analysis Number of hops between 2 nodes =

55. NUS.SOC.CS5248 Ooi Wei Tsang Analysis Maximum Degree of a Node =

56. NUS.SOC.CS5248 Ooi Wei Tsang Multicast Tree (Improved)

57. NUS.SOC.CS5248 Ooi Wei Tsang Node Join

58. NUS.SOC.CS5248 Ooi Wei Tsang Other operations Node leave Node failure Cluster merge/split

59. NUS.SOC.CS5248 Ooi Wei Tsang Evaluation: Control Overhead

60. NUS.SOC.CS5248 Ooi Wei Tsang Evaluation: Link Stress

61. NUS.SOC.CS5248 Ooi Wei Tsang Evaluation: Path Length

62. NUS.SOC.CS5248 Ooi Wei Tsang Previously, on CS5248..

63. NUS.SOC.CS5248 Ooi Wei Tsang Patching Time Client Request mcast unicast

64. NUS.SOC.CS5248 Ooi Wei Tsang Patching (Attempt 2) S Network

65. NUS.SOC.CS5248 Ooi Wei Tsang Patching (Attempt 2) S Network

66. NUS.SOC.CS5248 Ooi Wei Tsang Patching (Attempt 2) S Network

67. NUS.SOC.CS5248 Ooi Wei Tsang Patching (Attempt 2) S Network

68. NUS.SOC.CS5248 Ooi Wei Tsang Patching (Attempt 2) S Network

69. NUS.SOC.CS5248 Ooi Wei Tsang Patching (Attempt 2) S Network

70. NUS.SOC.CS5248 Ooi Wei Tsang Patching (Attempt 2) S Network

71. NUS.SOC.CS5248 Ooi Wei Tsang Patching (Attempt 2) S Network

72. NUS.SOC.CS5248 Ooi Wei Tsang Patching with Cache Proxy S Network

73. NUS.SOC.CS5248 Ooi Wei Tsang Patching with Cache Proxy S Network

74. NUS.SOC.CS5248 Ooi Wei Tsang P 2 Cast: P2P Patching Scheme for VoD Y. Guo, K. Suh, J. Kurose, D. Towsley WWW 2003

75. NUS.SOC.CS5248 Ooi Wei Tsang ALM with Patching

76. NUS.SOC.CS5248 Ooi Wei Tsang P2Cast

77. NUS.SOC.CS5248 Ooi Wei Tsang New Session

78. NUS.SOC.CS5248 Ooi Wei Tsang Existing Session + Patch ? ?

79. NUS.SOC.CS5248 Ooi Wei Tsang Node Join join

80. NUS.SOC.CS5248 Ooi Wei Tsang Node Join (measure B)

81. NUS.SOC.CS5248 Ooi Wei Tsang Node Join

82. NUS.SOC.CS5248 Ooi Wei Tsang Failure Recovery X

83. NUS.SOC.CS5248 Ooi Wei Tsang Failure Recovery What if Patch server failed? Base server failed?