开发工具:
文件大小: 11mb
下载次数: 0
上传时间: 2019-07-04
详细说明：找到的网络编码的课件，英文的，里面讲解还是挺好的。Collaborators
MIT: Varun Aggarwal, Ebad Ahmed, Flavio Calmon du pin, Jason Cloud Wenjun
Hu, David Karger, Dina Katabi, Sachin Katti, Minji Kim, Minkyu Kim, Anna Lee
Asuman Ozdaglar Hariharan Rahul, Devavrat Shah, Danail Traskov (previousl
UIUC, TUM), Weifei Zeng, fang Zhao
Rutgers: Desmond Lun(previously MIT
AT&T labs: Supratim Deb(previously UIUC, MIT)
Technical University of Munich: Ralf Koetter t(previously UIUC), Ashutosh
California Institute of Technology: Michelle effros, tracey Ho(previously MIt,
UIUC, Lucent)
Ecole Polytechnique Federale lausanne(Switzerland ): Christina fragouli
Qualcomm: Niranjan Ratnakar (previously UIUC) Payam Pakzad (previousl
y
EPFL), Jay-Kumar Sundararajan(previousl
ly MI
BBN: Karen Haigh, Paul Rubel
Ohio State University: Atilla Eryilmaz(previousl
By UIUC, MIT)
Support from DARPA(ITMANET, CBMANET, seed), NSF(ITR, XOR in the Air)
ARO(DAWN), AFOSR, Orange/france Telecom
Network coding
Canonical example [ahslwede et al. 00]
What choices can we make?
No longer distinct flows but information
Network coding
Picking a single bit does not work
Time sharing does not work
No longer distinct flows but information
Network coding
Need to use
alg
ebraic nature of data
b,+b
No longer distinct flows but information
y丿b1+b,b1+b2、z
Problem Description
[KMO1,02,O3]
R
R
R
A network
Vertices: V
Edges:EsV×V,e=(v,)∈E
Edge capacity: C(e)
Network: g=(V, E)
Source nodes:u1, 02,
Sink nodes: u1, u2,.,UK)CV
A input random processes at v
Z(v)={X(v,1),X(v,2)
(
y Output random processes at u
z(x)={z(u,1),Z(,2),…,Z(tu,v(u)}
Random processes on edges: Y(e)
A connection
c=(v,,(v,)),2(v,)sx(u)
A connection is established if 2(u)3 g(u, a)
Set of connections: 6
The pair(, 6)defines a network coding problem
Is the problem(9, 6)solvable?
How do we find a solution?
This is fairly idealized (synchronization, protocol, dynamic
behaviour, error free operation, but gives insights into possible
limits and opportunities
More Simplifications- Linear Network Codes
C(e)=1(links have the same capacity
H(X(U, i))=1(sources have the same rate)
The X(u, i) are mutually independent
Vector symbols of length m elements in F2m
(F2m is the finite field with m elements we can add, subtract, divide
and multiply elements in F2m without going crazy!)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相关说明
- 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
- 本站是交换下载平台，提供交流渠道，下载内容来自于网络，除下载问题外，其它问题请自行百度。
- 本站已设置防盗链，请勿用迅雷、QQ旋风等多线程下载软件下载资源，下载后用WinRAR最新版进行解压.
- 如果您发现内容无法下载，请稍后再次尝试；或者到消费记录里找到下载记录反馈给我们.
- 下载后发现下载的内容跟说明不相乎，请到消费记录里找到下载记录反馈给我们，经确认后退回积分.
- 如下载前有疑问，可以通过点击"提供者"的名字，查看对方的联系方式，联系对方咨询.
