throbber
I 1111111111111111 1111111111 1111111111 1111111111 1111111111111111 IIII IIII IIII
`US010257319B2
`
`c12) United States Patent
`Shribman et al.
`
`(IO) Patent No.: US 10,257,319 B2
`(45) Date of Patent:
`Apr. 9, 2019
`
`(54) SYSTEM PROVIDING FASTER AND MORE
`EFFICIENT DATA COMMUNICATION
`
`(71) Applicant: WEB SPARK LTD., Netanya (IL)
`
`(72)
`
`Inventors: Derry Shribman, Tel Aviv (IL); Ofer
`Vilenski, Moshav Hadar Am (IL)
`
`(73) Assignee: WEB SPARK LTD., Netanya (IL)
`
`( *) Notice:
`
`Subject to any disclaimer, the term ofthis
`patent is extended or adjusted under 35
`U.S.C. 154(b) by O days.
`
`(21) Appl. No.: 15/957,945
`
`(22) Filed:
`
`Apr. 20, 2018
`
`(65)
`
`Prior Publication Data
`
`US 2018/0241851 Al
`
`Aug. 23, 2018
`
`Related U.S. Application Data
`
`(60) Continuation of application No. 14/025,109, filed on
`Sep. 12, 2013, which is a division of application No.
`(Continued)
`
`(51)
`
`(2006.01)
`(2006.01)
`(2006.01)
`
`Int. Cl.
`H04L 29106
`H04L 29108
`H04L 12124
`(52) U.S. Cl.
`CPC ............ H04L 67142 (2013.01); H04L 411046
`(2013.01); H04L 6711002 (2013.01);
`(Continued)
`( 58) Field of Classification Search
`CPC ..... H04L 67/42; H04L 41/046; H04L 67/108;
`H04L 67/22
`
`(56)
`
`References Cited
`
`U.S. PATENT DOCUMENTS
`
`3,922,494 A
`4,937,781 A
`
`11/1975 Cooper et al.
`6/1990 Lee et al.
`(Continued)
`
`FOREIGN PATENT DOCUMENTS
`
`CN
`CN
`
`11/2007
`101075242 A
`5/2008
`101179389 A
`(Continued)
`
`OTHER PUBLICATIONS
`
`R. Fielding et al, RFC 2616: Hypertext Transfer Protocol-HTTP/
`1.1, Jun. 1999, retrieved from the Internet http://rcf-editor.org
`[retrieved Apr. 15, 2002] (114 pages).
`(Continued)
`
`Primary Examiner - Minh Chau Nguyen
`(74) Attorney, Agent, or Firm - May Patents Ltd. c/o
`Dorit Shem-Tov
`
`ABSTRACT
`(57)
`A system designed for increasing network communication
`speed for users, while lowering network congestion for
`content owners and ISPs. The system employs network
`elements including an acceleration server, clients, agents,
`and peers, where communication requests generated by
`applications are intercepted by the client on the same
`machine. The IP address of the server in the communication
`request is transmitted to the acceleration server, which
`provides a list of agents to use for this IP address. The
`communication request is sent to the agents. One or more of
`the agents respond with a list of peers that have previously
`seen some or all of the content which is the response to this
`request (after checking whether this data is still valid). The
`client then downloads the data from these peers in parts and
`in parallel, thereby speeding up the Web transfer, releasing
`congestion from the Web by fetching the information from
`multiple sources, and relieving traffic from Web servers by
`offloading the data transfers from them to nearby peers.
`
`(Continued)
`
`29 Claims, 15 Drawing Sheets
`
`..
`
`CLU:rff
`OIM:CI:
`
`..
`
`WH
`SERVl!:ll
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 1 of 29
`
`

