US010257319B2
`
`a2) United States Patent
`US 10,257,319 B2
`(0) Patent No.:
`Apr. 9, 2019
`(45) Date of Patent:
`Shribmanet al.
`
`(54) SYSTEM PROVIDING FASTER AND MORE
`EFFICIENT DATA COMMUNICATION
`
`(56)
`
`References Cited
`US. PATENT DOCUMENTS
`
`(71) Applicant: WEB SPARK LTD., Netanya (IL)
`
`(72)
`
`Inventors: Derry Shribman, Tel Aviv (IL); Ofer
`Vilenski, Moshav Hadar Am (IL)
`
`3,922,494 A
`4,937,781 A
`
`LL/1975 Cooperet al.
`6/1990 Leeetal.
`(Continued)
`FOREIGN PATENT DOCUMENTS
`
`(73) Assignee: WEB SPARK LTD., Netanya (IL)
`
`CN
`CN
`
`(*) Notice:
`
`Subject to any disclaimer, the term ofthis
`patent is extended or adjusted under 35
`U.S.C. 154(b) by 0 days.
`
`(21) Appl. No.: 15/957,945
`
`(22)
`
`Filed:
`
`Apr. 20, 2018
`
`(65)
`
`.
`.
`Prior Publication Data
`US 2018/0241851 Al
`Aug. 23, 2018
`
`101075242 A
`11/2007
`101179389 A
`5/2008
`(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 — MayPatents Ltd. c/o
`Dorit Shem-Tov
`
`Related U.S. Application Data
`:
`:
`.
`(60) Continuation of application No. 14/025,109, filed on
`Sep. 12, 2013, whichis a division of application No.
`(Continued)
`
`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
`Int. Cl.
`provides a list of agents to use for this IP address. The
`(2006.01)
`HO4L 29/06
`communication request is sent to the agents. One or more of
`(2006.01)
`FOAL 29/08
`
`
`HOAL 12/24 the agents respond withalist of peers that have previously(2006.01)
`(52) U.S. CL.
`seen someorall of the content which is the response to this
`CPC ow. HOAL 67/42 (2013.01); HO4L 41/046
`request (after checking whetherthis data is still valid). The
`(2013.01); HO4L 67/1002 (2013.01);
`client then downloads the data from these peers in parts and
`(Continued)
`in parallel, thereby speeding up the Web transfer, releasing
`.
`.
`'
`congestion from the Web by fetching the information from
`(58) Field of Classification Search
`multiple sources, and relieving traffic from Web servers by
`CPC..... HO4L 67/42; HO4L 41/046; HO4L 67/108;
`offloading the data transfers from them to nearby peers.
`HO4L 67/22
`
`(51)
`
`(Continued)
`
`29 Claims, 15 Drawing Sheets
`
`SULENT
`DEVICEa
`
`
`
`
`
`Data Co Exhibit 1001
`Data Co Exhibit 1001
`Data Co v. Bright Data
`
`Data Cov. Bright Data
`
`

