公开(公告)号：EP1801979B1

公开(公告)日：2010-06-09

申请号：EP05270098.6

申请日：2005-12-22

申请人： Microsoft Corporation

发明人： Gkantsidis, Christos ,  Miller, John ,  Costa, Manuel ,  Rodriguez, Pablo Rodriguez ,  Ranson, Stuart

IPC分类号： H03M13/11 ,  H04L12/18

CPC分类号： H04L67/104 ,  H03M13/3761 ,  H04L67/1076 ,  H04L67/108

公开(公告)号：EP1802072B1

公开(公告)日：2010-05-05

申请号：EP05270100.0

申请日：2005-12-22

申请人： Microsoft Corporation

发明人： Gkantsidis, Christos ,  Miller, John ,  Costa, Manuel ,  Rodriguez, Pablo ,  Ranson, Stuart

IPC分类号： H04L29/06

CPC分类号： H04L67/104 ,  H04L29/06 ,  H04L67/108 ,  H04L67/22 ,  H04L67/24 ,  H04L69/329

公开(公告)号：EP1802072A1

公开(公告)日：2007-06-27

申请号：EP05270100.0

申请日：2005-12-22

申请人： Microsoft Corporation

发明人： Gkantsidis, Christos ,  Miller, John ,  Costa, Manuel ,  Rodriguez, Pablo ,  Ranson, Stuart

IPC分类号： H04L29/06

CPC分类号： H04L67/104 ,  H04L29/06 ,  H04L67/108 ,  H04L67/22 ,  H04L67/24 ,  H04L69/329

摘要： A wire protocol is described which implements connection management and other methods to give enhanced peer-to-peer content distribution. Connections between nodes can be placed in a "notify" state when they are idle but may soon yield useful content. This notify state is also used together with a content request/response cycle to allow a peer to evaluate content available at a neighbour. If no suitable content is available a notify state is entered. When new content is later received at the neighbour it is able to inform the requesting node to allow it to restart the content request/response cycle.

公开(公告)号：EP1801979A1

公开(公告)日：2007-06-27

申请号：EP05270098.6

申请日：2005-12-22

申请人： Microsoft Corporation

发明人： Gkantsidis, Christos ,  Miller, John ,  Costa, Manuel ,  Rodriguez, Pablo Rodriguez ,  Ranson, Stuart

IPC分类号： H03M13/11 ,  H04L12/18

CPC分类号： H04L67/104 ,  H03M13/3761 ,  H04L67/1076 ,  H04L67/108

摘要： The invention provides methods of encoding content for distribution over a network and methods for decoding encoded content which has been distributed over the network. In a first example in which the content is divided into a plurality of segments and each segment comprising a plurality of blocks of data, the method comprises selecting a segment from the plurality of segments and selecting at least two blocks of the selected segment from a store of blocks. A new encoded block is created from a linear combination of the selected blocks.