1. Technical Field
This invention relates to the field of cable data delivery systems and, more particularly, to a two-tiered authorization and authentication system for a cable delivery system.
2. Description of the Relevant Art
In the not-too-distant past, images could be processed and displayed only by large, special-purpose computer systems. Owners of lower-cost and less-powerful computers such as personal computers had to content themselves with character-based displays. The cost of memory has dropped so quickly and the power of microprocessors has increased so greatly in recent years, however, that modern personal computers are completely capable of processing and displaying images. Indeed, modern graphical user interfaces depend to a large extent on this capability.
Frustratingly enough for users of personal computers, the old problems with images have returned in another area, namely network computing. In network computing, the personal computer or work station is connected to a network and is able to use the network to fetch the data it is processing from remote locations. The most recent development in network computing is the Internet, a worldwide logical network which permits anyone who has access to the Internet to interactively fetch data including images from just about anywhere in the world. For example, using the Internet, it is possible to fetch pictures of the latest restoration projects in Florence, Italy from that city's home page on the World Wide Web.
The main drawback to interactively fetching data on the Internet is the length of time it takes to retrieve and display images. The problem is so serious that many people set up the program they use to access the Internet so that it does not fetch images. Doing this restricts the user to character data, but greatly decreases the time it takes to access information. The bottleneck in retrieving images from the Internet is not the personal computer, but rather the lack of capacity or bandwidth of the networks over which the images must be fetched. One part of the network where bandwidth is particularly restricted is the analog telephone line that connects most PC users to the Internet.
It has been known for years that the bandwidth of the telephone system can be increased by replacing the analog system with a digital system, but all of the known techniques for doing this require extensive modification of the telephone system.
A great many homes do in fact have a high bandwidth connection, namely that provided by cable television. The problem with this connection is that it is one way. A PC may receive data via a home's CATV cable, but it cannot use the cable to send data. Again, ways of making the CATV system bidirectional have been known for years. For example, in the early 1980's, Scientific Atlanta, Inc. introduced and marketed a product known as the Model 6404 Broadband Data Modem for use with bidirectional CATV systems.
Scientific-Atlanta, Inc. has also recently filed U.S. patent application Ser. Nos. 08/627,062, filed Apr. 3, 1966, 08/738,6681, filed Oct. 16, 1996, and a continuation-in-part titled System and Method for Providing Statistics for Flexible Billing in a Cable Environment, Koperda, et al., filed Mar. 14, 1997 which describe bidirectional CATV systems. As with the telephone systems, the problem here is not the technology, but the fact that its introduction requires extensive modification of most existing CATV systems.
Given that many homes have a CATV cable and virtually all homes have an analog telephone line, systems have been proposed in which the CATV cable is used to send data from the Internet to the PC and the telephone line used to return data from the PC to the Internet. These systems take advantage of the fact that by far the most common pattern of interaction between users and networks is for the user to retrieve a large amount of data over the network, for example an image of a restored art work from Florence, examine the image, and then send a few keystrokes over the network. With this kind of interaction, far less bandwidth is needed in the channel that is used to return the keystrokes than in the channel that is used to fetch the image.
An example of such a system is the one disclosed in Moura, et al., Asymmetric Hybrid Access System and Method, U.S. Pat. No. 5,586,121, issued Dec. 17, 1996, and in Moura, et al., Remote Link Adapter for use in TV Broadcast Data Transmission System, U.S. Pat. No. 5,347,304, issued Sep. 13, 1994. In this system, the head end of a cable system has high bandwidth access to the Internet or to other networks and access via CATV cables and the telephone system to households or businesses with PCs. Data received from these networks is sent to PCs connected to the cable system's cables and responses from the PCs are collected via the telephone system and sent to the network. In the home or business, the PC is connected either directly or via a local area network to a device which includes both a radio frequency modem and a standard analog telephone modem. The radio frequency modem is connected to the CATV cable. It receives and decodes the data sent on the CATV cable and provides it to the PC. The telephone modem is connected to a standard telephone line. It receives data from the PC and sends it to the CATV head end, which in turn forwards it to the Internet or other networks.
While systems such as the one disclosed in the Moura references do provide a solution to the bandwidth problem, they have a number of deficiencies, particularly when used in the context of the Internet. Among the deficiencies are the following:
The system of Moura wastes Internet Protocol (IP) addresses for the computers attached to the modem. IP addresses are in short supply. In the system of Moura, however, IP addresses are statically assigned to the PCs and are consequently not available for reuse when a PC is idle or not engaged in an activity which involves network access.
From the point of view of the Internet, the system of Moura is a link level system, that is, the components of the system of Moura do not themselves have IP addresses and cannot themselves execute IP protocols. In particular, IP routing is not used within the system of Moura. One difficulty arising from this situation is that IP routing is centralized in the IP router that connects the head end to the Internet; another is that the modem in the system of Moura cannot function as an IP router.
In Moura, the telephone connection to the modem is used solely to transfer data from the PC and modem to the head end. All data received by the PC and modem is sent via the CATV cable. Consequently, when the CATV system fails, the PC is left without a connection by which it can receive data. This situation is made even less desirable by the fact that CATV systems are far more likely to fail than the telephone system.
The CATV channel to which the modem of Moura responds is statically assigned to a given modem, thereby rendering the channel unavailable for use by other modems when the PC connected to the given modem is idle or is not engaged in an activity which involves network access.
The Moura system is further deficient in that it does not have adequate provisions for preventing unauthorized use of the system. Thus, the system is subject to revenue loss for the system provider. Such losses result in an overall increase in the operating cost of the system, which ultimately must be passed on to the authorized subscribers.
Accordingly, there is a great need for a system like the one disclosed by Moura, but which is not burdened by the aforementioned deficiencies.
In accordance with the principles of the present invention, there is provided a modem apparatus including means for communicating authentication information of a host along a first path to prompt a first validation for receiving data over the first path, and means for communicating identifying information of the modem apparatus and a request for network resource allocation over the first path to prompt a second validation after the first validation, the second validation enabling the reception of data over a second path that has a higher rate of transmission than the first path.
Further details and features of the present invention will be understood from reading the detailed description of the invention in view of the drawings.
In a preferred embodiment, cable data network 100 is implemented in a cable television (CATV) system. Packets from Internet 150 that contain the IP address of a host 108(i) are received in CATV head end 122, are put in the proper form for transmittal over cable 132 belonging to the CATV system, and are transmitted via cable 132 to RF modem 106(j) to which destination host 108 (i) is attached. RF modem 106 (j) reads the IP address of host 108 from the packet and routes the packet to host 108 (1). Packets from host 108 (i) which are intended for a destination in Internet 150 go to RF modem 106(j), which routes them via telephone line 131 and public switched telephone network (PSTN) 109 to a telephone modem (Tmodem) 110(k) in telephone modem pool 135 in head end 122. Tmodem 110(k) routes the packet to router 101, which routes it to Internet 150. Since public switched telephone network 109 allows bidirectional communication, router 101 may also route packets received from Internet 150 for host 108(i) to host 108(i) via tmodem 110(k) and RF modem 106(j). As will be explained in more detail in the following, this route is used in the event of a failure in the CATV portion of network 100.
Continuing with the details of the implementation of cable data network 100, data packets are transferred between Internet 150 and CATV head end 122 by means of a transmission medium belonging to a wide-area backbone network 124. Typically, the transmission medium will be a high-speed, high-capacity fiber optic cable such as a T1 or T3 cable, but it could also be a terrestrial or satellite microwave link. The transmission medium is connected to router 101, which in a preferred embodiment may be a router belonging to the 7000 series manufactured by Cisco Systems, Inc., San Jose, Calif.
Router 101 is coupled between WAN backbone 124 and local-area network (LAN) 120, which is the link-level network that connects the components of cable data network 100 which are located in CATV head end 122. Router 101 may both receive packets from backbone 124 or LAN 120 and provide them to backbone 124 or LAN 120. Each component connected to LAN 120 has both an IP address and a LAN address on LAN 120, and router 101 contains a routing table which it uses to route IP packets to IP hosts, including other routers. Router 101 examines every packet it receives on WAN backbone 124 or LAN 120; if the packet's destination IP address is one of the ones in the routing table, router 101 routes it to the component on LAN 120 which is to receive IP packets having that address; if it is not one of the addresses in the routing table, router 101 routes it to WAN backbone 124, which takes it to Internet 150. In each case, router 101 puts the data packet into the proper form to be transmitted via the relevant link-level network.
As will be apparent from the foregoing discussion, LAN 120 and router 101 can be used to route IP packets received from Internet 150 and destined to a host 108 via two routes. The first is via communications manager 102 and cable plant 105, cable 132, and RF modem 106. The second is to host 108 via telephone modem pool 135 and RF modem 106. Packets from host 108 and from RF modem 106 go via telephone modem pool 135 and LAN 120 to router 101. In other embodiments, it may also be possible to route packets addressed to RF modem 106 via the first route. Router 101 can finally route packets via Internet 150 between the components in head end 122, hosts 108, RF modems 106, and control and management component 111.
When packets are to go to a host 108 via cable 132, they are routed to communications manager 102, which puts the packets into the proper form for transport by that link-level network.
Each superpacket 407 contains a header 409 and data 411. The header contains a link identifier (LinkID) 413 in cable network 132 for an RF modem 106. The number of superpackets 407 is the number of pipes in channel 403 (i). When a given RF modem 106 (i) is active, it is associated with a <channel,pipe, link ID> triple, that is, the RF modem 106(i) is tuned to the channel 403(j) specified in the triple and watches the superpackets that belong to the pipe specified in the triple. For example, if the RF modem is associated with pipe 3, it watches superpacket 407 (3) in superframe 405, and if superpacket 407 (3)'s header 409 contains RF modem 106 (i)'s Link Id 413, RF modem 106 (i) reads data 411 from superpacket 407 (3). The <chanel,pipe,LinkID> triple is thus the link address of RF modem 106(i) on cable 132. Data 411 is of course all or part of an IP packet 301. If the IP address of packet 301 specifies a host 108 connected to RF modem 106(i), RF modem 106(i) routes it to that host 108.
Returning to communications manager 102, that component receives IP packets 301 addressed to hosts 108 connected to networks whose link layers are cables 132 connected to head end 105 and routes them to the proper RF modems 106 for the hosts. It does by relating the IP address of an active host 108 to one of the networks and within the network to a <channel,pipe,linkID> triple specifying the RF modem 106 to which the host 108 is connected. As employed in the present context, an active host is one that currently has an IP address assigned to it. Using the information in the routing table, communications manager 102 makes superframes 405 for each channel 403(i) in the network containing cable 132. The superframes contain superpackets 407 directed to the RF modems 106 connected to that channel for which communications manager 102 has received IP packets 301. The superframes are stored in a dual-ported memory which is accessible to QPR modulators 103.
There is a QPR modulator 103 for each channel 403 in a given network, and the QPR modulator reads the superframes for its channel, digitally modulates the RF signal for the channel according to the contents of the superframes, and outputs the modulated signal to combiner 104, which combines the outputs from all QPR modulators and provides the combined output cable plant 105, which outputs it to cables 132 belonging to the network. The QPR modulators employ quadrature partial response modulation. Of course, any kind of digital RF frequency modulation could be employed as well. It should also be pointed out that any arrangement could be employed which relates a given RF modem 106 to a portion of the bandwidth of the network to which cable 132 belongs, rather than the <channel,pipe,LinkID> triple used in the preferred embodiment, and that the portion of the bandwidth that carries packets addressed to hosts 108 connected to a given RF modem 106 can be termed in a broad sense the RF modem's “channel”.
Following cable 132 to RF modem 106, RF modem 106 is connected between cable 132, a LAN 133 to which one or more hosts 108 are connected, and telephone line 131 and provides interfaces to cable 132, LAN 133, and telephone line 131.
Turning to the interfaces and beginning with the interface to cable 132, that interface has two main components, tuner 501 and decoder 503. Tuner 501 can be tuned under control of CPU 505 to a channel 403 (i) in cable 132. Tuner 501 further demodulates the superframes 405 it receives on that channel and passes them to decoder 503. Decoder 503 examines superpacket 407 (i) for the pipe which carries data addressed to RF modem 106, and if LinkID 413 in superpacket 407 (i) specifies RF modem 106, decoder 503 does error correction, decodes the data, and passes it to memory 507. When an IP packet has accumulated in memory 507, CPU 505 examines the destination IP address in the packet, and uses a routing table in memory 507 to determine whether the packet is addressed to a host 108 connected to RF modem 106. If the packet is so addressed, CPU 505 obtains the LAN address corresponding to the IP address. CPU 505 provides the LAN address and the location of the packet in memory 507 to Ethernet integrated circuit 515, which packages the packet into one or more Ethernet frames and outputs it to Ethernet 133.
RF modem may also receive IP packets via phone line 131 and modem chip 517 that are addressed either to the RF modem 106 itself or to one of the hosts 108 connected to RF modem 106. In the first case, RF modem 106 responds to the packet; in the second, it routes the packet to the host as just described for packets from cable 132. When RF modem 106 receives a packet via LAN 133 that is not addressed to RF modem 106 itself, it routes the packet via modem chip 517 and telephone line 131. Included in host 108 is the software 107 necessary to interact with RF modem 106.
Continuing with the portion of the link level that is implemented using the public switched telephone network, modem chip 517 in RF modem 106 is connected by means of a standard analog telephone line 131 to public switched telephone network 109, and RF modem 106 can thus call other telephone numbers via PSTN 109 and be called from other telephone numbers in PSTN 109. In the present case, when RF modem 106 wishes to set up a session that will permit it to transfer IP packets 301 for a host 108, it calls a telephone number for telephone modem pool 135. The modem pool responds by assigning a telephone modem (Tmodem) 110 to RF modem 106 and assigning RF modem 106 an IP address. As shown in
As will be explained in more detail in the following, the fact that PSTN 109 provides a bi-directional link between the devices connected to LAN 120 and RF modem 106 is employed to determine where RF modem 106 is in the cable network managed by head end 122, to dynamically assign a <channel,pipe,LinkID> triple in cable 132 to RF modem 106, and to provide an alternate route to hosts 108 connected to RF modem 106 when there is a failure in the RF link between head end 122 and RF modem 106.
The remaining device which is connected to LAN 120 is control/management server 125, which in a preferred embodiment is implemented in software executing on a server constructed by SUN Microsystems, Inc., Mountain View, Calif. Control/management sewer 125 manages CDN 100. It responds to DHCP packets by dynamically allocating IP addresses to hosts 108 and sending SNMP packets to router 101 and communication manager 102 which cause them to set their routing tables as required for the newly-assigned IP addresses, responds to SNMP trap packets from the devices connected to LAN 120 and from RF modems 106, responds to RIP packets as required to update routings, and maintains the Management Information Database used by the SNMP protocol as well as a list of unassigned IP addresses. A graphical user interface in control/management server 125 shows the current status of CDN 100 and permits operator intervention in the operation of cable data network 100.
The structure of an IP packet, IP address routing architecture and addressing architecture of CDN 100 are described in U.S. application Ser. Nos. 08/833,198, filed Apr. 14, 1997; 08/837,073, filed Apr. 11, 1997; U.S. Pat. No. 6,208,656, filed Apr. 11, 1997; U.S. Pat. No. 6,178,455, filed Apr. 11, 1997; U.S. application Ser. No. 08/838,833, filed Apr. 11, 1997; 08/832,714, filed Apr. 11, 1997 and U.S. Pat. No. 6,249,523 filed Apr. 11, 1997 and are incorporated herein by reference. These applications will be collectively referred to hereafter as the “incorporated applications.” In addition, details on IP addressing and the protocols of the TCP/IP protocol suite can be found in W. Richard Stevens, TCP/IP Illustrated: The Protocols, Addison-Wesley, 1994, which also is hereby incorporated by reference.
A problem in the design of networks that employ IP addresses is that the IP addresses are only 32 bits long. The maximum number of address is consequently 232 and the enormous growth of the Internet has resulted in a shortage of IP addresses. One of the techniques that cable data network 100 employs to reduce the number of IP address needed in cable data network 100 is the dynamic assignment of IP addresses to hosts 108 in network B and of the <channel,pipe,link ID> triples used to specify destinations of data in cable 132 to RF modems 106(j). By dynamic assignment is meant here that the IP addresses in a given subnetwork C and the <channel,pipe,link ID> triple listened to by RF modem 106(j) are assigned to RF modem 106(j) for the period of time that RF modem 106(j) is active. When RF modem 106(j) is not active, the IP addresses are available for assignment to other hosts 108 and the <channel,pipe,link ID> triple is available for assignment to another RF modem 106(k). Since only a small percentage of hosts 108 is active at a given time, dynamic assignment makes it possible to share a relatively small number of IP addresses and <channel,pipe,link ID> triples among a much larger number of users. It should be further noted here that the binding between a <channel,pipe,link ID> triple and the set of IP addresses is also dynamic, i.e., what IP addresses correspond to a given <channel,pipe,link ID> triple is decided only when the IP addresses and the <channel,pipe,link ID> triple are assigned.
A more detailed description of dynamic assignment of IP addresses can be found in the incorporated applications.
RF modem 106(i) must next obtain an IP address for host 108(j) and the <channel,pipe,Link ID> triple which it is to receive packets addressed to host 108(j)'s IP address on cable 132. To do this, it sends a DHCPOFFER IP packet 703 to modem pool 135. Included in the vendor-encapsulated options portion of the protocol are the IP address of RF modem 106(i) and a <frequency, streamID 405> pair which RF modem 106(i) obtains by listening to any frequency on cable 132. As explained earlier in the discussion of superframes 405, the <frequency,streamID> pair uniquely identifies which cable 132 RF modem 106(i) is connected to.
Modem pool 135 receives DHCPOFFER packet 703, adds modem pool 135's IP address to it, and broadcasts the packet on net A. DHCP server in Control/management server 125 responds to packet 705 and assigns IP addresses to the hosts 108 attached to RF modem 106 (j) and a <channel,pipe, link ID> triple to RF modem 106 as described above.
Next, control/management server 125 sends a DHCPOFFER packet 715 addressed to RF modem 106's IP address. This is routed to modem pool 135. The OFFER packet contains the following information:
Telephone modem pool 135 forwards the DHCP response packet to RF modem 106(i) (717) and RF modem 106(i) sets its tuner 501 to listen on the specified frequency and its decoder 503 to read superpackets on the specified pipe when they have the RF modem's link ID.
When RF modem 106(i) next receives a DHCPDISCOVER request from any of the IP hosts 108 attached to LAN 133, it responds with a DHCPOFFER packet that contains one of the IP addresses for the hosts that RF modem 106(i) received by the process described above.
In other embodiments, RF modem 106(i) may further respond to the DHCPOFFER packet 715 by sending an acknowledgment IP packet via PSTN 109 and modem pool 135 to communications manager 102 (719). Communications manager 102 responds to the acknowledgment by sending an acknowledgment 721 on the cable 132 at the frequency and pipe RF modem 106 (i) is listening to. The acknowledgment contains at least RF modem 106(i)'s LinkID. Once RF modem 106(i) receives the acknowledgment, it informs host 108(i) which began the transaction of its new IP address. Host 108(i) then replaces the dummy IP address with the new IP address.
The authorization and authentication process in accordance with the present invention will now be further described with reference again to
When a subscriber wishes to initiate a network session, modem 106 is powered up. Upon power up, the modem performs a set of self tests to verify the hardware. After a successful completion of the self tests, the modem is ready to receive commands from the network access software resident in the PC. The subscriber then launches the network access software which opens a logon dialog box on the PC screen requesting the subscriber's USERID, password and telephone number to dial in order to connect with modem pool 135. Ideally, the subscriber's USERID, password and telephone number will be stored in a configuration file associated with the network access software from an earlier session. Thus, when the logon dialog box is displayed, it may already have this information available for the subscriber to review and update if necessary.
The PC then sends the logon information (USERID, password and telephone number) to the cable modem. The modem then dials modem pool 135 over PSTN 109 and requests access using the USERID and password. Modem pool 135 forwards the access request to control and management component 111 which performs the actual authentication and replies to modem pool 135 with an “accept” or “reject” command. This command is then forwarded on to modem 106.
In the case of a “reject” the subscriber is not permitted further use of the system. In the case of an “accept”, a bidirectional control path is established between modem 106 and modem pool 135, thereby completing the first tier of the authorization and authentication process. At this stage, the subscriber may, depending on the type of service levels provided by the service provider, conduct, for example, an Internet session as is currently done in the prior art with a conventional modem and a conventional telephone connection.
In a full service operation, however, once the subscriber USERID and password are validated and an authorized telephone connection is established between modem 106 and modem pool 135, modem 106 sends to control and management component 111 its electronic serial number and a request for an allocation of system resources so that the modem can receive high data rate transmissions over cable plant 105. Control and management component 111 compares the serial number with a stored database of authorized serial numbers. Upon a match, the second tier of the authorization and authentication process is completed and appropriate system resources are allocated for modem 106 as described above.
It should be obvious from the above-discussed apparatus embodiment that numerous other variations and modifications of the apparatus of this invention are possible, and such will readily occur to those skilled in the art. Accordingly, the scope of this invention is not to be limited to the embodiment disclosed, but is to include any such embodiments as may be encompassed within the scope of the claims appended hereto.
This is a continuation of U.S. application Ser. No. 09/929,760, filed on Aug. 14, 2001, which is a continuation of U.S. application Ser. No. 08/835,916, filed Apr. 10, 1997, which claimed the benefit of U.S. Provisional Application No. 60/035,618, filed Jan. 17, 1997, all of which are incorporated by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
3985962 | Jones et al. | Oct 1976 | A |
4186380 | Bennett et al. | Jan 1980 | A |
4207431 | McVoy | Jun 1980 | A |
4361851 | Asip et al. | Nov 1982 | A |
4475123 | Dumbauld et al. | Oct 1984 | A |
4491983 | Pinnow et al. | Jan 1985 | A |
4528589 | Block et al. | Jul 1985 | A |
4536791 | Campbell et al. | Aug 1985 | A |
4577224 | Ost et al. | Mar 1986 | A |
4601028 | Huffman et al. | Jul 1986 | A |
4633462 | Stifle et al. | Dec 1986 | A |
4641304 | Raychaudhuri | Feb 1987 | A |
4672533 | Noble et al. | Jun 1987 | A |
4757460 | Bione et al. | Jul 1988 | A |
4771391 | Blasbalg et al. | Sep 1988 | A |
4804248 | Bhagavatula | Feb 1989 | A |
4823386 | Dumbauld et al. | Apr 1989 | A |
4858224 | Nakano et al. | Aug 1989 | A |
4907224 | Scoles et al. | Mar 1990 | A |
4912721 | Pidgeon et al. | Mar 1990 | A |
4980886 | Bernstein | Dec 1990 | A |
5012469 | Sardana | Apr 1991 | A |
5014125 | Pocock et al. | May 1991 | A |
5047928 | Wiedemer et al. | Sep 1991 | A |
5050213 | Shear et al. | Sep 1991 | A |
5113499 | Ankney et al. | May 1992 | A |
5131041 | Brunner et al. | Jul 1992 | A |
5136690 | Becker et al. | Aug 1992 | A |
5142690 | McMullan et al. | Aug 1992 | A |
5155590 | Beyers et al. | Oct 1992 | A |
5157657 | Potter | Oct 1992 | A |
5159592 | Perkins | Oct 1992 | A |
5166930 | Braff et al. | Nov 1992 | A |
5166931 | Riddle et al. | Nov 1992 | A |
5181107 | Rhoades et al. | Jan 1993 | A |
5185860 | Wu et al. | Feb 1993 | A |
5195092 | Wilson et al. | Mar 1993 | A |
5197094 | Tillery et al. | Mar 1993 | A |
5208665 | McCalley et al. | May 1993 | A |
5214390 | Montreuil | May 1993 | A |
5226120 | Brown et al. | Jul 1993 | A |
5235619 | Beyers et al. | Aug 1993 | A |
5239540 | Rovira et al. | Aug 1993 | A |
5251324 | McMullan et al. | Oct 1993 | A |
5261044 | Dev et al. | Nov 1993 | A |
5271041 | Montreuil | Dec 1993 | A |
5276789 | Besaw et al. | Jan 1994 | A |
5278833 | Crisler et al. | Jan 1994 | A |
5287351 | Wall, Jr. | Feb 1994 | A |
5295140 | Crisler et al. | Mar 1994 | A |
5295244 | Dev et al. | Mar 1994 | A |
5303234 | Kou et al. | Apr 1994 | A |
5327554 | Palazzi, III et al. | Jul 1994 | A |
5333183 | Herbert | Jul 1994 | A |
5347304 | Moura et al. | Sep 1994 | A |
5361259 | Hunt et al. | Nov 1994 | A |
5384777 | Ahmadi et al. | Jan 1995 | A |
5390181 | Campbell et al. | Feb 1995 | A |
5404505 | Levinson | Apr 1995 | A |
5423003 | Berteau et al. | Jun 1995 | A |
5423006 | Brown et al. | Jun 1995 | A |
5436909 | Dev et al. | Jul 1995 | A |
5440555 | Momona | Aug 1995 | A |
5471399 | Tanaka et al. | Nov 1995 | A |
5473599 | Li et al. | Dec 1995 | A |
5481542 | Logston et al. | Jan 1996 | A |
5483631 | Nagai et al. | Jan 1996 | A |
5504921 | Dev et al. | Apr 1996 | A |
5515361 | Li | May 1996 | A |
5515418 | Yamaguchi et al. | May 1996 | A |
5517488 | Miyazaki et al. | May 1996 | A |
5517502 | Bestler et al. | May 1996 | A |
5517618 | Wada et al. | May 1996 | A |
5521925 | Merakos et al. | May 1996 | A |
5533108 | Harris et al. | Jul 1996 | A |
5534913 | Majeti et al. | Jul 1996 | A |
5535206 | Bestler et al. | Jul 1996 | A |
5535403 | Li et al. | Jul 1996 | A |
5553095 | Engdahl et al. | Sep 1996 | A |
5553287 | Bailey et al. | Sep 1996 | A |
5572640 | Schettler et al. | Nov 1996 | A |
5586121 | Moura et al. | Dec 1996 | A |
5594798 | Cox et al. | Jan 1997 | A |
5604528 | Edwards et al. | Feb 1997 | A |
5608446 | Carr et al. | Mar 1997 | A |
5610910 | Focsaneanu et al. | Mar 1997 | A |
5612959 | Takase et al. | Mar 1997 | A |
5644706 | Ruigrok et al. | Jul 1997 | A |
5650994 | Daley et al. | Jul 1997 | A |
5654746 | McMullan et al. | Aug 1997 | A |
5671354 | Ito et al. | Sep 1997 | A |
5675732 | Majeti et al. | Oct 1997 | A |
5701465 | Baugher et al. | Dec 1997 | A |
5703795 | Mankovitz et al. | Dec 1997 | A |
5706277 | Klink et al. | Jan 1998 | A |
5708655 | Toth et al. | Jan 1998 | A |
5708961 | Hylton et al. | Jan 1998 | A |
5710884 | Dedrick et al. | Jan 1998 | A |
5712897 | Ortel et al. | Jan 1998 | A |
5720025 | Wilkes et al. | Feb 1998 | A |
5721780 | Ensor et al. | Feb 1998 | A |
5724492 | Matthews et al. | Mar 1998 | A |
5729682 | Marquis et al. | Mar 1998 | A |
5737311 | Wyld | Apr 1998 | A |
5737316 | Lee | Apr 1998 | A |
5751706 | Land et al. | May 1998 | A |
5751707 | Voit et al. | May 1998 | A |
5751971 | Dobbins et al. | May 1998 | A |
5761602 | Wagner et al. | Jun 1998 | A |
5768280 | Way et al. | Jun 1998 | A |
5790548 | Sistanizadeh et al. | Aug 1998 | A |
5790806 | Koperda | Aug 1998 | A |
5793753 | Hershey et al. | Aug 1998 | A |
5796718 | Caterisano et al. | Aug 1998 | A |
5799002 | Krishnan et al. | Aug 1998 | A |
5799016 | Onweller | Aug 1998 | A |
5805591 | Naboulsi et al. | Sep 1998 | A |
5805596 | Kranzler et al. | Sep 1998 | A |
5808671 | Maycock et al. | Sep 1998 | A |
5808886 | Suzuki et al. | Sep 1998 | A |
5812819 | Rodwin et al. | Sep 1998 | A |
5818845 | Moura et al. | Oct 1998 | A |
5818911 | Kawashima | Oct 1998 | A |
5822319 | Nagami et al. | Oct 1998 | A |
5828655 | Moura et al. | Oct 1998 | A |
5828666 | Focsaneanu et al. | Oct 1998 | A |
5835696 | Hess | Nov 1998 | A |
5835725 | Chiang et al. | Nov 1998 | A |
5841468 | Wright et al. | Nov 1998 | A |
5845091 | Dunne et al. | Dec 1998 | A |
5857075 | Chung | Jan 1999 | A |
5859852 | Moura et al. | Jan 1999 | A |
5881234 | Schwob et al. | Mar 1999 | A |
5881243 | Zaumen et al. | Mar 1999 | A |
5884024 | Lim et al. | Mar 1999 | A |
5884284 | Peters et al. | Mar 1999 | A |
5892812 | Pester, III | Apr 1999 | A |
5894479 | Mohammed et al. | Apr 1999 | A |
5898780 | Liu et al. | Apr 1999 | A |
5903572 | Wright et al. | May 1999 | A |
5905714 | Havansi et al. | May 1999 | A |
5905736 | Ronen et al. | May 1999 | A |
5940394 | Killian | Aug 1999 | A |
5956391 | Melen et al. | Sep 1999 | A |
5959972 | Hamami | Sep 1999 | A |
5966163 | Lin et al. | Oct 1999 | A |
5991308 | Fuhrmann et al. | Nov 1999 | A |
5999970 | Krisbergh et al. | Dec 1999 | A |
6018767 | Fijolek et al. | Jan 2000 | A |
6028860 | Laubach et al. | Feb 2000 | A |
6032266 | Ichinohe et al. | Feb 2000 | A |
6049826 | Beser et al. | Apr 2000 | A |
6052819 | Barker et al. | Apr 2000 | A |
6055224 | King et al. | Apr 2000 | A |
6058421 | Fijolek et al. | May 2000 | A |
6065049 | Beser et al. | May 2000 | A |
6070242 | Wong et al. | May 2000 | A |
6070246 | Beser | May 2000 | A |
6073178 | Wong et al. | Jun 2000 | A |
6101182 | Sistanizadeh et al. | Aug 2000 | A |
6101543 | Alden et al. | Aug 2000 | A |
6163272 | Goode et al. | Dec 2000 | A |
6178455 | Schutte et al. | Jan 2001 | B1 |
6208656 | Hrastar et al. | Mar 2001 | B1 |
6230203 | Koperda et al. | May 2001 | B1 |
6249523 | Hrastar et al. | Jun 2001 | B1 |
6272150 | Hrastar et al. | Aug 2001 | B1 |
6282208 | Bowcutt et al. | Aug 2001 | B1 |
6286058 | Hrastar et al. | Sep 2001 | B1 |
6295298 | Hrastar et al. | Sep 2001 | B1 |
6343322 | Nagami et al. | Jan 2002 | B2 |
6529590 | Centers | Mar 2003 | B1 |
Number | Date | Country |
---|---|---|
2716319 | Feb 1994 | FR |
Entry |
---|
U.S. Appl. No. 09/929,760, filed Aug. 14, 2001, Hrastar et al. |
U.S. Appl. No. 08/835,916, filed Apr. 10, 1997, Hrastar et al. |
U.S. Appl. No. 60/035,618, filed Jan. 17, 1997, Hrastar et al. |
Address Allocation for Private Intemets; Y. Rekhter, et al.; Network Working Group Request for Comments; 1996; pp. 1-9. |
The IP Network Address Translator (NAT); E. Egevang, et al.; Network Working Group Request for Comments; 1994; pp. 1-10. |
IP Network Address Translator (NAT) Terminology and Considerations; P. Srisuresh; et al.; Network Working Group Request for Comments; 1999; pp. 1-24. |
Load Sharing Using IP Network Address Translation (LSNAT); P. Srisuresh, et al.; Network Working Group Request for Comments; 1998; pp. 1-18. |
DNS Extensions to Network Address Translators (DNS—ALG); P. Srisuresh, et al.; Network Working Group Request for Comments; 1999; pp. 1-29. |
Security Model with Tunnel-Mode IPsec for NAT Domains; P. Srisuresh, et al.; Network Working Group Request for Comments; 1999, pp. 1-11. |
Network Address Translation—Protocol Translation (NAT-PT); G. Tsirtsis, et al.; Network Working Group Request for Comments; 2000; pp. 1-21. |
Stateless IP/ICMP Translation Algorithm (SIIT); E. Nordmark; Network Working Group Request for Comments; 2000; pp. 1-26. |
FTP Extensions for IPv.6 and .NATs; M. Allman, et a1.; Network Working Group Request for Comments; 1998; pp. 1-8. |
PPP Bridging Control Protocol (BCP); F. Baker et al.; Network Working Group Request for Comments, Jun. 1994; pp. 1-28. |
TCP/IP Illustrated, vol. 1—The Protocols; W. Richard Stevens; Addison-Wesley Longman, Inc.; Jan. 1999; Chapters 1, 2, 3, 4, 9, 10, 11, 16, 25. |
Data-Over-Cable Service Interface Specifications; Radio Frequency Interface Specification; SP-RFI-I04-980724; Cable Television Laboratories, Inc.; 1997; pp. 1-196. |
Data-Over Cable Service Interface Specifications; Cable Modem to Customer Premise Equipment Interface Specification; SP-CMCI-I02-980317; 1988; Cable Television Laboratories, Inc.; pp. 1-40. |
Data-Over Cable Service Interface Specifications; Cable Modem Telephony Return Interface Specification; SP-CMTRI-I01-970804; 1997; Cable Television Laboratories, Inc.; pp. 1-74. |
Data-Over Cable Service Interface Specifications; Radio Frequency Interface Specification; SPRFIv1.1-I01-990311; 1999; Cable Television Laboratories, Inc.; pp. 1-310. |
Data-Over Cable Technical Reports; Operations Support System Framework for Data Over Cable Services; TR-DOCS-OSSIW08-961016; 1996; MCNS Holdings, LP; pp. 1-20. |
Data-Over Cable Service Interface Specifications; Operations Support System Interface Specification; SP-OSSI-I02-990113; 1999; Cable Television Laboratories, Inc.; pp. 1-26. |
Data-Over Cable Service Interface Specifications; Operations Support System Interface Specification Radio Frequency Interface; SP-OSSI-RFI-I03-990113; 1999; Cable Television Laboratories, Inc.; pp. 1-29. |
Data-Over Cable Service Interface Specifications; Operations Support System Interface Specification Baseline Privacy Interface MIB; SP-OSSI-BPI-I0I-980331; 1998; pp. 1-33. |
Radio Frequency (RF) Interface Management Information Base for MCNS Compliant RF Interfaces draft-ietf-ipcdn-rf-interface-mib-04.txt; May 22, 1998; Guenter Roeck (editor); pp. 1-55. |
Cable Device Management Information Base for MCNS Complaint Cable Modems and Cable Modem Termination Systems draft-ietf-ipcdn-cable-device-mib-04.txt; May 22, 1998; Guenter Roeck (editor); pp. 1-32. |
Baseline Privacy Interface Management Information Base for MCNS Compliant Cable Modems and Cable Modem Termination Systems; R. Woundy; Jan. 17, 1999; pp. 1-35. |
Logical IP Subnetworks over IEEE 802.14 Services; Mark Laubach; Mar. 13, 1998; pp. 1-13. |
A Distribute Queueing Random Access Protocol for a Broadcast Channel; Wenxin Xu and Graham Campbell; Illinois Institute of Technology (Comp. Science Dept.); pp. 1-9. |
CBR Channels on a DQRAP-based HFC Network; Chien-Ting Wu, Graham Campbell; Illinois Institute of Technology (Comp. Science Dept); pp. 1-14. |
Interleaved DQRAP with Global TQ; Chien-Ting Wu, Graham Campbell; Illinois Institute of Technology (Comp. Science Dept.); pp. 1-27. |
The Extended DQRAP (XDQRAP) Algorithm; Chien-Ting Wu, Graham Campbell; Illinois Institute of Technology (Comp. Science Dept.); Dec. 9, 1994; pp. 1-4. |
Extended DQRAP (XDQRAP) A Cable TV Protocol Functioning as a Distributed Switch; Chien-Ting Wu & Graham Campbell; Illinois Institute of Technology (Comp. Science Dept.); pp. 1-7. |
A Review of Contention Resolution Algorithms for IEEE 802.14 Networks; Nada Glomie; Yves Saintillan, & David H. Su; National Institute of Standards and Technology; pp. 1-11. |
A Review of Contention Resolution Algorithms for IEEE 802.14 Networks; Nada Glomie, Yves Saintillan, & David H. Su; National Institute of Standards and Technology; pp. 1-12. |
On IEEE 802.14 Medium Access Control Protocol; Ying-Dar Lin; 1998; pp. 1-13. |
On IEEE 802.14 Medium Access Control Protocol; Ying-Dar Lin; 1998; pp. 1-11. |
On IEEE 802.14 Medium Access Control Protocol; Ying-Dar Lin; 1998; pp. 1-10. |
Hybrid-Fiber Coax; Hung Nguyen and Felix Yao; Apr. 22, 1996; pp. 1-11. |
Cable Data Modem Performance Evaluation, A Primer for Non-Technical Readers; Cable Television Laboratories, Inc.; Nov. 15, 1996; pp. 1-8. |
High Speed Cable Modems, Including IEEE 802.14 Standards; Albert A. Azzam; Chapters 5, 6. |
Cable Device Management Information Base for DOCSIS Compliant Cable Modems and Cable Modem Termination Systems; Michael St. Johns; Mar. 30, 1999; pp. 1-54. |
Radio Frequency (RF) Interfaces Management Information Base for MCNS/DOCSIS Compliant RF Interfaces; Mike St. Johns, (Editor); Feb. 17, 1999; pp. 1-67. |
Telephony-Return Interface (TRI) Management Information Base for DOCSIS-compliant Telephony-Return Cable Modems and Cable Modem Termination Systems; S. Adiraju, J. Fijolek; Apr. 2, 1999; pp. 1-27. |
Data Over Cable System Quality of Service Management Information Base (DOCSIS-QOS MIB); Mike Patrick; J. Harvey; Motorola ING; Jun. 25, 1999; pp. 1-43. |
Docsis 1.1 IGMP MIB; H. Abramson, Motorola; Jun. 1999; pp. 1-13. |
Publications and Technical Reports of Dolors Sala—Home Page; pp. 1-6. |
Scheduling Disciplines for HFC Systems: What can we learn from ATM scheduling?; Dolors Sala, John O. Limb; GA Tech; pp. 1-6. |
A Protocol for Efficient Transfer of Data over Fiber/Cable Systems; Dolors Sala, John O. Limb; GA Tech; pp. 1-8. |
MAC Protocols for Multimedia Data over HFC Architecture; Dolors Sala Batlle; Oct. 27, 1995; pp. 1-28. |
An Access Protocol to Support Multimedia Traffic Over Hybrid Fiber/Coax Systems; John O. Limb, Dolors Sala; pp. 1-6. |
Simulation of the Performance of XDQRAP under a Range of Conditions; John O. Limb, Dolors Sala, Jason Collins, David Hartman, Daniel Howard; pp. 1-10. |
Interleaved DQRAP with Global TQ; Chien-Ting Wu, Graham Campbell; Illinois Institute of Technology, CS Dept.; Jan. 8, 1995; pp. 1-26. |
Data Link Protocols; Uyless Black; Bell Atlantic Education Services; PTR Prentice Hall; New Jersey; 1993;pp. 141-159. |
ATM Foundation for Broadband Networks; vol. 1; Ed. 2; Uyless Black; Prentice Hall; NJ; 1999; pp. 260-299. |
The V Series Recommendations; Ed. 2; Uyless Black; McGraw-Hill, Inc.; 1995; pp. 169-184. |
Frame Relay Networks; Ed. 2; Uyless Black; McGraw-Hill, Inc.; 1996; pp. 159-176. |
ISDN; Ed. 3; Gary C. Kessler & Peter V. Southwick; McGraw-Hill, Inc.; 1997; pp. 111-128. |
ISDN & SS7: Architecture for Digital Signaling Networks; Uyless Black; Prentice Hall; NJ; 1997; pp. 31-47. |
ISDN and Broadband ISDN with Frame Relay and ATM; Ed. 4; William Stallings; Prentice Hall; NJ; 1999; pp. 181-343; pp. 312-343. |
Extended DQRAP (XDQRAP); Chien-Ting Wu; Graham Campbell; Illinois Institute of Technology (Comp. Sci. Dept.); Jan. 8, 1995; pp. 1-4. |
Dynamic Host Configuration Protocol; R. Droms; Network Working Group Request for Comments; 1993; pp. 1-39. |
Cisco Hot Standby Router Protocol (HSRP); T. Li, et al.; Network Working Group Request for Comments; 1998; pp. 1-17. |
Address Allocation for Private Internets; Y. Rekhter, et al.; Network Working Group Request for Comments; 1994; pp. 1-8. |
Network 10 Considered Harmful (Some Practices Shouldn't be Codified); E. Lear, et al; Network Working Group Request for Comments; 1994; pp. 1-8. |
Unique Addresses are Good; E. Gerich; Network Working Group Request for Comments; 1995; pp. 1-3. |
Number | Date | Country | |
---|---|---|---|
20080046951 A1 | Feb 2008 | US |
Number | Date | Country | |
---|---|---|---|
60035618 | Jan 1997 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09929760 | Aug 2001 | US |
Child | 11875437 | US | |
Parent | 08835916 | Apr 1997 | US |
Child | 09929760 | US |