`

`US 10,257,319 B2
`Page 2
`
`Related U.S. Application Data
`
`12/836,059, filed on Jul. 14, 2010, now Pat. No.
`8,560,604.
`
`(60) Provisional application No. 61/249,624, filed on Oct.
`8, 2009.
`
`(52) U.S. Cl.
`CPC ........ H04L 671108 (2013.01); H04L 6711023
`(2013.01); H04L 6711063 (2013.01); H04L
`67122 (2013.01); H04L 6712814 (2013.01);
`H04L 6712819 (2013.01); H04L 67/02
`(2013.01)
`
`(58)
`
`(56)
`
`Field of Classification Search
`USPC . ... ... ... .. ... ... ... ... ... .. ... ... ... ... ... .. ... ... ... ... 709/202
`See application file for complete search history.
`
`References Cited
`
`U.S. PATENT DOCUMENTS
`
`5,577,243 A
`5,758,195 A
`6,061,278 A
`6,154,782 A
`6,173,330 Bl
`6,466,470 Bl
`6,868,453 Bl *
`
`7,120,666 B2
`7,203,741 B2
`7,558,942 Bl
`7,788,378 B2
`7,818,430 B2
`7,865,585 B2
`7,890,547 B2
`7,970,835 B2
`8,135,912 B2
`8,171,101 B2
`8,479,251 B2
`8,499,059 B2
`8,595,786 B2 *
`
`8,769,035 B2
`8,719,505 B2
`8,832,179 B2
`9,201,808 B2
`9,253,164 B2
`9,990,295 B2
`2001/0033583 Al
`2002/0007413 Al
`2002/0065930 Al
`2002/0069241 Al
`2002/0120874 Al
`2002/0123895 Al
`2002/0133621 Al
`2003/0009518 Al
`2003/0009583 Al
`2003/0074403 Al
`2003/0097408 Al
`2003/0115364 Al
`2003/0174648 Al
`2003/0200307 Al
`2003/0204602 Al
`2003/0210694 Al
`2004/0088646 Al
`2004/0107242 Al
`2004/0254907 Al
`2004/0264506 Al
`2005/0015552 Al
`2005/0022236 Al
`2005/0097441 Al*
`
`2005/0228964 Al
`2006/00367 55 Al
`
`ll/ 1996 Sherwood et al.
`5/1998 Balmer
`5/2000 Kato et al.
`11/2000 Kawaguchi
`1/2001 Guo et al.
`10/2002 Chang
`3/2005 Watanabe ......... G06F 17/30861
`707/El7.107
`
`10/2006 McCanne et al.
`4/2007 Marco et al.
`7 /2009 Chen et al.
`8/2010 Rao
`10/2010 Zuckerman
`1/2011 Samuels et al.
`2/2011 Hotti
`6/2011 St. Jacques
`3/2012 Shribman et al.
`5/2012 Gladwin et al.
`7/2013 Feinleib et al.
`7/2013 Stoyanov
`11/2013 Choi ....................... H04L 1/005
`725/151
`
`1/2014 Reschetal.
`5/2014 Shribman et al.
`9/2014 Owen et al.
`12/2015 Shribman et al.
`2/2016 Gouge
`6/2018 Shribman et al.
`10/2001 Rabenko et al.
`1/2002 Garcia-Luna-Aceves et al.
`5/2002 Rhodes
`6/2002 Narlikar et al.
`8/2002 Shu et al.
`9/2002 Potekhin
`9/2002 Marco et al.
`1/2003 Harrow et al.
`1/2003 Chan et al.
`4/2003 Harrow et al.
`5/2003 Kageyama
`6/2003 Shu et al.
`9/2003 Wang et al.
`10/2003 Raju et al.
`10/2003 Hudson et al.
`11/2003 Jayaraman et al.
`5/2004 Yeager et al.
`6/2004 Vert et al.
`12/2004 Crow et al.
`12/2004 Furukawa
`1/2005 So et al.
`1/2005 Ito et al.
`5/2005 Herbach ................. G06F 21/10
`715/229
`
`10/2005 Sechrest et al.
`2/2006 Abdullah
`
`2006/0212542 Al*
`
`2006/0212584 Al*
`
`2006/0259728 Al
`2007/0073878 Al
`2007/0100839 Al
`2007/0156855 Al
`2007 /0226810 Al
`2007 /0239655 Al
`2008/0008089 Al
`2008/0025506 Al
`2008/0109446 Al
`2008/0125123 Al
`2008/0222291 Al
`2008/0235391 Al
`2008/0086730 Al
`2008/0256175 Al
`2009/0037529 Al
`2009/0182843 Al
`2009/0217122 Al
`2009/0279559 Al
`2009/0319502 Al
`2010/0066808 Al
`2010/0085977 Al
`2010/0094970 Al
`2010/0115063 Al
`2010/0154044 Al
`2010/0235438 Al
`2010/0293555 Al
`2010/0329270 Al
`2011/0035503 Al*
`
`2011/0066924 Al
`2011/0087733 Al
`2011/0128911 Al
`2011/0314347 Al
`2012/0099566 Al
`2012/0124173 Al
`2012/0124239 Al
`2012/0254370 Al
`2012/0254456 Al
`2013/0007253 Al
`2013/0157699 Al
`2013/0166768 Al
`2013/0201316 Al
`2013/0272519 Al
`2013/0326607 Al
`2014/0082260 Al
`2014/0301334 Al
`2014/0376403 Al
`2015/0033001 Al
`2015/0067819 Al
`2015/0358648 Al
`2016/0021430 Al
`
`9/2006 Fang ..................... H04L 67/104
`709/219
`9/2006 Yu ..................... G06F 17/30902
`709/227
`
`11/2006
`Chandrasekaran et al.
`3/2007
`Issa
`5/2007
`Kim
`7/2007
`Johnson
`9/2007
`Hotti
`10/2007
`Agetsuma
`1/2008
`Bornstein et al.
`1/2008
`Muraoka
`5/2008
`Wang
`5/2008
`Dorenbosch
`9/2008
`Weller et al.
`9/2008
`Painter et al.
`10/2008
`Vertes
`10/2008
`Lee
`2/2009
`Armon-Kest
`7/2009
`Hluchyj
`8/2009
`Yokokawa et al.
`11/2009
`Wong et al.
`12/2009
`Chalouhi et al.
`3/2010
`Tucker et al.
`4/2010
`Khalid et al.
`4/2010
`Zuckerman
`6/2010
`Gladwin et al.
`6/2010
`Manku
`9/2010
`Narayanan et al.
`11/2010
`Vepsalainen
`12/2010
`Asati et al.
`2/2011 Zaid .................... H04L 63/0407
`709/228
`
`3/2011 Dorso
`4/2011 Shribman et al.
`6/2011 Shaheen
`12/2011 Nakano et al.
`4/2012 Laine et al.
`5/2012 De et al.
`5/2012 Shribman et al.
`10/2012 Bacher
`10/2012 Visharam et al.
`1/2013 Li
`6/2013 Talwar
`6/2013 Gouache et al.
`8/2013 Binder et al.
`10/2013 Huang
`12/2013 Feng
`3/2014 Oh et al.
`10/2014 Labranche
`12/2014 Shao
`1/2015 Ivanov
`3/2015 Shribman et al.
`12/2015 Limberg
`1/2016 LaBosco et al.
`
`FOREIGN PATENT DOCUMENTS
`
`EP
`EP
`EP
`JP
`KR
`RU
`WO
`WO
`WO
`WO
`
`0948176 A2
`2597869 Al
`2597869 Al
`2007280388
`1020090097034
`2343536 C2
`2000/018078 Al
`2010090562 Al
`2011068784 Al
`2015034752 Al
`
`10/1999
`12/2013
`5/2015
`10/2007
`9/2009
`10/2009
`3/2000
`8/2010
`6/2011
`3/2015
`
`OTHER PUBLICATIONS
`
`Notice of Preliminary Rejection in KR Application No. 10-2012-
`7011711 dated Jul. 15, 2016.
`Kei Suzuki, a study on Cooperative Peer Selection Method in P2P
`Video Delivery, vol. 109, No. 37, IEICE Technical Report, The
`Institute of Electronics, Information and Communication Engineers,
`May 14, 2009.
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 2 of 29
`
`

