US 6,907,421 B1Grant
Regulating file access rates according to file type
Issue Date:2005-06-14
•21 Claims
•6 Drawing Sheets
Abstract
File access rates of processes are regulated according to file type. An association table stores entries associating processes to be regulated with specific access rates for various file types. System calls that access files are intercepted, and a system call wrapper executes. The system call wrapper determines the type of file that is being accessed by the process. The system call wrapper examines the association table in order to determine if the calling process is associated with an access rate for the file type being accessed. If so, the system call wrapper regulates access to the file according to the appropriate rate.
Metadata
Assignee
- Ensim Corporation
Inventors
- Srinivasan Keshav
- Rosen Sharma
Application Information
Application Number:US 09/572,672
Filing Date:2000-05-16
Priority Date:2000-05-16
Art Unit:2165
Patent Drawings (6 sheets)
Description
CROSS REFERENCE TO RELATED APPLICATIONS
[0001] This application incorporates by reference the entirety of the following patent applications: U.S. patent application Ser. No. 09/500,212, now U.S. Pat. No. 6,560,613 entitled “Disambiguating File Descriptors,” filed on Feb. 8, 2000; U.S. patent application Ser. No. 09/499,098, now U.S. Pat. No. 6,529,985 entitled “Selective Interception of System Calls,” filed on Feb. 4, 2000; and U.S. patent application Ser. No. 09/452,286, now pending entitled “Providing Quality of Service Guarantees to Virtual Hosts,” filed on Nov. 30, 1999. The incorporated applications have the same assignee as the present application.
BACKGROUND
[0002] 1. Field of Invention
[0003] The present invention relates generally to regulating access rates in a computer system, and specifically to regulating file access rates of software processes according to file type.
[0004] 2. Background of Invention
[0005] Multitasking operating systems such as UNIX® and Microsoft WINDOWS NT®are widely utilized in commercial computing systems. Among their many commercial uses, these operating systems are commonly deployed on Internet and other network server computers. With the popularity and success of the Internet, server computer operating systems are currently of great commercial importance.
[0006] One function of a multitasking operating system is to allocate system resources to the multiple software processes that simultaneously execute under the control of the operating system. Control over the allocation of system resources by an operating system is commercially useful for a number of reasons. Multitasking operating system are commonly used on Internet web servers by Internet Service Providers (ISP's). Where an ISP provides host services to multiple customers on a single physical computer, it is desirable to allot to each virtual host a specific amount of computer resources appropriate to the needs of the customer, and preferably based upon the amount paid for the services.
[0007] For example, suppose two customers purchase host services from an ISP. The first customer is a large corporation providing financial services to thousands of clients internationally. The financial services host requires fast file access, as well as prompt response time to all client requests. Of course, the first customer is willing to compensate the ISP appropriately for providing such a level of host services. The second customer is a sole proprietorship that sells floral arrangements locally. The second customer has a very limited budget, but only requires minimal computer resources. Clearly, it is desirable for the ISP to allocate different percentages of the system resources to the two separate virtual hosts provided by the ISP for the two separate customers.
[0008] In the example above, the ISP may wish to provide the financial services host with the ability to access files at the rate of 1,000 bytes per second, but to allow the florist to access files at the rate of only 150 bytes per second. These different access rates would be based upon the different needs of the two customers, and the corresponding different compensation schemes of each. As multitasking operating systems operate today, it would be impossible for the ISP to regulate the file access rates of the different customers. Each process associated with either virtual host simply accesses the file system at the same unregulated rate, and thus it is impossible for the ISP to guarantee or restrict access rates based upon customer need and corresponding financial arrangement. What is needed is a method that facilitates the regulation of the rate at which individual processes access the file system of a multitasking operating system.
[0009] Many commercially popular operating systems such as UNIX® and Microsoft WINDOWS NT® treat communication channels as files. In such an operating system, when a process instructs the operating system to create a communication channel, the operating system returns a file descriptor. The communication channel is subsequently accessed via the file descriptor, in a similar manner as a file stored on media.
[0010] Communication channels and files stored on media are inherently different, despite the fact that both are accessed via file descriptors. It is often desirable to for an ISP to allow a single process to access files stored on media at one rate, and to access communication channels at another. For example, a customer of the ISP may need to receive and respond to client requests very quickly, but need only an average access time for files stored on the system storage device(s). Such a customer would require (and be willing to pay for) a fast communication channel access rate, but only need (and be willing to pay for) a slower access rate to files stored on media.
[0011] Multitasking operating systems today are not capable of regulating the file access rates of different processes generally, much less facilitating different access rates for specific processes based on file type. Currently, each process accesses both files stored on media and communication channels at unregulated rates, not controlled by the operating system. Thus, it is impossible for the ISP to provide customers with different access rates for files stored on media and for communication channels, based upon customer need and corresponding financial arrangement. What is further needed is a method that not only facilitates the regulation of the rate at which individual processes access the file system of a multitasking operating system, but which also allows processes to be regulated to different access rates for different file types.
[0012] It is further desirable to not only be able to set separate access rates for communication channels and files stored on media, but to be able set separate access rates for file types generally. Under some operating systems, entities other than communication channels and files stored on media are treated as files, and hence need separate access rates. For example, under the UNIX® operating system, hardware devices are treated as files. For the same reasons that it is desirable to set separate access rates for communication channels and files stored on media, it is further desirable to be able to set a separate access rate for any type of file. Accordingly, what is needed is a method to set separate access rates for individual processes according to file type.
SUMMARY OF INVENTION
[0013] The present invention allows regulation of the file access rates of processes according to file type. An association data structure stores associations between processes to be regulated and specific access rates for various file types. In order to regulate processes to their associated access rates, system calls that access files are intercepted. When a process to be regulated makes a system call that accesses a file, the system call is intercepted, and a system call wrapper executes instead. The system call wrapper determines the type of file that is being accessed by the process. The system call wrapper examines the association table in order to determine if the calling process is associated with an access rate for that file type. If not, then the process is not to be regulated for that file type, in which case the system call wrapper simply allows the file access to proceed. Otherwise, the system call wrapper regulates the rate of the access to the file according to the appropriate rate.
[0014] The features and advantages described in this summary and the following detailed description are not all-inclusive, and particularly, many additional features and advantages will be apparent to one of ordinary skill in the art in view of the drawings, specification, and claims hereof. Moreover, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter, resort to the claims being necessary to determine such inventive subject matter.
BRIEF DESCRIPTION OF THE DRAWINGS
[0015] FIG. 1 is a block diagram providing a high level overview of a system for regulating file access rates of processes based upon file type, according to one embodiment of the present invention.
[0016] FIG. 2 is a block diagram illustrating a system for managing an association table by an access rate regulator program, according to one embodiment of the present invention.
[0017] FIG. 3 is a block diagram illustrating a system for managing an association table by a modified loader program, according to another embodiment of the present invention.
[0018] FIG. 4 is a block diagram illustrating a system for regulating file access rate, according to one embodiment of the present invention.
[0019] FIG. 5 is a block diagram illustrating a leaky-bucket regulator according to one embodiment of the present invention.
[0020] The figures depict embodiments of the present invention for purposes of illustration only. One skilled in the art will readily recognize from the following discussion that alternative embodiments of the structures and methods illustrated herein may be employed without departing from the principles of the invention described herein.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
I. System Overview
[0021] FIG. 1 illustrates a high level overview of a system 100 for regulating file access rates of processes 107 based upon file type according to one embodiment of the present invention. A computer memory 101 includes user address space 103 and operating system address space 105. A process 107 executes in user address space 103. Although FIG. 1 illustrates only a single process 107 executing in user address space 103, it is to be understood that within a given computer memory 101, multiple processes 107 can execute simultaneously.
[0022] Preferably, a data structure for storing associations 129 between processes 107 and access rates for file types is inserted into the operating system 117. In one embodiment, the data structure is an association table 127, but in other embodiments other data structures are utilized, for example a linked list. In one embodiment, the association table 127 (or other data structure) is dynamically loaded into the operating system kernel 109, while the kernel 109 is active. In another embodiment, the association table 127 is stored in user address space 103. The maintenance and use of the association table 127 is discussed in detail below.
[0023] In order to regulate file access rates, system calls 115 that access files are intercepted. A system call wrapper 111 is utilized in order to intercept system calls 115. In one embodiment, the system call wrapper 111 is dynamically loaded into the operating system kernel 109, while the kernel 109 is active. In another embodiment, the system call wrapper is loaded in user address space 103. The system call wrapper 111 is preferably in the form of object code, the functional features of which are described in detail below.
[0024] Pointers 114 to system calls 115 are located in an operating system call vector table 113. It is to be understood that the term “system call vector table” as used herein denotes an area in operating system address space 105 in which there are stored the addresses of system calls. In the UNIX® operating system, this part of the operating system is called the “system call vector table,” and that term is used in this specification. Other operating systems employ different terminology to denote the sane system component. A system call vector table by any other name is still within the scope of the present invention.
[0025] A copy 116 is made of a pointer 114 to each system call 115 to be intercepted. These copies 116 of pointers 114 are preferably stored in operating system address space 105, but in an alternative embodiment are stored in user address space 103. Once the copies 116 have been made and saved, the pointers 114 in the system call vector table 113 to the system calls 115 to be intercepted are replaced with pointers 118 to the system call wrapper 111, such that when a system call 115 to be intercepted is made, the system call wrapper 111 executes instead. In one embodiment, this copying, storing, and replacing of pointers is performed by the system call wrapper 111. In other embodiments, copying, storing, and replacing of pointers is performed by a pointer management module executing in either operating system address space 105 or user address space 103 as desired. The pointer management module can either be a stand alone program, or a component of a larger application program as desired.
[0026] Executing alternative code when a system call 115 is made comprises intercepting the system call 115. The steps of inserting a system call wrapper 111 into the operating system 117, making a copy 116 of an operating system pointer 114 to a system call 115, and replacing the operating system pointer 114 with a pointer 118 to the system call wrapper 111 facilitate interception of a system call 115. When a system call 115 to be intercepted is made, the operating system 117 uses the pointer 118 in the system call vector table 113 to the system call wrapper 111 to execute the system call wrapper 111.
[0027] It is to be understood that only system calls 115 that access files need be intercepted, and thus only pointers 114 to system calls 115 to be intercepted are replaced with pointers 118 to the system call wrapper 111. Pointers 114 to system calls 115 which are not to be intercepted are not replaced. Thus, when a non-intercepted system call 115 is made, the system call 115 executes, not the system call wrapper 111.
[0028] In one embodiment, a single system call wrapper 111 is loaded into operating system address space 105. Thus, whenever any process 107 makes a system call 115 to be intercepted, the system call wrapper 111 executes. In another embodiment, techniques described in the “Selective Interception of System Calls” application are used to associate a specific system call wrapper 111 with each process to be regulated.
[0029] Processes 107 execute in user address space 103 under control of the operating system 117, and make system calls 115. When a process makes a system call 115 that accesses a file, the system call wrapper 111 determines the type of the file being accessed. The system call wrapper 111 also examines the association table 127 to determine whether the process 107 that made the system call 115 is associated with an access rate for that file type. If so, the system call wrapper 111 regulates the file access rate appropriately. Otherwise, the access is allowed to proceed normally. Note that even in the embodiment in which processes 107 to be regulated are associated with individual system call wrappers 111, the system call wrapper still determines if the process 107 is associated with a rate for the file type being accessed, because an individual process 107 may be regulated for some file types and not for others.
II. Storing Associations by a Regulator Program
[0030] FIG. 2 illustrates one embodiment of a system 200 for regulating file access rates of processes 107 based upon file type. In the embodiment illustrated by FIG. 2 , the association table 127 is managed by an access rate regulator program 201.
[0031] The access rate regulator program 201 modifies the operating system 117 of the computer to include the association table 127. Preferably, the regulator program 201 loads the association table 127 into the kernel 109 of the operating system 117 while the kernel is active.
[0032] For each process 107 to be regulated, the regulator program 201 stores, in the association table 127, an association 129 between the process 107 and an access rate for at least one file type. For example, suppose a process 107 associated with a financial services host is to be regulated to 1,000 bytes per second for files stored on media, and to 1,400 bytes per second for communication channels. The regulator program 201 would store two associations for the process 107, the first indicating the access rate for files stored on media (1,000 bytes per second), and the second the access rate for communication channels (1,400 bytes per second). Of course, the regulator program 201 can add, modify, and delete associations 129 from the association table 127, as desired.
III. Storing Associations by a Loader Program
[0033] FIG. 3 illustrates another embodiment of a system 300 for regulating file access rates of processes 107 based upon file type. In the embodiment illustrated by FIG. 3 , processes 107 to be regulated are loaded by the modified loader program 301, which also stores the associations 129.
[0034] A loader program is an operating system utility that is used to execute computer programs that are stored on static media. Typically, a loader program loads an executable image from static media into user address space 103 of computer memory 101, and then initiates execution of the loaded image by transferring execution to the first instruction thereof.
[0035] Like a standard loader program, the modified loader 301 loads executable images from static media into user address space 103. Additionally, the modified loader program 301 stores, in the association table 127, at least one association 129 between the process 107 and a file access rate. Thus, whenever a process 107 to be regulated is loaded, the association table 127 is updated as needed.
[0036] In other embodiments, in addition to storing associations, the modified loader program 301 uses methodology described in detail in the “Selective Interception of System Calls” application in order to associate an individual system call wrapper 111 with the loaded process 107. In different embodiments, the system call wrapper 111 associated with the process is loaded into process address space of the process, user address space 103, or operating system address space 105 as described in the “Selective Interception of System Calls” application. In each of these embodiments, whenever the process 107 makes a system call 115 to be intercepted (i.e., a system call 115 that accesses a file) the system call wrapper 111 associated with the process 107 executes, and proceeds to manage the regulation of the file access rate. Regulation of file access rate by system call wrappers 111 generally is discussed in detail below.
IV. Determining the File Type
[0037] When a system call wrapper 111 executes, the system call wrapper determines the type of the file being accessed. Once the file type has been determined, the system call wrapper 111 examines the association table 127 to determine whether the process 107 that made the system call 115 is associated with an access rate for that file type. If so, the system call wrapper 111 regulates the file access rate appropriately. Otherwise, access of files of that type by the process 107 is not to be regulated, so the access is allowed to proceed normally. In one embodiment, the determination is made using methodology described in the “Disambiguating File Descriptors” application. Other techniques such as file extension or file name can also be used as desired.
V. Regulating the Access Rate
[0038] FIG. 4 illustrates one embodiment of a system 400 for regulating file access rate. After determining the file type being accessed, the system call wrapper 111 executes a file access rate regulation module 401 in order to regulate the access rate of the file 403 by the process 107. In one embodiment, the file access rate regulation module 401 executes in operating system address space 105, as illustrated in FIG. 4. In another embodiment, the file access rate regulation module 401 executes in user address space 103. The file access rate regulation module 401 can either be a section of the system call wrapper (as illustrated), a stand alone program, or a component of a larger application program as desired. In any case, the file access rate regulation module 401 applies a known rate regulation technique to the access of the file 403 by the process 107. More specifically, data being written to the file 403 by the process (input to the file 405) is routed through the file access rate regulation module 401. The file access rate regulation module 401 controls the rate at which the input 405 is sent to the file 403 by the process. Likewise, data read by the process 107 from the file (output from the file 407) is also routed through the file access rate regulation module 401, which controls the rate at which the output 407 is sent to the process 107.
[0039] Many techniques for regulating access rate are known. In one embodiment, the file access rate regulation module 401 uses a leaky-bucket regulator to regulate the access rate. A leaky-bucket regulator is one specific example of a technique for regulating access rates. A leaky-bucket regulator is described in An Engineering Approach to Computer Networking, Srinivasan Keshav, 1997, Addison Wesley, Chapter 7, at pp 403-405, which is incorporated herein by reference.
[0040] FIG. 5 illustrates a leaky-bucket regulator 501. As illustrated in FIG. 5 , the leaky-bucket regulator 501 stores fixed sized tokens 503 in a data structure known as a token (or leaky) bucket 505. Each token 503 constitutes permission for the regulator 501 to send a certain number of bits to a destination. The regulator 501 adds tokens 503 to the bucket 505 at a fixed rate, R. The bucket 505 overflows if the number of tokens 503 crosses some threshold, called its depth, D.
[0041] Data arrives at the regulator 501 as input 507 from a source. A test module 509 examines the bucket 505, to determine the sum of the sizes of the tokens 503 therein. The regulator 501 only sends the data as output to a destination 511 if the sum equals or exceeds the size of the data. When data is sent as output 511, the regulator 501 removes tokens 503 corresponding to the output 511 size from the token bucket 505.
[0042] If the sum is less than the size of the input 507, the input 507 is held as stored data 513 in a data buffer 515. Once the bucket 505 contains sufficient tokens 503, the stored data 513 is sent as output 511.
[0043] A leaky-bucket regulator 501 limits the size of a burst of output 511 to a little more D. The size can be slightly greater than D because tokens 503 may be added to the bucket 505 while output 511 equal in size to D is being sent. Over the long term, the rate at which output 511 is sent by the regulator 501 is limited by the rate R at which tokens 503 are added to the bucket 505. Thus, the leaky-bucket regulator 501 can be used to regulate a process 107 to an access rate for a file type by setting R to that access rate.
[0044] For example, suppose the system call wrapper 111 determines that the file access write for a process 107 is 1,000 bytes per second. The system call wrapper passes the rate to the leaky-bucket regulator 501, which proceeds to set R to the rate. Thus, the regulator 501 adds 1,000 byte tokens 503 to a bucket 505 at a rate of once per second. The system call wrapper 111 then routes the communication between the process 107 and the file through the regulator 501, which regulates the access rate to 1,000 bytes per second.
[0045] Note that if the process 107 is writing data to a file 403, the input to the file 405 becomes the input 507 to the leaky bucket regulator 501, and the output 511 from the leaky bucket regulator 501 is sent to the file 403. On the other hand, if the process 107 is reading data from a file 403, the output from the file 407 becomes the input 507 to the leaky bucket regulator 501, and the output 511 from the leaky bucket regulator 501 is sent to the process 107.
[0046] In other embodiments, other access rate techniques are employed by the file access rate regulation module 401, for example moving average, jumping average, or peak rate.
[0047] As will be understood by those familiar with the art, the invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. Likewise, the particular capitalization or naming of the modules, protocols, features, attributes or any other aspect is not mandatory or significant, and the mechanisms that implement the invention or its features may have different names or formats. Accordingly, the disclosure of the present invention is intended to be illustrative, but not limiting, of the scope of the invention, which is set forth in the following claims.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
1. A computer-implemented method for regulating file access rates of processes according to file type, the computer-implemented method comprising:
intercepting a system call attempts to access a file;
determining whether a process that made the intercepted system call is associated with an access rate corresponding to a type of the file being accessed;
in response to the attempt to access the file by the process, determining the associated access rate for the type of the file being accessed; and
regulating the process to access of the file at the determined rate.
2. The method of claim 1 further comprising:
storing an association between a selected process the an access rate for at least one file type.
3. The method of claim 2 wherein:
storing the association is performed by a process executing in user address space.
4. The method of claim 1 further comprising:
selecting a process to associate with an access rate for at least one file type;
loading the selected process into process address space by a modified loader program; and
storing, by the modified loader program, an association between the selected process and the access rate for at least one file type.
5. The method of claim 1 further comprising:
associating at least two different access rates with a single process, each access rate corresponding to a different file type.
6. The method of claim 1 further comprising:
associating at least two different access rates with at least two different processes.
7. The method of claim 1 wherein:
in response to the determination that the process is associated with the access rate, regulating the process to access of the file at the associated rate.
9. The method of claim 1, further comprising:
associating at least one process with the access rate for at least one file type.
10. A computer-readable program product for regulating file rates of processes according to file type, the computer-readable program product comprising:
program code for intercepting a system call attempts to access a file;
program code for determining whether a process that made the intercepted system call is associated with an access rate corresponding to a type of the file being accessed;
program code for, in response to the attempt to access the file by the process, determining the associated access rate for the type of the file being accessed;
program code for regulating the process to access of the file at the determined rate; and
a computer readable medium on which the program codes are stored.
11. The computer-readable program product of claim 10 father comprising:
program code for storing an association between a selected process and an access rate for at least one file type.
12. The computer-readable program product of claim 10 further comprising:
program code for selecting a process to associate with the access rate for at least one file type;
program code for loading the selected process into process address space; and
program code for storing an association between the selected process and the access rate for at least one file type.
13. The computer-readable program product of claim 10 further comprising:
program code for associating at least two different access rates with a single process, each access rate corresponding to a different file type.
14. The computer-readable program product of claim 10 further comprising:
program code for associating at least two different access rates with at least two different processes.
15. The computer-readable program product of claim 10 further comprising:
program code for, in response to the determination that the process is associated with the access rate, regulating the process to access of the file at the associated rate.
16. The computer-readable program product of claim 10 further comprising:
program code for determining the type of the file being accessed.
17. The compute-readable program product of claim 10 further comprising:
program code for associating at least one process with the access rate for at least one file type.
18. A computer implemented system for regulating file access rates of processes according to a file type, the system comprising:
an interception module, for intercepting system calls that access files, the interception module being coupled to a determination module;
at least one system call wrapper, for determining whether a process that made an intercepted system call is associated with an access rate corresponding to a type of the file being accessed, the system call wrapper being coupled to the interception module;
the determination module for, in response to an attempt to access a file by the process, determining the associated access rate for the type of the file being accessed; and
coupled to the determination module, a file access rate regulation module, for regulating the process to access of the file at the determined rate.
19. The computer system of claim 18 further comprising:
a selection module for selecting the process to associate with the access rate for at least one file type, the selection module being coupled to the determination module; and
a modified loader program for loading the selected process into process address space, and for storing the association between the selected process and the access rate for at least one file type, the modified loader program being coupled to the selection module.
20. The computer system of claim 18 further comprising:
a storage module, for storing the association between a selected process and the access rate for at least one file type, the storage module being coupled to the determination module.
21. A computer-implemented method for regulating file access rates of processes according to file type, the method comprising:
associating processes with rates for accessing files of specific types;
detecting attempts by processes to access files by intercepting system calls that access files;
determining associated access rates for the types of files being accessed; and
regulating processes to access of the files at the associated rates.
Patent Citations (131)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3377624(A) | 1968-04-01 | Nelson et al. | Applicant |
| US4177510(A) | 1979-12-01 | Appell et al. | Applicant |
| US5189667(A) | 1993-02-01 | Esaki et al. | Applicant |
| US5212793(A) | 1993-05-01 | Donica et al. | Applicant |
| US5226160(A) | 1993-07-01 | Waldron et al. | Applicant |
| US5249290(A) | 1993-09-01 | Heizer | Applicant |
| US5263147(A) | 1993-11-01 | Francisco et al. | Applicant |
| US5325530(A) | 1994-06-01 | Mohrmann | Applicant |
| US5437032(A) | 1995-07-01 | Wolf et al. | Applicant |
| US5528753(A) | 1996-06-01 | Fortin | Applicant |
| US5572680(A) | 1996-11-01 | Ikeda et al. | Applicant |
| US5584023(A) | 1996-12-01 | Hsu | Applicant |
| US5603020(A) | 1997-02-01 | Hashimoto et al. | Applicant |
| US5623492(A) | 1997-04-01 | Teraslinna | Applicant |
| US5636371(A) | 1997-06-01 | Yu | Applicant |
| US5640595(A) | 1997-06-01 | Baugher et al. | Applicant |
| US5692047(A) | 1997-11-01 | McManis | Applicant |
| US5706097(A) | 1998-01-01 | Schelling et al. | Applicant |
| US5706453(A) | 1998-01-01 | Cheng et al. | Applicant |
| US5708774(A) | 1998-01-01 | Boden | Applicant |
| US5719854(A) | 1998-02-01 | Choudhury et al. | Applicant |
| US5727203(A) | 1998-03-01 | Hapner et al. | Applicant |
| US5748614(A) | 1998-05-01 | Wallmeier | Applicant |
| US5752003(A) | 1998-05-01 | Hart | Applicant |
| US5761477(A) | 1998-06-01 | Wahbe et al. | Applicant |
| US5764889(A) | 1998-06-01 | Ault et al. | Applicant |
| US5781550(A) | 1998-07-01 | Templin et al. | Applicant |
| US5799173(A) | 1998-08-01 | Gossler et al. | Applicant |
| US5809527(A) | 1998-09-01 | Cooper et al. | Applicant |
| US5828893(A) | 1998-10-01 | Weid et al. | Applicant |
| US5838686(A) | 1998-11-01 | Ozkan | Applicant |
| US5838916(A) | 1998-11-01 | Domenikos et al. | Applicant |
| US5842002(A) | 1998-11-01 | Schnurer et al. | Applicant |
| US5845129(A) | 1998-12-01 | Wendorf et al. | Applicant |
| US5850399(A) | 1998-12-01 | Ganmukhi et al. | Applicant |
| US5860004(A) | 1999-01-01 | Fowlow et al. | Applicant |
| US5864683(A) | 1999-01-01 | Boebert et al. | Applicant |
| US5889956(A) | 1999-03-01 | Hauser et al. | Applicant |
| US5889996(A) | 1999-03-01 | Adams | Applicant |
| US5892968(A) | 1999-04-01 | Iwasaki et al. | Applicant |
| US5905730(A) | 1999-05-01 | Yang et al. | Applicant |
| US5905859(A) | 1999-05-01 | Holloway et al. | Applicant |
| US5913024(A) | 1999-06-01 | Green et al. | Applicant |
| US5915085(A) | 1999-06-01 | Koved | Applicant |
| US5915095(A) | 1999-06-01 | Miskowiec | Applicant |
| US5918018(A) | 1999-06-01 | Gooderum et al. | Applicant |
| US5920699(A) | 1999-07-01 | Bare | Applicant |
| US5933603(A) | 1999-08-01 | Vahalia et al. | Applicant |
| US5937159(A) | 1999-08-01 | Meyers et al. | Applicant |
| US5956481(A) | 1999-09-01 | Walsh et al. | Applicant |
| US5978373(A) | 1999-11-01 | Hoff et al. | Applicant |
| US5982748(A) | 1999-11-01 | Yin et al. | Applicant |
| US5987524(A) | 1999-11-01 | Yoshida et al. | Applicant |
| US5991812(A) | 1999-11-01 | Srinivasan | Applicant |
| US5999963(A) | 1999-12-01 | Bruno et al. | Applicant |
| US6016318(A) | 2000-01-01 | Tomoike | Applicant |
| US6018527(A) | 2000-01-01 | Yin et al. | Applicant |
| US6023721(A) | 2000-02-01 | Cummings | Applicant |
| US6038608(A) | 2000-03-01 | Katsumata | Applicant |
| US6038609(A) | 2000-03-01 | Geulen | Applicant |
| US6047325(A) | 2000-04-01 | Jain et al. | Applicant |
| US6055617(A) | 2000-04-01 | Kingsbury | Applicant |
| US6061349(A) | 2000-05-01 | Coile et al. | Applicant |
| US6065118(A) | 2000-05-01 | Bull et al. | Applicant |
| US6075791(A) | 2000-06-01 | Chiussi et al. | Applicant |
| US6075938(A) | 2000-06-01 | Bugnion et al. | Applicant |
| US6078929(A) | 2000-06-01 | Rao | Examiner |
| US6078957(A) | 2000-06-01 | Adelman et al. | Applicant |
| US6086623(A) | 2000-07-01 | Broome et al. | Applicant |
| US6092178(A) | 2000-07-01 | Jindal et al. | Applicant |
| US6094674(A) | 2000-07-01 | Hattori et al. | Applicant |
| US6101543(A) | 2000-08-01 | Alden et al. | Applicant |
| US6108701(A) | 2000-08-01 | Davis et al. | Applicant |
| US6108759(A) | 2000-08-01 | Orcutt et al. | Applicant |
| US6122673(A) | 2000-09-01 | Basak et al. | Applicant |
| US6154776(A) | 2000-11-01 | Martin | Applicant |
| US6154778(A) | 2000-11-01 | Koistinen et al. | Applicant |
| US6161139(A) | 2000-12-01 | Win et al. | Applicant |
| US6167520(A) | 2000-12-01 | Touboul | Applicant |
| US6172981(B1) | 2001-01-01 | Cox et al. | Applicant |
| US6189046(B1) | 2001-02-01 | Moore et al. | Applicant |
| US6192389(B1) | 2001-02-01 | Ault et al. | Applicant |
| US6192512(B1) | 2001-02-01 | Chess | Applicant |
| US6230203(B1) | 2001-05-01 | Koperda et al. | Applicant |
| US6240463(B1) | 2001-05-01 | Benmohamed et al. | Applicant |
| US6247057(B1) | 2001-06-01 | Barrera | Applicant |
| US6259699(B1) | 2001-07-01 | Opalka et al. | Applicant |
| US6266678(B1) | 2001-07-01 | McDevitt et al. | Examiner |
| US6269404(B1) | 2001-07-01 | Hart et al. | Applicant |
| US6279039(B1) | 2001-08-01 | Bhat et al. | Applicant |
| US6279040(B1) | 2001-08-01 | Ma et al. | Applicant |
| US6282581(B1) | 2001-08-01 | Moore et al. | Applicant |
| US6282703(B1) | 2001-08-01 | Meth et al. | Applicant |
| US6286047(B1) | 2001-09-01 | Ramanathan et al. | Applicant |
| US6298479(B1) | 2001-10-01 | Chessin et al. | Applicant |
| US6314558(B1) | 2001-11-01 | Angel et al. | Applicant |
| US6327622(B1) | 2001-12-01 | Jindal et al. | Applicant |
| US6336138(B1) | 2002-01-01 | Caswell et al. | Applicant |
| US6351775(B1) | 2002-02-01 | Yu | Applicant |
| US6353616(B1) | 2002-03-01 | Elwalid et al. | Applicant |
| US6363053(B1) | 2002-03-01 | Schuster et al. | Applicant |
| US6370583(B1) | 2002-04-01 | Fishler et al. | Applicant |
| US6381228(B1) | 2002-04-01 | Prieto, Jr. et al. | Applicant |
| US6385638(B1) | 2002-05-01 | Baker-Harvey | Applicant |
| US6389448(B1) | 2002-05-01 | Primak et al. | Applicant |
| US6393484(B1) | 2002-05-01 | Massarani | Applicant |
| US6425003(B1) | 2002-07-01 | Herzog et al. | Applicant |
| US6430622(B1) | 2002-08-01 | Aiken, Jr. et al. | Applicant |
| US6434631(B1) | 2002-08-01 | Bruno et al. | Applicant |
| US6434742(B1) | 2002-08-01 | Koepele, Jr. | Applicant |
| US6438134(B1) | 2002-08-01 | Chow et al. | Applicant |
| US6442164(B1) | 2002-08-01 | Wu | Applicant |
| US6457008(B1) | 2002-09-01 | Rhee et al. | Applicant |
| US6463459(B1) | 2002-10-01 | Orr et al. | Applicant |
| US6470398(B1) | 2002-10-01 | Zargham et al. | Examiner |
| US6487578(B2) | 2002-11-01 | Ranganathan | Applicant |
| US6487663(B1) | 2002-11-01 | Jaisimha et al. | Examiner |
| US6490670(B1) | 2002-12-01 | Collins et al. | Applicant |
| US6499137(B1) | 2002-12-01 | Hunt | Applicant |
| US6529950(B1) | 2003-03-01 | Lumelsky et al. | Applicant |
| US6529985(B1) | 2003-03-01 | Deianov et al. | Examiner |
| US6542167(B1) | 2003-04-01 | Darlet et al. | Applicant |
| US6553413(B1) | 2003-04-01 | Leighton et al. | Applicant |
| US6560613(B1) | 2003-05-01 | Gylfason et al. | Examiner |
| US6578055(B1) | 2003-06-01 | Hutchison et al. | Applicant |
| US6578068(B1) | 2003-06-01 | Bowman-Amuah | Applicant |
| US6580721(B1) | 2003-06-01 | Beshai | Applicant |
| US6658571(B1) | 2003-12-01 | O'Brien et al. | Applicant |
| US6691312(B1) | 2004-02-01 | Sen et al. | Examiner |
| US2003/0061338(A1) | 2003-03-01 | Stelliga | Applicant |
| WO99/39261 | 1999-08-01 | Applicant |
Non-Patent Literature (50)
- Keshav, S., An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network, Reading, MA, Addison-Wesley, 1997, pp. vii-xi, 85-115, 209-355, 395-444.Applicant
- Stevens, R. W., UNIX Network Programming vol. 1 Networking APIs: Sockets and XTI, Upper Saddle River, NJ, Prentice Hall, 1998, pp. v-xiv, 29-53, 85-110, 727-760.Applicant
- Tanenbaum, A. S. and Woodhull, A. S., Operating Systems: Design and Implementation, Upper Saddle River, NJ, Prentice Hall, 1997, pp. vii-xiv, 1-46, 401-454.Applicant
- Rubini, A., LINUX Device Drivers, Sebastopol, CA, O'Reilly & Associates, Inc., 1998, pp v-x, 13-40.Applicant
- Goyal, P., et al., “A Hierarchical CPU Scheduler for Multimedia Operating Systems,” Proceedings of the Second Symposium on Operating Systems Design and Impelementations (OSDI'96), Seattle, WA, Oct. 1996, 15 pages.Applicant
- Laurie, B. and Laurie, P., Apache The Definitive Guide, Sebastopol, CA, O'Reilly & Associates, Inc., Feb. 1999, pp. v-viii, 43-74.Applicant
- Aho, A. V. and Ullman J. D., Principles of Compiler Design, Reading, MA, 1977, pp vii-x, 359-362, 519-522.Applicant
- Jonsson, J., “Exploring the Importance of Preprocessing Operations in Real-Time Multiprocessor Scheduling,” Proc. of the IEEE Real-Time Systems Symposium—Work-in-Progress session, San Francisco, CA, Dec. 4, 1997, pp 31-34.Applicant
- Rusling, D. A., Processes, [online], [retrieved on Dec. 7, 1999]. Retrieved from the Internet: URL: http://www.cebaf.gov/˜saw/linux/tlk-html/node44.htm.Applicant
- Rusling, D. A., Linux Processes, [online], [retrieved on Dec. 7, 1999]. Retrieved from the Internet: URL: http://www.cebaf.gov/˜saw/linux/tlk-html/node45.html.Applicant
- Rusling, D. A., Identifiers, [online], [retrieved on Dec. 7, 1999]. Retrieved from the Internet: URL: http://www.cebaf.gov/˜saw/linux/tlk-html/node46.html.Applicant
- Rusling, D. A., Scheduling, [online], [retrieved on Dec. 7, 1999]. Retrieved from the Internet: URL: http://www.cebaf.gov/˜saw/linux/tlk-html/node47.html.Applicant
- Rusling, D. A., Scheduling in Multiprocessor Systems, [online], [retrieved on Dec. 7, 1999]. Retrieved from the Internet: URL: http://www.cebaf.gov/˜saw/linux/tlk-html/node48.html.Applicant
- Rusling, D. A., Files, [online], [retrieved on Dec. 7, 1999]. Retrieved from the Internet: URL: http://www.cebaf.gov/˜saw/linux/tlk-html/node49.html.Applicant
- Goyal, P. et al., “Start-time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks,” Proceedings of ACM SIGCOMM '96, San Francisco, CA, Aug. 1996, 14 pages.Applicant
- Jánosi, T., “Notes on ‘A Hierarchical CPU Scheduler for Multimedia Operating Systems’ by Pawan Goyal, Xingang Guo and Harrick Vin,” [online], [retrieved on May 8, 2000]. Retrieved from the Internet: URL: http://cs.cornell.edu/Info/Courses/Spring-97/CS614/goy.htm.Applicant
- Goyal, P., “Packet Scheduling Algorithms for Integrated Services Networks,” PhD Dissertation, University of Texas, Austin, TX, Aug. 1997.Applicant
- Pending U.S. Appl. No. 09/452,286, entitled “Providing Quality of Service Guarantees to Virtual Hosts,” filed Nov. 30, 1999.Applicant
- Pending U.S. Appl. No. 09/499,098, entitled “Selective Interception of System Calls,” filed Feb. 4, 2000.Applicant
- Pending U.S. Appl. No. 09/498,450, entitled “Dynamic Scheduling of Task Streams in a Multiple-Resource System to Ensure Task Stream Quality of Service,” filed Feb. 4, 2000.Applicant
- Pending U.S. Appl. No. 09/500,212, entitled “Disambiguating File Descriptors,” filed Feb. 8, 2000.Applicant
- Pending U.S. Appl. No. 09/502,155, entitled “Restricting Communication Between Network Devices on a Common Network,” filed Feb. 11, 2000.Applicant
- Pending U.S. Appl. No. 09/503,975, entitled “Restricting Communication of Selected Processes to a Set of Specific Network Addresses,” filed Feb. 14, 2000.Applicant
- Pending U.S. Appl. No. 09/526,980, entitled “Enabling a Service Provider to Provide Intranet Services,” filed Mar. 15, 2000.Applicant
- Pending U.S. Appl. No. 09/569,371, entitled “Dymamically Modifying the Resources of a Virtual Server,” filed May 11, 2000.Applicant
- Boehm, B., “Managing Software Productivity and Reuse,” IEEE Computer, vol. 32, No. 9, Sep. 1999, 3 pages.Applicant
- Corbato, F. J. et al. “An Experimental Timesharing System,” Proceedings of the American Federation Of Information Processing Societies Spring Joint Computer Conference, San Francisco, CA, May 1-3, 1962, pp 335-344.Applicant
- Deutsch, P. and Grant, C.A., “A Flexible Measurement Tool for Software Systems,” Information Processing 71 (Proc. of the IFIP Congress), 1971, pp. 320-326.Applicant
- Edijali, G., et al., “History-based Access Control for Mobile Code,” Fifth ACM Conference on Computer and Communication Security, Nov. 3-5, 1998, 19 pages.Applicant
- Erlingsson, U. and Schneider, F. B., “SASI Enforcement of Security Policies: A Retrospective,” Proc. New Security Paradigms Workshop, Apr. 2, 1999, pp 1-17.Applicant
- Erlingsson, U. and Schneider, F. B., IRM Enforcement of Java Stack Inspection, [online], Feb. 19, 2000, [retrieved on Apr. 2, 2002]. Retrieved from the Internet: URL : http://cs-tr.cs.cornell.edu/Dienst/UI2.0/Show Page/ncstrl.cornell/TR2000-1786.Applicant
- Evans, D. and Twyman, A., “Flexible Policy-Directed Code Safety,” Proc. of 1999 IEEE Symposium on Security and Privacy, Oakland, CA, May 9-12, 1999, pp. 1-14.Applicant
- Fraser, T. et al., “Hardening COTS Software with Generic Software Wrappers,” Proc. of 1999 IEEE Symposium on Security and Privacy, 1999, 15 pages.Applicant
- Goldberg, I. et al., “A Secure Environment For Untrusted Helper Applications (Confining the Wily Hacker),” Proc. of the Sixth USENIX UNIX Security Symposium, San Jose, CA, Jul. 1996, 14 pages.Applicant
- Goldberg, R. P., “Survey of Virtual Machine Research,” IEEE Computer, Jun. 1974, pp 34-45.Applicant
- Pandey, R. and Hashii, B., “Providing Fine-Grained Access Control For Mobile Programs Through Binary Editing,” Technical Report TR98 08, University of California, Davis, CA, 1998, pp 1-22.Applicant
- Ritchie, D. M., “The Evolution of the Unix TIme-Sharing System,” AT&T Bell Laboratories Technical Journal 63, No. 6, Part 2, Oct. 1984, (originally printed 1979), 11 pages.Applicant
- Saltzer, J., H. and Schroeder, M. D., The Protection of Information in Computer Systems, [online], 1973, [retrieved on Apr. 2, 2002]. Retrieved from the Internet: URL: http://www.cs.virginia.edu˜evans/cs551/saltzer.Applicant
- Wahbe, R., et al., “Efficient Software-Based Fault Isolation,” Proc. of the Symposium on Operating System Principles, 1993, 14 pages.Applicant
- Plummer, D. C., An Ethernet Address Resolution Protocol—or—Converting Network Protocol Addresses to 48.bit Ethernet Address for Transmission on Ethernet Hardware, Nov. 1982, [online], [retrieved on Jan. 17, 2000]. Retrieved from the Internet: URL: http://www.msg.net/kadow/answers/extras/rfc/rfc826.tx.Applicant
- Huang, X. W. et al., “The ENTRAPID Protocol Development Environment,” Proceedings of IEEE Infocom'99, Mar. 1999, nine pages.Applicant
- Duffield, N.G., et al., “A Flexible Model for Resource Management in Virtual Private Networks,” Computer Communication Review Conference, Computer Communication, ACM SIGCOMM '99 Conference, Cambridge, MA, Aug. 30, 1999-Sep. 3, 1999. pp 95-108.Applicant
- Campbell, A. T. and Keshav, S., “Quality of Service in Distributed Systems,” Computer Communications 21, 1998, pp 291-293.Applicant
- Bach, M. J., The Design of the Unix® Operating System, New Delhi, Prentice-Hall of India, 1989, pp v-x, 19-37.Applicant
- McDougall, R., et al., Resource Management, Upper Saddle River, NJ, Prentice Hall, 1999, pp iii-xix, 135-191.Applicant
- Rijsinghani, A., RFC 1624, May 1994, [online], [retrieved Feb. 2, 2000]. retrieved from the internet: URL: http://www.faqs.org/rfcs/rfc1624.html.Applicant
- Mallory, T and Kullberg, A., RFC 1141, Jan. 1990 [online], [retrieved Feb. 2, 2000]. retrieved from the Internet: URL: http://www.faqs.org/rfcs/rfc1141.html.Applicant
- Egevang, K. and Francis P., RFC 1631, May 1994 [online], [retrieved on Feb. 2, 2000]. retrieved from the Internet: URL: http://www.faqs.org/rfcs/rfc1631.html.Applicant
- Goyal, Pawan et al., Generalized Guaranteed Rate Scheduling Algorithms: A Framework, IEEE/ACM Transactions, vol. 5, Issue: 4, Aug. 1997; pp. 561-571.Applicant
- Symbol Table, [online] copyright 1997, 1998, [Retrieved on Apr. 4, 2003] Retrieved from the internet < URL: http://216.239.33. 100/search?q=cache:eASXk8qC_AC:www.caldera.com/developers/gabi/1998-04-29/ch4.s . . . , pp. 1-5.Applicant