CROSS REFERENCE TO RELATED APPLICATIONSNotice: More than one reissue application has been filed for the reissue of U.S. Pat. No. 7,698,297. The reissue applications are application Ser. Nos. 14/866,639 (the present application) and 13/445,791. This application is a continuation reissue of U.S. patent application Ser. No. 13/445,691 (U.S. Pat. No. RE45,793), filed on Apr. 12, 2012, which is an application for reissue of U.S. Pat. No. 7,698,297, filed on Mar. 12, 2004, which is a divisional of U.S. patent application Ser. No. 10/423,638 entitled “ACCESSING MEDIA ACROSS NETWORK,” filed on Apr. 25, 2003 now U.S. Pat. No. 6,728,729 from which priority under 35 U.S.C. §120 is claimed, and which is all of which are incorporated herein in its entirety and for all purposes by reference.
BACKGROUND OF THE INVENTION1. Field of the Invention
The present invention relates to digital media and, more particularly, to accessing digital media across networks.
2. Description of the Related Art
The ability of computers to be able to share information is of utmost importance in the information age. Networks are the mechanism by which computers are able to communicate with one another. Generally, devices that provide resources are called servers and devices that utilize those resources are called clients. Depending upon the type of network, a device might be dedicated to one type of task or might act as both a client and a server, depending upon whether it is giving or requesting resources.
Increasingly, the types of resources that people want to share are entertainment-related. Specifically, music, movies, pictures, and print are all types of entertainment-related media that someone might want to access from across a network. For example, although a music library may reside on a family computer in the den, the media owner may want to listen to the music in the living room.
However, sharing media data can be a network-intensive process. People have devoted significant resources to both reducing the load on networks and increasing the capability of networks to handle large data transfers. Due to advances in compression technology and network bandwidth, the throughput of information through networks has increased dramatically over the years.
Although the described technologies work well in many applications, there are continuing efforts to further improve the ability to transfer digital media.
SUMMARY OF THE INVENTIONThe present invention provides a method of retrieving media across a network. First, a client connects to a network that includes a server. The server includes at least one media database that has media and associated media information. The client then queries the server for at least a portion of the media information and then receives media information responsive to the query. The client then uses a client-side media management system to manage the received media information. Management of the received media information includes selecting media. The client then requests the selected media from across the network and, in response to the request, receives the requested media.
In another aspect, a client queries the server for server information and capabilities after connecting to the network. The client then receives a response that identifies the server and informs the client as to its capabilities. After receiving the server information, the client queries the server for database enumeration and receives a response that enumerates all databases, how much media is available, and how many media collections are available. After the database identification, the client queries the server for an enumeration of media collections in the database and receives a response that identifies media collections. The client then queries the server for data associated with an identified media collection, the query being capable of requesting a different level of detail than would be given by default. The response to the media collection query identifies data associated with the identified media collection in the requested level of detail. The client then executes the identified media collection, requesting media from the server when the media collection requires the media and receiving the requested media.
In yet another aspect, the invention provides a method of ensuring that a media database representation on a client is current. The server first provides a media database that updates to a current revision indicator whenever the media database is modified. Then, the server receives a request from the client, the request pertaining to the database that includes a client-provided revision indicator. After receiving the request, the server compares the current revision indicator to the client-provided revision indicator. The server then responds to the request with a response that includes at least an identification of the current revision indicator if the client-provided revision indicator did not match the current revision indicator.
BRIEF DESCRIPTION OF THE DRAWINGSThe invention may best be understood by reference to the following description taken in conjunction with the accompanying drawings in which:
FIG. 1 is a block diagram illustrating an exemplary environment in which the present invention may be implemented;
FIG. 2 is a block diagram illustrating an organizational structure of a server-side media management system on the server illustrated inFIG. 1;
FIG. 3 is a block diagram illustrating an organizational structure of a client-side media management system on the client illustrated inFIG. 1;
FIG. 4A is a representational control flow diagram illustrating one technique that can be used to determine the features of the server-side media management system illustrated inFIG. 2;
FIG. 4B is a representational control flow diagram illustrating one technique that could be used to enumerate databases of the server-side media management system illustrated inFIG. 2;
FIG. 4C is a representational control flow diagram illustrating one technique that could be used to populate a song records portion of the client-side media management system illustrated inFIG. 5;
FIG. 4D is a representational control flow diagram illustrating a technique that could be used to enumerate playlists of the server-side media management system illustrated inFIG. 2;
FIG. 4E is a representational control flow diagram illustrating a technique that could be used to populate a playlist records portion of the client-side media management system illustrated inFIG. 6;
FIG. 4F is a representational control flow diagram illustrating a technique that could be used to retrieve a song from a song database once a song is selected from the client-side media management system illustrated inFIG. 7;
FIG. 5 is a block diagram illustrating an organizational structure of the client-side media management system after receiving a reply to the SERVER-DATABASE request illustrated inFIG. 4B;
FIG. 6 is a block diagram illustrating an organizational structure of the client-side media management system after receiving a reply to the DATABASE-SONGS request illustrated inFIG. 4C;
FIG. 7 is a block diagram illustrating an organizational structure of the client-side media management system after receiving a reply to the PLAYLIST-SONGS request illustrated inFIG. 4E;
FIG. 8 is a representational control flow diagram illustrating one technique that could be used to ensure the client and the server illustrated inFIG. 1 are synchronized; and
FIG. 9 is a diagram illustrating an exemplary computing device in which various embodiments of the invention may be implemented.
It is to be understood that, in the drawings, like reference numerals designate like structural elements. Also, it is understood that the depictions in the figures are not necessarily to scale.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTSIn the following description, numerous specific details are set forth to provide a thorough understanding of the present invention. However, it will be obvious to one skilled in the art that the present invention may be practiced without some or all of these specific details. In other instances, well known process steps have not been described in detail in order to avoid unnecessarily obscuring the present invention.
The present invention generally allows for client machines to access a media database on a server. Both data and metadata on the server describes and organizes the media in various ways and allows the server to manipulate the media. Instead of relying on the server to execute the media management system, the client requests the data and metadata and then uses the information on a local media management system, effectively creating a representation of the server on the client. Once media is selected on the client through the client-side media management system, the client can request the media from the server, and the server can deliver the media to the client.
The invention can support both “thick” and “thin” clients. Thick clients are typically software programs, such as iTunes™ software available from Apple Computer, Inc. of Cupertino, Calif., operating on hardware devices that support full user interface abilities and have considerable processor and memory resources. Thin clients are software programs operating on hardware devices that may have limited user interface abilities and have reduced processing and memory resources. The invention allows for robust control features appropriate for thick clients, but can adapt to minimal control features for thin clients.
Generally, a client will first make a request to determine whether media is available on a server. Then, the client can make a series of requests to create a representation of the media available on the server on the client. The representation contains information about the media available on the server (“media information”). Thick clients can choose to retrieve a complete representation of the server's available media, while thin clients may choose to retrieve a partial representation of the server's available media. After receiving the media information from the server, the client (as instructed by its user) can then search, browse, sort, or otherwise interact with the media information now resident on the client. Further, the client (as instructed by its user) will typically select a media item to be presented (e.g., played). In such a case, the media content for the selected media item is streamed from the server to the client.
In addition, clients can receive notifications from the server when a media database has been changed. Multiple connections can allow a client to use one connection to access media while using another connection to wait for a notification that the database has changed, or to browse media listings.
FIG. 1 is a block diagram illustrating an exemplary environment in which the present invention may be implemented. Anetwork105 couples aserver110 tovarious clients115,120,125, and130. Thenetwork105 can generally be a data network, such as a LAN, WAN or the Internet. Theserver110 may or may not be a dedicated device. In the example shown inFIG. 1, theserver110 is a general purpose computer. Thevarious clients115,120,125, and130 can be thick or thin clients, with varying levels of processing power. Clients may includeportable computers115,desktop computers120, specialized devices such asiPods™125 available from Apple Computer, Inc. of Cupertino, Calif., or even network-aware audio/video components130 that are designed to work across anetwork105. The following discussion will, for simplicity, assume only theportable computer client115 is requesting information from theserver110.
FIG. 2 is a block diagram illustrating an organizational structure of a server-sidemedia management system200 on theserver110. The server-sidemedia management system200 includes amedia manager210 and amusic database205. Themedia manager210 controls access to themusic database205. More particularly, themedia manager210 receives requests from theclient115, accesses the music database, and returns responses to theclient115.
Themusic database205 has a number ofrecords215 and220 that are used to classify, identify and/or describe media (i.e., media items) in themusic database205. For simplicity, the following discussion will assume the digital media contained on theserver110 only contains music files that can be streamed over thenetwork105. It should be appreciated that any reference to “songs” or “music” made in this document could be generalized to any form of digital media, which can include sound files, picture data, movies, text files or any other types of media that can be digitally stored on a computer. Similarly, any reference to “playlists” can be generalized to media collections, including collections of mixed digital media.
Themedia manager210 has or can obtain information about thedatabase205 that may, for example, include the name of the server, the version of the database being used, the type of security that is required, the number of databases available to the server, whether non-standard content codes are supported, whether persistent identification is supported, etc. It should be appreciated by those skilled in the art that the information about thedatabase205 may exist in a single record file or can be either partially or fully generated on demand, identifying the various pieces of information as needed.
The song records215 contain metadata about each media item available in thedatabase205. The metadata might include, for example, the names of songs, an identification number, a persistent identification number, the artist, the album, the size of the song, the format of the song, the required bit rate, and any other appropriate information. Of course, the type of information may depend on the type of media. A video file might additionally have director and producer fields, but may not use the album field. Still pictures would have no need for bit rate information. While some fields may be standard, others may be specific to certain applications. For example, a video signal may have secondary audio program (SAP) information. A mechanism for ensuring clients can properly process non-standard content codes is described in connection withFIG. 4A.
Both an identification number and a persistent identification number can be used. If supported, a persistent identification could be used to access the same information across server restarts. Typically, a server would assign each record a new identification number every time themedia management system200 restarted. However, persistent identification numbers would remain the same for as long as the record is available.
The playlist records220 contain information about each playlist available in themusic database205. Further, the information for a given playlist can include the identification numbers for each of the songs within the playlist. Playlists are collections of media that may or may not be in any particular order. Users may choose to combine media by genre, mood, artists, audience, or any other meaningful arrangement. While theplaylists220 on theserver110 will usually only include media contained in itsown music database205, there is no reason the playlist records220 cannot include media or playlists stored on other servers. However, certain non-standard content codes may need to be used, depending upon the implementation of the server-sidemedia management system200.
FIG. 3 is a block diagram illustrating an organizational structure of a client-sidemedia management system300 on one of theclients115. The client-sidemedia management system300 includes amedia manager305. Themedia manager305 interacts with themedia manager210 of the server-sidemedia management system200 through thenetwork105 so as to replicate at least a portion of themusic database205 at theserver110 on theclient115. When the client-sidemedia management system300 first starts, it cannot access media on theserver110 because it does not as yet have any information about what media is available.
FIG. 4A is a representational control flow diagram illustrating one technique that can be used to determine the features of the server-sidemedia management system200. Operations performed by theclient115 and theserver110 are represented by correspondingvertical lines403 and406. At409 theclient115 connects to thenetwork105 and first becomes aware of theserver110. Theclient115 can use any connection mechanism that allows it to interact with thenetwork105. For example, if theclient115 were an iBook™ available from Apple Computer, Inc. of Cupertino, it might use Rendezvous™ networking technology, also available from Apple Computer, Inc. of Cupertino, Calif., in order to automatically configure itself with thenetwork105. If the client is not aware of theserver110, other mechanisms can be used. For example, a user might manually search for theserver110, or the user might directly enter the address of theserver110.
Once theclient115 is aware of theserver110, it can send a SERVER-INFO request to theserver110 at412. The SERVER-INFO request is usually used to obtain information from the server prior to attempting any other transactions. If thenetwork105 uses the TCP/IP protocol, the request could be formatted as an HTTP GET request. The GET request might also allow for additional extensions to be added to the request, enabling, for example, theclient115 to include information about the client-sidemedia management system300.
At415 the server responds to the SERVER-INFO request with information describing a series of features supported by or required by the server. The information might, for example, include information about the server-sidemedia management system200, the number of available databases, whether and what login procedures are required, whether updates are supported, whether persistent identification numbers are supported, whether non-standard content codes are supported, and the protocol version.
The information provided to theclient115 at415 permits the client-sidemedia management system300 to understand the capabilities of theserver110. Although theclient115 is able to identify theserver110, theclient115 does not yet have any information about the available media.
If theclient115 determines that theserver110 responded to the SERVER-INFO request with an indication that non-standard content codes are supported at418, theclient115 can optionally issue a CONTENT CODE request at421. The CONTENT CODE request is one mechanism by which theclient115 can obtain a list of content codes supported by theserver110 and associated string names mapped thereto.
The inclusion of the string name allows multiple developers to use the same codes for their individualized products. For example, one developer may assign the code “16000” to a feature that allows users to purchase corresponding albums over the network; while another developer may assign the same code to feature that provides users with the lyrics of songs that are being listened to. By allowing a string name to be included, theclient115 can determine whether it can support the content code. Uniqueness of the string name can, for example, be ensured by including the developer's URL as part of the string name.
At424 theserver110 responds to the CONTENT CODE request the codes and their associated string names. At427, theclient115 can simply ignore the code/string pairs that it does not recognize. Otherwise, for those code/string pairs that theclient115 does recognize, theclient115 will associate the code with the associated string name.
At430 theclient115 logs into theserver110. The login procedure might require a user name (or account name) and password so the user of the client can be authenticated. The login procedure is only required if theserver110 requires it. Certain security protocols might require that every future request made by theclient115 include certain parameters such as a session identification number.
Once logged in, theclient115 is ready to begin populating its local representation of themusic database205.FIG. 4B is a representational control flow diagram illustrating one technique that can be used to enumerate databases of the server-sidemedia management system200. Operations performed by theclient115 and theserver110 are represented by correspondingvertical lines403 and406. At433 theclient115 can issue a SERVER-DATABASE request, which can be used to retrieve the list of all music databases from theserver110. The SERVER-DATABASE request may additionally include an index range and/or a query. Although available to both thick and thin clients, thin clients might use index ranges and/or queries to limit the amount of data contained in each server response.
The index range might be used in any request to constrain the items returned in the response to a subset of the total set of items, based on the position (or index) of the first item and the number of items requested. For example, an index range could be used to request: the second music database from a server, songs 10 through 20 from a music database, the last 5 playlists from a music database, the first 5 songs from a given playlist, or the 42nd song in a music database.
The query might be used in any request to constrain the items returned in the response to a subset of the total set of items, based on the specified criteria. For example, a query could request: songs in a database after a given year; playlists that contain a certain word in their name; songs in a database that do not contain a given word in their name; or some combination thereof.
After processing the SERVER-DATABASE request at436, theserver110 issues a response at439. If no index range and/or query was given, the response would contain a complete list of the music databases available at theserver110 together with information about the one or more music databases. The information about each database might, for example, include the database identification number, the persistent database identification number, the name for each database, the numbers of songs, and the number of playlists. With this information, the client-sidemedia management system300 becomes aware of the general structure of the one or more music databases at theserver110.
FIG. 5 is a block diagram illustrating the organizational structure of the client-sidemedia management system300 shown inFIG. 3 after receiving a reply to the SERVER-DATABASE request. At442, theclient115 is able to identify themusic database510, the number ofavailable song records515, and the number ofavailable playlists520. Once the general structure of themusic database510 is known, theclient115 can populate its representation using any number of techniques.
FIG. 4C is a representational control flow diagram illustrating one technique that could be used to populate the song records515 portion of the client-sidemedia management system300 for aspecific database510. Operations performed by theclient115 and theserver110 are represented by correspondingvertical lines403 and406. At445 the client issues a DATABASE-SONGS request to obtain metadata about available songs.
A thick client may choose to issue a DATABASE-SONGS request so that it can front load network traffic. Once metadata about a song is received and stored, theclient115 does not need to request that metadata again. Playlists would only need to correctly identify a song (e.g., using the song identification number), and the client-sidemedia management system300 would be able to associate it with the already-received metadata.
Thin clients may choose to issue an index range, query, metadata field specifier, or skip445 all together. A metadata field specifier would indicate that only certain metadata fields are desired. Thick clients that use445 may also choose to use these same index range, query or metadata field specifier techniques. For example, limiting the song metadata request to only songs in a certain genre might be a technique that is used to provide the user with a different user experience.
Theserver110 performs any necessary filtering operations at448 and then issues a reply at451.FIG. 6 is a block diagram illustrating the organizational structure of the client-sidemedia management system300 at453, after receiving a reply to the DATABASE-SONGS request. The song records605 may either be a partial or complete representation of the server-side song records215, having metadata that might, for example, include the names of songs, an identification number, a persistent identification number, the artist, the album, the size of the song, the format of the song, the required bit rate, and any other appropriate information. If the server-side management system200 had multiple databases, a DATABASE-SONGS request (if used) would need to be issued for each database.
FIG. 4D is a representational control flow diagram illustrating a technique that could be used to enumerate the playlist records220 portion of the server-sidemedia management system200. Operations performed by theclient115 and theserver110 are represented by correspondingvertical lines403 and406.
At454 the client issues a DATABASE-PLAYLIST request to obtain a list of available playlists. Playlists on theserver110 can either be user-identified or generated automatically by the server-sidemedia management system200. For example, a “base playlist” might be automatically created as a special playlist that contains all the songs in theentire song database205 while a “John Lennon playlist” might be a user-created collection of songs by John Lennon.
After receiving the DATABASE-PLAYLIST request and performing any necessary filtering operations, theserver110 issues a reply at457. The reply includes a list of all playlists in themusic database205 and information about those playlists. The information about the playlists might, for example, include identification numbers and/or persistent identification numbers for the playlists, and any other information (e.g., whether the songs in the playlist are in order or can be shuffled) that may have been provided. Multiple DATABASE-PLAYLIST requests may be required to populate multiple databases.
FIG. 4E is a representational control flow diagram illustrating a technique that could be used to populate the playlist records520 portion of the client-sidemedia management system300. Operations performed by theclient115 and theserver110 are represented by correspondingvertical lines403 and406. Once a playlist is identified at460, theclient115 sends a PLAYLIST-SONGS request for that playlist at463. Depending upon whetheroperations445 through451 were already performed, the PLAYLIST-SONGS request could additionally request that metadata accompanying each song also be delivered in order to populate the song records605. Although thick clients that do not have a mechanism for informing theserver110 of already-receivedsong records605 would run the risk of receivingduplicate song records605, thin clients that did not retainsong records605 might benefit from requesting song metadata along with each playlist.
After receiving the PLAYLIST-SONGS request and performing any necessary filtering operations, theserver110 issues a reply at466 containing the requested information.FIG. 7 is a block diagram illustrating the organizational structure of the client-sidemedia management system300 after receiving a reply to the PLAYLIST-SONGS request at469. Each time the PLAYLIST-SONGS transaction between theclient115 and theserver110 is completed, anotherplaylist record705 is populated. Theplaylist record705 may be a complete or partial representation of the corresponding server-side playlist record220. Multiple PLAYLIST-SONGS requests may be required to populate multiple playlists.
FIG. 4F is a representational control flow diagram illustrating a technique that could be used to retrieve a song from thesong database205 once a song is selected. Operations performed by theclient115 and theserver110 are represented by correspondingvertical lines403 and406.
At472 theclient115 issues a SONG-DATA request to retrieve the song data from theserver110. If a single song is stored in multiple formats on the server100, the SONG-DATA request could include a format identifier. The format identifier could specify that the song is requested in, for example, MPEG 3 encoded data (“mp3”), MPEG 4 advanced audio coding (“m4a”) audio interchange file format (“aiff”), or Windows sound file (“wav”). At475 theserver110 delivers the audio file to theclient115. In one embodiment, theserver110 will stream the song by appending song data to an http header, therefore making theclient115 responsible for parsing the data as is appropriate for playing the song at theclient115.
The preceding description assumes no mechanism is used to update theclient115 if the data on the server-sidemedia management system200 is modified during a session. For example, a client-side representation of aplaylist705 may not accurately represent the latest version of the corresponding server-side playlist220.
FIG. 8 is a representational control flow diagram illustrating one technique that could be used to ensure theclient115 and theserver110 are synchronized. Operations performed by theclient115 and theserver110 are represented by correspondingvertical lines805 and810.
At815 theclient115 issues an UPDATE request to retrieve the media data from theserver110. The UPDATE request can be a flag that informs theserver110 that theclient115 wants to be informed when data on the server110 (e.g., music database205) changes. In one embodiment, the flag is a revision indicator, such as a revision number or a time-stamp.
At820 theserver110 processes the UPDATE request. In one embodiment, theserver110 will not respond to the UPDATE request until the server's music database has changed relative to the client's representation for that music database. If a revision number was used at815, theserver110 compares the revision number provided by theclient115 with the current revision number to determine if a change was made. The revision number of theserver110 represents the version of themusic database205 at theserver110. Any subsequent changes torecords215 or220 may cause theserver110 to increment its revision number by one. Depending upon the requirements of the system, a group of changes torecords215 or220 may be batched so that the revision number only increments once. Batching may be performed by standard techniques, including by operation (e.g., adding files as a group to the server), by time (e.g., waiting a certain period of time after the last change has been made to ensure no other changes will be made) or by number of operations (e.g., changing the revision number after a certain number of changes).
Once theserver110 determines that the revision number provided by the client no longer equals the current revision number, a reply is issued at825. In one embodiment, the reply will contain the server's current revision number. Although theserver110 could then the continue to monitor for changes in the server's current revision number, theclient115 might re-issue a new UPDATE request with the server's current revision number, essentially repeatingoperation815 with the updated revision number. Some systems might have theclient115 always start with a client-generated revision number of “1” and theserver110 always start with a revision number “2” in order to force theserver110 to issue an UPDATE reply the first time it receives an UPDATE request. Such an approach can provide theclient115 with an impetus for populating its local representation of themusic database205 with a SERVER-DATABASE request (seeFIG. 4B at433). Additionally, an UPDATE reply might also be used to notify aclient115 that the server is about to terminate connection (possibly due to timeout or server shutdown), perhaps by issuing a current revision number of 0.
In addition to the UPDATE request, theclient115 could also include a revision number field in any of therequests433,445,454, and463. Theserver110 would then, on a request-by-request basis, check the revision number provided with the requests with the revision number for that particular request. If the revision numbers did not match, theserver110 would issue an UPDATE reply, specifying the current revision number and perhaps the corresponding reply. Otherwise, theserver110 would comply with the request as previously described.
In one embodiment, the database requests433,445,454, and463 would additionally support incremental updating in order to reduce network traffic (and to improve user experience through greater responsiveness). Incremental updates would allow the client to request only the changes from a historical revision number to a current revision number. If, for example, theclient115 had populated itsplaylists records705 with information from revision “5,” and then the client is notified by theserver110 that the latest revision is “8,” the client can issue a new PLAYLIST-SONGS request463, requesting only the information that has changed from revision “5” to revision “8.” As long as theserver110 maintains or has access to a historical record of modifications from each revision number, it would be able to comply with the incremental request.
However, an optimization might allow for theserver110 to determine whether complying with the incremental request would actually be more efficient than re-sending the entire reply. In certain circumstances (e.g., when more than half of the songs in the playlist were deleted), it would use less network resources to reply with a full PLAYLIST-SONGS reply466 instead of an incremental reply. However, when the PLAYLIST-SONGS reply466 provides a full reply, the reply would advantageously include an indication that the data does not represent an incremental update, so theclient115 will be able to properly handle the information.
Generally, the techniques of the present invention may be implemented on software and/or hardware. For example, they can be implemented in an operating system, in a separate user process, in a library package bound into network applications, or on a specially constructed machine. In a specific embodiment of this invention, the technique of the present invention is implemented in software such as an operating system and/or in an application program running on the operating system.
A software or software/hardware hybrid implementation of the techniques of this invention may be implemented on a general-purpose programmable machine selectively activated or reconfigured by a computer program stored in memory. In an alternative embodiment, the techniques of this invention may be implemented on a general-purpose network host machine such as a personal computer, workstation or server. Further, the invention may be at least partially implemented on a general-purpose computing device.
Referring now toFIG. 9, acomputing device900 suitable for implementing the techniques of the present invention includes a master central processing unit (CPU)905,interfaces910,memory915 and abus920. When acting under the control of appropriate software or firmware, theCPU905 may be responsible for implementing specific functions associated with the functions of a desired computing device. TheCPU905 preferably accomplishes all these functions under the control of software including an operating system (e.g., Mac OS X), and any appropriate applications software (e.g., iTunes).
CPU905 may include one or more processors such as those from the Motorola family of microprocessors or the MIPS family of microprocessors. In an alternative embodiment, the processor is specially designed hardware for controlling the operations ofcomputing device900.
Theinterfaces910 are typically provided as interface cards. Generally, they control the sending and receiving of data packets over the network and sometimes support other peripherals used with thecomputing device900. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, DSL interfaces, token ring interfaces, and the like. In addition, various very high-speed interfaces may be provided such as fast Ethernet interfaces, Gigabit Ethernet interfaces, ATM interfaces, HSSI interfaces, POS interfaces, FDDI interfaces, ASI interfaces, DHEI interfaces and the like. Generally, these interfaces may include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile RAM.
Regardless of computing device's configuration, it may employ one or more memories or memory modules (such as, for example, the memory915) configured to store data, program instructions and/or other information relating to the functionality of the techniques described herein. The program instructions may control the operation of an operating system and/or one or more applications, for example.
Because such information and program instructions may be employed to implement the systems/methods described herein, the present invention relates to machine readable media that include program instructions, state information, etc. for performing various operations described herein. Examples of machine-readable media include, but are not limited to, magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROM disks; magneto-optical media such as floptical disks; and hardware devices that are specially configured to store program instructions, such as read-only memory devices (ROM) and random access memory (RAM). Examples of program instructions include both machine code, such as produced by a compiler, and higher level code that may be executed by the computer (e.g., using an interpreter).
Although illustrative embodiments and applications of this invention are shown and described herein, many variations and modifications are possible which remain within the concept, scope, and spirit of the invention, and these variations would become clear to those of ordinary skill in the art after perusal of this application. Accordingly, the present embodiments are to be considered as illustrative and not restrictive, and the invention is not to be limited to the details given herein, but may be modified within the scope and equivalents of the appended claims.