Results 1 - 10 of 290,388

Table 6: Blocking probabilities for the multi-server example.

in An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates
by Gagan L. Choudhury, Kin K. Leung, Ward Whitt 1995
"... In PAGE 16: ... Class type 3 has 40 servers, o ered load 3 = 42, resource- unit requirement a13 = 1 and an upper limit of 100 jobs (100 resource units). In Table6 we show the results for 4 cases with di erent multiplicities and capacities. Note that the computational complexity of the inversion algorithm is O(rpK) and that of the recursive algorithm is O(rK2) where K is the number of resource units, r is the number of classes, and r is the number of types (3 in the above example).... ..."
Cited by 13

Table 2: Results for an unbalanced 3-station network with 2 multi-server stations,

in Approximate Mean Value Analysis for Closed Queuing Networks with Multiple-Server Stations
by Rajan Suri, Sushanta Sahu, Mary Vernon
"... In PAGE 5: ... We next test MS-AMVA for a 3-station unbalanced network containing one single server and two multi-server stations with , 1 1 = C 2 2 = C and . 4 3 = C As an example, Table2 shows the results for 8 = N . i S represent the service stations and the service times at these are included in the table.... ..."

Table 2: Response time variances of a queueing network with general service times at the entry node and two asymmetrically loaded multi-server service nodes.

in Modeling and Predicting End-to-End Response Times in Multi-Tier Internet Applications
by S. Bhulai, S. Sivasubramanian, R. Van Der Mei, M. Van Steen, De Boelelaan A
"... In PAGE 9: ... Table 1 shows the results for a variety of parameters, where the coefficient of variation for the service times at the entry nodes is varied between 0 (deterministic), 4 and 16 (Gamma distribution). These results are extended in Table2 with multi-server service nodes. If we look at the results, we see that the approximation is accurate in all cases.... ..."

Table 2. Response time variances of a queueing network with general service times at the entry node and two asymmetrically loaded multi-server service nodes.

in Modeling End-to-End Response Times in Multi-Tier Internet Applications
by Jai Bhulai, Swaminathan Sivasubramanian, Rob Van Der Mei, Maarten Van Steen, De Boelelaan A
"... In PAGE 9: ... Table 1 shows the results for a variety of parameters, where the coefficient of variation for the service times at the entry nodes is varied between 0 (deterministic), 4 and 16 (Gamma distribution). These results are extended in Table2 with multi- server service nodes. If we look at the results, we see that the approximation is accurate in all cases.... ..."

Table 6: Use of Multi-Server Content

in Analyzing Factors That Influence End-to-End Web Performance
by Balachander Krishnamurthy, Craig E. Wills
"... In PAGE 14: ... The rst part of our analysis is to determine the extent to which content is being served from multiple servers. These results are shown in Table6 where the second column shows the number of cases where the base object includes embedded objects by servers other than the base server. These numbers are relative to the count of base servers in column 2 of Table 1.... In PAGE 14: ... The purpose of these other sites is unknown|some may also serve ads, count clicks, or serve contracted content. Results in Table6 show the count of non-local servers in each category as well as the percentage of objects and bytes served by this category relative to the total number of objects... ..."

Table 6: Use of Multi-Server Content

in Analyzing factors that influence end-to-end Web performance Work Project No. 539054-0000
by Date November From, From Balachander, Craig E. Wills
"... In PAGE 12: ... The purpose of these other sites is unknown|some may also serve ads, count clicks, or serve contracted content. Results in Table6 show the count of non-local servers in each category as well as the percentage of objects and bytes served by this category relative to the total number of objects and bytes for the base Web page. The percentages only include Web pages where the given category of servers are present.... ..."

Table 1: A checkmark indicates that the authentication mode achieves the security goals outlined in Section 2. Note that all of these authentication modes are secure against network password sniffing and network cookie sniffing if HTTPS is used for passwords and cookies, respectively.

in Spyware Resistant Web Authentication Using Virtual Machines
by unknown authors
"... In PAGE 10: ... Used together, these techniques counter the most common web threats in a manner that is invisible to the server. As shown in Table1 , password hashing and injection do not protect against all possible threats, but they represent a dramatic improvement over existing web authentication. 4.... In PAGE 10: ....2.2 Password injection Password injection is designed to protect passwords from passive spyware. By itself, it pro- vides no protection against phishing, as indicated in Table1 . In the basic password injection scheme,... ..."

Table 3 gives the sizes of the code in the directories that make up a microkernel for the DECstation 3100. For comparison, the compiled size of the emulator library and the single server are also given.The Mach microkernel is about 65% the size of a Sprite kernel in the number of non-comment code lines. This is approximately equal to leaving out the Sprite file system, although other modules in the Sprite kernel depend on the file system. The single process UNIX server is about the same size as the microkernel, although I suspect there may be some dead code in the UNIX server. I do not have access to a multi-server implementation, so I cannot comment on the size of that system. All-in-all, the code size comparison comes out a wash. By the time a file system is added back onto

in The File System Belongs in the Kernel
by Brent Welch Welch 1991
"... In PAGE 12: ... Table3 . Sizes for a DECstation 3100 microkernel.... ..."
Cited by 15

Table 3 gives the sizes of the code in the directories that make up a microkernel for the DECstation 3100. For comparison, the compiled size of the emulator library and the single server are also given.The Mach microkernel is about 65% the size of a Sprite kernel in the number of non-comment code lines. This is approximately equal to leaving out the Sprite file system, although other modules in the Sprite kernel depend on the file system. The single process UNIX server is about the same size as the microkernel, although I suspect there may be some dead code in the UNIX server. I do not have access to a multi-server implementation, so I cannot comment on the size of that system. All-in-all, the code size comparison comes out a wash. By the time a file system is added back onto

in The File System Belongs in the Kernel
by Brent Welch 1991
"... In PAGE 12: ... Table3 . Sizes for a DECstation 3100 microkernel.... ..."
Cited by 15

Table 1. Sample Authentication Methods

in Middleware for Secure Home Access and Control
by Andres Marín, Wolfgang Mueller, Robbie Schaefer, Florina Almenárez, Daniel Díaz, Max Ziegler
"... In PAGE 3: ... Security levels refer certain amount of authentication points. Assume, we have five dif- ferent authentication schemes available in our environment and consider Table1 . Each authentication schema provides a different level of accuracy and security, depending on the method of authentication.... ..."
Results 1 - 10 of 290,388