US7370110B2 - Method and system for operating a network server to discourage inappropriate use - Google Patents

Method and system for operating a network server to discourage inappropriate use Download PDF

Info

Publication number
US7370110B2
US7370110B2 US09/837,319 US83731901A US7370110B2 US 7370110 B2 US7370110 B2 US 7370110B2 US 83731901 A US83731901 A US 83731901A US 7370110 B2 US7370110 B2 US 7370110B2
Authority
US
United States
Prior art keywords
packet
file
information
delay period
server
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related, expires
Application number
US09/837,319
Other versions
US20020103915A1 (en
Inventor
Gary Stephen Shuster
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Preferential Networks Ip LLC
Original Assignee
Hoshiko LLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=26893838&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=US7370110(B2) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Priority to US09/837,319 priority Critical patent/US7370110B2/en
Application filed by Hoshiko LLC filed Critical Hoshiko LLC
Assigned to IDEAFLOOD, INC. reassignment IDEAFLOOD, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SHUSTER, GARY STEPHEN
Publication of US20020103915A1 publication Critical patent/US20020103915A1/en
Assigned to HOSHIKO, LLC reassignment HOSHIKO, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: IDEAFLOOD, INC.
Priority to US12/114,215 priority patent/US7797408B2/en
Application granted granted Critical
Publication of US7370110B2 publication Critical patent/US7370110B2/en
Priority to US12/881,082 priority patent/US7966416B2/en
Priority to US13/161,063 priority patent/US8171113B2/en
Priority to US13/457,279 priority patent/US8577994B2/en
Assigned to HOSHIKO LLC reassignment HOSHIKO LLC CORRECTIVE ASSIGNMENT TO CORRECT THE ASSIGNEE NAME PREVIOUSLY RECORDED ON REEL 018498 FRAME 0337.ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNEE'S NAME IS HOSHIKO LLC,NOT HOSHIKO,LLC Assignors: IDEAFLOOD, INC.
Assigned to INTELLECTUAL VENTURES I LLC reassignment INTELLECTUAL VENTURES I LLC MERGER (SEE DOCUMENT FOR DETAILS). Assignors: HOSHIKO LLC
Assigned to INTELLECTUAL VENTURES ASSETS 27 LLC reassignment INTELLECTUAL VENTURES ASSETS 27 LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: INTELLECTUAL VENTURES I LLC
Assigned to PREFERENTIAL NETWORKS IP, LLC reassignment PREFERENTIAL NETWORKS IP, LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: INTELLECTUAL VENTURES ASSETS 27 LLC
Adjusted expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/26Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
    • H04L47/266Stopping or restarting the source, e.g. X-on or X-off
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/11Identifying congestion
    • H04L47/115Identifying congestion using a dedicated packet
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/36Flow control; Congestion control by determining packet size, e.g. maximum transfer unit [MTU]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/06Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40Network security protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/329Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/50Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Definitions

  • the present invention relates to methods and systems for operating a server connected to a wide area network, such as the Internet, and particularly to methods of serving files in response to requests from users.
  • Publicly accessible servers particular servers that provide storage space for no charge, such as servers on free web hosts, are often used inappropriately in violation of agreed terms of service for the distribution of media files such as large software, music, and video files.
  • Such media files tend to be much larger than the files that the host service is intended for. Consequently, the storage and exchange of these inappropriate files demands greater bandwidth than more appropriate uses, thereby choking and discouraging the uses that the web server is intended to serve.
  • these types of media files often contain illegally copied content, that may lend an undesirable taint to operators of web hosting services who do not wish to be perceived as encouraging copyright violations.
  • Another injury caused by such inappropriate use is disproportionately heavy use of the server by relatively few users, thereby reducing the number of subscribers that the hosting service attracts.
  • a related problem is the devaluation of advertising space as a result of people downloading such files, and the potential for alienating advertisers who have purchased advertising space on the servers serving such files.
  • a method and system is needed to discourage inappropriate use of publicly available, network-connected server space, without adversely affecting intended uses of the server space or restricting public access.
  • the method and system should integrate seamlessly and cost-effectively with existing network protocols and server software and hardware.
  • a method and system for operating a network server are provided, whereby the rate at which files are served from the server storage device to public users on the network depends primarily on the file size, and secondarily on other parameters, such as server load and file type.
  • the transfer rate of each requested file is controlled and varied during transfer of the file.
  • the method is particularly suitable for application to every file transferred from the server.
  • the method may be applied only to selected files or types of files.
  • the transfer rate is progressively slowed (decelerated) as each file is transferred from or to the network. Consequently, relatively small files are not noticeably delayed, while very large files may be very substantially delayed relative to the rate at which they would be transferred without implementation of the invention.
  • the delaying action serves to preserve system bandwidth for transfer of smaller files, and further discourages users from requesting the transfer of large files, thereby preserving system bandwidth to an even greater degree.
  • the response of the server to appropriate uses can be greatly improved at the same time system performance is deliberately degraded for inappropriate uses.
  • the method is easy to implement in a variety of different systems while adding minimal system overhead.
  • the server is connected through a network, such as the Internet, to a plurality of client devices, and is configured to transfer information between any selected one of the client devices and a memory for static storage of information.
  • the method comprises the steps of receiving a request to transfer a file between the memory and one of the plurality of client devices, removing a packet comprising a defined number of information bits from the file, transferring the packet between the memory and the client device per the request, then pausing for a defined delay period, and repeating the removing, transferring, and pausing steps in order until all of the file has been transferred.
  • the method further comprises increasing the defined delay period after each execution of a packet transfer cycle (or after a selected number of cycles), thereby discouraging the transfer of unacceptably large files.
  • the delay period may be initiated, and the amount of increase or other adjustment to the delay period during the transfer cycle may be controlled, by selected a predetermined value from a table, or by calculating a value based on variable input parameters such as the file size, server load, network response time, and number of transfer requests from the client device within a defined prior period.
  • the number of information bits in the packet that is, the packet size—may have a value that is similarly initiated and adjusted during the transfer cycle.
  • a system comprises a server having an application that performs one of the embodiments of the method according to the invention.
  • FIG. 1 is a system diagram showing an exemplary system for implementing a method according to the invention, and its relationship to other elements.
  • FIG. 2 is a flow diagram showing exemplary steps for performing a method according to the invention.
  • the present invention provides a method and system operable at an application or higher network level for discouraging inappropriate use of network resources.
  • like element numerals are used to describe like elements shown in one or more of the figures.
  • system 10 comprises a server 16 and an application 14 executing on the server.
  • Server 16 is typically a general purpose computer configured for serving information to multiple users across a network, but may comprise any high-level computing device capable of performing the method described herein.
  • Application 14 comprises a program of instructions for performing the method described herein, and may additionally comprise instructions for performing other server functions as known in the art.
  • Server 16 is connected to network 13 by communication link 15 and to a memory 18 containing at least one file 17 .
  • Memory 18 is any device, such as a hard drive or array of hard drives, tape drive, optical disk drive, or similar device, for static storage of information; and particularly, devices capable of accessing and storing massive amounts of high-level data for indefinite periods.
  • memory 18 is physically adjacent to server 16 and connected to the server through a server-operated bus 19 .
  • Server 10 controls access by users, such as user 11 connected to network 13 , to memory 18 .
  • File 17 is a set of high-level data encoded in a finite number of discrete information bits, such as binary bits. A plurality of files such as file 17 are used to exchange high-level information between a plurality of users, such as user 11 , connected to network 13 using client devices such as terminal 12 and a communication link 15 .
  • Network 13 may be a wide area network, a local area network, or a combination of different types of networks, such as the Internet.
  • the network may be operated by various protocols, such as TCP/IP.
  • the system and method according to the invention are not limited to application with any particular type of type of network, protocol, or client device.
  • packet-switching networks such as the Internet
  • the invention provides a method for implementation at a high system level. Therefore, the details of lower-level systems, such as network architecture and protocols, are secondary considerations for adapting the invention to be addressed in specific cases by one skilled in the art.
  • Method 20 may be implemented by a background application, and is preferably applied to all public requests for file transfers from the memory.
  • the method is applied to files of a selected type, such as MP 3 files.
  • file types are generally easily disguised, so the foregoing embodiment may suffer from the disadvantage of being easily circumvented.
  • Operation of method 20 is triggered by the receipt of a public request for a file transfer at step 21 .
  • “transfer” includes both the transmission of a file from a public memory to a client device, and storage in the public memory of a file received from a client device.
  • Method 20 may be applied to both types of transfers, but is believed to be especially useful for application to transmission of files from network-accessible memory to client devices.
  • packet size and delay period values are initialized.
  • the initial packet size and delay period values may be constants that are retrieved from a system memory, or may be variables that are calculated or selected from a table of predetermined values depending on variable parameters such as the size of the requested file, the load experienced by the server, the network response time, or the number and/or size of transfer requests from the requesting client device within a defined time period.
  • the initial delay value is preferably a unit of time, such as one millisecond.
  • the initial packet size is preferably a defined number of information bits, which is substantially smaller than the size of files that are considered undesirable to transfer.
  • the packet size is preferably the same as or larger than the typical packet size of the transmission control protocol in use on the network over which the file will be transferred, such as, for example, 8192 (8 k) bytes. It should be apparent that the packets used in method 20 are distinct from and reside at a higher level than “packets” as the term is used in the art in connection with packet-switched communication methods.
  • a packet of information having the defined size is removed from the file requested for transfer.
  • to “remove” a packet does not necessarily imply actual removal of information from the file, or actual segmentation of the file into co-existing, separate packets. Such techniques may be used, but are not generally preferred because they may entail destruction of the file and/or inefficient programming. Rather, a packet is preferably removed by copying a defined portion of the file into a working memory in the server and recording the sequence number, packet size, and any other information required to identify the next packet in the sequence and/or to reassemble the file from the separately transferred packets. Depending on the desired transfer technique, such identifying information may be included in a packet header or footer.
  • the packet comprises the entire remaining portion of the file, and a flag for application 14 is set to indicate that the end of the file has been reached.
  • the packet is transferred in accordance with the client request.
  • whatever packeting technique is used at step 23 is preferably designed so that transmission of the file as a sequence of high-level packets is seamlessly integrated with the transfer protocol, and no client-side special application is needed to reassemble the file.
  • high-level, server side delays attributable to method 20 are preferably made indistinguishable from transmission delays caused by bandwidth constraints at the server or at lower layers in the network. In this way, operation of method 20 is made invisible to users of the system.
  • a distributable client-side application for re-assembling the high-level packets into a file may be distributed to the client in advance of the file transfer, where it may be triggered upon receipt of the first top-level file packet.
  • a pause is introduced having a duration determined by the defined delay period.
  • no top-level server-side activity is performed that is directed towards the transfer of the requested file, although lower-level activity and client-side activity for transfer of the file preferably can and does occur irrespective of the pause.
  • a pause serves no function and the routine terminates as indicated at branch 25 .
  • step 28 the delay period and/or the packet size are set to adjusted values. If both parameters are to remain constant for the next execution cycle, step 28 is bypassed as indicated at branch 27 , and the transfer cycle is re-entered at step 23 . However, during at least selected ones of the execution cycles, at least one of the packet size or the delay period is preferably set to an adjusted value at step 28 . For example, it is generally preferable to increase the delay period after selected execution cycles, such as after each execution cycle. File transfer rates may also be adjusted and controlled by changing the packet size after each of, or selected ones of, the execution cycles.
  • the delay period is increased after selected cycles (such as after each cycle) by adding a constant increment, such as an additional millisecond. If desired, greater rates of deceleration may be achieved by increasing the incremental delay amount as the transfer progresses, such as by a fixed percentage (for example, 2%) after each cycle.
  • the delay period (or packet size) value set at step 28 may be calculated independently of the delay period (or packet size) value used in the previous cycle, or calculated using at least one independent variable.
  • delay period value can be set as a function of the server load, file size, network response time, or number of transfer requests or quantity of bytes requested from the requesting client device or port within a defined prior period. The latter parameter allows for targeting delays to particular ports or clients.
  • the delay period can be set to zero, thereby permitting both large and small files to be transferred without delay. This may be useful for applications where it is desirable to permit large file transfers under limited circumstances.
  • any of the initial delay period, the rate of increase in the delay period, and/or the value of the delay period after each cycle or a selected number of cycles can be set to a non-zero value that is determined as a function of load on the server.
  • step 28 After execution of step 28 (or after step 28 is bypassed at branch 27 ), the transfer cycle is re-entered at step 23 , and steps 23 , 24 , 26 (and optionally, step 28 ) are repeated in sequence until all of the file requested for transfer has been transferred. When file transfer is complete, the execution loop terminates as indicated at branch 25 .
  • Method 20 is preferably configured as one or more modules that can be called as needed, and configured so that separate instances of each module may run concurrently without conflict. Accordingly, a server making use of method 20 is preferably capable of transferring multiple files in parallel. It should be apparent that the pauses inserted by method 20 may in some cases enhance such parallel operation, by freeing processor time available for execution of parallel steps.
  • server 16 and terminal 12 are connected via communication links 15 to network 13 .
  • User 11 sends a request for file 17 to server 16 .
  • Server 16 is open to file requests from any and all users, and application 14 is applied to filter or screen all requests for files.
  • application 14 is configured so that the initial delay period “t” is one millisecond, and the initial packet size “P” is ten kilobytes (it should be understood that 8 kilobytes would be a more typical implementation, and ten kilobytes is merely convenient choice for illustrative purposes).
  • application 14 transmits the first ten kilobytes of file 17 to terminal 12 .
  • Application 14 then pauses for one millisecond, and then transmits the next ten kilobytes of file 17 to terminal 12 .
  • Application 14 then increments the delay period by an additional one millisecond, pauses for the adjusted delay period (now two milliseconds) and transmits the next ten milliseconds of file 17 .
  • Application 14 repeats the foregoing cycle, incrementing the delay period by an additional millisecond after each transmission, until the entire file 17 has been transferred to terminal 12 .
  • the sequence of delay periods comprises an arithmetic progression of integer millisecond values from 1 to (n ⁇ 1). Therefore, the total delay time in milliseconds for a given file of size “F” will be:
  • server 16 remains freely available on an open and equal basis to all users, thereby helping to attract traffic to the site.

Abstract

A method and system for operating a network server to discourage inappropriate use are disclosed. A server is connected to a plurality of connected client devices, and is configured to transfer information between any selected one of the client devices and a memory for static storage of information. The method comprises the steps of receiving a request to transfer a file between the memory and one of the plurality of client devices, removing a packet comprising a defined number of information bits from the file, transferring the packet between the memory and the client device per the request, then pausing for a defined delay period, and repeating the removing, transferring, and pausing steps in order until all of the file has been transferred. Preferably, the method further comprises increasing the defined delay period after each execution of a packet transfer cycle, thereby discouraging the transfer of unacceptably large files. The delay period may be initiated, and the amount of increase or other adjustment to the delay period during the transfer cycle may be controlled, by selected a predetermined value from a table, or by calculating a value based on variable input parameters such as the file size, server load, network response time, and number of transfer requests from the client device within a defined prior period. The number of information bits in the packet may similarly be initiated, and adjusted during the transfer cycle. The system comprises the server having an application for performing the method according to the invention.

Description

CROSS-REFERENCE TO RELATED APPLICATION
This application claims priority pursuant to 35 U.S.C. § 119(e) to U.S. Provisional Application Ser. No. 60/198,491, filed Apr. 18, 2000, which application is specifically incorporated herein, in its entirety, by reference.
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to methods and systems for operating a server connected to a wide area network, such as the Internet, and particularly to methods of serving files in response to requests from users.
2. Description of Related Art
Publicly accessible servers, particular servers that provide storage space for no charge, such as servers on free web hosts, are often used inappropriately in violation of agreed terms of service for the distribution of media files such as large software, music, and video files. Such media files tend to be much larger than the files that the host service is intended for. Consequently, the storage and exchange of these inappropriate files demands greater bandwidth than more appropriate uses, thereby choking and discouraging the uses that the web server is intended to serve. Additionally, these types of media files often contain illegally copied content, that may lend an undesirable taint to operators of web hosting services who do not wish to be perceived as encouraging copyright violations. Another injury caused by such inappropriate use is disproportionately heavy use of the server by relatively few users, thereby reducing the number of subscribers that the hosting service attracts. A related problem is the devaluation of advertising space as a result of people downloading such files, and the potential for alienating advertisers who have purchased advertising space on the servers serving such files.
Therefore, a method and system is needed to discourage inappropriate use of publicly available, network-connected server space, without adversely affecting intended uses of the server space or restricting public access. The method and system should integrate seamlessly and cost-effectively with existing network protocols and server software and hardware.
SUMMARY OF THE INVENTION
A method and system for operating a network server are provided, whereby the rate at which files are served from the server storage device to public users on the network depends primarily on the file size, and secondarily on other parameters, such as server load and file type. In particular, the transfer rate of each requested file is controlled and varied during transfer of the file. The method is particularly suitable for application to every file transferred from the server. In the alternative, the method may be applied only to selected files or types of files. In an embodiment of the invention, the transfer rate is progressively slowed (decelerated) as each file is transferred from or to the network. Consequently, relatively small files are not noticeably delayed, while very large files may be very substantially delayed relative to the rate at which they would be transferred without implementation of the invention. The delaying action serves to preserve system bandwidth for transfer of smaller files, and further discourages users from requesting the transfer of large files, thereby preserving system bandwidth to an even greater degree. The response of the server to appropriate uses can be greatly improved at the same time system performance is deliberately degraded for inappropriate uses. Furthermore, the method is easy to implement in a variety of different systems while adding minimal system overhead.
According to an embodiment of the invention, the server is connected through a network, such as the Internet, to a plurality of client devices, and is configured to transfer information between any selected one of the client devices and a memory for static storage of information. The method comprises the steps of receiving a request to transfer a file between the memory and one of the plurality of client devices, removing a packet comprising a defined number of information bits from the file, transferring the packet between the memory and the client device per the request, then pausing for a defined delay period, and repeating the removing, transferring, and pausing steps in order until all of the file has been transferred. Preferably, the method further comprises increasing the defined delay period after each execution of a packet transfer cycle (or after a selected number of cycles), thereby discouraging the transfer of unacceptably large files. The delay period may be initiated, and the amount of increase or other adjustment to the delay period during the transfer cycle may be controlled, by selected a predetermined value from a table, or by calculating a value based on variable input parameters such as the file size, server load, network response time, and number of transfer requests from the client device within a defined prior period. The number of information bits in the packet—that is, the packet size—may have a value that is similarly initiated and adjusted during the transfer cycle. According to a related embodiment of the invention, a system comprises a server having an application that performs one of the embodiments of the method according to the invention.
A more complete understanding of the method and system for operating a network server to discourage inappropriate use will be afforded to those skilled in the art, as well as a realization of additional advantages and objects thereof, by a consideration of the following detailed description of the preferred embodiment. Reference will be made to the appended sheets of drawings which will first be described briefly.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a system diagram showing an exemplary system for implementing a method according to the invention, and its relationship to other elements.
FIG. 2 is a flow diagram showing exemplary steps for performing a method according to the invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
The present invention provides a method and system operable at an application or higher network level for discouraging inappropriate use of network resources. In the detailed description that follows, like element numerals are used to describe like elements shown in one or more of the figures.
Referring to FIG. 1, system 10 comprises a server 16 and an application 14 executing on the server. Server 16 is typically a general purpose computer configured for serving information to multiple users across a network, but may comprise any high-level computing device capable of performing the method described herein. Application 14 comprises a program of instructions for performing the method described herein, and may additionally comprise instructions for performing other server functions as known in the art.
Server 16 is connected to network 13 by communication link 15 and to a memory 18 containing at least one file 17. Memory 18 is any device, such as a hard drive or array of hard drives, tape drive, optical disk drive, or similar device, for static storage of information; and particularly, devices capable of accessing and storing massive amounts of high-level data for indefinite periods. In an embodiment of the invention, memory 18 is physically adjacent to server 16 and connected to the server through a server-operated bus 19. Server 10 controls access by users, such as user 11 connected to network 13, to memory 18. File 17 is a set of high-level data encoded in a finite number of discrete information bits, such as binary bits. A plurality of files such as file 17 are used to exchange high-level information between a plurality of users, such as user 11, connected to network 13 using client devices such as terminal 12 and a communication link 15.
Network 13 may be a wide area network, a local area network, or a combination of different types of networks, such as the Internet. The network may be operated by various protocols, such as TCP/IP. The system and method according to the invention are not limited to application with any particular type of type of network, protocol, or client device. Although one skilled in the art will recognize that the invention is readily implemented for use with packet-switching networks, such as the Internet, it should also be appreciated that the invention is not limited thereby. The invention provides a method for implementation at a high system level. Therefore, the details of lower-level systems, such as network architecture and protocols, are secondary considerations for adapting the invention to be addressed in specific cases by one skilled in the art.
Referring to FIG. 2, exemplary steps of a method 20 for discouraging inappropriate use of memory connected to a network are shown. Method 20 may be implemented by a background application, and is preferably applied to all public requests for file transfers from the memory. In an alternative embodiment, the method is applied to files of a selected type, such as MP3 files. However, file types are generally easily disguised, so the foregoing embodiment may suffer from the disadvantage of being easily circumvented. Operation of method 20 is triggered by the receipt of a public request for a file transfer at step 21. As used herein, “transfer” includes both the transmission of a file from a public memory to a client device, and storage in the public memory of a file received from a client device. Method 20 may be applied to both types of transfers, but is believed to be especially useful for application to transmission of files from network-accessible memory to client devices.
At step 22, packet size and delay period values are initialized. The initial packet size and delay period values may be constants that are retrieved from a system memory, or may be variables that are calculated or selected from a table of predetermined values depending on variable parameters such as the size of the requested file, the load experienced by the server, the network response time, or the number and/or size of transfer requests from the requesting client device within a defined time period. The initial delay value is preferably a unit of time, such as one millisecond. The initial packet size is preferably a defined number of information bits, which is substantially smaller than the size of files that are considered undesirable to transfer. In an embodiment of the invention, the packet size is preferably the same as or larger than the typical packet size of the transmission control protocol in use on the network over which the file will be transferred, such as, for example, 8192 (8 k) bytes. It should be apparent that the packets used in method 20 are distinct from and reside at a higher level than “packets” as the term is used in the art in connection with packet-switched communication methods.
At step 23, a packet of information having the defined size is removed from the file requested for transfer. As used herein, to “remove” a packet does not necessarily imply actual removal of information from the file, or actual segmentation of the file into co-existing, separate packets. Such techniques may be used, but are not generally preferred because they may entail destruction of the file and/or inefficient programming. Rather, a packet is preferably removed by copying a defined portion of the file into a working memory in the server and recording the sequence number, packet size, and any other information required to identify the next packet in the sequence and/or to reassemble the file from the separately transferred packets. Depending on the desired transfer technique, such identifying information may be included in a packet header or footer. If the remaining portion of the file (i.e., that portion that has not yet been removed and transferred) is less than the packet size, then the packet comprises the entire remaining portion of the file, and a flag for application 14 is set to indicate that the end of the file has been reached.
At step 24, the packet is transferred in accordance with the client request. Where the file is to be transferred over a network, whatever packeting technique is used at step 23 is preferably designed so that transmission of the file as a sequence of high-level packets is seamlessly integrated with the transfer protocol, and no client-side special application is needed to reassemble the file. In addition, high-level, server side delays attributable to method 20 are preferably made indistinguishable from transmission delays caused by bandwidth constraints at the server or at lower layers in the network. In this way, operation of method 20 is made invisible to users of the system. In the alternative, but less preferably, a distributable client-side application for re-assembling the high-level packets into a file may be distributed to the client in advance of the file transfer, where it may be triggered upon receipt of the first top-level file packet.
At step 26, a pause is introduced having a duration determined by the defined delay period. During the pause, no top-level server-side activity is performed that is directed towards the transfer of the requested file, although lower-level activity and client-side activity for transfer of the file preferably can and does occur irrespective of the pause. Of course, after the last packet in the file is transferred, a pause serves no function and the routine terminates as indicated at branch 25.
At optional step 28, the delay period and/or the packet size are set to adjusted values. If both parameters are to remain constant for the next execution cycle, step 28 is bypassed as indicated at branch 27, and the transfer cycle is re-entered at step 23. However, during at least selected ones of the execution cycles, at least one of the packet size or the delay period is preferably set to an adjusted value at step 28. For example, it is generally preferable to increase the delay period after selected execution cycles, such as after each execution cycle. File transfer rates may also be adjusted and controlled by changing the packet size after each of, or selected ones of, the execution cycles. For example, decreasing the packet size parameter after each cycle while holding the delay period constant will cause the transfer rate to decelerate similarly to what may be achieved by holding the packet size constant and increasing the delay period. However, use of the delay period as the rate control parameter will typically be more easily and more efficiently implemented at the application level. Therefore, it is generally preferred to hold the packet size constant and adjust the delay period, but the scope of the invention is not limited thereby. Furthermore, to achieve the desired result, an appropriately timed delay may be inserted after randomly chosen packets wherein each packet has a set probability of being selected for delay. Thus, a delay need not necessarily be inserted after every packet, or even after every “nth” packet.
Various different algorithms may be employed to calculate the value to which the delay period and/or packet size parameters will be set at step 28. In the alternative, a predetermined value may be selected from a lookup table depending on various input criteria. A desirable result can be achieved using a compact calculation scheme. For example, in an embodiment of the invention, the delay period is increased after selected cycles (such as after each cycle) by adding a constant increment, such as an additional millisecond. If desired, greater rates of deceleration may be achieved by increasing the incremental delay amount as the transfer progresses, such as by a fixed percentage (for example, 2%) after each cycle.
In the alternative, the delay period (or packet size) value set at step 28 may be calculated independently of the delay period (or packet size) value used in the previous cycle, or calculated using at least one independent variable. For example, delay period value can be set as a function of the server load, file size, network response time, or number of transfer requests or quantity of bytes requested from the requesting client device or port within a defined prior period. The latter parameter allows for targeting delays to particular ports or clients. In an alternative embodiment, if the server load is very low and excess capacity is available, the delay period can be set to zero, thereby permitting both large and small files to be transferred without delay. This may be useful for applications where it is desirable to permit large file transfers under limited circumstances. As server load increases, any of the initial delay period, the rate of increase in the delay period, and/or the value of the delay period after each cycle or a selected number of cycles, can be set to a non-zero value that is determined as a function of load on the server.
After execution of step 28 (or after step 28 is bypassed at branch 27), the transfer cycle is re-entered at step 23, and steps 23, 24, 26 (and optionally, step 28) are repeated in sequence until all of the file requested for transfer has been transferred. When file transfer is complete, the execution loop terminates as indicated at branch 25.
Method 20 is preferably configured as one or more modules that can be called as needed, and configured so that separate instances of each module may run concurrently without conflict. Accordingly, a server making use of method 20 is preferably capable of transferring multiple files in parallel. It should be apparent that the pauses inserted by method 20 may in some cases enhance such parallel operation, by freeing processor time available for execution of parallel steps.
The following example illustrates the operation of method 20 in a network-connected system 10. Referring again to FIG. 1, server 16 and terminal 12 are connected via communication links 15 to network 13. User 11 sends a request for file 17 to server 16. Server 16 is open to file requests from any and all users, and application 14 is applied to filter or screen all requests for files. For this example, application 14 is configured so that the initial delay period “t” is one millisecond, and the initial packet size “P” is ten kilobytes (it should be understood that 8 kilobytes would be a more typical implementation, and ten kilobytes is merely convenient choice for illustrative purposes). Therefore, after receiving the request, application 14 transmits the first ten kilobytes of file 17 to terminal 12. Application 14 then pauses for one millisecond, and then transmits the next ten kilobytes of file 17 to terminal 12. Application 14 then increments the delay period by an additional one millisecond, pauses for the adjusted delay period (now two milliseconds) and transmits the next ten milliseconds of file 17. Application 14 repeats the foregoing cycle, incrementing the delay period by an additional millisecond after each transmission, until the entire file 17 has been transferred to terminal 12.
It should be apparent that the total delay time “T” inserted by method 20 for file 17 may be computed by summing the individual delay periods; that is, “T=Σt.” The size “n” of file 17 may be expressed as an integer number of packets, determined by “n=F/P,” where n is rounded up to the next integer, and “F” and “P” are the size of file 17 and the packet size, respectively, in compatible units such as bytes or bits. For the forgoing example, the sequence of delay periods comprises an arithmetic progression of integer millisecond values from 1 to (n−1). Therefore, the total delay time in milliseconds for a given file of size “F” will be:
T = n ( n - 1 ) 2 = ( F / P ) 2 - ( F / P ) 2 . Eq . 1
Accordingly, user 11 will experience, for example, in addition to any usual transmission delays associated with network and system capacity, an unnoticeable additional delay of 45 milliseconds in transferring a 100 kilobyte file; a slight additional delay of 4.95 seconds in transferring a one megabyte file; a substantial additional delay of 8 minutes and 19 seconds in transferring a ten megabyte file, and a probably intolerable additional delay of 208 hours in transferring a fifty megabyte file. A desirable user will perceive that the system is fast, because the transfers of small files (such as web pages) proceed without noticeable delay. However, a user seeking to use server 16 to store and transfer large files, such as music or video files, will be discouraged by the large additional delay times, and will therefore avoid using the server for such purposes. At the same time, server 16 remains freely available on an open and equal basis to all users, thereby helping to attract traffic to the site.
Having thus described a preferred embodiment of the method and system for operating a network server to discourage inappropriate use, it should be apparent to those skilled in the art that certain advantages of the within system have been achieved. It should also be appreciated that various modifications, adaptations, and alternative embodiments thereof may be made within the scope and spirit of the present invention. For example, the use of a particular rate-modifying algorithm has been illustrated, but it should be apparent that the inventive concepts described above would be equally adaptable for use with other algorithms for controlling the file transfer rate. For further example, a system comprising a server has been illustrated, but it should be apparent that the inventive concepts described above would be equally adaptable for use with other devices for transferring information across a network, such as routers. The invention is further defined by the following claims.

Claims (20)

1. A method for operating a network server to discourage use that disproportionately depletes server resources such as distribution of large media files, wherein the server is connected to a plurality of client devices, and configured to transfer information between selected ones of the client devices and a memory for static storage of information, said method comprising the steps of:
receiving a request to transfer a file between the memory and one of the plurality of client devices;
removing a packet of information from the file after said receiving step;
transferring the packet of information from the memory to a lower-level network component operative to configure the packet as at least one lower-level packet according to a protocol of a packet-switched network for transmission to the one of the plurality of client devices after said removing step;
pausing for a defined delay period after at least one of said removing and said transferring steps; and
repeating said removing step, said transferring step, and said pausing step in any operative order until all of the file has been transferred to the lower-level network component, wherein at least one of the delay period and a defined number of information bits in the information packet is controlled so as to cause later-transferred portions of the file to be delayed by increasing amounts until all portions of the file have been transferred, whereby the entire file is transferred at a rate that decreases with increasing file size.
2. The method of claim 1, further comprising increasing the defined delay period after each iteration of the repeating step.
3. The method of claim 1, further comprising setting the defined delay period to a selected predetermined value after each execution of said pausing step.
4. The method of claim 1, further comprising initializing the defined delay period to a calculated value prior to said removing step.
5. The method of claim 1, further comprising initializing the defined delay period to a selected predetermined value prior to said removing step.
6. The method of claim 1, further comprising setting the defined delay period to a calculated value after each execution of said pausing step.
7. The method of claim 6, further comprising determining the calculated value from the file size or file type.
8. The method of claim 1, further comprising setting the defined number of information bits in the packet of information to a calculated value after each execution of said pausing step.
9. The method of claim 1, further comprising setting the defined number of information bits in the packet of information to a selected predetermined value after each execution of said pausing step.
10. The method of claim 1, further comprising initializing the defined number of information bits in the packet of information prior to said removing step.
11. A system for discouraging use of memory connected to a network where the use, such as distribution of large media files, disproportionately depletes server resources, the system comprising:
a memory for static storage of information;
a server connected to a plurality of client devices and to the memory, the server controlling access by the client devices to the memory; and
an application on the server for transferring information between selected ones of the client devices and the memory, the application comprising instructions to perform the steps of:
receiving a request to transfer a file between the memory and one of the plurality of client devices;
removing a packet of information from the file after the receiving step;
transferring the packet of information from the memory to a lower-level network component operative to configure the packet as at least one lower-level packet according to a protocol of a packet-switched network for transmission to the one of the plurality of client devices after the removing step;
pausing for a defined delay period after one of the removing and the transferring steps;
repeating the removing step, the transferring step, and the pausing step in any operative order until all of the file has been transferred to the lower-level network component, wherein at least one of the delay period and a defined number of information bits in the information packet is controlled so as to cause later-transferred portions of the file to be delayed by increasing amounts.
12. The system of claim 11, wherein the application further comprises instructions to perform the step of increasing the defined delay period after each iteration of the repeating step.
13. The system of claim 11, wherein the application further comprises instructions to perform the step of setting the defined delay period to a selected predetermined value after each execution of the pausing step.
14. The system of claim 11, wherein the application further comprises instructions to perform the step of initializing the defined delay period to a calculated value prior to the removing step.
15. The system of claim 11, wherein the application further comprises instructions to perform the step of initializing the defined delay period to a selected predetermined value prior to the removing step.
16. The system of claim 11, wherein the application further comprises instructions to perform the step of setting the defined delay period to a calculated value after each execution of the pausing step.
17. The system of claim 16, wherein the application further comprises instructions to perform the step of determining the calculated value from the file size or the file type.
18. The system of claim 11, wherein the application further comprises instructions to perform the step of setting the defined number of information bits in the packet of information to a calculated value after each execution of the pausing step.
19. The system of claim 11, wherein the application further comprises instructions to perform the step of setting the defined number of information bits in the packet of information to a selected predetermined value after each execution of the pausing step.
20. The system of claim 11, wherein the application further comprises instructions to perform the step of initializing the defined number of information bits in the packet of information prior to said removing step.
US09/837,319 2000-04-18 2001-04-18 Method and system for operating a network server to discourage inappropriate use Expired - Fee Related US7370110B2 (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
US09/837,319 US7370110B2 (en) 2000-04-18 2001-04-18 Method and system for operating a network server to discourage inappropriate use
US12/114,215 US7797408B2 (en) 2000-04-18 2008-05-02 Management of bandwidth allocation in a network server
US12/881,082 US7966416B2 (en) 2000-04-18 2010-09-13 Management of bandwidth allocation in a network server
US13/161,063 US8171113B2 (en) 2000-04-18 2011-06-15 Management of bandwidth allocation in a network server
US13/457,279 US8577994B2 (en) 2000-04-18 2012-04-26 Management of bandwidth allocation in a network server

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US19849100P 2000-04-18 2000-04-18
US09/837,319 US7370110B2 (en) 2000-04-18 2001-04-18 Method and system for operating a network server to discourage inappropriate use

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/114,215 Continuation US7797408B2 (en) 2000-04-18 2008-05-02 Management of bandwidth allocation in a network server

Publications (2)

Publication Number Publication Date
US20020103915A1 US20020103915A1 (en) 2002-08-01
US7370110B2 true US7370110B2 (en) 2008-05-06

Family

ID=26893838

Family Applications (5)

Application Number Title Priority Date Filing Date
US09/837,319 Expired - Fee Related US7370110B2 (en) 2000-04-18 2001-04-18 Method and system for operating a network server to discourage inappropriate use
US12/114,215 Expired - Fee Related US7797408B2 (en) 2000-04-18 2008-05-02 Management of bandwidth allocation in a network server
US12/881,082 Expired - Fee Related US7966416B2 (en) 2000-04-18 2010-09-13 Management of bandwidth allocation in a network server
US13/161,063 Expired - Fee Related US8171113B2 (en) 2000-04-18 2011-06-15 Management of bandwidth allocation in a network server
US13/457,279 Expired - Fee Related US8577994B2 (en) 2000-04-18 2012-04-26 Management of bandwidth allocation in a network server

Family Applications After (4)

Application Number Title Priority Date Filing Date
US12/114,215 Expired - Fee Related US7797408B2 (en) 2000-04-18 2008-05-02 Management of bandwidth allocation in a network server
US12/881,082 Expired - Fee Related US7966416B2 (en) 2000-04-18 2010-09-13 Management of bandwidth allocation in a network server
US13/161,063 Expired - Fee Related US8171113B2 (en) 2000-04-18 2011-06-15 Management of bandwidth allocation in a network server
US13/457,279 Expired - Fee Related US8577994B2 (en) 2000-04-18 2012-04-26 Management of bandwidth allocation in a network server

Country Status (1)

Country Link
US (5) US7370110B2 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080209017A1 (en) * 2000-04-18 2008-08-28 Gary Stephen Shuster Management of bandwidth allocation in a network server
US8453219B2 (en) 2011-08-18 2013-05-28 Brian Shuster Systems and methods of assessing permissions in virtual worlds
US9348666B2 (en) 2012-06-18 2016-05-24 Gary Shuster Translating user interfaces of applications

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7240117B2 (en) * 2001-04-04 2007-07-03 Hall Aluminum Llc Method and apparatus for preventing overload using scaled recovery
US7539756B2 (en) * 2002-01-31 2009-05-26 Darby & Mohaine, L.L.C. Method and system of data packet transmission timing for controlling bandwidth
US7428243B2 (en) 2002-10-18 2008-09-23 Darby & Mohaine, Llc Method and system for varying data packet size for controlling bandwidth
US7945689B2 (en) * 2007-03-23 2011-05-17 Sony Corporation Method and apparatus for transferring files to clients using a peer-to-peer file transfer model and a client-server transfer model
US9229933B2 (en) * 2006-12-19 2016-01-05 International Business Machines Corporation System, method and program for managing file downloads
US7733785B2 (en) 2007-01-31 2010-06-08 International Business Machines Corporation Method and system for dynamically adjusting packet size to decrease delays of streaming data transmissions on noisy transmission lines
US8335857B1 (en) * 2009-05-21 2012-12-18 Sprint Communications Company L.P. System and methods of data transmission to devices
US8782267B2 (en) * 2009-05-29 2014-07-15 Comcast Cable Communications, Llc Methods, systems, devices, and computer-readable media for delivering additional content using a multicast streaming
SG176724A1 (en) * 2009-06-25 2012-01-30 Astrazeneca Ab Method for treating a patient at risk for developing an nsaid-associated ulcer
US9208250B2 (en) * 2011-04-07 2015-12-08 Infosys Technologies, Ltd. System and method for dynamic modification of web page content to ensure consistent response time
US9363199B1 (en) * 2013-03-13 2016-06-07 Western Digital Technologies, Inc. Bandwidth management for data services operating on a local network
US9606245B1 (en) 2015-03-24 2017-03-28 The Research Foundation For The State University Of New York Autonomous gamma, X-ray, and particle detector
US10630553B2 (en) 2015-08-18 2020-04-21 Walmart Apollo, Llc Bandwidth throttling
CN109947721B (en) * 2017-12-01 2021-08-17 北京安天网络安全技术有限公司 Small file processing method and device
JP6969454B2 (en) * 2018-03-13 2021-11-24 オムロン株式会社 Control device, control method, and control program
CN108989440A (en) * 2018-07-27 2018-12-11 上海爱优威软件开发有限公司 A kind of document transmission method and system

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5854900A (en) * 1996-05-31 1998-12-29 Advanced Micro Devices, Inc. Method and apparatus avoiding capture effect by adding a slot time to an interpacket gap interval in a station accessing an ethernet network
US5896502A (en) 1996-12-10 1999-04-20 International Business Machines Corporation Internet data transfer control via a client system to reduce delay
US6065059A (en) 1996-12-10 2000-05-16 International Business Machines Corporation Filtered utilization of internet data transfers to reduce delay and increase user control
US6078919A (en) 1997-10-23 2000-06-20 Lucent Technologies Inc. Method and apparatus for delivery of data over a network based on determination of network parameters
US6275896B1 (en) * 1996-11-27 2001-08-14 Sony Corporation Data transfer apparatus and method of the same and data input and output controlling apparatus and method of same

Family Cites Families (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6473793B1 (en) * 1994-06-08 2002-10-29 Hughes Electronics Corporation Method and apparatus for selectively allocating and enforcing bandwidth usage requirements on network users
GB9513885D0 (en) * 1995-07-07 1995-09-06 Ailsa Investments Ltd Improvements in or relating to the manufacture of extrusive dies
EP1457896A3 (en) * 1995-10-26 2005-04-20 Matsushita Electric Industrial Co., Ltd. File system
US5850525A (en) * 1996-03-29 1998-12-15 Advanced Micro Devices, Inc. Method and apparatus for adding a randomized propagation delay interval to an interframe spacing in a station accessing an ethernet network
US6147997A (en) * 1996-11-08 2000-11-14 Pmc-Sierra (Maryland), Inc. Mechanism to support an UTOPIA interface over a backplane
US5832232A (en) * 1996-12-16 1998-11-03 Intel Corporation Method and apparatus for providing user-based flow control in a network system
US6701372B2 (en) * 1997-08-22 2004-03-02 Canon Kabushiki Kaisha Data communication apparatus and method
JP3566047B2 (en) * 1997-10-17 2004-09-15 富士通株式会社 Network system and communication device
US6363076B1 (en) * 1998-01-27 2002-03-26 International Business Machines Corporation Phantom buffer for interfacing between buses of differing speeds
US6637031B1 (en) * 1998-12-04 2003-10-21 Microsoft Corporation Multimedia presentation latency minimization
US6600721B2 (en) * 1998-12-31 2003-07-29 Nortel Networks Limited End node pacing for QOS and bandwidth management
US6600737B1 (en) * 1999-02-11 2003-07-29 Mediaring Ltd. Bandwidth protection for voice over IP
US6560243B1 (en) * 1999-04-30 2003-05-06 Hewlett-Packard Development Company System and method for receiver based allocation of network bandwidth
US7370110B2 (en) * 2000-04-18 2008-05-06 Hoshiko Llc Method and system for operating a network server to discourage inappropriate use
AU2001271609A1 (en) * 2000-06-30 2002-01-14 Kanad Ghose System and method for fast, reliable byte stream transport
US7555559B2 (en) * 2003-02-28 2009-06-30 Onion Networks, KK Parallel data transfer over multiple channels with data order prioritization
US7660906B1 (en) * 2006-03-27 2010-02-09 Beyond Media, Llc Data delivery system and method
US7945689B2 (en) * 2007-03-23 2011-05-17 Sony Corporation Method and apparatus for transferring files to clients using a peer-to-peer file transfer model and a client-server transfer model

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5854900A (en) * 1996-05-31 1998-12-29 Advanced Micro Devices, Inc. Method and apparatus avoiding capture effect by adding a slot time to an interpacket gap interval in a station accessing an ethernet network
US6275896B1 (en) * 1996-11-27 2001-08-14 Sony Corporation Data transfer apparatus and method of the same and data input and output controlling apparatus and method of same
US5896502A (en) 1996-12-10 1999-04-20 International Business Machines Corporation Internet data transfer control via a client system to reduce delay
US6065059A (en) 1996-12-10 2000-05-16 International Business Machines Corporation Filtered utilization of internet data transfers to reduce delay and increase user control
US6078919A (en) 1997-10-23 2000-06-20 Lucent Technologies Inc. Method and apparatus for delivery of data over a network based on determination of network parameters

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
McAuley, Anthony J. "Error Control for Messaging Applications in a Wireless Environment," Apr. 1995, IEEE, vol. 1, pp. 261-268. *
Xomsihapanya, Khammouane et al. "Improvement of Average Delay Performance in Packet Network by Introducing Intermediate Nodes," Jan. 1998, IEEE, pp. 25-28. *

Cited By (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080209017A1 (en) * 2000-04-18 2008-08-28 Gary Stephen Shuster Management of bandwidth allocation in a network server
US7797408B2 (en) 2000-04-18 2010-09-14 Gary Stephen Shuster Management of bandwidth allocation in a network server
US20110010462A1 (en) * 2000-04-18 2011-01-13 Gary Stephen Shuster Management of bandwidth allocation in a network server
US7966416B2 (en) 2000-04-18 2011-06-21 Hoshiko Llc Management of bandwidth allocation in a network server
US8171113B2 (en) 2000-04-18 2012-05-01 Hoshiko Llc Management of bandwidth allocation in a network server
US20120215886A1 (en) * 2000-04-18 2012-08-23 Hoshiko Llc Management of bandwidth allocation in a network server
US8577994B2 (en) * 2000-04-18 2013-11-05 Intellectual Ventures I Llc Management of bandwidth allocation in a network server
US8522330B2 (en) 2011-08-18 2013-08-27 Brian Shuster Systems and methods of managing virtual world avatars
US8493386B2 (en) 2011-08-18 2013-07-23 Aaron Burch Systems and methods of managed script execution
US8572207B2 (en) 2011-08-18 2013-10-29 Brian Shuster Dynamic serving of multidimensional content
US8453219B2 (en) 2011-08-18 2013-05-28 Brian Shuster Systems and methods of assessing permissions in virtual worlds
US8671142B2 (en) 2011-08-18 2014-03-11 Brian Shuster Systems and methods of virtual worlds access
US8947427B2 (en) 2011-08-18 2015-02-03 Brian Shuster Systems and methods of object processing in virtual worlds
US9046994B2 (en) 2011-08-18 2015-06-02 Brian Shuster Systems and methods of assessing permissions in virtual worlds
US9087399B2 (en) 2011-08-18 2015-07-21 Utherverse Digital, Inc. Systems and methods of managing virtual world avatars
US9386022B2 (en) 2011-08-18 2016-07-05 Utherverse Digital, Inc. Systems and methods of virtual worlds access
US9509699B2 (en) 2011-08-18 2016-11-29 Utherverse Digital, Inc. Systems and methods of managed script execution
US9348666B2 (en) 2012-06-18 2016-05-24 Gary Shuster Translating user interfaces of applications

Also Published As

Publication number Publication date
US7797408B2 (en) 2010-09-14
US20120215886A1 (en) 2012-08-23
US8171113B2 (en) 2012-05-01
US20080209017A1 (en) 2008-08-28
US20110246625A1 (en) 2011-10-06
US8577994B2 (en) 2013-11-05
US20020103915A1 (en) 2002-08-01
US7966416B2 (en) 2011-06-21
US20110010462A1 (en) 2011-01-13

Similar Documents

Publication Publication Date Title
US7797408B2 (en) Management of bandwidth allocation in a network server
US10979499B2 (en) Managed object replication and delivery
Rodriguez et al. Dynamic parallel access to replicated content in the Internet
US7734807B2 (en) Method and apparatus for improving bandwidth efficiency in a computer network
US6343085B1 (en) Adaptive bandwidth throttling for individual virtual services supported on a network server
US7443871B2 (en) Method and system for managing a jitter buffer
US7949748B2 (en) Timing module for regulating hits by a spidering engine
CN1238800C (en) Internet convolution audio/video server
US6772217B1 (en) Internet backbone bandwidth enhancement by initiating an additional data stream when individual bandwidth are approximately equal to the backbone limit
US20070088826A1 (en) Systems and Methods for Controlling the Number of Connections Established with a Server
US20020099844A1 (en) Load balancing and dynamic control of multiple data streams in a network
US7310681B2 (en) System and method for modeling the memory state of a streaming media server
JP2010020782A (en) Method for transferring information
US20140095729A1 (en) Client-side class-of-service-based bandwidth management in over-the-top video delivery
EP1473636B1 (en) Information processing device and method, and computer program
Touch Defining high-speed protocols: five challenges and an example that survives the challenges
US7062557B1 (en) Web server request classification system that classifies requests based on user's behaviors and expectations
KR100812211B1 (en) System and Method for Providing Application by using Streaming
Hua et al. An adaptive video multicast scheme for varying workloads
Makaroff et al. Design and implementation of a VBR continuous media file server
Kang et al. Modeling the caching effect in continuous media servers
CN117768453A (en) Resource downloading method and device based on priority
EP3062474B1 (en) Method, device, computer program product and storage medium for distributing file requests in adaptive streaming systems
JP3709461B2 (en) Packet communication network quality simulation apparatus and method, program, and recording medium
Sheu et al. A novel broadcast technique for theaters in the air

Legal Events

Date Code Title Description
AS Assignment

Owner name: IDEAFLOOD, INC., NEVADA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SHUSTER, GARY STEPHEN;REEL/FRAME:012549/0549

Effective date: 20011120

AS Assignment

Owner name: HOSHIKO, LLC,NEVADA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:IDEAFLOOD, INC.;REEL/FRAME:018498/0337

Effective date: 20060721

Owner name: HOSHIKO, LLC, NEVADA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:IDEAFLOOD, INC.;REEL/FRAME:018498/0337

Effective date: 20060721

STCF Information on status: patent grant

Free format text: PATENTED CASE

FEPP Fee payment procedure

Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 4

FEPP Fee payment procedure

Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

AS Assignment

Owner name: HOSHIKO LLC, NEVADA

Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE ASSIGNEE NAME PREVIOUSLY RECORDED ON REEL 018498 FRAME 0337.ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNEE'S NAME IS HOSHIKO LLC,NOT HOSHIKO,LLC;ASSIGNOR:IDEAFLOOD, INC.;REEL/FRAME:029006/0972

Effective date: 20060721

AS Assignment

Owner name: INTELLECTUAL VENTURES I LLC, DELAWARE

Free format text: MERGER;ASSIGNOR:HOSHIKO LLC;REEL/FRAME:030639/0289

Effective date: 20130523

FPAY Fee payment

Year of fee payment: 8

AS Assignment

Owner name: INTELLECTUAL VENTURES ASSETS 27 LLC, DELAWARE

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTELLECTUAL VENTURES I LLC;REEL/FRAME:040178/0801

Effective date: 20161004

AS Assignment

Owner name: PREFERENTIAL NETWORKS IP, LLC, TEXAS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTELLECTUAL VENTURES ASSETS 27 LLC;REEL/FRAME:040602/0577

Effective date: 20161028

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20200506