Erasure Coding for Cloud Communication and Storage
|
|
|
- Merilyn Shields
- 7 years ago
- Views:
Transcription
1 Erasure Coding for Cloud Communication and Storage Cheng Huang, Jin Li Microsoft Research Tutorial at IEEE ICC (June, 2014) 1
2 Tutorial at IEEE ICC (June, 2014) 2
3 Tutorial at IEEE ICC (June, 2014) 3
4 Erasure Coding has become a key technology piece in realizing the vision focusing on improving network performance and reducing cloud storage cost Tutorial at IEEE ICC (June, 2014) 4
5 Tutorial at IEEE ICC (June, 2014) 5
6 Tutorial at IEEE ICC (June, 2014) 6
7 Erasure Coding 101 Tutorial at IEEE ICC (June, 2014) 7
8 Tutorial at IEEE ICC (June, 2014) 8
9 encoding decoding Tutorial at IEEE ICC (June, 2014) 9
10 Tutorial at IEEE ICC (June, 2014) 10
11 replication a=2 a=2 b=3 b=3 a=2 b=3 Tutorial at IEEE ICC (June, 2014) 11
12 simple parity a=2 a=2 b=3 b=3 a+b=5 Tutorial at IEEE ICC (June, 2014) 12
13 Tutorial at IEEE ICC (June, 2014) 13
14 n = 4 k = 2 a=2 a=2 b=3 b=3 a b a 2b Tutorial at IEEE ICC (June, 2014) 14
15 a=2 X a=? a=2 b=3 b=? a=2 b=3 a b=1 a b=1 b=3 a 2xb=3 a 2xb=3 Tutorial at IEEE ICC (June, 2014) 15
16 a a b a b b a b a 2xb is Tutorial at IEEE ICC (June, 2014) 16
17 X X Tutorial at IEEE ICC (June, 2014) 17
18 Erasure Coding has been around for decades, the purpose of this tutorial is to cover innovative designs and applications of erasure coding in recent years to address needs from new application scenarios Tutorial at IEEE ICC (June, 2014) 18
19 Erasure Coding in Cloud-Based Social Gaming Tutorial at IEEE ICC (June, 2014) 19
20 How to ensure universally smooth gaming experience? Improving the tail! Tutorial at IEEE ICC (June, 2014) 20
21 Tutorial at IEEE ICC (June, 2014) 21
22 Tutorial at IEEE ICC (June, 2014) 22
23 interaction gap Tutorial at IEEE ICC (June, 2014) 23
24 Many messages arriving late Tutorial at IEEE ICC (June, 2014) 24
25 Latency (ms) US/CAN & Europe only Imagine what s next open to all markets launch on mobile 0 Tutorial at IEEE ICC (June, 2014) 95% 99% 99.9% 25
26 Tutorial at IEEE ICC (June, 2014) 26
27 Tutorial at IEEE ICC (June, 2014) 27
28 Tutorial at IEEE ICC (June, 2014) 28
29 4 S:6 S:6 R:0 R 4 R:2 3 R:0 2 2 S:4 R:1 1 R 2 1 S:3 0 0 S:2 S:2 R:0 R S:5 S:4 4 R: S: S:3 R:0 R:1 R S:1 0 0 Tutorial at IEEE ICC (June, 2014) 0 RTT 2RTT 3RTT 29
30 4 S:6 S:6 R:0 R 4 R:2 3 R:0 2 2 S:4 R:1 1 R 2 1 S:3 0 0 S:2 S:2 R:0 R S:5 S:4 4 R: S: S:3 R:0 R:1 R S:1 0 0 Tutorial at IEEE ICC (June, 2014) 0 RTT 2RTT 3RTT 30
31 4 S:6 S:6 R:0 R 4 R:2 3 R:0 2 2 S:4 R:1 1 R 2 1 S:3 0 0 S:2 S:2 R:0 R S:5 S:4 4 R: S: S:3 R:0 R:1 R S:1 0 0 Tutorial at IEEE ICC (June, 2014) 0 RTT 2RTT 3RTT 31
32 4 S:6 S:6 R:0 R 4 R:2 3 R:0 2 2 S:4 R:1 1 R 2 1 S:3 0 0 S:2 S:2 R:0 R S:5 S:4 4 R: S: S:3 R:0 R:1 R S:1 0 0 Tutorial at IEEE ICC (June, 2014) 0 RTT 2RTT 3RTT 32
33 4 S:6 S:6 R:0 R 4 R:2 3 R:0 2 2 S:4 R:1 1 R 2 1 S:3 0 0 S:2 S:2 R:0 R S:5 S:4 4 R: S: S:3 R:0 R:1 R S:1 0 0 Tutorial at IEEE ICC (June, 2014) 0 RTT 2RTT 3RTT 33
34 4 S:6 S:6 R:0 R 4 R:2 3 R:0 2 2 S:4 R:1 1 R 2 1 S:3 0 0 S:2 S:2 R:0 R S:5 S:4 4 R: S: S:3 R:0 R:1 R S:1 0 0 Tutorial at IEEE ICC (June, 2014) 0 RTT 2RTT 3RTT 34
35 4 S:6 S:6 R:0 R 4 R:2 3 R:0 2 2 S:4 R:1 1 R 2 1 S:3 0 0 S:2 S:2 R:0 R S:5 S:4 4 R: S: S:3 R:0 R:1 R S:1 0 0 Tutorial at IEEE ICC (June, 2014) 0 RTT 2RTT 3RTT 35
36 4 S:6 S:6 R:0 R 4 R:2 3 R:0 2 2 S:4 R:1 1 R 2 1 S:3 0 0 S:2 S:2 R:0 R S:5 S:4 4 R: S: S:3 R:0 R:1 R S:1 0 0 Tutorial at IEEE ICC (June, 2014) 0 RTT 2RTT 3RTT 36
37 Tutorial at IEEE ICC (June, 2014) 37
38 Tutorial at IEEE ICC (June, 2014) 38
39 Tutorial at IEEE ICC (June, 2014) 39
40 Tutorial at IEEE ICC (June, 2014) 40
41 Latency (ms) TCP Pangolin 95% 99% 99.9% 60% Pangolin overhead only 6.1%! Tutorial at IEEE ICC (June, 2014) 41
42
43
44 Latency Packet Loss Limited bandwidth End to end delay/ping (e.g. 100ms) Burst or Random E.g. <2 Mbps vs 100Mbps for LAN
45 Effect of Packet Loss on Real-Time Multimedia Communication Transmission error Time Reconstructed video frame subjected to packet loss
46 RemoteFX for WAN Application Rate Control Transport Protocol Congestion Control Network Feedback Application Original Packets Coded Packets Transmission Strategy Coded Packets Key components Estimate channel condition (packet loss prob), and use a cost function, determine whether to send: i) Original, ii) FEC or iii) Resent packet Use random linear code (network coding) to mix packets
47 Design Goal 66 Minimize sequential decodability delay Time when packet is sent to the time that packet and all previous packets available Good indicator for user perceived performance A B C x Delay for B is much larger because of retransmission Resend B Delay for C is larger than simply propagation delay because of waiting for B
48 Delay 67 Sequential decodability delay function of Probability of sequential decodability which is function of Channel loss characteristics increases with network congestion Transmission strategy - which packets have been sent original/fec coding structure of FEC packets delay caused by coding structure as well as retransmissions Propagation delay Network queuing delay increases with network congestion
49 How to Minimize Delay Loss Prevention and Loss Mitigation 1. Don t cause self-induced congestion minimizes packet loss and minimizes network queuing delay 2. Use flow control strategy that does not induce loss e.g. TCP enters congestion avoidance phase only when it encounters loss once loss has already happened, you suffer 3. Maximize transmission rate aggressive ramp up and state remembering after burst Use FEC to proactively correct any remaining losses
50 Components of Sequential Decodability Delay 69 Expected value of delay for packet l Propagation + Network queuing delay Time it takes packet to reach from sender to receiver Probability of sequential decodability of packet l based upon transmitted packets up to k Time between transmission opportunities 1/transmission rate
51 Minimizing Components of Sequential Decodability Delay 70 Preventing self induced congestion minimizes this term minimizes network queuing delay Minimizing loss minimizes this term done by Using wise coding strategy Backing off on rate increase prior to loss Minimize this term by maximizing transmission rate Quick ramp up State remembering for initial point
52 Packet Encoding Strategy 71 Assume these terms constant flow/congestion control s job to minimize also assume congestion based loss at minimum Term to minimize over all packets being considered for practical reasons, only consider those currently in sender s queue By considering all packets currently in queue, balance Gain of packets already sent by sending FEC with Delaying original packets waiting in queue Have fast algorithm to determine probability given particular coding structure and probability of loss
53 Erasure Coding in P2P Multiparty Conferencing
54 Multi-party Conferencing Scenario Every user wants to view audio/video from all other users and is a source of its own audio/video stream Maximize Quality-of-Experience (QoE) Challenges Network bandwidth limited Require low end-to-end delay Network conditions time-varying Distributed solution not requiring global network knowledge Existing audio/video conferencing products B A C B A D C Apple ichat AV,,, Halo, TelePresence, Windows Live Messenger
55 Comparison of Distribution Approaches MCU-assisted multicast Simulcast Peer-assisted multicast A A A MCU B C B C B C High load on MCU, expensive, not scalable with increasing number of peers or groups Halo As group size and heterogeneity increases, video quality deteriorates due to peer uplink bandwidth constraint Apple ichat AV Optimal utilization of each peer s uplink bandwidth, no MCU required but can assist as helper
56 Celebrity (A P2P Multiparty Conferencing with Network Coding) Objectives Stringent end-to-end delay requirement <200ms Unknown network topology Limited and unknown network bandwidth Time-varying network conditions
57 Celebrity : Overview Data multicast via a hybrid tree and mixing solution Source sends one copy of content via low-delay spanning trees Can explore all depth-1 and depth-2 trees Each node outputs a mixture/network coded packets on each link at certain rate Redundancy provided by network coding Distributed link rate adaptation that collectively maximized delay-limited capacities of the sessions Critical session and links get more resource Approach 1: driven by session and link innovation measurement Approach 2: driven by link states and critical cut computation Respond to link congestion signals (loss and delay) Similar to TCP, TFRC, DCCP
58 Hybrid Tree + Coding Approach Distribution trees +: Propagation delay known from the tree structures -: Update of the trees need to be done centrally How to deal with packet loss? How to find a good set of trees? Network coding +: information will find their ways to the sinks built-in resilience to packet losses +: Update of the link rates can potentially be done distributedly How to reduce the decoding delay? How to provide delay guarantee? Hybrid tree + coding approach Best of both worlds. (Tree packets are always sent immediately)
59 Network Coding
60 Experimental Results
61 Erasure Coding in Video Streaming Tutorial at IEEE ICC (June, 2014) 80
62 Tutorial at IEEE ICC (June, 2014) 81
63 ? Tutorial at IEEE ICC (June, 2014) 82
64 coding in network Tutorial at IEEE ICC (June, 2014) 83
65 Peer Peer Peer Peer Peer Peer Peer Peer Peer Peer Peer Peer Peer Peer Tutorial at IEEE ICC (June, 2014) 84
66 Advanced Applications Video Streaming Streaming VOIP Skype Basic Applications Downloading File Sharing Napster BitTorrent Tutorial at IEEE ICC (June, 2014) time 85
67 Tutorial at IEEE ICC (June, 2014) 86
68 a b a b b c c c a Tutorial at IEEE ICC (June, 2014) 87
69 chunks chunks Tutorial at IEEE ICC (June, 2014) 88
70 Segment: 4 seconds, 180KB Block: 1KB, 180 blocks/segment 350 kbps video delivered segments priority region outside priority Tutorial at IEEE ICC (June, 2014) 89
71 Tutorial at IEEE ICC (June, 2014) 90
72 Tutorial at IEEE ICC (June, 2014) 91
73 Tutorial at IEEE ICC (June, 2014) 92
74 Tutorial at IEEE ICC (June, 2014) 93
75 Erasure Coding in Cloud Storage Tutorial at IEEE ICC (June, 2014) 94
76 Performance good perf, minimize cost Storage Cost Reliability Tutorial at IEEE ICC (June, 2014) 95
77 replication a=2 Reed-Solomon coding a=2 a=2 b=3 b=3 b=3 a=2 a=2 reconstruction a b b=3 storage 2x 1.5x reconstruction 1 2 Tutorial at IEEE ICC (June, 2014) 96
78 permanent failure temporary unavailability (90+%) hot storage nodes rolling update a=2 reconstruction Reed-Solomon coding a=2 b=3 a+b reconstruction on critical path and frequent enough storage 2x 1.5x reconstruction 1 2 Tutorial at IEEE ICC (June, 2014) 97
79 high reconstruction cost inevitable price for erasure coding Tutorial at IEEE ICC (June, 2014) 98
80 reconstruction cost Reed-Solomon codes replication storage overhead Tutorial at IEEE ICC (June, 2014) 99
81 Pyramid Codes Tutorial at IEEE ICC (June, 2014) 100
82 reconstruction cost: 12 data nodes d1 d2... d6 d7... d11 d12 12 parity nodes C1 C2 C3 3 Reed-Solomon Tutorial at IEEE ICC (June, 2014) 101
83 data nodes d1 d2... d6 d7... d11 d12 12 parity nodes C1 C2 C3 3 Pyramid Codes Construction: take an arbitrary Reed- Solomon (RS) code C 1,1 C 1,2 split one RS parity into multiple local parities RS Pyramid Tutorial at IEEE ICC (June, 2014) 102
84 reconstruction cost: 6 d1 d2 d3 d4 d5 d6 C 1,1 d7 d8 d9 d10 d11 d12 C 1,2 C2 C3 Tutorial at IEEE ICC (June, 2014) 103
85 d1 d2 d3 d4 d5 d6 C 1,1 d7 d8 d9 d10 d11 d12 C 1,2 C2 C3 CASE I: recover d 5 from c 1,1 recover d 8 and d 12 from c 2 and c 3 Tutorial at IEEE ICC (June, 2014) 104
86 d1 d2 d3 d4 d5 d6 C 1,1 d7 d8 d9 d10 d11 d12 C1,2 C1 C2 C3 CASE II: combine C1,1 and C1,2 C 1 convert Pyramid code back to RS code recover the 3 failures (d 8, d 11 and d 12 ) in the RS code Tutorial at IEEE ICC (June, 2014) 105
87 C1 C2 d1 d2 d3 d4 d5 d6 d7 d8 d9 d10 d11 d12 C3 reconstruction cost of d 1 3 Tutorial at IEEE ICC (June, 2014) 106
88 C1 C2 d1 d2 d3 d4 d5 d6 d7 d8 d9 d10 d11 d12 C3 reconstruction cost of d 1 and d 2 6 Tutorial at IEEE ICC (June, 2014) 107
89 C1 C2 d1 d2 d3 d4 d5 d6 d7 d8 d9 d10 d11 d12 C3 decoding analogous to climbing up Pyramid Tutorial at IEEE ICC (June, 2014) 108
90 reconstruction cost Reed-Solomon codes Pyramid Codes replication storage overhead Tutorial at IEEE ICC (June, 2014) 109
91 Maximal Recoverability Tutorial at IEEE ICC (June, 2014) 110
92 d1 d2 d3 d4 d5 d6 C 1,1 d7 d8 d9 d10 d11 d12 C 1,2 C2 C3 Tutorial at IEEE ICC (June, 2014) 111
93 Decoding Tanner graph Left: failed data nodes Right: survival parity nodes d1 d2 d3 d4 d5 d6 C1,1 d5 C 1,1 d7 d8 d9 d10 d11 d12 C1,2 d6 C 1,2 C2 C3 d8 C2 Recoverability Theorem: recoverable full matching d12 C3 decoding Tanner graph contains full matching Tutorial at IEEE ICC (June, 2014) 112
94 d1 C1,1 d2 d1 d2 d3 d4 d5 d6 C1,1 C1,2 d7 d8 d9 d10 d11 d12 C1,2 C2 C3 d5 C3 d6 C4 decoding Tanner graph contains no full matching Tutorial at IEEE ICC (June, 2014) 113
95 First class of MR codes MR codes in cloud deployment (Windows Azure Storage) Tutorial at IEEE ICC (June, 2014) 114
96 LRC in Windows Azure Storage Tutorial at IEEE ICC (June, 2014) 115
97 sealed extent ( 3 GB ) sealed extent ( 3 GB ) sealed extent ( 3 GB ) p 1 d 0 d 1 d 2 d 3 d 4 d 5 p 2 Reed-Solomon storage overhead 3x 1.5x reconstruction cost 6 used in Google GFS II (as of 2012) Tutorial at IEEE ICC (June, 2014) 116 p 3
98 sealed extent ( 3 GB ) overhead (6+3)/6 = 1.5x d 0 d 1 d 2 d 3 d 4 d 5 p 0 p 1 p 2 Tutorial at IEEE ICC (June, 2014) 117
99 sealed extent ( 3 GB ) overhead (6+3)/6 = 1.5x d 0 d 1 d 2 d 3 d 4 d 5 p 0 p 1 p 2 (12+4)/12 = 1.33x d 0 d 1 d 2 d 3 d 4 d 5 d 6 d 7 d 8 d 9 d 10 d 11 p 0 p 1 p 2 p 3 Tutorial at IEEE ICC (June, 2014) 118
100 p 0 d 0 d 1 d 2 d 3 d 4 d 5 d 6 d 7 d 8 d 9 d 10 d 11 p 1 reconstruction twice more expensive requiring 12 fragments (12 disk I/Os, 12 net transfers) p 2 p 3 Tutorial at IEEE ICC (June, 2014) 119
101 Conventional Reed-Solomon Coding Storage Overhead Reconstruction Cost sealed extent ( 3 GB ) d 0 d 1 d 2 d 3 d 4 d 5 p 1 p 2 p 3 1.5x 6 reads LRC sealed extent ( 3 GB ) p 1 d 0 d 1 d 2 d 3 d 4 d 5 d 6 d 7 d 8 d 9 d 10 d 11 p 2 p x 12 reads p 4 Tutorial at IEEE ICC (June, 2014) 120
102 sealed extent ( 3 GB ) x 0 x 1 x 2 x 3 x 4 x 5 y 0 y 1 y 2 y 3 y 4 y 5 LRC : 12 data fragments, 2 local parities and 2 global parities storage overhead: ( ) / 12 = 1.33x Local parity: reconstruction requires only 6 fragments Tutorial at IEEE ICC (June, 2014) 121
103 LRC : reliability: RS 12+4 > LRC > RS 6+3 Tutorial at IEEE ICC (June, 2014) 122
104 Tutorial at IEEE ICC (June, 2014) 123
105 Reconstruction Read Cost RS RS 10+4 same cost 1.5x 1.33x RS 6+3 Reed-Solomon LRC same overhead half cost (6 3) LRC (12+2+2) 4 LRC (12+4+2) Tutorial at IEEE ICC (June, 2014) Storage Overhead RS 10+4 : HDFS-RAID at Facebook RS 6+3 : GFS II (Colossus) at Google 124
106 RS (6 + 3) reconstruction cost = 6 RS (14 + 4) reconstruction cost = 14 LRC ( ) reconstruction cost = 7 14% savings Tutorial at IEEE ICC (June, 2014) millions of $ savings! 125
107 LRC in Hadoop Tutorial at IEEE ICC (June, 2014) 126
108 8% cold x 0 x 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 p 0 p 1 p 2 p Reed-Solomon single failure reconstruction requires 10 fragments (10 disk I/Os, 10 net transfers) Tutorial at IEEE ICC (June, 2014) 127
109 x 0 x 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 p 0 p 1 p 2 p 3 c 0 c 1 c 2 c 3 c 5 c 5 c 6 c 7 c 8 c9 c 0 c 1 c 2 c 3 s 0 local parity s 1 local parity s 2 implied parity Tutorial at IEEE ICC (June, 2014) add 2 local parities to existing RS code choose c i carefully so that implied parity can be derived 4 global parities and 2 local parities sum to zero single failure of any chunk can be reconstructed by 5 fragments 14% extra storage for 50% savings in reconstruction 128
110 LRC in Hierarchical Storage Tutorial at IEEE ICC (June, 2014) 129
111 Note: no need to tolerate 2 JBOD failures Tutorial at IEEE ICC (June, 2014) 130
112 New erasure codes designed targeting multi-level durability requirements can reduce storage space Tutorial at IEEE ICC (June, 2014) 131
113 JBOD enclosure local parity global parity x 1 x 2 x 3 x 4 p x y 1 y 2 y 3 y 4 p y q z 1 z 2 z 3 z 4 p z storage overhead: 1.33x (LRC ) < 1.5x (RAID6 4+2 ) But, does LRC indeed tolerate failures of 1 JBOD + 1 HDD? Tutorial at IEEE ICC (June, 2014) 132
114 JBOD enclosure local parity global parity x 1 x 2 x 3 x 4 p x y 1 y 2 y 3 y 4 p y q z 1 z 2 z 3 z 4 p z y 3 and z 3 are reconstructed using local parity p y and p z x 3 and x 4 are then reconstructed using p x and global parity q Shipped in Windows Server 2012 R2 and Windows 8.1 Tutorial at IEEE ICC (June, 2014) 133
115 PMDS and SD Codes Tutorial at IEEE ICC (June, 2014) 134
116 m = 4 n = 7 d 0 d 1 d 2 d 3 d 4 d 5 p 0 d 6 d 7 d 8 d 9 d 10 d 11 d 12 d 13 d 14 d 15 d 16 d 17 d 18 d 19 d 20 d 21 qy 40 qy 51 p 1 p 2 p 3 s = 2 r = 1 PMDS Codes m rows, n columns n drives, m x n sectors r row parities in each row s global parities tolerate r failures per row and s additional failures anywhere Tutorial at IEEE ICC (June, 2014) 135
117 n = 7 m = 4 d 0 d 1 d 2 d 3 d 4 d 5 p 0 d 6 d 7 d 8 d 9 d 10 d 11 d 12 d 13 d 14 d 15 d 16 d 17 p 1 p 2 recoverable case I r = 1 drive (column) failure s = 2 additional sector failures anywhere d 18 d 19 d 20 d 21 qy 40 qy 51 p 3 s = 2 r = 1 Tutorial at IEEE ICC (June, 2014) 136
118 n = 7 m = 4 d 0 d 1 d 2 d 3 d 4 d 5 p 0 d 6 d 7 d 8 d 9 d 10 d 11 d 12 d 13 d 14 d 15 d 16 d 17 p 1 p 2 recoverable case II r = 1 failures per row s = 2 additional failures anywhere d 18 d 19 d 20 d 21 qy 40 qy 51 p 3 s = 2 r = 1 Tutorial at IEEE ICC (June, 2014) 137
119 n = 7 d 0 d 1 d 2 d 3 d 4 d 5 p 0 recoverable case II m = 4 d 6 d 7 d 8 d 9 d 10 d 11 d 12 d 13 d 14 d 15 d 16 d 17 d 18 d 19 d 20 d 21 qy 40 qy 51 p 1 p 2 p 3 d 11 and d 19 recoverable from their row parities 4 parities for the remaining 4 failures similar to LRC s = 2 r = 1 Tutorial at IEEE ICC (June, 2014) PMDS codes are Maximally Recoverable (MR) codes 138
120 case I case II What if restricting to only case I? r Tutorial at IEEE ICC (June, 2014) s 139
121 m = 4 n = 7 d 0 d 1 d 2 d 3 d 4 d 5 p 0 d 6 d 7 d 8 d 9 d 10 d 11 d 12 d 13 d 14 d 15 d 16 d 17 d 18 d 19 d 20 d 21 qy 40 qy 51 p 1 p 2 p 3 s = 2 r = 1 SD Codes m rows, n columns n drives, m x n sectors r row parities in each row s global parities tolerate r column failures and s additional failures anywhere Tutorial at IEEE ICC (June, 2014) 140
122 case I case II SD codes handle case I, but not case II There are many constructions which are valid as SD codes, but not PMDS codes. Tutorial at IEEE ICC (June, 2014) 141
123 Efficient Repair of MDS Codes Tutorial at IEEE ICC (June, 2014) 142
124 a 1 b 1 a 1 b 1 a 1 b 2 a 2 b 2 a 2 b 2 a 2 b 1 b 2 Tutorial at IEEE ICC (June, 2014) 143
125 a 1 b 1 a 1 b 1 a 1 b 2 a 2 b 2 a 2 b 2 a 2 b 1 b 2 Tutorial at IEEE ICC (June, 2014) 144
126 a 1 b 1 a 1 b 1 a 1 b 2 a 2 b 2 a 2 b 2 a 2 b 1 b 2 Tutorial at IEEE ICC (June, 2014) 145
127 Tutorial at IEEE ICC (June, 2014) 146
128 Efficient Repair of Existing Codes Tutorial at IEEE ICC (June, 2014) 147
129 Tutorial at IEEE ICC (June, 2014) 148
130 Tutorial at IEEE ICC (June, 2014) 149
131 Tutorial at IEEE ICC (June, 2014) 150
132 Tutorial at IEEE ICC (June, 2014) 151
133 ~20+% savings in general Tutorial at IEEE ICC (June, 2014) 152
134 Theoretical Bound on Efficient Repair Tutorial at IEEE ICC (June, 2014) 153
135 Efficient repair: 1.83x 69% savings! Tutorial at IEEE ICC (June, 2014) 154
136 Single Failure Repair of MDS Code Reed-Solomon Coding Regenerating Coding # of nodes participating in repair 6 11 # of network transfers 6x 1.83x # of disk I/Os 6x up to 11x Tutorial at IEEE ICC (June, 2014) 155
137 network transfer: 3 (optimal), disk I/O: 4 (no saving) a 1 b 1 a 1 b 1 a 1 b 2 a 2 b 2 a 2 b 2 a 2 b 1 b 2 XOR before transmitting b 2 a 1 b 1 a 2 b 2 a 1 a 1 b 2 a 2 b 1 b 2 Regenerating Codes may require more disk I/Os than network transfers. Unfortunately, most RC papers do not discuss the difference! Tutorial at IEEE ICC (June, 2014) 156
138 Simple Regenerating Codes Tutorial at IEEE ICC (June, 2014) 157
139 not Tutorial at IEEE ICC (June, 2014) 158
140 (n=6, k=4, f=2)-src MDS precode placement node1 node2 node3 node4 node5 node6 (6,4)-RS (6,4)-RS tolerating arbitrary two failures any chunk recoverable with 2 I/Os overhead: 3/2 * 6/4 = 2.25x Tutorial at IEEE ICC (June, 2014) 159
141 single failure recovered efficiently 2 I/Os for each chunk 6 I/Os in total for all three chunks disk I/O = network I/O in repair Tutorial at IEEE ICC (June, 2014) 160
142 Tutorial at IEEE ICC (June, 2014) 161
Digital Audio and Video Data
Multimedia Networking Reading: Sections 3.1.2, 3.3, 4.5, and 6.5 CS-375: Computer Networks Dr. Thomas C. Bressoud 1 Digital Audio and Video Data 2 Challenges for Media Streaming Large volume of data Each
Airlift: Video Conferencing as a Cloud Service using Inter- Datacenter Networks
Airlift: Video Conferencing as a Cloud Service using Inter- Datacenter Networks Yuan Feng Baochun Li Bo Li University of Toronto HKUST 1 Multi-party video conferencing 2 Multi-party video conferencing
Video Streaming with Network Coding
Video Streaming with Network Coding Kien Nguyen, Thinh Nguyen, and Sen-Ching Cheung Abstract Recent years have witnessed an explosive growth in multimedia streaming applications over the Internet. Notably,
Practical Data Integrity Protection in Network-Coded Cloud Storage
Practical Data Integrity Protection in Network-Coded Cloud Storage Henry C. H. Chen Department of Computer Science and Engineering The Chinese University of Hong Kong Outline Introduction FMSR in NCCloud
A Digital Fountain Approach to Reliable Distribution of Bulk Data
A Digital Fountain Approach to Reliable Distribution of Bulk Data John Byers, ICSI Michael Luby, ICSI Michael Mitzenmacher, Compaq SRC Ashu Rege, ICSI Application: Software Distribution New release of
Classes of multimedia Applications
Classes of multimedia Applications Streaming Stored Audio and Video Streaming Live Audio and Video Real-Time Interactive Audio and Video Others Class: Streaming Stored Audio and Video The multimedia content
HOW PUBLIC INTERNET IS FINALLY READY FOR HD VIDEO BACKHAUL
White Paper HOW PUBLIC INTERNET IS FINALLY READY FOR HD VIDEO BACKHAUL EXPLORING THE CHALLENGES AND OPPORTUNITIES OF DELIVERING MORE CONTENT AT LESS COST Today s broadcasters are faced with an ever- present
Key Components of WAN Optimization Controller Functionality
Key Components of WAN Optimization Controller Functionality Introduction and Goals One of the key challenges facing IT organizations relative to application and service delivery is ensuring that the applications
Sources: Chapter 6 from. Computer Networking: A Top-Down Approach Featuring the Internet, by Kurose and Ross
Multimedia Communication Multimedia Systems(Module 5 Lesson 2) Summary: H Internet Phone Example Making the Best use of Internet s Best-Effort Service. Sources: H Chapter 6 from Computer Networking: A
Giving life to today s media distribution services
Giving life to today s media distribution services FIA - Future Internet Assembly Athens, 17 March 2014 Presenter: Nikolaos Efthymiopoulos Network architecture & Management Group Copyright University of
Requirements of Voice in an IP Internetwork
Requirements of Voice in an IP Internetwork Real-Time Voice in a Best-Effort IP Internetwork This topic lists problems associated with implementation of real-time voice traffic in a best-effort IP internetwork.
Final for ECE374 05/06/13 Solution!!
1 Final for ECE374 05/06/13 Solution!! Instructions: Put your name and student number on each sheet of paper! The exam is closed book. You have 90 minutes to complete the exam. Be a smart exam taker -
Question: 3 When using Application Intelligence, Server Time may be defined as.
1 Network General - 1T6-521 Application Performance Analysis and Troubleshooting Question: 1 One component in an application turn is. A. Server response time B. Network process time C. Application response
QoS issues in Voice over IP
COMP9333 Advance Computer Networks Mini Conference QoS issues in Voice over IP Student ID: 3058224 Student ID: 3043237 Student ID: 3036281 Student ID: 3025715 QoS issues in Voice over IP Abstract: This
Network Coding for Distributed Storage
Network Coding for Distributed Storage Alex Dimakis USC Overview Motivation Data centers Mobile distributed storage for D2D Specific storage problems Fundamental tradeoff between repair communication and
Internet Video Streaming and Cloud-based Multimedia Applications. Outline
Internet Video Streaming and Cloud-based Multimedia Applications Yifeng He, yhe@ee.ryerson.ca Ling Guan, lguan@ee.ryerson.ca 1 Outline Internet video streaming Overview Video coding Approaches for video
Computer Network. Interconnected collection of autonomous computers that are able to exchange information
Introduction Computer Network. Interconnected collection of autonomous computers that are able to exchange information No master/slave relationship between the computers in the network Data Communications.
PEER TO PEER FILE SHARING USING NETWORK CODING
PEER TO PEER FILE SHARING USING NETWORK CODING Ajay Choudhary 1, Nilesh Akhade 2, Aditya Narke 3, Ajit Deshmane 4 Department of Computer Engineering, University of Pune Imperial College of Engineering
IMPROVING QUALITY OF VIDEOS IN VIDEO STREAMING USING FRAMEWORK IN THE CLOUD
IMPROVING QUALITY OF VIDEOS IN VIDEO STREAMING USING FRAMEWORK IN THE CLOUD R.Dhanya 1, Mr. G.R.Anantha Raman 2 1. Department of Computer Science and Engineering, Adhiyamaan college of Engineering(Hosur).
Methods for Mitigating IP Network Packet Loss in Real Time Audio Streaming Applications
Methods for Mitigating IP Network Packet Loss in Real Time Audio Streaming Applications Keyur Parikh and Junius Kim Harris Broadcast Mason Ohio Abstract Increasingly, IP based networks are being used for
ADVANTAGES OF AV OVER IP. EMCORE Corporation
ADVANTAGES OF AV OVER IP More organizations than ever before are looking for cost-effective ways to distribute large digital communications files. One of the best ways to achieve this is with an AV over
Introduction, Rate and Latency
Introduction, Rate and Latency Communication Networks Why communicate? Necessary to support some application. Example Applications Audio communication Radio, Telephone Text communication Email, SMS (text
Transport Layer Protocols
Transport Layer Protocols Version. Transport layer performs two main tasks for the application layer by using the network layer. It provides end to end communication between two applications, and implements
Region 10 Videoconference Network (R10VN)
Region 10 Videoconference Network (R10VN) Network Considerations & Guidelines 1 What Causes A Poor Video Call? There are several factors that can affect a videoconference call. The two biggest culprits
The Data Replication Bottleneck: Overcoming Out of Order and Lost Packets across the WAN
The Data Replication Bottleneck: Overcoming Out of Order and Lost Packets across the WAN By Jim Metzler, Cofounder, Webtorials Editorial/Analyst Division Background and Goal Many papers have been written
Experiences with Interactive Video Using TFRC
Experiences with Interactive Video Using TFRC Alvaro Saurin, Colin Perkins University of Glasgow, Department of Computing Science Ladan Gharai University of Southern California, Information Sciences Institute
Is Your Network Ready for VoIP? > White Paper
> White Paper Tough Questions, Honest Answers For many years, voice over IP (VoIP) has held the promise of enabling the next generation of voice communications within the enterprise. Unfortunately, its
Broadband Networks. Prof. Dr. Abhay Karandikar. Electrical Engineering Department. Indian Institute of Technology, Bombay. Lecture - 29.
Broadband Networks Prof. Dr. Abhay Karandikar Electrical Engineering Department Indian Institute of Technology, Bombay Lecture - 29 Voice over IP So, today we will discuss about voice over IP and internet
CSE-E5430 Scalable Cloud Computing P Lecture 5
CSE-E5430 Scalable Cloud Computing P Lecture 5 Keijo Heljanko Department of Computer Science School of Science Aalto University keijo.heljanko@aalto.fi 12.10-2015 1/34 Fault Tolerance Strategies for Storage
Lecture 15: Congestion Control. CSE 123: Computer Networks Stefan Savage
Lecture 15: Congestion Control CSE 123: Computer Networks Stefan Savage Overview Yesterday: TCP & UDP overview Connection setup Flow control: resource exhaustion at end node Today: Congestion control Resource
Advanced satellite infrastructures in future global Grid computing: network solutions to compensate delivery delay ISTI CNR
Advanced satellite infrastructures in future global Grid computing: network solutions to compensate delivery delay Blasco Bonito, Alberto Gotta and Raffaello Secchi ISTI CNR Outline Introduction Grid Networks
Coding Techniques for Efficient, Reliable Networked Distributed Storage in Data Centers
Coding Techniques for Efficient, Reliable Networked Distributed Storage in Data Centers Anwitaman Datta Joint work with Frédérique Oggier (SPMS) School of Computer Engineering Nanyang Technological University
An Analysis of Error Handling Techniques in Voice over IP
An Analysis of Error Handling Techniques in Voice over IP Martin John Lipka ABSTRACT The use of Voice over IP (VoIP) has been growing in popularity, but unlike its wired circuit-switched telephone network
PARALLELS CLOUD STORAGE
PARALLELS CLOUD STORAGE Performance Benchmark Results 1 Table of Contents Executive Summary... Error! Bookmark not defined. Architecture Overview... 3 Key Features... 5 No Special Hardware Requirements...
File sharing using IP-Multicast
File sharing using IP-Multicast Kai Trojahner, Peter Sobe University of Luebeck, Germany Institute of Computer Engineering email: sobe@iti.uni-luebeck.de Abstract: File sharing systems cause a huge portion
Assessment of Traffic Prioritization in Switched Local Area Networks Carrying Multimedia Traffic
Assessment of Traffic Prioritization in Switched Local Area Networks Carrying Multimedia Traffic F. A. Tobagi, C. J. Fraleigh, M. J. Karam, W. Noureddine Computer Systems Laboratory Department of Electrical
Quantum StorNext. Product Brief: Distributed LAN Client
Quantum StorNext Product Brief: Distributed LAN Client NOTICE This product brief may contain proprietary information protected by copyright. Information in this product brief is subject to change without
Content Distribution over IP: Developments and Challenges
Content Distribution over IP: Developments and Challenges Adrian Popescu, Blekinge Inst of Technology, Sweden Markus Fiedler, Blekinge Inst of Technology, Sweden Demetres D. Kouvatsos, University of Bradford,
Input / Ouput devices. I/O Chapter 8. Goals & Constraints. Measures of Performance. Anatomy of a Disk Drive. Introduction - 8.1
Introduction - 8.1 I/O Chapter 8 Disk Storage and Dependability 8.2 Buses and other connectors 8.4 I/O performance measures 8.6 Input / Ouput devices keyboard, mouse, printer, game controllers, hard drive,
Lecture 33. Streaming Media. Streaming Media. Real-Time. Streaming Stored Multimedia. Streaming Stored Multimedia
Streaming Media Lecture 33 Streaming Audio & Video April 20, 2005 Classes of applications: streaming stored video/audio streaming live video/audio real-time interactive video/audio Examples: distributed
Three Key Design Considerations of IP Video Surveillance Systems
Three Key Design Considerations of IP Video Surveillance Systems 2012 Moxa Inc. All rights reserved. Three Key Design Considerations of IP Video Surveillance Systems Copyright Notice 2012 Moxa Inc. All
Final Exam. Route Computation: One reason why link state routing is preferable to distance vector style routing.
UCSD CSE CS 123 Final Exam Computer Networks Directions: Write your name on the exam. Write something for every question. You will get some points if you attempt a solution but nothing for a blank sheet
Frequently Asked Questions
Frequently Asked Questions 1. Q: What is the Network Data Tunnel? A: Network Data Tunnel (NDT) is a software-based solution that accelerates data transfer in point-to-point or point-to-multipoint network
CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS
137 CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 8.1 CONCLUSION In this thesis, efficient schemes have been designed and analyzed to control congestion and distribute the load in the routing process of
AN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK
Abstract AN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK Mrs. Amandeep Kaur, Assistant Professor, Department of Computer Application, Apeejay Institute of Management, Ramamandi, Jalandhar-144001, Punjab,
Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc
(International Journal of Computer Science & Management Studies) Vol. 17, Issue 01 Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc Dr. Khalid Hamid Bilal Khartoum, Sudan dr.khalidbilal@hotmail.com
Highly Available Mobile Services Infrastructure Using Oracle Berkeley DB
Highly Available Mobile Services Infrastructure Using Oracle Berkeley DB Executive Summary Oracle Berkeley DB is used in a wide variety of carrier-grade mobile infrastructure systems. Berkeley DB provides
Challenges of Sending Large Files Over Public Internet
Challenges of Sending Large Files Over Public Internet CLICK TO EDIT MASTER TITLE STYLE JONATHAN SOLOMON SENIOR SALES & SYSTEM ENGINEER, ASPERA, INC. CLICK TO EDIT MASTER SUBTITLE STYLE OUTLINE Ø Setting
CISCO WIDE AREA APPLICATION SERVICES (WAAS) OPTIMIZATIONS FOR EMC AVAMAR
PERFORMANCE BRIEF CISCO WIDE AREA APPLICATION SERVICES (WAAS) OPTIMIZATIONS FOR EMC AVAMAR INTRODUCTION Enterprise organizations face numerous challenges when delivering applications and protecting critical
How To Encrypt Data With A Power Of N On A K Disk
Towards High Security and Fault Tolerant Dispersed Storage System with Optimized Information Dispersal Algorithm I Hrishikesh Lahkar, II Manjunath C R I,II Jain University, School of Engineering and Technology,
The Pros and Cons of Erasure Coding & Replication vs. RAID in Next-Gen Storage Platforms. Abhijith Shenoy Engineer, Hedvig Inc.
The Pros and Cons of Erasure Coding & Replication vs. RAID in Next-Gen Storage Platforms Abhijith Shenoy Engineer, Hedvig Inc. @hedviginc The need for new architectures Business innovation Time-to-market
White Paper Creating a Video Matrix over IP
White Paper Creating a Video Matrix over IP As the worlds of AV and IT converge, software is rapidly becoming the new frontier of AV development. In the old days, once there was a picture on the screen
INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET) PERCEIVING AND RECOVERING DEGRADED DATA ON SECURE CLOUD
INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET) International Journal of Computer Engineering and Technology (IJCET), ISSN 0976- ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume 4,
Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow
International Journal of Soft Computing and Engineering (IJSCE) Performance Analysis of AQM Schemes in Wired and Wireless Networks based on TCP flow Abdullah Al Masud, Hossain Md. Shamim, Amina Akhter
Optimizing Converged Cisco Networks (ONT)
Optimizing Converged Cisco Networks (ONT) Module 3: Introduction to IP QoS Introducing QoS Objectives Explain why converged networks require QoS. Identify the major quality issues with converged networks.
QoS Parameters. Quality of Service in the Internet. Traffic Shaping: Congestion Control. Keeping the QoS
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
1Multimedia Networking and Communication: Principles and Challenges
1Multimedia Networking and Communication: Principles and Challenges Mihaela van der Schaar and Philip A. Chou In case you haven t noticed, multimedia communication over IP and wireless networks is exploding.
Erasure Coding for Cloud Storage Systems: A Survey
TSINGHUA SCIENCE AND TECHNOLOGY ISSNll1007-0214ll06/11llpp259-272 Volume 18, Number 3, June 2013 Erasure Coding for Cloud Storage Systems: A Survey Jun Li and Baochun Li Abstract: In the current era of
www.lirneasia.net Oct 2008 Annual price 256kbps Business Broadband connection Figure 2 Annual Price 2Mbps, 2km leased line connection Figure 1 4,500
18, Annual Price 2Mbps, 2km leased line connection Figure 1 4,5 Annual price 256kbps Business Broadband connection Figure 2 USD 16, 14, 12, 1, 8, 6, 4, 2, Afghanistan Bangladesh Pakistan India Bhutan Sri
Comparative Analysis of Congestion Control Algorithms Using ns-2
www.ijcsi.org 89 Comparative Analysis of Congestion Control Algorithms Using ns-2 Sanjeev Patel 1, P. K. Gupta 2, Arjun Garg 3, Prateek Mehrotra 4 and Manish Chhabra 5 1 Deptt. of Computer Sc. & Engg,
Dynamic Load Balancing and Node Migration in a Continuous Media Network
Dynamic Load Balancing and Node Migration in a Continuous Media Network Anthony J. Howe Supervisor: Dr. Mantis Cheng University of Victoria Draft: April 9, 2001 Abstract This report examines current technologies
Airlift: Video Conferencing as a Cloud Service using Inter-Datacenter Networks
Airlift: Video Conferencing as a Cloud Service using Inter-Datacenter Networks Yuan Feng, Baochun Li Department of Electrical and Computer Engineering University of Toronto Abstract It is typical for enterprises
Datagram-based network layer: forwarding; routing. Additional function of VCbased network layer: call setup.
CEN 007C Computer Networks Fundamentals Instructor: Prof. A. Helmy Homework : Network Layer Assigned: Nov. 28 th, 2011. Due Date: Dec 8 th, 2011 (to the TA) 1. ( points) What are the 2 most important network-layer
Ad hoc and Sensor Networks Chapter 13: Transport Layer and Quality of Service
Ad hoc and Sensor Networks Chapter 13: Transport Layer and Quality of Service António Grilo Courtesy: Holger Karl, UPB Overview Dependability requirements Delivering single packets Delivering blocks of
QOS Requirements and Service Level Agreements. LECTURE 4 Lecturer: Associate Professor A.S. Eremenko
QOS Requirements and Service Level Agreements LECTURE 4 Lecturer: Associate Professor A.S. Eremenko Application SLA Requirements Different applications have different SLA requirements; the impact that
Designing a Cloud Storage System
Designing a Cloud Storage System End to End Cloud Storage When designing a cloud storage system, there is value in decoupling the system s archival capacity (its ability to persistently store large volumes
Glossary of Terms and Acronyms for Videoconferencing
Glossary of Terms and Acronyms for Videoconferencing Compiled by Irene L. Ferro, CSA III Education Technology Services Conferencing Services Algorithm an algorithm is a specified, usually mathematical
Configuring ThinkServer RAID 500 and RAID 700 Adapters. Lenovo ThinkServer
Configuring ThinkServer RAID 500 and RAID 700 Adapters Lenovo ThinkServer October 4, 2011 Contents Overview... 4 RAID 500 features... 4 RAID 700 features... 4 RAID Overview... 4 Choosing the RAID Level...
Realtime Multi-party Video Conferencing Service over Information Centric Networks
Realtime Multi-party Video Conferencing Service over Information Centric Networks (Anil Jangam, Ravishankar Ravindran, Asit Chakraborti, Xili Wan, Guoqiang Wang ) University of Maryland, Baltimore County,
VoIP 101. E911-Enhanced 911- Used for providing emergency service on cellular and internet voice calls.
If you ve been researching phone systems for awhile, you ve probably heard the term VoIP. What s the definition? Do you need certain hardware for it to work? There are a few questions that should be answered
How To Recognize Voice Over Ip On Pc Or Mac Or Ip On A Pc Or Ip (Ip) On A Microsoft Computer Or Ip Computer On A Mac Or Mac (Ip Or Ip) On An Ip Computer Or Mac Computer On An Mp3
Recognizing Voice Over IP: A Robust Front-End for Speech Recognition on the World Wide Web. By C.Moreno, A. Antolin and F.Diaz-de-Maria. Summary By Maheshwar Jayaraman 1 1. Introduction Voice Over IP is
Multicast vs. P2P for content distribution
Multicast vs. P2P for content distribution Abstract Many different service architectures, ranging from centralized client-server to fully distributed are available in today s world for Content Distribution
Testing & Assuring Mobile End User Experience Before Production. Neotys
Testing & Assuring Mobile End User Experience Before Production Neotys Agenda Introduction The challenges Best practices NeoLoad mobile capabilities Mobile devices are used more and more At Home In 2014,
Windows 8 SMB 2.2 File Sharing Performance
Windows 8 SMB 2.2 File Sharing Performance Abstract This paper provides a preliminary analysis of the performance capabilities of the Server Message Block (SMB) 2.2 file sharing protocol with 10 gigabit
PORTrockIT. Spectrum Protect : faster WAN replication and backups with PORTrockIT
1 PORTrockIT 2 Executive summary IBM Spectrum Protect, previously known as IBM Tivoli Storage Manager or TSM, is the cornerstone of many large companies data protection strategies, offering a wide range
Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation
Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation R.Navaneethakrishnan Assistant Professor (SG) Bharathiyar College of Engineering and Technology, Karaikal, India.
A Hitchhiker s Guide to Fast and Efficient Data Reconstruction in Erasure-coded Data Centers
A Hitchhiker s Guide to Fast and Efficient Data Reconstruction in Erasure-coded Data Centers K V Rashmi 1, Nihar B Shah 1, Dikang Gu 2, Hairong Kuang 2, Dhruba Borthakur 2, and Kannan Ramchandran 1 ABSTRACT
Chapter 3 ATM and Multimedia Traffic
In the middle of the 1980, the telecommunications world started the design of a network technology that could act as a great unifier to support all digital services, including low-speed telephony and very
Computer Networks Homework 1
Computer Networks Homework 1 Reference Solution 1. (15%) Suppose users share a 1 Mbps link. Also suppose each user requires 100 kbps when transmitting, but each user transmits only 10 percent of the time.
SYSTEMATIC NETWORK CODING FOR LOSSY LINE NETWORKS. (Paresh Saxena) Supervisor: Dr. M. A. Vázquez-Castro
SYSTEMATIC NETWORK CODING FOR LOSSY LINE NETWORKS Paresh Saxena Supervisor: Dr. M. A. Vázquez-Castro PhD Programme in Telecommunications and Systems Engineering Department of Telecommunications and Systems
Multimedia Data Transmission over Wired/Wireless Networks
Multimedia Data Transmission over Wired/Wireless Networks Bharat Bhargava Gang Ding, Xiaoxin Wu, Mohamed Hefeeda, Halima Ghafoor Purdue University Website: http://www.cs.purdue.edu/homes/bb E-mail: bb@cs.purdue.edu
Horizon: Balancing TCP over multiple paths in wireless mesh networks
Horizon: Balancing TCP over multiple paths in wireless mesh networks Bozidar Radunovic, Christos Gkantsidis, Dinan Gunawardena, Peter Key Microsoft Research Cambridge, UK Wireless Mesh Networks Goals 1.
VoIP QoS. Version 1.0. September 4, 2006. AdvancedVoIP.com. sales@advancedvoip.com support@advancedvoip.com. Phone: +1 213 341 1431
VoIP QoS Version 1.0 September 4, 2006 AdvancedVoIP.com sales@advancedvoip.com support@advancedvoip.com Phone: +1 213 341 1431 Copyright AdvancedVoIP.com, 1999-2006. All Rights Reserved. No part of this
Data Storage - II: Efficient Usage & Errors
Data Storage - II: Efficient Usage & Errors Week 10, Spring 2005 Updated by M. Naci Akkøk, 27.02.2004, 03.03.2005 based upon slides by Pål Halvorsen, 12.3.2002. Contains slides from: Hector Garcia-Molina
Technical Specifications for KD5HIO Software
Technical Specifications for KD5HIO Software Version 0.2 12/12/2000 by Glen Hansen, KD5HIO HamScope Forward Error Correction Algorithms HamScope is a terminal program designed to support multi-mode digital
Mul$media Networking. #3 Mul$media Networking Semester Ganjil PTIIK Universitas Brawijaya. #3 Requirements of Mul$media Networking
Mul$media #3 Mul$media Semester Ganjil PTIIK Universitas Brawijaya Schedule of Class Mee$ng 1. Introduc$on 2. Applica$ons of MN 3. Requirements of MN 4. Coding and Compression 5. RTP 6. IP Mul$cast 7.
1. Comments on reviews a. Need to avoid just summarizing web page asks you for:
1. Comments on reviews a. Need to avoid just summarizing web page asks you for: i. A one or two sentence summary of the paper ii. A description of the problem they were trying to solve iii. A summary of
VOICE OVER IP AND NETWORK CONVERGENCE
POZNAN UNIVE RSITY OF TE CHNOLOGY ACADE MIC JOURNALS No 80 Electrical Engineering 2014 Assaid O. SHAROUN* VOICE OVER IP AND NETWORK CONVERGENCE As the IP network was primarily designed to carry data, it
Seamless Congestion Control over Wired and Wireless IEEE 802.11 Networks
Seamless Congestion Control over Wired and Wireless IEEE 802.11 Networks Vasilios A. Siris and Despina Triantafyllidou Institute of Computer Science (ICS) Foundation for Research and Technology - Hellas
VoIP over P2P networks
VoIP over P2P networks Víctor Ramos UAM-Iztapalapa Redes y Telecomunicaciones Victor.Ramos@ieee.org http://laryc.izt.uam.mx/~vramos What is the Internet? The IP protocol suite and related mechanisms and
Performance Evaluation of VoIP Services using Different CODECs over a UMTS Network
Performance Evaluation of VoIP Services using Different CODECs over a UMTS Network Jianguo Cao School of Electrical and Computer Engineering RMIT University Melbourne, VIC 3000 Australia Email: j.cao@student.rmit.edu.au
Broadband Quality of Service Experience (QoSE)
Broadband Quality of Service Experience (QoSE) Indicators 1 Price is not the only dimension that is of interest to customers and regulators. Quality of Service Experience (QoSE) is integrally connected
Video Transmission over Wireless LAN. Hang Liu Hang.liu@thomson.net
Video Transmission over Wireless LAN Hang Liu Hang.liu@thomson.net Page 1 Introduction! Introduction! Wi-Fi Multimedia and IEEE 802.11e for QoS Enhancement! Error Control Techniques Page 2 Introduction!
VoIP network planning guide
VoIP network planning guide Document Reference: Volker Schüppel 08.12.2009 1 CONTENT 1 CONTENT... 2 2 SCOPE... 3 3 BANDWIDTH... 4 3.1 Control data 4 3.2 Audio codec 5 3.3 Packet size and protocol overhead
Reliability and Fault Tolerance in Storage
Reliability and Fault Tolerance in Storage Dalit Naor/ Dima Sotnikov IBM Haifa Research Storage Systems 1 Advanced Topics on Storage Systems - Spring 2014, Tel-Aviv University http://www.eng.tau.ac.il/semcom
Trevi: Watering down storage hotspots with cool fountain codes. Toby Moncaster University of Cambridge
Trevi: Watering down storage hotspots with cool fountain codes Toby Moncaster University of Cambridge Trevi summary Ø Trevi is a cool new approach to data centre storage Ø based on exis;ng ideas that are
Per-Flow Queuing Allot's Approach to Bandwidth Management
White Paper Per-Flow Queuing Allot's Approach to Bandwidth Management Allot Communications, July 2006. All Rights Reserved. Table of Contents Executive Overview... 3 Understanding TCP/IP... 4 What is Bandwidth
Visualizations and Correlations in Troubleshooting
Visualizations and Correlations in Troubleshooting Kevin Burns Comcast kevin_burns@cable.comcast.com 1 Comcast Technology Groups Cable CMTS, Modem, Edge Services Backbone Transport, Routing Converged Regional
Load Balancing in Fault Tolerant Video Server
Load Balancing in Fault Tolerant Video Server # D. N. Sujatha*, Girish K*, Rashmi B*, Venugopal K. R*, L. M. Patnaik** *Department of Computer Science and Engineering University Visvesvaraya College of
Distributed Systems (5DV147) What is Replication? Replication. Replication requirements. Problems that you may find. Replication.
Distributed Systems (DV47) Replication Fall 20 Replication What is Replication? Make multiple copies of a data object and ensure that all copies are identical Two Types of access; reads, and writes (updates)