`

`US 10,257,319 B2
`Page 3
`
`(56)
`
`References Cited
`
`OTHER PUBLICATIONS
`
`International Search Report dated in PCT Application No. PCT/
`US2010/051881 dated Dec. 9, 2010.
`Supplementary European Search Report dated in EP Application
`No. 10822724 dated Apr. 24, 2013.
`Screen captures from YouTube video clip entitle "nVpn.net I Double
`your Safety and use Socks5 + nVpn" 38 pages, last accessed Nov.
`20, 2018 <https://www.youtube.com/watch?v~LOHct2kSnn4>.
`Screen captures from YouTube video clip entitle "Andromeda" 47
`pages, publicly known and available as of at least 2011 <https://
`www.youtube.com/watch?v~yRRYpFLbKNU>.
`Spy Eye, https://www.symantec .corn/security-center/writeup/2010-
`0 20216-0135-9; http://securesql.info/riskyclouds/spyeye-user(cid:173)
`manual; known as of at least 2010 ( 13 pages).
`Screen captures from YouTube video clip entitle "Change Your
`Country IP Address & Location with Easy Hide IP Software" 9
`pages, publicly known and available as of at least 2011, <https://
`www.youtube.com/watch?v~lwkfl sOfdA and https://www.youtube.
`corn/watch?v~iFEMT-o9DTc>.
`CoralCDN ("CoralCDN"), https://pdos.csail.mit.edu/6.824/papers/
`freedman-coral.pdf (14 Pages).
`
`European Search Report for EP 14182547.1, dated Jul. 30, 2015.
`R. Fielding et al, RFC 2616: Hypertext Transfer Protocol-HTTP/
`1.1, Jun. 1999, retrieved from the Internet http://rcf-editor.org
`[retrieved Apr. 15, 2002].
`"On the leakage of personally identifiable information via online
`social networks", Wills et al. AT&T, Apr. 2009 http://www2.research.
`att. corn/-bala/papers/wosn 09. pdf.
`"Slice Embedding Solutions for Distributed Service Architectures"(cid:173)
`Esposito et al., Boston University, Computer Science Dept., Oct.
`2011http://www.cs.bu.edu/techreports/pdf/2011-025-slice-embedding.
`pdf.
`International Search Report of PCT/US2010/034072 dated Jul. 1,
`2010.
`YouTube video clip entitled "nVpn.net I Double your Safety and use
`Socks5 + n Vpn" <https://www.youtube.com/watch?v~LOHct2kSnn4>.
`YouTube video clip entitled "Andromeda" <https://www.youtube.
`corn/watch?v~yRRYpFLbKNU>.
`YouTube video clip entitled "Change Your Country IP Address &
`Location with Easy Hide IP Software" <https://www.youtube.com/
`watch?v~ulwkfl sOfdA and https://www.youtube.com/watch?v~
`iFEMT-o9DTc>.
`
`* cited by examiner
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 3 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 1 of 15
`
`US 10,257,319 B2
`
`CLIENT
`DEVICE
`!.1
`
`CUENT
`OEVtCE
`.t!I
`
`CUENT
`DEVICE
`1.11
`
`CllENT
`DEVICE
`.U
`
`CLIENT
`DEVICE
`!§.
`
`CUENT
`Dl!VICE
`2'0
`
`WEB
`SERVER
`~!!
`
`INTERNET
`ll
`
`WEB
`
`SERVER n
`
`WEB
`SERVER
`l!f_
`
`FIG. 1
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 4 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 2 of 15
`
`US 10,257,319 B2
`
`SERVER
`80
`
`j
`
`INTERNET
`lU
`
`PEER
`'.Hi
`
`CLIENT
`DEVICE
`!HI
`
`PEER
`H
`
`PEER
`l.Q_
`
`PEER
`72
`
`FIG. 2
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 5 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 3 of 15
`
`US 10,257,319 B2
`
`ACL'ElERATION
`SERVER
`.lll;/
`
`STORAGE
`Ol;VICE
`lJi4
`
`WEIi
`SERI/ER
`l~Z
`
`CLtfNT
`JQ?,
`
`FIG. 3
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 6 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 4 of 15
`
`US 10,257,319 B2
`
`200~
`
`PROCESSOR
`202
`
`INTERNET
`BROWSER
`214
`ACCELERATION
`APPLICATION
`220
`
`SOFTWARE
`212
`
`0/S
`230
`
`MEMORY
`210
`
`CONFIGURATION
`DATABASE
`280
`
`CACHE DATABASE
`282
`
`STORAGE DEVICE
`~
`
`LOCAL INTERFACE 250
`
`1/0 DEVICES
`240
`
`FIG. 4
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 7 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 5 of 15
`
`US 10,257,319 B2
`
`APPLICATION
`LEVEL
`270
`
`INTERNET
`BROWSER
`214
`
`OTHER
`APPLICATIONS
`216
`
`ACCELERATION
`APPLICATION
`220
`
`OPERATING
`SYSTEM
`LEVEL
`1§.Q
`
`Jr
`
`INTERMMEDIATE DRIVER
`272
`
`COMMUNICATION
`STACKS
`264
`
`Ji
`
`/
`
`DEVICE DRIVERS
`262
`
`OPERATING
`SYSTEM
`230
`
`MEMORY
`2.10.
`
`FIG. 5
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 8 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 6 of 15
`
`US 10,257,319 B2
`
`ACCELERATION
`APPLICATION
`220
`
`A CC EL ERA TION
`SYSTEM INITIALIZER
`MODULE
`222
`
`I
`
`CLIENT MODULE
`224
`
`PEER MODULE
`226
`
`AGENT MODULE
`228
`
`H
`
`CONFIGURATION
`DATABASE
`280
`
`CACHE DATABASE
`~
`
`STORAGE DEVICE
`208
`
`FIG. 6
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 9 of 29
`
`

