[미국특허]
Multi-path data transfer using network coding
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
H04L-012/707
H04B-007/155
H04L-029/06
H04L-001/00
출원번호
US-0754398
(2013-01-30)
등록번호
US-9537759
(2017-01-03)
발명자
/ 주소
Calmon, Flavio du Pin
Cloud, Jason M.
Medard, Muriel
Zeng, Weifei
출원인 / 주소
MASSACHUSETTS INSTITUTE OF TECHNOLOGY
대리인 / 주소
Daly, Crowley, Mofford & Durkee, LLP
인용정보
피인용 횟수 :
10인용 특허 :
27
초록▼
Techniques, devices, systems, and protocols are disclosed herein that relate to data transfer between communication nodes via multiple heterogeneous paths. In various embodiments, network coding may be used to improve data flow and reliability in a multiple path scenario. Transmission control protoc
Techniques, devices, systems, and protocols are disclosed herein that relate to data transfer between communication nodes via multiple heterogeneous paths. In various embodiments, network coding may be used to improve data flow and reliability in a multiple path scenario. Transmission control protocol (TCP) may also be used within different paths to further enhance data transfer reliability. In some embodiments, multiple levels of network coding may be provided within a transmitter in a multiple path scenario, with one level being applied across ail paths and another being applied within individual paths.
대표청구항▼
1. A machine implemented method for use at a source node for transferring data to a destination node, the method comprising: receiving, from an application layer within the source node, a plurality of original data packets to be transferred to the destination node;generating, at the source node, fir
1. A machine implemented method for use at a source node for transferring data to a destination node, the method comprising: receiving, from an application layer within the source node, a plurality of original data packets to be transferred to the destination node;generating, at the source node, first coded packets by combining original data packets using a linear network code;distributing the first coded packets among multiple available paths leading from the source node to the destination node;generating, at the source node, second coded packets associated with a first path of the multiple available paths by combining two or more of the first coded packets distributed to the first path using the linear network code;generating, at the source node, second coded packets associated with a second path of the multiple available paths by combining two or more of the first coded packets distributed to the second path using the linear network code;transmitting the second coded packets associated with the first path to the destination node via the first path; andtransmitting the second coded packets associated with the second path to the destination node via the second path. 2. The method of claim 1, wherein: generating first coded packets includes generating first coded packets by linearly combining original data packets that are within a sliding coding window. 3. The method of claim 2, further comprising: receiving acknowledgement messages from the destination node that each indicate that a new degree of freedom has been received by the destination node in connection with the data transfer; andadjusting the width of the sliding coding window based, at least in part, on received acknowledgement messages. 4. The method of claim 1, wherein: generating second coded packets includes generating second coded packets by linearly combining first coded packets that are within a sliding coding window. 5. The method of claim 4, wherein: generating second coded packets includes generating redundant second coded packets for each set of first coded packets within the sliding coding window. 6. The method of claim 1, wherein: each of the multiple available paths includes a transmission control protocol (TCP) layer that adds sequence numbers to first coded packets distributed to the path, wherein generating second coded packets by linearly combining first coded packets masks the sequence numbers added to the first coded packets associated with a path. 7. The method of claim 1, wherein: each of the multiple available paths includes a transmission control protocol (TCP) layer; anddistributing the first coded packets includes distributing the first coded packets among the multiple available paths based, at least in part, on TCP congestion control window dynamics. 8. The method of claim 1, wherein: the multiple available paths are associated with different network technologies. 9. The method of claim 1, wherein: obtaining a plurality of original data packets includes receiving the original data packets from an application layer. 10. A communication device comprising: a first network interface unit configured for communication in a first network;a second network interface unit configured for communication in a second network that is different from the first network; andat least one processor to manage data transfer between the communication device and a destination node using multiple different paths, the at least one processor to: receive, from an application layer, a plurality of original packets representative of data to be transferred to the destination node;generate first coded packets by combining original data packets using a linear network code;distribute the first coded packets to the multiple different paths to the destination node;generate second coded packets associated with a first path of the multiple different paths by combining two or more of the first coded packets distributed to the first path using the linear network code;generate second coded packets associated with a second path of the multiple available paths by combining two or more of the first coded packets distributed to the second path using the linear network code;transmit the second coded packets associated with the first path to the destination node via the first network using the first network interface unit; andtransmit the second coded packets associated with the second path to the destination node via the second network using the second network interface unit. 11. The communication device of claim 10, wherein the at least one processor is configured to generate first coded packets by linearly combining original data packets within a sliding coding window. 12. The communication device of claim 10, wherein the at least one processor is configured to generate second coded packets for a first path by linearly combining first coded packets within a sliding coding window. 13. The communication device of claim 12, wherein the at least one processor is configured to generate redundant second coded packets for the first path for each set of first coded packets within the sliding coding window. 14. The communication device of claim 10, wherein the at least one processor is configured to distribute the first coded packets to the multiple different paths based, at least in part, on TCP congestion control window dynamics. 15. The communication device of claim 10, further comprising: at least one additional network interface unit configured for communication within at least one additional network.
Choi, Sung-Ho; Park, Chang-Soo; Kim, Jae-Yoel; Park, Seong-III; Jung, Ki-Ho; Choi, Ho-Kyu; Lee, Hyun-Woo; Kwak, Yong-Jun; Lee, Kook-Heui, Apparatus and method for allocating channel using OVSF code for uplink synchronous transmission scheme in a W-CDMA communication system.
Knapp,David J.; Ho,Horace C., Communication system and method for sending asynchronous data and/or isochronous streaming data across a synchronous network within a frame segment using a coding violation to signify at least the beginning of a data transfer.
Knapp,David J.; Ho,Horace C., Communication system and method for sending isochronous streaming data across a synchronous network within a frame segment using a coding violation to signify invalid or empty bytes within the frame .
Malik Imran (Germantown MD) Lowe D. Ray (Gaithersburg MD), Method and apparatus for adjusting the postamble false detection probability threshold for a burst transmission.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.