`

`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 FOAL 67/108 (2013.01); HO4L 67/1023
`(2013.01); HO4L 67/1063 (2013.01); HO4L
`67/22 (2013.01); HOAL 67/2814 (2013.01);
`HOAL 67/2819 (2013.01); HO4L 67/02
`(2013.01)
`
`(58) Field of Classification Search
`USPC soos eeeeeessssnieeeseesssssnneeestessnnineeeesststes“ 709/202
`See application file for complete search history.
`
`(56)
`
`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 BI
`6,868,453 B1*
`
`9/2006 Fang woe HO4L 67/104
`709/219
`9/2006 YU vececceeeesssseen GO6F 17/30902
`709/227
`
`2006/0212542 A1*
`
`2006/0212584 AL*®
`
`2006/0259728 Al
`2007/0073878 Al
`2007/0100839 Al
`2007/0156855 Al
`2007/0226810 Al
`2007/0239655 Al
`2008/0008089 Al
`soosorooaae Al
`POeee et
`2008/0222291 Al
`2008/0235391 Al
`tosooeeias ‘i
`3009/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*
`
`11/2006 Chandrasekaran et al.
`3/2007 Issa
`5/2007 Kim
`7/2007 Johnson
`9/2007 Hotti
`10/2007 Agetsuma
`1/2008 Bornstein etal.
`soooe Muraoka
`aoe vanssch
`9/2008 Welleret al.
`9/2008 Painteret al.
`Iooooe vertes
`ee
`2/2009 Armon-Kest
`7/2009 Hluchyj
`8/2009 Yokokawaet al.
`11/2009 Wongetal.
`12/2009 Chalouhiet al.
`3/2010 Tucker etal.
`4/2010 Khalid et al.
`4/2010 Zuckerman
`11/1996 Sherwoodet al.
`6/2010 Gladwin et al.
`5/1998 Balmer
`6/2010 Manku
`5/2000 Kato et al.
`9/2010 Narayanan et al.
`11/2000 Kawaguchi
`11/2010 Vepsalainen
`1/2001 Guoet al.
`12/2010 Asatiet al.
`10/2002 Chang
`2/2011 Zaid we HO4L 63/0407
`3/2005 Watanabe......... GO6F 17/30861
`709/228
`707/E17.107
`7,120,666 B2 2011/0066924 Al=3/2011 Dorso10/2006 McCanneetal.
`
`
`7,203,741 B2
`4/2007 Marcoetal.
`2011/0087733 Al
`4/2011 Shribman et al.
`7,558,942 Bl
`7/2009 Chen et al.
`2011/0128911 Al
`6/2011 Shaheen
`
`7,788,378 B2 2011/0314347 Al=12/2011 Nakanoet al.8/2010 Rao
`
`7,818,430 B2
`10/2010 Zuckerman
`2012/0099566 Al
`4/2012 Laine etal.
`7,865,585 B2
`1/2011 Samuels et al.
`2012/0124173 Al
`§/2012 De et al.
`7,890,547 B2
`2/2011 Hotti
`2012/0124239 Al
`5/2012 Shribman etal.
`7,970,835 B2
`6/2011 St. Jacques
`2012/0254370 Al
`10/2012 Bacher
`8,135,912 B2
`3/2012 Shribman et al.
`2012/0254456 Al
`10/2012 Visharam etal.
`
`8,171,101 B2 2013/0007253 Al=1/2013 Li5/2012 Gladwinet al.
`
`8,479,251 B2
`7/2013 Feinleib etal.
`2013/0157699 Al
`6/2013. Talwar
`8,499,059 B2
`7/2013 Stoyanov
`2013/0166768 Al
`6/2013 Gouacheetal.
`8,595,786 B2* 11/2013 Choi vice HO4L 1/005
`2013/0201316 Al
`8/2013 Binderet al.
`75/15]
`2013/0272519 Al
`10/2013 Huang
`2013/0326607 Al
`12/2013 Feng
`2014/0082260 Al
`3/2014 Ohetal.
`2014/0301334 Al
`10/2014 Labranche
`2014/0376403 Al
`12/2014 Shao
`2015/0033001 Al
`1/2015 Ivanov
`2015/0067819 Al
`3/2015 Shribman etal.
`2015/0358648 Al
`12/2015 Limberg
`2016/0021430 Al
`1/2016 LaBoscoet al.
`
`‘1/2014 Resch etal.
`8,769,035 B2
`5/2014 Shribman etal.
`8,719,505 B2
`9/2014 Owenetal.
`8,832,179 B2
`12/2015 Shribman etal.
`9,201,808 B2
`2/2016 Gouge
`9,253,164 B2
`6/2018 Shribman et al.
`9,990,295 B2
`10/2001 Rabenkoetal.
`2001/0033583 Al
`1/2002 Garcia-Luna-Aceveset al.
`2002/0007413 Al
`5/2002 Rhodes
`2002/0065930 Al
`6/2002 Narlikar etal.
`2002/0069241 Al
`8/2002 Shuet al.
`2002/0120874 Al
`9/2002 Potekhin
`2002/0123895 Al
`9/2002 Marcoet al.
`2002/0133621 Al
`1/2003 Harrow et al.
`2003/0009518 Al
`1/2003 Chan etal.
`2003/0009583 Al
`4/2003 Harrow et al.
`2003/0074403 Al
`5/2003 Kageyama
`2003/0097408 Al
`6/2003 Shuet al.
`2003/0115364 Al
`9/2003 Wanget al.
`2003/0174648 Al
`10/2003 Raju et al.
`2003/0200307 Al
`10/2003 Hudsonet al.
`2003/0204602 Al
`11/2003 Jayaraman et al.
`2003/0210694 Al
`5/2004 ‘Yeageret al.
`2004/0088646 Al
`6/2004 Vert et al.
`2004/0107242 Al
`OTHER PUBLICATIONS
`2004/0254907 Al=12/2004 Crowetal.
`2004/0264506 Al
`12/2004 Furukawa
`Notice of Preliminary Rejection in KR Application No. 10-2012-
`2005/0015552 Al
`1/2005 Soet al.
`7011711 dated Jul. 15, 2016.
`2005/0022236 Al
`1/2005 Ito et al.
`2005/0097441 Al*
`5/2005 Herbach ou... GO6F 21/10
`Kei Suzuki, a study on Cooperative Peer Selection Method in P2P
`715/229
`Video Delivery, vol. 109, No. 37, IEICE Technical Report, The
`Institute of Electronics, Information and Communication Engineers,
`May 14, 2009.
`
`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
`
`2005/0228964 Al
`2006/0036755 Al
`
`10/2005 Sechrestet al.
`2/2006 Abdullah
`
`

