This technology generally relates to network communication security, and more particularly, to prevent web scraping.
With the widespread use of web-based applications, and the Internet in general, concerns have been raised with the security of such servers and web applications operating on them in view of the array of bots and other web scraping potential malicious requests. Various security measures have been taken to combat these ever growing threats, including implementing web application firewalls (“WAFs”), such as the BIG-IP Application Security Manager™ (“ASM™”) product developed by F5 Networks, Inc., of Seattle, Wash., which may be used to analyze network traffic to Web application servers for identifying and filtering out malicious packets or to otherwise thwart malicious attacks.
Web scraping is a computer software technique of extracting information from web pages in which web scrapers, search engines or bots index web content and transforms unstructured Web content, typically in HTML format, into structured data that can be stored and analyzed in a central local database or spreadsheet. Although safeguards against web scraping exist, such as CAPTCHA, bots and other web scrapers have become more complex and able to bypass these safeguards to take content off of web pages.
In an aspect, a method for preventing web scraping comprises receiving a request between a web client and a web server for the web client to receive web content. The method comprises injecting a client side language script into a response to be sent to the requesting web client, wherein the client side language script contains an event listener to detect a keystroke and/or a mouse movement at the web client. The method comprises collecting information from the client side language script relating to whether the keystroke and/or the mouse movement were detected. The method comprises selectively allowing the web client to access the web server to receive the web content based on the collected information.
In an aspect, a machine readable medium having stored thereon instructions for preventing web scraping, comprising machine executable code which when executed by at least one machine, causes the machine to receive a request between a web client and a web server for the web client to receive web content. The code causes the machine to inject a client side language script into a response to be sent to the requesting web client, wherein the client side language script contains an event listener to detect a keystroke and/or a mouse movement at the web client. The code causes the machine to collect information from the client side language script relating to whether the keystroke and/or the mouse movement were detected. The code causes the machine to selectively allow the web client to access the web server to receive the web content based on the collected information.
In an aspect, a network traffic manager for preventing web scraping, the network traffic manager comprises a server interface coupled to a server and a network interface coupled to a web client via a network. The network interface receives a request from the web client requesting access to the server. A controller is coupled to the server interface and the network interface. The controller is operative to inject a client side language script into a response to be sent to the requesting web client, wherein the client side language script contains an event listener to detect a keystroke and/or a mouse movement at the web client. The controller collects information from the client side language script relating to whether the keystroke and/or the mouse movement were detected. The controller selectively allows the web client to access the web server to receive the web content based on the collected information.
While these examples are susceptible of embodiment in many different forms, there is shown in the drawings and will herein be described in detail preferred examples with the understanding that the present disclosure is to be considered as an exemplification and is not intended to limit the broad aspect to the embodiments illustrated.
Referring now to
Client devices 106 comprise computing devices capable of connecting to other computing devices, such as network traffic management device 110 and Web application servers 102. Such connections are performed over wired and/or wireless networks, such as network 108, to send and receive data, such as for Web-based requests, receiving responses to requests and/or performing other tasks, in accordance with the processes described below in connection with
Network 108 comprises a publicly accessible network, such as the Internet, which includes client devices 106. However, it is contemplated that the network 108 may comprise other types of private and public networks that include other devices. Communications, such as requests from clients 106 and responses from servers 102, take place over the network 108 according to standard network protocols, such as the HTTP and TCP/IP protocols in this example. However, the principles discussed herein are not limited to this example and can include other protocols. Further, it should be appreciated that network 108 may include local area networks (LANs), wide area networks (WANs), direct connections and any combination thereof, as well as other types and numbers of network types. On an interconnected set of LANs or other networks, including those based on differing architectures and protocols, routers, switches, hubs, gateways, bridges, and other intermediate network devices may act as links within and between LANs and other networks to enable messages and other data to be sent from and to network devices. Also, communication links within and between LANs and other networks typically include twisted wire pair (e.g., Ethernet), coaxial cable, analog telephone lines, full or fractional dedicated digital lines including T1, T2, T3, and T4, Integrated Services Digital Networks (ISDNs), Digital Subscriber Lines (DSLs), wireless links including satellite links and other communications links known to those skilled in the relevant arts. In essence, the network 108 includes any communication method by which data may travel between client devices 106, Web application servers 102 and network traffic management device 110, and the like.
LAN 104 comprises a private local area network that includes the network traffic management device 110 coupled to the one or more servers 102, although the LAN 104 may comprise other types of private and public networks with other devices. Networks, including local area networks, besides being understood by those skilled in the relevant arts, have already been generally described above in connection with network 108 and thus will not be described further.
Web application server 102 comprises one or more server computing machines capable of operating one or more Web-based applications that may be accessed by network devices in the network 108. Such network devices include client devices 106, via the network traffic management device 110, and may provide other data representing requested resources, such as particular Web page(s), image(s) of physical objects, and any other objects, responsive to the requests. It should be noted that the server 102 may perform other tasks and provide other types of resources. It should be noted that while only two Web application servers 102 are shown in the environment 100 depicted in
As per the TCP/IP protocols, requests from the requesting client devices 106 may be sent as one or more streams of data packets over network 108 to the network traffic management device 110 and/or the Web application servers 102. Such protocols can establish connections, send and receive data for existing connections, and the like. It is to be understood that the one or more Web application servers 102 may be hardware and/or software, and/or may represent a system with multiple servers that may include internal or external networks. In this example, the Web application servers 102 may be any version of Microsoft® IIS servers or Apache® servers, although other types of servers may be used. Further, additional servers may be coupled to the network 108 and many different types of applications may be available on servers coupled to the network 108.
Each of the Web application servers 102 and client devices 106 may include one or more central processing units (CPUs), one or more computer readable media (i.e., memory), and interface systems that are coupled together by internal buses or other links as are generally known to those of ordinary skill in the art.
As shown in the example environment 100 depicted in
Generally, the network traffic management device 110 manages network communications, which may include one or more client requests and server responses, from/to the network 108 between the client devices 106 and one or more of the Web application servers 102 in LAN 104. These requests may be destined for one or more servers 102, and may take the form of one or more TCP/IP data packets originating from the network 108. The requests pass through one or more intermediate network devices and/or intermediate networks, until they ultimately reach the traffic management device 110. In any case, the network traffic management device 110 may manage the network communications by performing several network traffic related functions involving the communications. Such functions include load balancing, access control, and validating HTTP requests using JavaScript code that are sent back to requesting client devices 106 in accordance with the processes described further below in connection with
Referring now to
Device processor 200 comprises one or more microprocessors configured to execute computer/machine readable and executable instructions stored in device memory 218. Such instructions implement network traffic management related functions of the network traffic management device 110. In addition, the instructions implement the security module 210 to perform one or more portions of the processes illustrated in
Device I/O interfaces 202 comprise one or more user input and output device interface mechanisms. The interface may include a computer keyboard, mouse, display device, and the corresponding physical ports and underlying supporting hardware and software to enable the network traffic management device 110 to communicate with the outside environment. Such communication may include accepting user data input and to provide user output, although other types and numbers of user input and output devices may be used. Additionally or alternatively, as will be described in connection with network interface 204 below, the network traffic management device 110 may communicate with the outside environment for certain types of operations (e.g., configuration) via a network management port.
Network interface 204 comprises one or more mechanisms that enable network traffic management device 110 to engage in TCP/IP communications over LAN 104 and network 108. However, it is contemplated that the network interface 204 may be constructed for use with other communication protocols and types of networks. Network interface 204 is sometimes referred to as a transceiver, transceiving device, or network interface card (NIC), which transmits and receives network data packets to one or more networks, such as LAN 104 and network 108. In an example where the network traffic management device 110 includes more than one device processor 200 (or a processor 200 has more than one core), each processor 200 (and/or core) may use the same single network interface 204 or a plurality of network interfaces 204. Further, the network interface 204 may include one or more physical ports, such as Ethernet ports, to couple the network traffic management device 110 with other network devices, such as Web application servers 102. Moreover, the interface 204 may include certain physical ports dedicated to receiving and/or transmitting certain types of network data, such as device management related data for configuring the network traffic management device 110.
Bus 208 may comprise one or more internal device component communication buses, links, bridges and supporting components, such as bus controllers and/or arbiters. The bus enable the various components of the network traffic management device 110, such as the processor 200, device I/O interfaces 202, network interface 204, and device memory 218, to communicate with one another. However, it is contemplated that the bus may enable one or more components of the network traffic management device 110 to communicate with components in other devices as well. Example buses include HyperTransport, PCI, PCI Express, InfiniBand, USB, Firewire, Serial ATA (SATA), SCSI, IDE and AGP buses. However, it is contemplated that other types and numbers of buses may be used, whereby the particular types and arrangement of buses will depend on the particular configuration of the network traffic management device 110.
Device memory 218 comprises computer readable media, namely computer readable or processor readable storage media, which are examples of machine-readable storage media. Computer readable storage/machine-readable storage media may include volatile, nonvolatile, removable, and non-removable media implemented in any method or technology for storage of information. Such storage media contains computer readable/machine-executable instructions, data structures, program modules, or other data, which may be obtained and/or executed by one or more processors, such as device processor 200. Such instructions allow the processor to perform actions, including implementing an operating system for controlling the general operation of network traffic management device 110 to manage network traffic and implementing security module 210 to perform one or more portions of the process illustrated in
Examples of computer readable storage media include RAM, BIOS, ROM, EEPROM, flash/firmware memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information. Such desired information includes data and/or computer/machine-executable instructions and which can be accessed by a computing or specially programmed device, such as network traffic management device 110.
Security module 210 is depicted in
In addition to preventing web scrapers and other types of bots from accessing one or more servers 102, the security module 210 may use additional information obtained by further analyzing collected data to identify latencies associated with particular servers, server applications or other server resources, page traversal rates, client device fingerprints and access statistics that the security module 210 may analyze to identify anomalies indicative to the module 210 that there may be an attack. The security module 210 also analyzes collected data to obtain information the security module 210 may use to identify particular servers and/or server applications and resources on particular servers, such as Web application server 102, being targeted in network attacks, so the module 210 can handle the attack.
Although an example of the Web application server 102, network traffic device 110, and client devices 106 are described and illustrated herein in connection with
Furthermore, each of the devices of the system 100 may be conveniently implemented using one or more general purpose computer systems, microprocessors, digital signal processors, micro-controllers, application specific integrated circuits (ASIC), programmable logic devices (PLD), field programmable logic devices (FPLD), field programmable gate arrays (FPGA) and the like. The devices may be programmed according to the teachings as described and illustrated herein, as will be appreciated by those skilled in the computer, software, and networking arts.
In addition, two or more computing systems or devices may be substituted for any one of the devices in the system 100. Accordingly, principles and advantages of distributed processing, such as redundancy, replication, and the like, also can be implemented, as desired, to increase the robustness and performance of the devices and systems of the system 100. The system 100 may also be implemented on a computer system or systems that extend across any network environment using any suitable interface mechanisms and communications technologies including, for example telecommunications in any suitable form (e.g., voice, modem, and the like), Public Switched Telephone Network (PSTNs), Packet Data Networks (PDNs), the Internet, intranets, a combination thereof, and the like.
The security module 210 of the network traffic management device performs a two step process to mitigate web scraping by a web crawler, bot or other web content collecting entity. In an aspect, the security module 210 subjects the web client to one or more computational challenges, to determine if the web client 106 is Javascript Proper. However, it is contemplated that a computational challenge is not sent to the web client (e.g. when the security module is not in blocking mode.) To be Javascript proper, the web client 106 has to support Javascript, and support cookies, as well as be able to provide satisfactory results to the computational challenges from the security module 210 of the network traffic management device 110.
In particular, the challenge preferably includes information representing instructions (e.g., JavaScript code) to be executed by the web client 106 to perform the challenge. The challenge preferably includes instructions to generate an HTTP cookie for storing any result(s) obtained by performing the challenge as well as recreate and resend its initial request including any cookies that store the challenge results. Although the challenge preferably includes Javascript code, other types of challenges can be employed and the code could be expressed in other programming, markup or script languages. For example, the challenge may be to compute some code and then auto-submit a form, which contains the original request, enveloped in the modified response which is sent back to the web client 106. The challenge is sent to the web client 106 in a modified response on behalf of the potentially targeted server. The web client 106 thus receives what it would otherwise understand to be a response, from the server, to its initial request.
If the web client 106 is indeed not JavaScript proper, then it would not be able to execute the challenge or, alternatively be able to execute the challenge but not generate the correct result. However, if the web client is indeed JavaScript proper, the web client 106 will execute the challenge and resend its initial request along with results obtained by executing the challenge in a cookie. It is contemplated that other fingerprints or information may be utilized which that the security module 210 will be able to analyze to determine that the associated requestor is legitimate. It should be noted that regardless of whether the bot and/or webscraper is able to correctly solve and update the challenge, the actual time it takes the client to go through the challenge cycle, including computing the challenge, results in the bot/web scraper being slowed down in obtaining information.
The security module 210 in the network traffic management device 110 confirms whether the received challenge results are correct to determine whether the web client 106 is JavaScript proper. The calculation of such a challenge allows a legitimate requestor to access server resources without any interference while non-Javascript proper web crawlers are filtered out. The security module 210 therefore gains some control over the rate of requests to the server 102. It is to be understood that other client side languages such as FLASH, Silverlight, VB script, etc. may be returned with the request.
In an aspect, the system may send several computational challenges to the web client to make it difficult for a bot or web scraper to copy the computational challenges from a previous intervals to bypass the current challenge. The computational challenge may require the web client to locate a special challenge cookie placed by the security module 210 when the request is sent back to the web client. However, it is contemplated that other types and/or techniques of administering a computational challenge can be utilized.
The system also proactively protects the web application by extending the scope of its data collection in the web client by injecting a client side script into HTTP responses with HTML content. In an aspect, the client side script is a JavaScript enabled technique called a client side human user indicator (CSHUI) code which is effectively used to determine whether the web client is being operated by a human by monitoring one or more keyboard and/or mouse events over a set amount of time and/or within a time period. It is preferred that the CSHUI code is inserted into the HTTP response after the computational challenge has been successfully validated by the web client. However it is contemplated that the validation of the web client may be performed before and/or after the CSHUI code has been injected into the response.
The CSHUI code is configured to hook into and log keyboard and/or mouse events, whereby the CSHUI code causes the web client to send a CSHUI cookie which carries human activity (or an indicated of lack of human activity) information to the web server to allow determination of whether the web client is operated by a human or a bot. However, it is contemplated that the web client may send this information back in another manner instead of using a cookie. For example, it is contemplated that the human activity information (or lack thereof) may be communicated from the web client using a parameter such as a query string or post; a specialized Ajax request, a special header or any other appropriate means.
The security module 210, when implementing the CSHUI code in a web client, first sends a CSHUI code snippet to the web client, preferably in an obfuscated manner known in the art. The CSHUI code snippet, once executed on the client side, causes the web client to download, preferably in a delayed manner, the actual CSHUI code. The delayed code download has advantages as the code will be downloaded from the network traffic management device 110 to the web client only if the web client was able to previously execute the code snippet. Additionally, bandwidth usage is reduced and latency is minimized in viewing the web content since most or all of other Javascript code will have first been loaded before the CSHUI code is loaded. Further, for delayed code loading, this facilitates caching mechanisms in the client side in intermediate proxies as well as the network traffic management device 110.
In particular, the CSHUI code utilizes an event listener which is configured to monitor activity in the web client while the web client displays a HTML page. In particular, the event listener of the CSHUI code determines whether keyboard and/or mouse activity has been detected and then updates a flag value in the CSHUI cookie if the event listener has detected sufficient mouse and/or keyboard activity in a session. In an aspect, the CSHUI cookie will have a unique identifier and a flag value of whether human activity has been detected (e.g. flag set to true). The security module 210 keeps track of the CSHUI cookies sent from the web client and monitors whether at least one cookie has had its flag be set to true within a predetermined number of transactions received from the web client. The security module 210 may be configured to keep these scores within a session and store them in a message key which effectively allows the approved web client to continue to receive the web content from the web server for that session for a set number of safe intervals. For example, a human user accessing a web page having a continuously updating stock ticker may not move the mouse or press a key on the keyboard throughout the session. However, if at any point during the session, the CSHUI detects keyboard and/or mouse movement (thus, concluding that a human is operating the web client), the security module 210 will continue allowing web content from the web server to be sent to the web client.
In an aspect, the network traffic management device 110 uses a CSHUI_ID to protect the cookie from theft in a valid session, whereby the CSHUI ID is injected along with the CSHUI cookie for each validation cycle (described below). In an aspect, network traffic management device 110 keeps the CSHUI_ID current per interval and considers the web client as being operated by a human only if it has human indication (CSHUI cookie value true) and the CSHUI_ID is current for that interval.
The system may be configured to store and utilize a white-list of approved web scrapers, bots, search engines or other content accessing entities in which the Web server will provide the web content to the web client even though non-human activity has been detected. In an embodiment, the entities are identified on the white-list by IP Address, by User Agents, by user credentials' identification, by connection, by session, and the like. It should be stressed that if requests are being issued to the web application server by an entity which can be associated with the white list, then the requests are approved and are not further monitored for web scraping violations. In other words, the system and method does not perform web scraping detection when the requesting web client is on the white-list. Thus, if a web crawler or bot is identified by the CSHUI cookie, but is on the white-list, the Web server will continue to provide web content to the Web client. Additionally or alternatively, the system may be configured to store and utilize a black-list of non-approved web scrapers, bots, search engines or other content accessing entities. In particular, the system can check whether the requesting entity is on the black-list and automatically refuse access to that entity of it is on the black-list. In an embodiment, the entities are identified on the white-list by IP Address, User Agents, by user credentials' identification, by connection, by session, and the like although web page addresses or other identifying information is contemplated for use with the black-list.
It is contemplated that the network traffic management device 110 can store the identity (e.g. IP address, subnet mask, web page address) or other information (e.g. user-agent string) of the web crawler or bot for diagnostic purposes, policy building, and/or preventative measures. This information can be also used for optimization of the web scraping mitigation feature of the system.
The operation of the example use of the web scraping mitigation technique is shown in
As shown in
However, if the security module 210 is already operating in the blocking mode, upon receiving the request, a response will be sent with the original request enveloped in it along with JavaScript code that causes the browser on the client device to execute a computational challenge. Once the browser provides a result to the computational challenge, the client device 106 will auto submit the original request along with the result of the challenge (in a cookie) back to the Web application server 102. The security module 210 intercepts the request sent from the client device and inspects the result of the computational challenge. If the security module 210 determines that the result is proper and correct, then the security module 210 will forward the request to the web application server 102 for that client device and will move on to the next state (block 308 in
However, if no answer or a wrong answer to the challenge is intercepted by the network traffic management device 110, the device 110 will again send a modified response with another enveloped computational challenge to the web client 106. As shown by arrow 304, this challenge process will repeat for P number of times until a proper answer is received by the network traffic management device 110, whereby P may be set to a set finite number of intervals or an indefinite number of intervals.
However, if a proper answer to the computational challenge is intercepted by the network traffic management device 110 within a threshold limit of P intervals (if applicable), the process proceeds to block 308, as indicated by arrow 306. At block 308, the security module 210 of the network traffic management device 110 assigns a CSHUI_ID for the session and injects a CSHUI code into responses from the server which are sent to the client device 106. As stated above, a CSHUI cookie corresponding to the injected CSHUI code is stored on the client device 106, whereby the CSHUI code monitors mouse and/or keyboard actions on the client device 106 and updates one or more values in the CSHUI cookie to indicate whether a human is operating the client device 106. The modified value in the CSHUI cookie is provided in subsequent requests from the client device 106 which are then inspected by the security module 210.
As indicated by arrow 312, if the CSHUI cookie comes back to the network traffic management device 110 with a value which indicates that the requests are coming from a bot or web scraper, (shown as arrow 312) the security module considers the validation cycle as unsafe and goes into the prevent mode (block 314). If the security module 210 was previously operating in the blocking mode, then all further requests (up to the M number of unsafe intervals) are blocked from being passed on through to the server 102. However, if the security module 210 was previously in the non-blocking mode, the request is allowed to pass through onto server but the security module 210 produces an alarm notification for a M number of unsafe intervals, as described below.
However, as stated above, it is possible that the request received by the security module may not even include a CSHUI cookie value. It is also possible that the request may include a CSHUI cookie whose value is unchanged. In either case, as shown by arrow 310, the security module 210 is configured to repeat the step at block 308 for a N number of grace intervals, as indicated by arrow 310. In particular, the security module 210 will allow a limited number of subsequent requests to be passed on to the server 102 even though the CSHUI cookie does not definitively indicate whether the client device 106 is being operated by a human or a bot. The threshold of a maximum number of grace intervals to be allowed per session can be set to a desired value N on the network traffic management device 110. However, as shown by arrow 312, if the number of requests exceeds the threshold limit N of grace intervals while the security module 210 is in the blocking mode, then the security module 210 refuses the request from going to the server and (prevent mode), as shown in block 314. Then the security module 210 moves to an unsafe/prevented stated (block 314).
In block 314, it should be noted that the security module 210, in its blocking mode, will run a counter which keeps track of a number of requests received from the client device 106 which are refused to pass on to the server (“unsafe intervals”). However, if the security module 210 is operating in its non-blocking mode, it will allow requests to proceed to the server, and will issue alarm notifications for every request within an unsafe interval, as shown by arrow 316. If the number of refused requests reaches or exceeds the set threshold limit of M number of unsafe intervals, then the validation cycle starts over and the process begins at block 302, as shown by arrow 318.
Referring back to block 308, if the security module 210 finds that the CSHUI cookie has a modified value that indicates heuristics that a human is operating the client device 106 (e.g. keystrokes and/or mouse movements detected), the security module 210 will also inspect the CSHUI_ID present in the request. In particular, the security module 210 will determine whether the received CSHUI cookie has a CSHUI_ID matches the CSHUI_ID for that particular session, as shown by arrow 320. If both of these conditions are satisfied, the security module 210 will conclude that the client device 106 is not a bot, and switches to an approval mode for the client device 106, whereby subsequent requests from the client device 106 will be allow to access the server for that session (block 322). It should be noted that if the web client is identified to be one of the approved entities on a white-list, then the process described in
It should be noted that the security module 210, in its approval mode, will run a counter which keeps track of a subsequent Q number of requests received from the client device 106 which are allowed to pass on to the server (referred to herein as “safe intervals”). As shown by arrow 324, if the number of subsequent allowed requests exceed the set threshold limit of Q safe intervals, then the validation cycle starts over, and the process begins again at block 302, as shown by arrow 326.
It should be noted that although the security module 210 in the network traffic management device is described herein as sending the computational challenges and processing the CSHUI code/cookies, it is contemplated that the web application or web server which serves the web application can be configured to perform these duties.
Additionally or alternatively, it is possible for the network traffic management device 110 to monitor the number of page traversals (e.g. load, unload and/or refresh requests) which are received from a particular web client over a predetermined amount of time to determine whether the web client is human or a web scraper. In an example, the predetermined number of allowed page traversals per a time unit is set in the network traffic management device 110 by an administrator, wherein the setting may be a value that permits no more than 5 page traversals per second. If the network traffic management device 110 detects that more than 5 page traversals have occurred within a second (or less), then the network traffic management device 110 may consider the web client as hostile and drop the connection or may refer to the authorized list in the policy enforcer. This is based on the assumption that a human will not make such a high number of requests within that small period of time. It should be noted that although a value of more than 5 page traversals per second is discussed above, any other value greater or lesser than 5 is contemplated. It should be noted that keyboard and mouse movement and usage can be used as a heuristics for detecting a human user on the client side while the network traffic management device is detecting whether too many page traversals occur per time unit (e.g. identifying the requesting pattern as a “non human activity”).
It is also contemplated that network traffic management device randomizes and adds a hidden link to web pages where the CSHUI script is injected into the response. The hidden link cannot be viewed by a human, unless page markup and code is carefully inspected, although it will be able to be selected by a bot or web scraper. As a result, if the hidden link is selected, the CSHUI cookie will be set to false and the network traffic management device will conclude that the web client is hostile. Additionally or alternatively to the page traversal feature described above, keyboard and mouse movement and usage can be used as a heuristics for detecting a human user on the client side while and the hidden link functionality is performed to determine whether the client device is being operated by a human or a bot.
Having thus described the basic concepts, it will be rather apparent to those skilled in the art that the foregoing detailed disclosure is intended to be presented by way of example only, and is not limiting. Various alterations, improvements, and modifications will occur and are intended to those skilled in the art, though not expressly stated herein. These alterations, improvements, and modifications are intended to be suggested hereby, and are within the spirit and scope of the examples. Additionally, the recited order of processing elements or sequences, or the use of numbers, letters, or other designations therefore, is not intended to limit the claimed processes to any order except as may be specified in the claims. Accordingly, the invention is limited only by the following claims and equivalents thereto.
Number | Name | Date | Kind |
---|---|---|---|
5282201 | Frank et al. | Jan 1994 | A |
5550816 | Hardwick et al. | Aug 1996 | A |
5606665 | Yang et al. | Feb 1997 | A |
5623490 | Richter et al. | Apr 1997 | A |
5991302 | Berl et al. | Nov 1999 | A |
5995491 | Richter et al. | Nov 1999 | A |
6026500 | Topff et al. | Feb 2000 | A |
6029175 | Chow et al. | Feb 2000 | A |
6041365 | Kleinerman | Mar 2000 | A |
6047356 | Anderson et al. | Apr 2000 | A |
6067558 | Wendt et al. | May 2000 | A |
6104706 | Richter et al. | Aug 2000 | A |
6154777 | Ebrahim | Nov 2000 | A |
6157950 | Krishnan | Dec 2000 | A |
6259405 | Stewart et al. | Jul 2001 | B1 |
6260070 | Shah | Jul 2001 | B1 |
6292832 | Shah et al. | Sep 2001 | B1 |
6304913 | Rune | Oct 2001 | B1 |
6330574 | Murashita | Dec 2001 | B1 |
6338082 | Schneider | Jan 2002 | B1 |
6353848 | Morris | Mar 2002 | B1 |
6363056 | Beigi et al. | Mar 2002 | B1 |
6370527 | Singhal | Apr 2002 | B1 |
6389462 | Cohen et al. | May 2002 | B1 |
6446108 | Rosenberg et al. | Sep 2002 | B1 |
6466580 | Leung | Oct 2002 | B1 |
6469983 | Narayana et al. | Oct 2002 | B2 |
6513061 | Ebata et al. | Jan 2003 | B1 |
6514085 | Slattery et al. | Feb 2003 | B2 |
6542936 | Mayle et al. | Apr 2003 | B1 |
6560230 | Li et al. | May 2003 | B1 |
6578069 | Hopmann et al. | Jun 2003 | B1 |
6615267 | Whalen et al. | Sep 2003 | B1 |
6631422 | Althaus et al. | Oct 2003 | B1 |
6654346 | Mahalingaiah et al. | Nov 2003 | B1 |
6701415 | Hendren, III | Mar 2004 | B1 |
6708220 | Olin | Mar 2004 | B1 |
6728704 | Mao et al. | Apr 2004 | B2 |
6738357 | Richter et al. | May 2004 | B1 |
6744776 | Kalkunte et al. | Jun 2004 | B1 |
6754215 | Arikawa et al. | Jun 2004 | B1 |
6754699 | Swildens et al. | Jun 2004 | B2 |
6760337 | Snyder, II et al. | Jul 2004 | B1 |
6795860 | Shah | Sep 2004 | B1 |
6857009 | Ferreria | Feb 2005 | B1 |
6862282 | Oden | Mar 2005 | B1 |
6865593 | Reshef et al. | Mar 2005 | B1 |
6868447 | Slaughter et al. | Mar 2005 | B1 |
6871221 | Styles | Mar 2005 | B1 |
6880017 | Marce et al. | Apr 2005 | B1 |
6883137 | Girardot et al. | Apr 2005 | B1 |
6904040 | Salapura et al. | Jun 2005 | B2 |
6914881 | Mansfield et al. | Jul 2005 | B1 |
6928518 | Talagala | Aug 2005 | B2 |
6970475 | Fraser et al. | Nov 2005 | B1 |
6970924 | Chu et al. | Nov 2005 | B1 |
6973490 | Robertson et al. | Dec 2005 | B1 |
6975592 | Seddigh et al. | Dec 2005 | B1 |
6990074 | Wan et al. | Jan 2006 | B2 |
6990114 | Erimli et al. | Jan 2006 | B1 |
7003564 | Greuel et al. | Feb 2006 | B2 |
7006502 | Lin | Feb 2006 | B2 |
7020713 | Shah et al. | Mar 2006 | B1 |
7023974 | Brannam et al. | Apr 2006 | B1 |
7035212 | Mittal et al. | Apr 2006 | B1 |
7039061 | Connor et al. | May 2006 | B2 |
7065482 | Shorey et al. | Jun 2006 | B2 |
7075924 | Richter et al. | Jul 2006 | B2 |
7076689 | Atkinson | Jul 2006 | B2 |
7080314 | Garofalakis et al. | Jul 2006 | B1 |
7089491 | Feinberg et al. | Aug 2006 | B2 |
7113996 | Kronenberg | Sep 2006 | B2 |
7133863 | Teng et al. | Nov 2006 | B2 |
7155722 | Hilla et al. | Dec 2006 | B1 |
7161904 | Hussain et al. | Jan 2007 | B2 |
7191163 | Herrera et al. | Mar 2007 | B2 |
7228359 | Monteiro | Jun 2007 | B1 |
7236491 | Tsao et al. | Jun 2007 | B2 |
7240100 | Wein et al. | Jul 2007 | B1 |
7257633 | Masputra et al. | Aug 2007 | B2 |
7292541 | C S | Nov 2007 | B1 |
7296263 | Jacob | Nov 2007 | B1 |
7308475 | Pruitt et al. | Dec 2007 | B1 |
7324533 | DeLiberato et al. | Jan 2008 | B1 |
7340571 | Saze | Mar 2008 | B2 |
7373438 | DeBergalis et al. | May 2008 | B1 |
7409440 | Jacob | Aug 2008 | B1 |
7555608 | Naik et al. | Jun 2009 | B2 |
7577723 | Matsuda et al. | Aug 2009 | B2 |
7640347 | Sloat et al. | Dec 2009 | B1 |
7684423 | Tripathi et al. | Mar 2010 | B2 |
7698458 | Liu et al. | Apr 2010 | B1 |
7822839 | Pruitt et al. | Oct 2010 | B1 |
7861085 | Case et al. | Dec 2010 | B1 |
7895653 | Calo et al. | Feb 2011 | B2 |
7903554 | Manur et al. | Mar 2011 | B1 |
7908245 | Nakano et al. | Mar 2011 | B2 |
7958222 | Pruitt et al. | Jun 2011 | B1 |
7984500 | Khanna et al. | Jul 2011 | B1 |
8024443 | Jacob | Sep 2011 | B1 |
8037528 | Williams et al. | Oct 2011 | B2 |
8064342 | Badger | Nov 2011 | B2 |
8155128 | Balyan et al. | Apr 2012 | B2 |
8171124 | Kondamuru | May 2012 | B2 |
8190769 | Shukla et al. | May 2012 | B1 |
8271620 | Witchey | Sep 2012 | B2 |
8396836 | Ferguson et al. | Mar 2013 | B1 |
8463850 | McCann | Jun 2013 | B1 |
8484348 | Subramanian et al. | Jul 2013 | B2 |
8838817 | Biswas | Sep 2014 | B1 |
8879431 | Ridel et al. | Nov 2014 | B2 |
8959215 | Koponen et al. | Feb 2015 | B2 |
9143451 | Amdahl et al. | Sep 2015 | B2 |
20010007560 | Masuda et al. | Jul 2001 | A1 |
20020010757 | Granik et al. | Jan 2002 | A1 |
20020012352 | Hansson et al. | Jan 2002 | A1 |
20020032758 | Yen et al. | Mar 2002 | A1 |
20020038360 | Andrews et al. | Mar 2002 | A1 |
20020065848 | Walker et al. | May 2002 | A1 |
20020072048 | Slattery et al. | Jun 2002 | A1 |
20020087571 | Stapel et al. | Jul 2002 | A1 |
20020087744 | Kitchin | Jul 2002 | A1 |
20020099829 | Richards et al. | Jul 2002 | A1 |
20020103823 | Jackson et al. | Aug 2002 | A1 |
20020143819 | Han et al. | Oct 2002 | A1 |
20020162118 | Levy et al. | Oct 2002 | A1 |
20020174216 | Shorey et al. | Nov 2002 | A1 |
20020194112 | dePinto et al. | Dec 2002 | A1 |
20020194342 | Lu et al. | Dec 2002 | A1 |
20020198956 | Dunshea et al. | Dec 2002 | A1 |
20030005172 | Chessell | Jan 2003 | A1 |
20030009528 | Sharif et al. | Jan 2003 | A1 |
20030018450 | Carley | Jan 2003 | A1 |
20030018585 | Butler et al. | Jan 2003 | A1 |
20030018927 | Gadir et al. | Jan 2003 | A1 |
20030034905 | Anton et al. | Feb 2003 | A1 |
20030046335 | Doyle et al. | Mar 2003 | A1 |
20030051045 | Connor | Mar 2003 | A1 |
20030055723 | English | Mar 2003 | A1 |
20030074301 | Solomon | Apr 2003 | A1 |
20030105846 | Zhao et al. | Jun 2003 | A1 |
20030128708 | Inoue et al. | Jul 2003 | A1 |
20030130945 | Force et al. | Jul 2003 | A1 |
20030139934 | Mandera | Jul 2003 | A1 |
20030156586 | Lee et al. | Aug 2003 | A1 |
20030179755 | Fraser | Sep 2003 | A1 |
20030189936 | Terrell et al. | Oct 2003 | A1 |
20030191812 | Agarwalla et al. | Oct 2003 | A1 |
20030195813 | Pallister et al. | Oct 2003 | A1 |
20030212954 | Patrudu | Nov 2003 | A1 |
20030220835 | Barnes, Jr. | Nov 2003 | A1 |
20030229665 | Ryman | Dec 2003 | A1 |
20030236995 | Fretwell, Jr. | Dec 2003 | A1 |
20040006591 | Matsui et al. | Jan 2004 | A1 |
20040015783 | Lennon et al. | Jan 2004 | A1 |
20040017825 | Stanwood et al. | Jan 2004 | A1 |
20040030627 | Sedukhin | Feb 2004 | A1 |
20040030740 | Stelting | Feb 2004 | A1 |
20040043758 | Sorvari et al. | Mar 2004 | A1 |
20040059789 | Shum | Mar 2004 | A1 |
20040064544 | Barsness et al. | Apr 2004 | A1 |
20040064554 | Kuno et al. | Apr 2004 | A1 |
20040093361 | Therrien et al. | May 2004 | A1 |
20040103206 | Hsu et al. | May 2004 | A1 |
20040122926 | Moore et al. | Jun 2004 | A1 |
20040123277 | Schrader et al. | Jun 2004 | A1 |
20040133605 | Chang et al. | Jul 2004 | A1 |
20040138858 | Carley | Jul 2004 | A1 |
20040167967 | Bastian et al. | Aug 2004 | A1 |
20040177165 | Masputra et al. | Sep 2004 | A1 |
20040213156 | Smallwood et al. | Oct 2004 | A1 |
20040215665 | Edgar et al. | Oct 2004 | A1 |
20040236826 | Harville et al. | Nov 2004 | A1 |
20040260745 | Gage et al. | Dec 2004 | A1 |
20050008017 | Datta et al. | Jan 2005 | A1 |
20050021703 | Cherry et al. | Jan 2005 | A1 |
20050027841 | Rolfe | Feb 2005 | A1 |
20050044158 | Malik | Feb 2005 | A1 |
20050117589 | Douady et al. | Jun 2005 | A1 |
20050165656 | Frederick et al. | Jul 2005 | A1 |
20050174944 | Legault et al. | Aug 2005 | A1 |
20050175013 | Le Pennec et al. | Aug 2005 | A1 |
20050198234 | Leib et al. | Sep 2005 | A1 |
20050213587 | Cho et al. | Sep 2005 | A1 |
20050234928 | Shkvarchuk et al. | Oct 2005 | A1 |
20050240664 | Chen et al. | Oct 2005 | A1 |
20050246393 | Coates et al. | Nov 2005 | A1 |
20050256806 | Tien et al. | Nov 2005 | A1 |
20060031374 | Lu et al. | Feb 2006 | A1 |
20060031778 | Goodwin et al. | Feb 2006 | A1 |
20060045089 | Bacher et al. | Mar 2006 | A1 |
20060045096 | Farmer et al. | Mar 2006 | A1 |
20060047785 | Wang et al. | Mar 2006 | A1 |
20060100752 | Kim et al. | May 2006 | A1 |
20060112367 | Harris | May 2006 | A1 |
20060123210 | Pritchett et al. | Jun 2006 | A1 |
20060133374 | Sekiguchi | Jun 2006 | A1 |
20060140193 | Kakani et al. | Jun 2006 | A1 |
20060153201 | Hepper et al. | Jul 2006 | A1 |
20060209669 | Nishio | Sep 2006 | A1 |
20060229861 | Tatsuoka et al. | Oct 2006 | A1 |
20060235998 | Stecher et al. | Oct 2006 | A1 |
20060259320 | LaSalle et al. | Nov 2006 | A1 |
20060268692 | Wright et al. | Nov 2006 | A1 |
20060270341 | Kim et al. | Nov 2006 | A1 |
20060282442 | Lennon et al. | Dec 2006 | A1 |
20070005807 | Wong | Jan 2007 | A1 |
20070016613 | Foresti et al. | Jan 2007 | A1 |
20070019636 | Lau et al. | Jan 2007 | A1 |
20070038994 | Davis et al. | Feb 2007 | A1 |
20070067373 | Higgins et al. | Mar 2007 | A1 |
20070067771 | Kulbak et al. | Mar 2007 | A1 |
20070112775 | Ackerman | May 2007 | A1 |
20070124415 | Lev-Ran et al. | May 2007 | A1 |
20070124502 | Li | May 2007 | A1 |
20070130255 | Wolovitz et al. | Jun 2007 | A1 |
20070147246 | Hurley et al. | Jun 2007 | A1 |
20070162891 | Burner et al. | Jul 2007 | A1 |
20070168320 | Borthakur et al. | Jul 2007 | A1 |
20070168525 | DeLeon et al. | Jul 2007 | A1 |
20070192543 | Naik et al. | Aug 2007 | A1 |
20070233826 | Tindal et al. | Oct 2007 | A1 |
20080004022 | Johannesson et al. | Jan 2008 | A1 |
20080010372 | Khedouri et al. | Jan 2008 | A1 |
20080022059 | Zimmerer et al. | Jan 2008 | A1 |
20080120592 | Tanguay et al. | May 2008 | A1 |
20080141246 | Kuck et al. | Jun 2008 | A1 |
20080208917 | Smoot et al. | Aug 2008 | A1 |
20080263401 | Stenzel | Oct 2008 | A1 |
20080270578 | Zhang et al. | Oct 2008 | A1 |
20080281908 | McCanne et al. | Nov 2008 | A1 |
20080281944 | Vorne et al. | Nov 2008 | A1 |
20090080440 | Balyan et al. | Mar 2009 | A1 |
20090089487 | Kwon et al. | Apr 2009 | A1 |
20090094311 | Awadallah et al. | Apr 2009 | A1 |
20090097480 | Curtis et al. | Apr 2009 | A1 |
20090106413 | Salo et al. | Apr 2009 | A1 |
20090125955 | DeLorme | May 2009 | A1 |
20090138314 | Bruce | May 2009 | A1 |
20090144285 | Chatley et al. | Jun 2009 | A1 |
20090161542 | Ho | Jun 2009 | A1 |
20090187915 | Chew et al. | Jul 2009 | A1 |
20090217386 | Schneider | Aug 2009 | A1 |
20090248870 | Kamei et al. | Oct 2009 | A1 |
20090265396 | Ram et al. | Oct 2009 | A1 |
20090265467 | Peles | Oct 2009 | A1 |
20090289828 | Hinchey | Nov 2009 | A1 |
20090292957 | Bower et al. | Nov 2009 | A1 |
20090300161 | Pruitt et al. | Dec 2009 | A1 |
20090316708 | Yahyaoui et al. | Dec 2009 | A1 |
20090319600 | Sedan et al. | Dec 2009 | A1 |
20100042743 | Jeon et al. | Feb 2010 | A1 |
20100061232 | Zhou et al. | Mar 2010 | A1 |
20100064001 | Daily | Mar 2010 | A1 |
20100070476 | O'Keefe et al. | Mar 2010 | A1 |
20100093318 | Zhu et al. | Apr 2010 | A1 |
20100103820 | Fuller et al. | Apr 2010 | A1 |
20100179984 | Sebastian | Jul 2010 | A1 |
20100228814 | McKenna et al. | Sep 2010 | A1 |
20100228819 | Wei | Sep 2010 | A1 |
20100242092 | Harris et al. | Sep 2010 | A1 |
20100250497 | Redlich et al. | Sep 2010 | A1 |
20100251329 | Wei | Sep 2010 | A1 |
20100261479 | Hidaka | Oct 2010 | A1 |
20100274772 | Samuels | Oct 2010 | A1 |
20100306169 | Pishevar et al. | Dec 2010 | A1 |
20110055921 | Narayanaswamy et al. | Mar 2011 | A1 |
20110066736 | Mitchell et al. | Mar 2011 | A1 |
20110072321 | Dhuse | Mar 2011 | A1 |
20110075667 | Li et al. | Mar 2011 | A1 |
20110078303 | Li et al. | Mar 2011 | A1 |
20110098087 | Tseng | Apr 2011 | A1 |
20110113095 | Hatami-Hanza | May 2011 | A1 |
20110153985 | Saha et al. | Jun 2011 | A1 |
20110185082 | Thompson | Jul 2011 | A1 |
20110188415 | Graziano | Aug 2011 | A1 |
20110213911 | Eldus et al. | Sep 2011 | A1 |
20120094631 | Pattabiraman | Apr 2012 | A1 |
20120102011 | Matsuki et al. | Apr 2012 | A1 |
20120117028 | Gold et al. | May 2012 | A1 |
20120150805 | Pafumi et al. | Jun 2012 | A1 |
20120195273 | Iwamura et al. | Aug 2012 | A1 |
20120254293 | Winter et al. | Oct 2012 | A1 |
20120257506 | Bazlamacci et al. | Oct 2012 | A1 |
20120258766 | Cho et al. | Oct 2012 | A1 |
20130058229 | Casado et al. | Mar 2013 | A1 |
20130073717 | Collin et al. | Mar 2013 | A1 |
20130114497 | Zhang et al. | May 2013 | A1 |
20130182713 | Giacomoni et al. | Jul 2013 | A1 |
20130238472 | Fan et al. | Sep 2013 | A1 |
20140071895 | Bane et al. | Mar 2014 | A1 |
20140099945 | Singh et al. | Apr 2014 | A1 |
20140105069 | Potnuru | Apr 2014 | A1 |
20140187199 | Yan et al. | Jul 2014 | A1 |
20140286316 | Park et al. | Sep 2014 | A1 |
20150058595 | Gura et al. | Feb 2015 | A1 |
Number | Date | Country |
---|---|---|
2080530 | Apr 1994 | CA |
0605088 | Jul 1994 | EP |
1081918 | Mar 2001 | EP |
06-205006 | Jul 1994 | JP |
8021924 | Mar 1996 | JP |
2000183935 | Jun 2000 | JP |
0058870 | Oct 2000 | WO |
0239696 | May 2002 | WO |
2006091040 | Aug 2006 | WO |
Entry |
---|
Baer, T., et al., “The elements of Web Services” ADTmag.com, Dec. 1, 2002, pp. 1-6, (http://www.adtmag.com). |
Blue Coat, “Technology Primer: CIFS Protocol Optimization,” Blue Coat Systems Inc., pp. 1-3, (http://www.bluecoat.com). |
“Diameter MBLB Support Phase 2: Generic Message Based Load Balancing (GMBLB)”, last accessed Mar. 29, 2010, pp. 1-10, (http://peterpan.f5net.com/twiki/bin/view/TMOS/TMOSDiameterMBLB). |
F5 Networks Inc., “Big-IP® Reference Guide, version 4.5”, F5 Networks Inc., Sep. 2002, pp. 11-1-11-32, Seattle, Washington. |
F5 Networks Inc., “3-DNS® Reference Guide, version 4.5”, F5 Networks Inc., Sep. 2002, pp. 2-1-2-28, 3-1-3-12, 5-1-5-24, Seattle, Washington. |
F5 Networks Inc., “Using F5's-DNS Controller to Provide High Availability Between Two or More Data Centers”, F5 Networks Inc., Aug. 2001, pp. 1-4, Seattle, Washington, (http://www.f5.com/f5products/3dns/relatedMaterials/3DNSRouting.html). |
F5 Networks Inc., “Deploying the BIG-IP LTM for Diameter Load Balancing,” F5® Deployment Guide, Version 2.0, pp. 1-19. |
F5 Networks Inc., “F5 Diameter RM”, Powerpoint document, Jul. 16, 2009, pp. 1-7. |
F5 Networks Inc., “Routing Global Internet Users to the Appropriate Data Center and Applications Using F5's 3-DNS Controller”, F5 Networks Inc., Aug. 2001, pp. 1-4, Seattle, Washington, (http://www.f5.com/f5producs/3dns/relatedMaterials/UsingF5.html). |
F5 Networks Inc., “Case Information Log for ‘Issues with BoNY upgrade to 4.3’”, as early as Feb. 2008. |
F5 Networks Inc., “F5 WANJet CIFS Acceleration”, White Paper, F5 Networks Inc., Mar. 2006, pp. 1-5, Seattle, Washington. |
Fajardo V., “Open Diameter Software Architecture,” Jun. 25, 2004, last accessed Sep. 2, 2008, pp. 1-6, Version 1.0.7, (http://diameter.sourceforge.net/diameter-architecture/indext.html). |
Gupta et al., “Algorithms for packet classification”, Dept. of Comput. Scie., Stanford Univ., CA, Mar./Apr. 2001, , pp. 1, vol. 15, Issue 2, abstract only, last accessed May 14, 2007 (http://ieeexplore.ieee.org/xpl/freeabs—all.jsp?arnumber=912717&isnumber=19697). |
Heinz G., “Priorities in Stream Transmission Control Protocol (SCTP) Multistreaming”, Thesis submitted to the Faculty of the University of Delaware, Spring 2003, pp. 1-35. |
Ilvesjmaki M., et al., “On the capabilities of application level traffic measurements to differentiate and classify Internet traffic”, Presented in SPIE's International Symposium ITcom, Aug. 19-21, 2001, pp. 1-11, Denver, Colorado. |
Internet Protocol,“Darpa Internet Program Protocol Specification”, (RFC:791), Information Sciences Institute, University of Southern California, Sep. 1981, pp. 1-49. |
Kawamoto, D., “Amazon files for Web services patent”, CNET News.com, Jul. 28, 2005, pp. 1-2, last accessed May 4, 2006, (http://news.com). |
LaMonica M., “Infravio spiffs up Web services registry idea”, CNET News.com, May 11, 2004, pp. 1-2, last accessed Sep. 20, 2004, (http://www.news.com). |
Mac Vittie, L., “Message-Based Load Balancing: Using F5 solutions to address the challenges of scaling Diameter, Radius, and message-oriented protocols”, F5 Technical Brief, 2005, pp. 1-9, F5 Networks Inc., Seattle, Washington. |
“Market Research & Releases, CMPP PoC documentation”, last accessed Mar. 29, 2010, (http://mainstreet/sites/PD/Teams/ProdMgmt/MarketResearch/Universal). |
“Market Research & Releases, Solstice Diameter Requirements”, last accessed Mar. 29, 2010, (http://mainstreet/sites/PD/Teams/ProdMgmt/MarketResearch/Unisversal). |
Modiano E., “Scheduling algorithms for message transmission over a satellitebroadcast system”, MILCOM 97 Proceedings Lincoln Lab., MIT, Nov. 2-5, 1997, abstract only, last accessed Sep. 12, 2008, (http://ieeexplore,ieee.org/xpl/freeabs)all.jsp?arnumber=646697). |
Nichols K., et al., “Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers”, (RFC:2474) Network Working Group, Dec. 1998, pp. 1-19, last accessed Oct. 8, 2012, (http://www.ietf.org/rfc/rfc2474.txt). |
Ott D., et al., “A Mechanism for TCP-Friendly Transport-level Protocol Coordination”, USENIX Annual Technical Conference, 2002, University of North Carolina at Chapel Hill, pp. 1-12. |
Padmanabhan V., et al., “Using Predictive Prefetching to Improve World Wide Web Latency”, SIGCOM, 1996, pp. 1-15. |
“Respond to server depending on TCP::client—port”, DevCentral Forums iRules, pp. 1-6, last accessed Mar. 26, 2010, (http://devcentral.f5.com/Default/aspx?tabid=53&forumid=5&tpage=1&v). |
Rosen E., et al., “MPLS Label Stack Encoding”, (RFC:3032) Network Working Group, Jan. 2001, pp. 1-22, last accessed Oct. 8, 2012, (http://www.ietf.org/rfc/rfc3032.txt). |
Schilit B., “Bootstrapping Location-Enhanced Web Services”, University of Washington, Dec. 4, 2003, (http://www.cs.washington.edu/news/colloq.info.html). |
Seeley R., “Can Infravio technology revive UDDI?”, ADTmag.com, Oct. 22, 2003, last accessed Sep. 30, 2004, (http://www.adtmag.com). |
Shohoud, Y., “Building XML Web Services with VB .Net and VB 6”, Addison Wesley, 2002, pp. 1-14. |
Sommers F., “Whats New in UDDI 3.0—Part 1”, Web Services Papers, Jan. 27, 2003, pp. 1-4, last accessed Mar. 31, 2004, (http://www.webservices.org/index.php/article/articleprint/871/-1/24/). |
Sommers F., “Whats New in UDDI 3.0—Part 2”, Web Services Papers, Mar. 2, 2003, pp. 1-8, last accessed Nov. 1, 2007, (http://www.web.archive.org/web/20040620131006/). |
Sommers F., “Whats New in UDDI 3.0—Part 3”, Web Services Papers, Sep. 2, 2003, pp. 1-4, last accessed Mar. 31, 2007, (http://www.webservices.org/index.php/article/articleprint/894/-1/24/). |
Sleeper B., “The Evolution of UDDI: UDDI.org White Paper”, The Stencil Group, Inc., Jul. 19, 2002, pp. 1-15, San Francisco, California. |
Sleeper B., “Why UDDI Will Succeed, Quietly: Two Factors Push Web Services Forward”, The Stencil Group, Inc., Apr. 2001, pp. 1-7, San Francisco, California. |
“UDDI Overview”, Sep. 6, 2000, pp. 1-21, uddi.org, (http://www.uddi.org/). |
“UDDI Version 3.0.1 UDDI Spec Technical Committee Specification”, Oct. 14, 2003, pp. 1-383, uddi.org, (http://www.uddi.org/). |
“UDDI Technical White Paper,” Sep. 6, 2000, pp. 1-12, uddi-org, (http://www.uddi.org/). |
Wang B., “Priority and realtime data transfer over the best-effort Internet”, Dissertation Abstract, 2005, ScholarWorks@UMASS. |
Wikipedia, “Diameter (protocol)”, pp. 1-11, last accessed Oct. 27, 2010, (http://en.wikipedia.org/wiki/Diameter—(protocol)). |
Woo T.Y.C., “A modular approach to packet classification: algorithms and results”, Nineteenth Annual Conference of the IEEE Computer and Communications Societies 3(3):1213-22, Mar. 26-30, 2000, abstract only, last accessed May 14, 2007, (http://ieeexplore.ieee.org/xpl/freeabs—all.jsp?arnumber=832499). |