`

`\0 = N
`"'""'
`-....l w
`UI
`'N
`"'""' =
`d r.,;_
`
`....
`0 ....
`('D a
`rJJ =(cid:173)
`
`-....J
`
`Ul
`
`1,0
`
`0 ....
`> "e :-:
`
`N
`
`~
`
`1,0
`
`~ = ~
`
`~
`~
`~
`•
`00
`
`e •
`
`FIG. 7
`
`312IPEER 2 CONNECTION STATUS
`310IPEER 1 IP ADDRESS
`
`30SIPEER 1
`
`3061 LIST OE e
`3041 CHUNK DA lA
`302LCHUNK CHlCKSUM
`
`300lcHUNKl
`
`298 IIJSI.Qf~_f.OR JlRSJJRLi
`296llAST CHAN~ED ON SEltVfR
`294ltASr CHECil.E:D ON SER't'ER
`2.92IURL HTTP
`2.90IURl
`
`162
`
`f
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 10 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 8 of 15
`
`US 10,257,319 B2
`
`300
`
`~
`
`INITIALIZER SIGNS UP WITH
`ACCELERATION SERVER
`302
`
`l
`
`DETERMINE IF THERE 15 AN
`UPDATED VERSION OF
`APPLICATION?
`304
`
`l
`
`INITIALIZER REDIRECTS
`OUTGOING NETWORK TRAFFIC
`306
`
`INITIALIZER LAUNCHES CLIENT
`MODULE AND CONFIGURES
`CLIENT MODULE TO INTERCEPT
`ALL OUTGOING NETWORK
`COMMUNICATIONS
`308
`
`+
`
`l
`
`INITIALIZER LAUNCHES AGENT
`MODULE AND PEER MODULE
`310
`
`FIG. 8
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 11 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 9 of 15
`
`US 10,257,319 B2
`
`/350
`
`APPLICATION ON CLIENT INITIATES
`REQUEST FOR A RESOURCE ON A
`NETWORK
`ill
`
`l
`
`RESOURCE REQUEST IS INTERCEPTED BY
`THE CLIENT MODULE
`354
`
`l
`
`CLIENT MODULE LOOKS UP IP ADDRESS OF
`SERVER THAT IS TARGET OF RESOURCE
`REQUEST AND SENDS IP ADDRESS TO
`ACCELERATION SERVER TO OBTAIN LIST
`OF COMMUNICATION DEVICES THAT
`CLIENT CAN USE AS AGENTS
`356
`
`l
`
`ACCELERATION SERVER PREPARES A LIST
`OF AGENTS THAT MAY BE SUITABLE TO
`HANDLE THE REQUEST FROM THIS IP
`ADDRESS
`~
`
`l
`
`CLIENT SENDS ORIGINAL REQUEST TO ALL
`AGENTS IN THE LIST RECEIVED FROM
`ACCELERATION SERVER TO DETERMINE
`WHICH AGENT IN THE LIST IS BEST SUITED
`TO ASSIST WITH THE REQUEST
`360
`
`FIG. 9
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 12 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 10 of 15
`
`US 10,257,319 B2
`
`EACH AGENT THAT RECEIVES CLIENT REQUEST RESPONDS TO CLIENT WITH
`WHETHER IT HAS INFO. REGARDING REQUEST THAT CAN ASSIST CLIENT TO
`DOWNLOAD REQUESTED INFO. FROM PEERS IN NETWORK m
`i
`CLIENT SELECTS SPECIFIC AGENT
`
`~
`
`CLIENT NOTIFIES SELECTED AGENT OF USE FOR REQUEST AND NOTIFIES OTHER
`AGENTS OF LACK OF USE
`.a.8.§
`
`+
`
`CLIENT FORWARDS SELECTED AGENT REQUEST FOR FIRST X NUMBER OF
`388
`CHUNKS
`
`+
`
`i
`
`DOES SELECTED AGENT HAVE INFO. REGARDING
`REQUESTED CHUNKS AND IS INFO. STILL VALID?
`.aru!
`
`YES
`
`IF INFO. STILL VALID, SELECTED
`AGENT RESPONDS TO CLIENT WITH
`CHECKSUM OF CHUNK, LIST OF
`PEERS THAT CONTAIN CHUNKS, AND
`IF ONLY A PORTION OF INFO.,
`392
`HEADERS
`
`+
`
`LIST OF PEERS FOR EACH CHUNK IS
`SORTED BY GEOGRAPHICAL
`PROXIMITY TO REQUESTING CLIENT
`J.IM
`+
`
`LIST OF CLOSEST PEERS TO CLIENT
`IS SENT TO CLIENT
`~
`
`1 NO
`
`SELECTED AGENT SENDS REQUEST
`DIRECTLY TO SERVER
`~
`
`l
`SELECTED AGENT STORES INFO.
`FROM SERVER IN ITS DATABASE
`m
`!
`SELECTED AGENT PREPARES
`RESPONSE (LIST) FOR CLIENT,
`WHERE RESPONSE INCLUDES
`CHECKSUM OF CHUNK, HEADERS,
`AND PROVIDES ITSELF AS THE ONLY
`PEER FOR THESE CHUNKS
`404
`
`+
`
`LIST IS FORWARDED BACK TO
`CLIENT
`406
`
`FIG. 10
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 13 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 11 of 15
`
`US 10,257,319 B2
`
`CLIENT RECEIVES RESPONSE FROM THE AGENT AND FOR EACH OF X CHUNKS,
`CLIENT SENDS A REQUEST TO EACH OF THE PEERS LISTED FOR THE CHUNK TO
`422
`DOWNLOAD THE DATA OF THAT CHUNK
`
`+
`
`PEERS RESPOND REGARDING WHETHER THEY STILL HAVE THE DATA OF THE
`CHUNK
`424
`...
`CLIENT SELECTS QUICKEST PEER WITH DATA OF THE CHUCK 426
`...
`CHOSEN PEER SENDS CHUNK TO CLIENT
`
`428
`
`CLIENT STORES CHUNKS IN ITS CACHE FOR FUTURE USE
`
`430
`
`+
`+
`
`IF ANY CHUNKS WERE NOT LOADED FROM ANY OF THE PEERS, CLIENT REQUESTS
`CHUNKS AGAIN FROM AGENT
`432
`
`+
`
`CLIENT ACKNOWLEDGES TO THE AGENT WHICH OF THE CHUNKS IT RECEIVED
`PROPERLY
`434
`
`+
`
`AGENT LOOKS UP CHUNKS IN DATABASE OF AGENT AND ADDS CLIENT TO LIST
`OF PEERS FOR THESE CHUNKS
`436
`...
`CLIENT PASSES DATA TO APPLICATION OF CLIENT THAT MADE REQUEST 438
`
`CLIENT CHECKS WHETHER ALL OF THE CHUNKS FOR REQUEST WERE RECEIVED
`440
`
`+
`
`FIG. 11
`
`420
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 14 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 12 of 15
`
`US 10,257,319 B2
`
`LOOK UP HTTP REQUEST IN
`DATABASE, GET ITS HTTP HEADERS
`502
`
`USING STANDARD HTTP
`PROTOCOL, CHECK THE HEADERS
`TO SEE IF THE URL IS STILL VALID
`AT THIS TIME ( USING HTTP
`HEADER INFORMATION SUCH AS
`'MAX AGE', 'NO CACHE', MUST
`REVALIDATE', ETC.)
`504
`
`IS DATA CACHED FOR THIS
`REQUEST STILL VALID?
`502
`
`YES
`
`)-...W"------•SEND HTTP CONDITIONAL REQUE
`TO THE WEB SERVER, TO CHECK IF
`THE DATA STORED FOR THIS
`REQUEST IS STILL VALID
`510
`
`RETURN "VALID"
`~
`
`YES
`
`IS CACHED DATA STILL VALID?
`Sil
`
`NO
`
`RETURN "INVALID"
`514
`
`FIG. 12
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 15 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 13 of 15
`
`US 10,257,319 B2
`
`0£0< ''l<EEP Al.l\lE'' VlllH IIETW:R<
`B..BENIS (QJENTS/ AG:MS/PEERS),
`. - - - - - - - - - ~TEDATABASEAS101lER.SfATUS - - - - - - - - - - - (cid:173)
`(CJIH.IN: I a=F-1.IN:)
`552.
`
`AIDTI-EQ.IENTlOLIST
`POTENTIAL AGENTS,
`SCRIEDBYJP ADCRSSCF
`11-E IIETW:R< B.EM:NIS
`(QlENIS, ~ AGENTS)
`558
`
`WAITFCROJENT IEQlEST
`554
`
`lYPECFREQ.ESl"ISEVED?
`556
`
`SEARJ-111-E AGENT DATABASE
`FCR 11-E l'ElCI" SACTTIIEAGENTS
`lHAT HA.S 11-E IP AIXH:5511-IAT
`ISQ.O;EST10n£TARGET
`SERVER.IP
`(EG.192166.3.103lSQ..OiER
`192166.3.212 TH:N 10
`192.167.3.104)
`562
`
`SEID TI-E AGENT usrro TI-E
`Q.JENT
`564
`
`FIG.13
`
`0£0<_\IERSION
`
`RETl.R\I 1011-E Q.IENf 11-E \IERSICJ\I
`11-E 1.AlESf AVAnABI.E sa=ntlME, ~
`A lR. CF~ 10 COIIIN.OAD 11-E
`1.AlESf\lERSION
`566
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 16 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 14 of 15
`
`US 10,257,319 B2
`
`f600
`
`NETWORK APPLICATION ON CLIENT ISSUES REQUEST TO
`CONNECT TO A TCPIP SERVER
`601
`
`l
`
`CONNECTION REQUEST IS INTERCEPTED BY
`ACCELERATION APPLICATION ON THE CLIENT
`602
`
`l
`
`CLIENT MODULE SENDS THE IP ADDRESS OF THE TCPIP
`SERVER TO THE ACCELERATION SERVER TO OBTAIN AN
`AGENT LIST
`604
`
`l
`
`ACCELERATION SERVER PREPARES A LIST OF AGENTS
`THAT MAY BE SUITABLE TO HANDLE THE REQUEST FROM
`THIS IP ADDRESS (FOR EXAMPLE, A PRIMARY AGENT AND
`FOUR SECONDARY AGENTS), AND SENDS THE LIST TO THE
`CLIENT
`606
`
`l
`
`CLIENT ISSUES A TCPIP CONNECT WITH THE PRIMARY
`AGENT (OR ONE OF THE OTHER AGENTS IF THE PRIMARY
`AGENT CONNECT DOES NOT SUCCEED) TO ESTABLISH A
`TCPIP CONNECTION WITH AN AGENT
`608
`
`l
`
`CLIENT SENDS TO THE AGENT THE IP ADDRESS OF THE
`TCPIP SERVER THAT THE COMMUNICATION APPLICATION
`WANTS TO CONNECT WITH, AND THE PORT TO WHICH IT
`WANTS TO CONNECT
`610
`
`l
`
`AGENT ISSUES A TC PIP CONNECT WITH THE TC PIP
`SERVER TO THE IP AND PORT RECEIVED FROM THE CLIENT
`612
`
`FIG. 14
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 17 of 29
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 15 of 15
`
`US 10,257,319 B2
`
`ACCELERATION APPLICATION INTERCEPTS A TCPIP WRITE COMMAND FROM THE
`COMMUNICATION APPLICATION (ON CLIENT) OR FROM TCPIP SERVER (ON AGENT) 802
`.!.
`DATA OF WRITE COMMAND IS BROKEN UP INTO CHUNKS AND CHECKSUMS ARE
`CALCULATED FOR EACH CHUNK 804
`.!.
`ACCELERATION APPLICATION LOOKS UP EACH CHUNK'S CHECKSUM IN ITS CACHE
`DAT ABASE 806
`i
`DOES AN ENTRY FOR THE CHECKSUM EXIST IN THE CACHE DATABASE? 808
`
`YES
`
`ACCELERATION APPLICATION PREPARES
`LIST OF PEERS THAT HAVE RECEIVED THIS
`CHUNK IN THE PAST 810
`
`+
`
`ACCELERATION APPLICATION SENDS PEER
`LIST TO COMMUNICATION DEVICE IT IS
`COMMUNICATING WITH (CLIENT TO AGENT,
`OR AGENT TO CLIENT), AND ADDS THAT
`COMMUNICATION DEVICE TO THE LIST OF
`PEERS FOR THAT CHUNK 812
`
`+
`
`COMMUNICATION DEVICE WITH
`ACCELERATION APPLICATION THAT
`RECEIVED THE LIST OF PEERS CONNECTS
`TO AT LEAST ONE OF THE PEERS AND
`DOWNLOADS THE CHUNK FROM IT 814
`
`NO
`
`,.
`
`ACCELERATION APPLICATION ADDS
`THE CHUNK AND ITS CHECKSUM TO
`ITS CACHE DATABASE, AND SENDS
`THE CHUNK ITSELF TO THE
`COMMUNICATION DEVICE IT IS
`COMMUNICATING WITH (CLIENT TO
`AGENT, OR AGENT TO CLIENT), AND
`ADDS THAT COMMUNICATION DEVICE
`TO THE LIST OF PEERS FOR THAT
`CHUNK 820
`
`HAVE ALL CHUNK DATA BEEN TRANSFERRED TO THE OTHER SIDE? 816
`
`NO
`
`~
`
`YES
`ACCELERATION APPLICATION PASSES ON THE COMPLETE DATA RECEIVED ON TO THE
`REQUESTER- IN THE CLIENT IT PASSES IT ON TO THE COMMUNICATION APPLICATION,
`AND IN THE AGENT IT PASSES IT ON TO THE TCPIP SERVER 818
`
`FIG. 15
`
`\__800
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 18 of 29
`
`