`

`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 YouTubevideoclip entitle “nVpn.net | 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 andavailable as of at least 2011 <https://
`www.youtube.com/watch?v=yRRYpFLbKNU>.
`SpyEye, https://www.symantec.com/security-center/writeup/20 10-
`020216-0135-9; http://securesql.info/riskyclouds/spyeye-user-
`manual; knownasofat 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 andavailable as of at least 2011, <https://
`www.youtube.com/watch?v=ulwkf1sOfdA andhttps://www.youtube.
`com/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.com/-bala/papers/wosn09. pdf.
`“Slice Embedding Solutions for Distributed Service Architectures”—
`Esposito et al., Boston University, Computer Science Dept., Oct.
`2011 http://www.cs.bu.edu/techreports/pdf/20 1 1-025-slice-embedding.
`pdf.
`International Search Report of PCT/US2010/034072 dated Jul. 1,
`2010.
`YouTubevideo clip entitled “nVpn.net | Double your Safety and use
`Socks5 + nVpn”<https:/Awww.youtube.com/watch?v=LOHct2kSnn4>.
`YouTube video clip entitled “Andromeda” <https://www.youtube.
`com/watch?v=yRRYpFLbKNU>.
`YouTube video clip entitled “Change Your Country IP Address &
`Location with Easy Hide IP Software” <https://www.youtube.com/
`watch?v=ulwkflsOfdA and https://www.youtube.com/watch?v=
`iFEMT-o9DTe>.
`
`* cited by examiner
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 1 of 15
`
`US 10,257,319 B2
`
`
`CUIENT
`
`DEVICE
`
`
`ig
`
`
`
`CRIENT
`
`
`DEVICE
`a2
`
`
`CLIENT
`
`
`DEVICE
`
`
`
`
`CLIENT
`
`BEVECE
`
`As
`
`
`
`anna
`
`.
`
`“PROXY
`SERVER
`
`
`da
`
`
`
`
`CLIENT
`
`
`DEVICE
`
`a8
`
`CLIENT
`
`
`DEVICE
`
`28
`
`FIG. 1
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 2 of 15
`
`US 10,257,319 B2
`
`SERVER
`BO
`
`
`
`
`
`CLYENT
`DEVICE
`80
`
`ye
`’
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 3 of 15
`
`US 10,257,319 B2
`
`ac
`
`ACCELERATION
`SERVER
`4182
`
`STORAGE
`DEVICE
`154
`
`WEB
`SERVERAgZ
`
`CLIENT
`482
`
`’
`
`PEER
`216
`
`PEER
`
`FIG. 3
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 4 of 15
`
`US 10,257,319 B2
`
`INTERNET
`BROWSER
`214
`
`ACCELERATION
`
`APPLICATION
`
`SOFTWARE
`
`CONFIGURATION
`DATABASE
`
`210
`
`200
`
`(\
`
`PROCESSOR
`202
`
`STORAGE DEVICE
`208
`
`MEMORY
`
`LOCALINTERFACE 250
`
`0 DEVICES
`240
`
`FIG. 4
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 5 of 15
`
`US 10,257,319 B2
`
`ACCELERATION
`OTHER
`INTERNET
`APPLICATION|
`
`LEVEL APPLICATIONS||APPLICATIONBROWSER
`
`270
`214
`216
`220
`
`INTERMMEDIATE DRIVER
`272
`
`COMMUNICATION
`STACKS
`264
`
`
`
`210
`
`OPERATING
`SYSTEM
`LEVEL
`260
`
`D
`
`OPERATING
`SYSTEM
`230
`
`MEMORY
`
`FIG. 5
`
`

`

`U.S. Patent
`
`Apr. 9, 2019
`
`Sheet 6 of 15
`
`US 10,257,319 B2
`
`
`
`ACCELERATION
`APPLICATION
`220
`
`ACCELERATION
`SYSTEM INITIALIZER
`MODULE
`
`CLIENT MODULE
`224
`
`PEER MODULE
`226
`
`AGENT MODULE
`228
`
`CONFIGURATION
`DATABASE
`
`
`
`
`222
`
`
`280
`
`CACHE DATABASE
`282
`
`
`
`STORAGE DEVICE
`
`208
`
`FIG. 6
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 7 of 15
`
`US 10,257,319 B2
`
`f9OT
`
` kUaSNOGapO3H9
`
`PEOMahhEESely
`
`aNTHO/INCNOWdi1NZDv/99T
`
`1SVia|__SuRaapSTETaeee
`
`aMSeReMBLae
`
`
`
`feel||
`
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 8 of 15
`
`US 10,257,319 B2
`
`300
`
`D
`
`INITIALIZER LAUNCHES AGENT
`MODULE AND PEER MODULE
`
`FIG. 8
`
`INITIALIZER SIGNS UP WITH
`ACCELERATION SERVER
`302
`
`DETERMINE IF THERE IS AN
`UPDATED VERSION OF
`APPLICATION?
`304
`
`INITIALIZER REDIRECTS
`OUTGOING NETWORK TRAFFIC
`306
`
`310
`
`INITIALIZER LAUNCHES CLIENT
`MODULE AND CONFIGURES
`CLIENT MODULE TO INTERCEPT
`ALL OUTGOING NETWORK
`COMMUNICATIONS
`308
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 9 of 15
`
`US 10,257,319 B2
`
`352
`
`APPLICATION ON CLIENT INITIATES
`REQUEST FOR A RESOURCE ONA
`NETWORK
`
`350
`
`RESOURCE REQUESTIS INTERCEPTED BY
`THE CLIENT MODULE
`354
`
`CLIENT MODULE LOOKSUP 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
`
`ACCELERATION SERVER PREPARESA LIST
`OF AGENTSTHAT MAYBE SUITABLE TO
`HANDLE THE REQUEST FROM THIS IP
`ADDRESS
`358
`
`360
`
`CLIENT SENDS ORIGINAL REQUEST TO ALL
`AGENTSIN THE LIST RECEIVED FROM
`ACCELERATION SERVER TO DETERMINE
`WHICH AGENTIN THE LIST IS BEST SUITED
`TO ASSIST WITH THE REQUEST
`
`FIG. 9
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 10 of 15
`
`US 10,257,319 B2
`
`
`
`
`EACH AGENT THAT RECEIVES CLIENT REQUEST RESPONDSTO CLIENT WITH
`WHETHER IT HAS INFO. REGARDING REQUEST THAT CAN ASSIST CLIENT TO
`
`
`DOWNLOAD REQUESTEDINFO. FROM PEERS IN NETWORK 382
`
`
`CLIENT SELECTS SPECIFIC AGENT
`
`
`CLIENT NOTIFIES SELECTED AGENT OF USE FOR REQUESTAND NOTIFIES OTHER
`AGENTS OF LACK OF USE 386
`
`
`
`
`CLIENT FORWARDS SELECTED AGENT REQUESTFORFIRST X NUMBEROF
`CHUNKS
`388
`
`DOES SELECTED AGENTHAVEINFO. REGARDING
`REQUESTED CHUNKSAND IS INFO. STILL VALID?
`390
`
`
`
`
`
`
`IF INFO. STILL VALID, SELECTED
`AGENT RESPONDSTOCLIENT WITH
`CHECKSUM OF CHUNK,LIST OF
`PEERS THAT CONTAIN CHUNKS, AND
`
`HEADERS
`
`392
`—
`
`LIST OF PEERS FOR EACH CHUNK IS
`SORTED BY GEOGRAPHICAL
`PROXIMITY TO REQUESTING CLIENT
`394
`
`
`
`LIST OF CLOSEST PEERS TO CLIENT
`iS SENT TO CLIENT
`396
`
`
`
`
`
`
`SELECTED AGENT SENDS REQUEST
`DIRECTLY TO SERVER
`400
`
`
`
`
`
`
`FROM SERVERIN ITS DATABASE
`
`
`402
`
`SELECTED AGENT PREPARES
`
`WHERE SEpONse INCLUDES
`RESPONSE (LIST) FOR CLIENT,
`CHECKSUM OF CHUNK, HEADERS,
`AND PROVIDES ITSELF AS THE ONLY
`PEER FOR THESE CHUNKS
`
`404
`
`LIST IS FORWARDED BACK TO
`CLIENT
`406
`
`FIG. 10
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 11 of 15
`
`US 10,257,319 B2
`
`422
`
`CLIENT RECEIVES RESPONSE FROM THE AGENT AND FOR EACH OF X CHUNKS,
`CLIENT SENDS A REQUEST TO EACH OF THE PEERSLISTED FOR THE CHUNK TO
`DOWNLOADTHE DATA OF THAT CHUNK
`
`PEERS RESPOND REGARDING WHETHER THEYSTILL HAVE THE DATA OF THE
`CHUNK
`424
`
`CLIENT SELECTS QUICKEST PEER WITH DATA OF THE CHUCK 426
`
`CHOSEN PEER SENDS CHUNK TO CLIENT
`
`CLIENT STORES CHUNKSIN ITS CACHE FOR FUTURE USE
`
`2
`428
`
`3
`430
`
`IF ANY CHUNKS WERE NOT LOADED FROM ANYOF THE PEERS, CLIENT REQUESTS
`2
`432
`CHUNKS AGAIN FROM AGENT
`
`CLIENT ACKNOWLEDGESTO THE AGENT WHICH OF THE CHUNKSIT RECEIVED
`PROPERLY
`434
`
`AGENT LOOKS UP CHUNKSIN DATABASE OF AGENT AND ADDS CLIENT TO LIST
`OF PEERS FOR THESE CHUNKS
`436
`
`CLIENT PASSES DATA TO APPLICATION OF CLIENT THAT MADE REQUEST438
`
`CLIENT CHECKS WHETHER ALL OF THE CHUNKS FOR REQUEST WERE RECEIVED
`440
`
`\ 4
`
`20
`
`FIG. 11
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 12 of 15
`
`US 10,257,319 B2
`
`500
`
`
`
`LOOK UP HTTP REQUESTIN
`DATABASE, GET ITS HTTP HEADERS
`
`
`
`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
`
`
`
`502
`
`510
`512
`
`
`
`
`
`
`IS DATA CACHED FOR THIS
`
`
`SEND HTTP CONDITIONAL REQUE
`REQUEST STILL VALID?
`
`
`
`TO THE WEB SERVER, TO CHECK IF
`506
`
`THE DATA STOREDFOR THIS
`
`REQUEST IS STILL VALID
`
`
`
`
`
`RETURN "VALID™
`IS CACHED DATA STILL VALID?
`508
`
`
`514
`
`
`
`RETURN "INVALID"
`
`FIG. 12
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 13 of 15
`
`US 10,257,319 B2
`
`ar
`
`CHECK "KEEP ALTVE” WITH NETWORK
`ELEMENTS (CLIENTS/AGENTS/PEERS),
`A
`UPDATE DATABASE AS TOTHEIR STATUS
`
`(ON-LINE / OFF-LINE)
`
`SIGN_UP
`
`
`
`
`FOR THE NEXT 5 ACTIVE AGENTS
`
`THAT HAS THE IPADDRESSTHAT
`
`
`IS CLOSEST TOTHE TARGET
`SERVERIP
`
`(EG 192.166.3.103 IS CLOSER TO
`192. 166.3.212 THEN TO
`192.167.3.104)
`
`
`FIG. 13
`
`

`

`U.S. Patent
`
`Apr.9, 2019
`
`Sheet 14 of 15
`
`US 10,257,319 B2
`
`NETWORK APPLICATION ON CLIENT ISSUES REQUEST TO
`CONNECT TO A TCPIP SERVER
`
`601
`
`600
`
`CONNECTION REQUEST IS INTERCEPTED BY
`ACCELERATION APPLICATION ON THE CLIENT
`602
`
`CLIENT MODULE SENDS THE IP ADDRESS OF THE TCPIP
`SERVER TO THE ACCELERATION SERVER TO OBTAIN AN
`AGENT LIST
`604
`
`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
`
`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
`
`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
`
`612
`
`AGENT ISSUES A TCPIP CONNECT WITH THE TCPIP
`SERVER TO THE IP AND PORT RECEIVED FROM THE CLIENT
`
`FIG. 14
`
`

`

`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
`
`
`
`
`
`
`CALCULATED FOR EACH CHUNK 804
`
`| | DATA OF WRITE COMMANDIS BROKENUP INTO CHUNKS AND CHECKSUMS ARE
`
`
`
`
`
`
`
`ACCELERATION APPLICATION LOOKS UP EACH CHUNK’S CHECKSUM IN ITS CACHE
`DATABASE 806
`
`
`
`
`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
`
`ASRATIONROPLIOASONTHAT
`RECEIVED THE LIST OF PEERS CONNECTS
`TO AT LEAST ONE OF THE PEERS AND
`DOWNLOADS THE CHUNK FROM IT 814
`
`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
`
`
`
`
`
`
`
`
`
`
`a HAVEALLCHUNKDATABEEN TRANSFERREDTOTHEOTHERSIDE? 816
`AND IN THE AGENT IT PASSES IT ON TO THE TCPIP SERVER 818
`XN 800
`
`
`
`ACCELERATION APPLICATION PASSES ON THE COMPLETE DATA RECEIVED ON TO THE
`REQUESTER — IN THE CLIENT IT PASSES IT ON TO THE COMMUNICATION APPLICATION,
`
`FIG. 15
`
`

`

`US 10,257,319 B2
`
`1
`SYSTEM PROVIDING FASTER AND MORE
`EFFICIENT DATA COMMUNICATION
`
`CROSS-REFERENCE TO RELATED
`APPLICATIONS
`
`20
`
`25
`
`40
`
`45
`
`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 MOREEFFI-
`
`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 claimspriority to US.
`provisional patent application entitled “SYSTEM AND
`METHOD FOR REDUCING INTERNET CONGES-
`
`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-
`tion, and moreparticularly, to improving data communica-
`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
`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
`the congestion.
`The increase in bandwidth consumption has created sev-
`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
`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
`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 methodofdata 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 problemsassociated with
`the increase in Internettraffic. Mostof the previous solutions
`require billions of dollars in capital investment for a com-
`prehensive solution. Many of these attempts are lacking in
`that muchofthe content on the Internet has become dynami-
`cally created per the user and the session of the user (this is
`
`2
`what used to be called the “Web2.0” trend). This may be
`seen on the Amazon Website and the Salesforce Website,
`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 makesit impossible
`for most of the solutions offered to date to store the content
`and provide it to others seeking similar content.
`Onesolution that has been in useis called a “proxy”. FIG.
`1 is a schematic diagram providing an example of use of a
`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
`Webservers 30, 32, 34 from which they are requesting the
`data. The proxyserver4, 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 enoughtothe client devices 10, 12,
`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-
`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, andthe storage
`size of the proxy servers at each location would need to be
`near the sizeofall 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,
`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
`hardwarecosts 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-
`ing an example of a peer-to-peerfile 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 downloadthe 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 somesort of index by which to find the required
`data. In typical peer-to-peerfile sharing systems, because the
`index is on a server 80, or distributed amongseveral servers,
`the numberoffiles 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
`sharing systems, because there are not that many mediafiles
`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,
`if this system were to be used to serve the hundreds of
`billionsof files that are available on the Internet of today, the
`cost of storing and maintaining such an index would be
`
`

`

`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
`incur tremendous costs, and/or that provides only a very
`partial solution to the problem of Internettraffic congestion.
`Thus, a heretofore unaddressed need exists in the industry to
`address the aforementioned deficiencies and inadequacies.
`
`SUMMARY OF THE INVENTION
`
`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, amongothers, can be implementedas follows.
`Anetwork is provided for accelerating data communication,
`wherein the network contains: at least one client communi-
`
`cation device for originating a data request for obtaining the
`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
`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
`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-
`mation to the at least one client communication device.
`
`The present system and method also provides a commu-
`nication device within a network, wherein the communica-
`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;
`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 to data
`requests from the assigned data server; and storing portions
`of data received in response to the originated data request,
`wherein the portions of data may be transmitted to commu-
`nication device upon request by the communication device.
`Other systems, methods, features, and advantages of the
`present invention will be or become apparent to one with
`skill in the art upon examination of the following drawings
`and detailed description. It is intended that all such addi-
`tional
`systems, methods,
`features, and advantages be
`included within this description, be within the scope of the
`present invention, and be protected by the accompanying
`claims.
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`
`Manyaspects of the invention can be better understood
`with reference to the following drawings. The components
`in the drawingsare not necessarily to scale, emphasis instead
`being placed upon clearly illustrating the principles of the
`present invention. Moreover, in the drawings,like reference
`numerals designate corresponding parts throughout the sev-
`eral views.
`FIG. 1 is a schematic diagram providing a prior art
`example of use of a proxy within a network.
`
`10
`
`15
`
`20
`
`25
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`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
`memory of FIG. 4.
`FIG.6 is a schematic diagram furtherillustrating elements
`of the acceleration application of FIG. 5, as well as com-
`munication paths of the acceleration application.
`FIG. 7 is a chart further illustrating two of the main
`databases utilized within the communication network.
`
`FIG. 8 is a flowchart illustrating operation of the accel-
`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-
`eration server.
`
`FIG. 14 is a flowchart further illustrating TCPIP accel-
`eration in accordance with an alternative embodimentofthe
`invention.
`FIG. 15 is a flowchart further illustrating TCPIP accel-
`eration in accordance with an alternative embodimentofthe
`
`invention, detailing the communication between the client
`and the TCPIP server (read and write commands) after the
`connect phase has completed successfully.
`
`DETAILED DESCRIPTION
`
`The present system and method provides for faster and
`more efficient data communication within a communication
`
`network. An example of such a communication network 100
`is provided by the schematic diagram of FIG. 3. The network
`100 of FIG. 3 contains multiple communication devices.
`Dueto functionality provided by software stored within each
`communication device, which may be the same in each
`communication device, each communication device may
`serve as a client, peer, or agent, depending upon require-
`ments of the network 100, as is described in detail herein.It
`should be noted that a detailed description of a communi-
`cation device is provided with regard to the description of
`FIG.4.
`
`Returning to FIG. 3, the exemplary embodiment of the
`network 100 illustrates that one of the communication
`devices is functioning as a client 102. The client 102 is
`capable of communication with one or more peers 112, 114,
`116 and one or more agents 122. For exemplary purposes,
`the network contains three peers and one agent, although it
`is noted that a client can communicate with any numberof
`agents and peers.
`The communication network 100 also contains a Web
`server 152. The Web server 152 is the server from which the
`
`for
`requesting information and may be,
`client 102 is
`example, a typical HTTPserver, such as those being used to
`deliver content on any of the many such servers on the
`Internet. It should be noted that the server 152 is not limited
`
`

`

`US 10,257,319 B2
`
`5
`to being an HTTPserver. In fact, if a different communica-
`tion protocol is used within the communication network, the
`server may be a server capable of handling a different
`protocol. It should also be noted that while the present
`description refers to the use of HTTP, the present invention
`mayrelate to any other communication protocol and HTTP
`is not intended to be a limitation to the present invention.
`The communication network 100 further contains an
`acceleration server 162 having an acceleration server storage
`device 164. As is described in more detail herein,
`the
`acceleration server storage device 164 has contained therein
`an acceleration server database. The acceleration server
`
`database stores Internet protocol (IP) addresses of commu-
`nication devices within the communication network 100
`
`having acceleration software stored therein. Specifically, the
`acceleration server database contains stored therein a list of
`
`communication d