`

`US 10,257,319 B2
`
`1
`SYSTEM PROVIDING FASTER AND MORE
`EFFICIENT DATA COMMUNICATION
`
`CROSS-REFERENCE TO RELATED
`APPLICATIONS
`
`The present application is a continuation application of
`U.S. non-provisional patent application Ser. No. 14/025, 109,
`filed Sep. 12, 2013, which is a divisional application of U.S.
`non-provisional patent application entitled "SYSTEM AND
`METHOD FOR PROVIDING FASTER AND MORE EFFI(cid:173)
`CIENT DATA COMMUNICATION" having Ser. No.
`12/836,059, filed Jul. 14, 2010 and issued as U.S. Pat. No.
`8,560,604 on Oct. 15, 2013, and claims priority to U.S.
`provisional patent application entitled "SYSTEM AND
`METHOD FOR REDUCING INTERNET CONGES(cid:173)
`TION," having Ser. No. 61/249,624, filed Oct. 8, 2009,
`which are hereby incorporated herein by reference in their
`entirety.
`
`FIELD OF THE INVENTION
`
`The present invention is related to Internet communica(cid:173)
`tion, and more particularly, to improving data communica(cid:173)
`tion speed and bandwidth efficiency on the Internet.
`
`BACKGROUND OF THE INVENTION
`
`There are several trends in network and Internet usage,
`which tremendously increase the bandwidth that is being 30
`used on the Internet. One such trend is that more and more
`video is being viewed on demand on the Internet. Such
`viewing includes the viewing of both large and short video
`clips. In addition, regular shows and full-featured films may
`be viewed on the Internet. Another trend that is increasing
`the traffic on the Internet is that Web sites (such as shopping
`portals, news portals, and social networks) are becoming
`global, meaning that the Web sites are serving people in
`many diverse places on the globe, and thus the data is
`traversing over longer stretches of the Internet, increasing 40
`the congestion.
`The increase in bandwidth consumption has created sev(cid:173)
`eral major problems, a few of which are described below:
`The problem for users-the current Internet bandwidth is
`not sufficient, and thus the effective 'speed' experienced by 45
`users is slow;
`The problem for content owners-the tremendous amount of
`data being viewed by users is costing large amounts of
`money in hosting and bandwidth costs; and
`The problem for Internet Service Providers (ISPs )-the 50
`growth in Internet traffic is requiring the ISPs to increase the
`infrastructure costs (communication lines, routers, etc.) at
`tremendous financial expense.
`The need for a new method of data transfer that is fast for
`the consumer, cheap for the content distributor and does not
`require infrastructure investment for ISPs, has become a
`major issue which is yet unsolved.
`There have been many attempts at making the Internet
`faster for the consumer and cheaper for the broadcaster.
`Each such attempt is lacking in some aspect to become a
`widespread, practical solution, or is a partial solution in that
`it solves only a subset of the major problems associated with
`the increase in Internet traffic. Most of the previous solutions
`require billions of dollars in capital investment for a com(cid:173)
`prehensive solution. Many of these attempts are lacking in
`that much of the content on the Internet has become dynami(cid:173)
`cally created per the user and the session of the user (this is
`
`5
`
`2
`what used to be called the "Web2.0" trend). This may be
`seen on the Amazon Web site and the Salesforce Web site,
`for example, where most of the page views on these Web
`sites is tailored to the viewer, and is thus different for any
`two viewers. This dynamic information makes it impossible
`for most of the solutions offered to date to store the content
`and provide it to others seeking similar content.
`One solution that has been in use is called a "proxy". FIG.
`1 is a schematic diagram providing an example of use of a
`10 proxy within a network 2. A proxy, or proxy server 4, 6, 8
`is a device that is placed between one or more clients,
`illustrated in FIG. 1 as client devices 10, 12, 14, 16, 18, 20,
`that request data, via the Internet 22, and a Web server or
`Web servers 30, 32, 34 from which they are requesting the
`15 data. The proxy server 4, 6, 8 requests the data from the Web
`servers 30, 32, 34 on their behalf, and caches the responses
`from the Web servers 30, 32, 34, to provide to other client
`devices that make similar requests. If the proxy server 4, 6,
`8 is geographically close enough to the client devices 10, 12,
`20 14, 16, 18, 20, and if the storage and bandwidth of the proxy
`server 4, 6, 8 are large enough, the proxy server 4, 6, 8 will
`speed up the requests for the client devices 10, 12, 14, 16,
`18, 20 that it is serving.
`It should be noted, however, that to provide a compre-
`25 hensive solution for Internet surfing, the proxy servers of
`FIG. 1 would need to be deployed at every point around the
`world where the Internet is being consumed, and the storage
`size of the proxy servers at each location would need to be
`near the size of all the data stored anywhere on the Internet.
`The abovementioned would lead to massive costs that are
`impractical. In addition, these proxy solutions cannot deal
`well with dynamic data that is prevalent now on the Web.
`There have been commercial companies, such as Akamai,
`that have deployed such proxies locally around the world,
`35 and that are serving a select small group of sites on the
`Internet. If all sites on the Web were to be solved with such
`a solution, the capital investment would be in the range of
`billions of dollars. In addition, this type of solution does not
`handle dynamic content.
`To create large distribution systems without the large
`hardware costs involved with a proxy solution, "peer-to-peer
`file sharing" solutions have been introduced, such as, for
`example, BitTorrent. FIG. 2 is a schematic diagram provid(cid:173)
`ing an example of a peer-to-peer file transfer network 50. In
`the network 50, files are stored on computers of consumers,
`referred to herein as client devices 60. Each consumer can
`serve up data to other consumers, via the Internet 62, thus
`taking the load of serving off of the distributors and saving
`them the associated costs, and providing the consumer
`multiple points from which to download the data, referred to
`herein as peers 70, 72, 74, 76, 78, thus increasing the speed
`of the download. However, each such peer-to-peer solution
`must have some sort of index by which to find the required
`data. In typical peer-to-peer file sharing systems, because the
`55 index is on a server 80, or distributed among several servers,
`the number of files available in the system is not very large
`( otherwise, the server costs would be very large, or the
`lookup time would be very long).
`The peer-to-peer file sharing solution is acceptable in file
`60 sharing systems, because there are not that many media files
`that are of interest to the mass (probably in the order of
`magnitude of millions of movies and songs that are of
`interest). Storing and maintaining an index of millions of
`entries is practical technically and economically. However,
`65 if this system were to be used to serve the hundreds of
`billions of files that are available on the Internet of today, the
`cost of storing and maintaining such an index would be
`
`NetNut Ltd. v. Bright Data Ltd.
`NetNut Exhibit 1001
`Page 19 of 29
`
`

`

`US 10,257,319 B2
`
`3
`again in the billions of dollars. In addition, these types of
`peer-to-peer file sharing systems are not able to deal with
`dynamic HTTP data.
`In conclusion, a system does not exist that enables fast
`transmission of most of the data on the Internet, that does not 5
`incur tremendous costs, and/or that provides only a very
`partial solution to the problem of Internet traffic congestion.
`Thus, a heretofore unaddressed need exists in the industry to
`address the aforementioned deficiencies and inadequacies.
`
`SUMMARY OF THE INVENTION
`
`4
`FIG. 2 is a schematic diagram providing a prior art
`example of a peer-to-peer file transfer network.
`FIG. 3 is a schematic diagram providing an example of a
`communication network in accordance with the present
`invention.
`FIG. 4 is a schematic diagram further illustrating a
`communication device of the communication network of
`FIG. 3.
`FIG. 5 is a schematic diagram further illustrating the
`10 memory of FIG. 4.
`FIG. 6 is a schematic diagram further illustrating elements
`of the acceleration application of FIG. 5, as well as com(cid:173)
`munication paths of the acceleration application.
`FIG. 7 is a chart further illustrating two of the main
`15 databases utilized within the communication network.
`FIG. 8 is a flowchart illustrating operation of the accel(cid:173)
`eration system initializer module.
`FIG. 9 is a flowchart further illustrating communication
`between different elements of the communication network.
`FIG. 10 is a flowchart continuing the flowchart of FIG. 9
`and focused on agent response to the HTTP request.
`FIG. 11 is a flowchart continuing the flowchart of FIG. 10,
`which illustrates actions taken upon receipt of the list of
`peers, or single peer listing, from the agent.
`FIG. 12 is a flowchart illustrating steps taken by an agent,
`client, or peer to determine whether a certain HTTP request
`is still valid.
`FIG. 13 is a flowchart outlining operation of the accel(cid:173)
`eration server.
`FIG. 14 is a flowchart further illustrating TCPIP accel(cid:173)
`eration in accordance with an alternative embodiment of the
`invention.
`FIG. 15 is a flowchart further illustrating TCPIP accel(cid:173)
`eration in accordance with an alternative embodiment of the
`invention, detailing the communication between the client
`and the TCPIP server (read and write commands) after the
`connect phase has completed successfully.
`
`The present system and method provides for faster and
`more efficient data communication within a communication
`network. Briefly described, in architecture, one embodiment
`of the system, among others, can be implemented as follows.
`A network is provided for accelerating data communication,
`wherein the network contains: at least one client communi(cid:173)
`cation device for originating a data request for obtaining the 20
`data from a data server; at least one agent communication
`device which is assigned to the data server for receiving the
`data request from the client communication device, wherein
`the agent keeps track of which client communication devices
`have received responses to data requests from the assigned 25
`data server; at least one peer communication device for
`storing portions of data received in response to the data
`request by the at least one client communication device,
`wherein the portions of data may be transmitted to the at
`least one client communication device upon request by the 30
`client communication device; and at least one acceleration
`server for deciding which agent communication device is to
`be assigned to which data server and providing this infor(cid:173)
`mation to the at least one client communication device.
`The present system and method also provides a commu- 35
`nication device within a network, wherein the communica(cid:173)
`tion device contains: a memory; and a processor configured
`by the memory to perform the steps of: originating a data
`request for obtaining data from a data server; being assigned
`to a data server, referred to as an assigned data server; 40
`receiving a data request from a separate device within the
`network, and keeping track of which client communication
`devices within the network have received responses

This document is available on Docket Alarm but you must sign up to view it.


Or .

Accessing this document will incur an additional charge of $.

After purchase, you can access this document again without charge.

Accept $ Charge
throbber

Still Working On It

This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.

Give it another minute or two to complete, and then try the refresh button.

throbber

A few More Minutes ... Still Working

It can take up to 5 minutes for us to download a document if the court servers are running slowly.

Thank you for your continued patience.

This document could not be displayed.

We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.

Your account does not support viewing this document.

You need a Paid Account to view this document. Click here to change your account type.

Your account does not support viewing this document.

Set your membership status to view this document.

With a Docket Alarm membership, you'll get a whole lot more, including:

  • Up-to-date information for this case.
  • Email alerts whenever there is an update.
  • Full text search for other cases.
  • Get email alerts whenever a new case matches your search.

Become a Member

One Moment Please

The filing “” is large (MB) and is being downloaded.

Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.

Your document is on its way!

If you do not receive the document in five minutes, contact support at support@docketalarm.com.

Sealed Document

We are unable to display this document, it may be under a court ordered seal.

If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.


Access Government Site

We are redirecting you
to a mobile optimized page.





Document Unreadable or Corrupt

Refresh this Document
Go to the Docket

We are unable to display this document.

Refresh this Document
Go to the Docket