WO2001060767A2 - System and method for combining data bandwidth requests by a dataprovider for transmission of data over an asynchronous communication medium - Google Patents

System and method for combining data bandwidth requests by a dataprovider for transmission of data over an asynchronous communication medium Download PDF

Info

Publication number
WO2001060767A2
WO2001060767A2 PCT/US2001/004820 US0104820W WO0160767A2 WO 2001060767 A2 WO2001060767 A2 WO 2001060767A2 US 0104820 W US0104820 W US 0104820W WO 0160767 A2 WO0160767 A2 WO 0160767A2
Authority
WO
WIPO (PCT)
Prior art keywords
bandwidth
data
requests
communication medium
asynchronous communication
Prior art date
Application number
PCT/US2001/004820
Other languages
French (fr)
Other versions
WO2001060767A3 (en
Inventor
Ajay Chandra V. Gummalla
Dolors Sala
Original Assignee
Broadcom Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Broadcom Corporation filed Critical Broadcom Corporation
Priority to DE60137115T priority Critical patent/DE60137115D1/en
Priority to EP01910717A priority patent/EP1257514B1/en
Priority to AU2001238298A priority patent/AU2001238298A1/en
Publication of WO2001060767A2 publication Critical patent/WO2001060767A2/en
Publication of WO2001060767A3 publication Critical patent/WO2001060767A3/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N7/00—Television systems
    • H04N7/16—Analogue secrecy systems; Analogue subscription systems
    • H04N7/173—Analogue secrecy systems; Analogue subscription systems with two-way working, e.g. subscriber sending a programme selection signal
    • H04N7/17309—Transmission or handling of upstream communications
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2801—Broadband local area networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2854—Wide area networks, e.g. public data networks
    • H04L12/2856—Access arrangements, e.g. Internet access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2854—Wide area networks, e.g. public data networks
    • H04L12/2856—Access arrangements, e.g. Internet access
    • H04L12/2858—Access network architectures
    • H04L12/2861—Point-to-multipoint connection from the data network to the subscribers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/2854—Wide area networks, e.g. public data networks
    • H04L12/2856—Access arrangements, e.g. Internet access
    • H04L12/2869—Operational details of access network equipments
    • H04L12/287—Remote access server, e.g. BRAS
    • H04L12/2872—Termination of subscriber connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/508—Network service management, e.g. ensuring proper service fulfilment according to agreements based on type of value added network service under agreement
    • H04L41/5087—Network service management, e.g. ensuring proper service fulfilment according to agreements based on type of value added network service under agreement wherein the managed service relates to voice services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/15—Flow control; Congestion control in relation to multipoint traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416—Real-time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
    • H04L47/2433—Allocation of priorities to traffic types
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/35—Flow control; Congestion control by embedding flow control information in regular packets, e.g. piggybacking
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/6215—Individual queue per QOS, rate or priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/622—Queue service order
    • H04L47/623—Weighted service order
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/78—Architectures of resource allocation
    • H04L47/788—Autonomous allocation of resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/801—Real time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/805—QOS or priority aware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/1066—Session management
    • H04L65/1101—Session protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/60—Network streaming of media packets
    • H04L65/70—Media network packetisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/80—Responding to QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40—Network security protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M7/00—Arrangements for interconnection between switching centres
    • H04M7/006—Networks other than PSTN/ISDN providing telephone service, e.g. Voice over Internet Protocol (VoIP), including next generation networks with a packet-switched transport layer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/238—Interfacing the downstream path of the transmission network, e.g. adapting the transmission rate of a video stream to network bandwidth; Processing of multiplex streams
    • H04N21/2385—Channel allocation; Bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/41—Structure of client; Structure of client peripherals
    • H04N21/426—Internal components of the client ; Characteristics thereof
    • H04N21/42676—Internal components of the client ; Characteristics thereof for modulating an analogue carrier signal to encode digital information or demodulating it to decode digital information, e.g. ADSL or cable modem
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/437—Interfacing the upstream path of the transmission network, e.g. for transmitting client requests to a VOD server
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/439—Processing of audio elementary streams
    • H04N21/4396—Processing of audio elementary streams by muting the audio signal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/442—Monitoring of processes or resources, e.g. detecting the failure of a recording device, monitoring the downstream bandwidth, the number of times a movie has been viewed, the storage space available from the internal hard disk
    • H04N21/44209—Monitoring of downstream path of the transmission network originating from a server, e.g. bandwidth variations of a wireless network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/47—End-user applications
    • H04N21/478—Supplemental services, e.g. displaying phone caller identification, shopping application
    • H04N21/4788—Supplemental services, e.g. displaying phone caller identification, shopping application communicating with other users, e.g. chatting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/61—Network physical structure; Signal processing
    • H04N21/6106—Network physical structure; Signal processing specially adapted to the downstream path of the transmission network
    • H04N21/6118—Network physical structure; Signal processing specially adapted to the downstream path of the transmission network involving cable transmission, e.g. using a cable modem
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/61—Network physical structure; Signal processing
    • H04N21/6156—Network physical structure; Signal processing specially adapted to the upstream path of the transmission network
    • H04N21/6168—Network physical structure; Signal processing specially adapted to the upstream path of the transmission network involving cable transmission, e.g. using a cable modem
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
    • H04N21/637—Control signals issued by the client directed to the server or network components
    • H04N21/6377—Control signals issued by the client directed to the server or network components directed to server
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
    • H04N21/647—Control signaling between network components and server or clients; Network processes for video distribution between server and clients, e.g. controlling the quality of the video stream, by dropping packets, protecting content from unauthorised alteration within the network, monitoring of network load, bridging between two different networks, e.g. between IP and wireless
    • H04N21/64707—Control signaling between network components and server or clients; Network processes for video distribution between server and clients, e.g. controlling the quality of the video stream, by dropping packets, protecting content from unauthorised alteration within the network, monitoring of network load, bridging between two different networks, e.g. between IP and wireless for transferring content from a first network to a second network, e.g. between IP and wireless
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
    • H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6481—Speech, voice
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6494—Silence suppression
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/08—Protocols for interworking; Protocol conversion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/22—Parsing or analysis of headers

Definitions

  • the present invention is generally related to increasing the efficiency of providing requested bandwidth to a data provider via asynchronous communication mediums.
  • Cable modems provide asynchronous communications on cable networks.
  • a user connects a cable modem to the TV outlet for his or her cable TV, and the cable TN operator connects a cable modem termination system ("CMTS") in the operator's headend.
  • CMTS cable modem termination system
  • the CMTS is a central device for connecting the cable network to a data network like the Internet.
  • the CMTS is a central distribution point for a cable system. Data flows "downstream" from the CMTS to the cable modem (i.e., downstream communication). Alternatively, data flows "upstream” from the cable modem to the CMTS (i.e., upstream communication).
  • a common cable modem standard today is the Data Over Cable Service
  • DOCSIS Interface Specification
  • DOCSIS defines technical specifications for both cable modems and CMTS.
  • DOCSIS downstream communication is quite restrictive in the way the control information is conveyed to the data provider (e.g., cable modem) via a DOCSIS CMTS scheduler. What is needed is to override the CMTS scheduler of DOCSIS and provide a CMTS scheduler that reduces the overhead of bandwidth grants via downstream communication by providing flexibility in the allocation of the bandwidth.
  • the present invention is a system and method for combining requests for bandwidth by a data provider for transmission of data over an asynchronous communication medium.
  • An embodiment of the method comprises the first step of receiving bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth.
  • the next step is storing each of the bandwidth requests in a data structure so as to maintain the order in which the bandwidth requests were received.
  • the third step is, based on the priority identifier and the order of each bandwidth request, scheduling each the bandwidth request in an order to be serviced.
  • the next step is combining each of the bandwidth requests having the same the data provider identifier into a data burst bandwidth.
  • the final step is granting the data burst bandwidth to the data provider over the asynchronous communication medium.
  • the first step involves receiving bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth.
  • the second step is combining, by data provider identifier and priority identifier, the amount of bandwidth required to represent a data burst bandwidth.
  • the fourth step is, based on one or more quality of service parameters (which varies from priority to priority), scheduling each the data burst bandwidth in an order to be serviced.
  • the final step involves granting the data burst bandwidth to the data provider over the asynchronous communication medium.
  • An embodiment of the system comprises a headend and a scheduler that are coupled together.
  • the scheduler receives bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth.
  • the scheduler then stores each of the bandwidth requests in a data structure so as to maintain the order in which the bandwidth requests were received.
  • the scheduler schedules each the bandwidth request in an order to be serviced based on the priority identifier and the order of each bandwidth request.
  • the scheduler combines each of the bandwidth requests having the same the data provider identifier into a data burst bandwidth.
  • the headend grants the data burst bandwidth to the data provider over the asynchronous communication medium.
  • Another embodiment of the system also includes a headend and a scheduler coupled together.
  • the scheduler receives bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth.
  • the scheduler then combines, by data provider identifier and priority identifier, the amount of bandwidth required to represent a data burst bandwidth.
  • the scheduler based on one or more quality of service parameters (which varies from priority to priority), schedules each the data burst bandwidth in an order to be serviced.
  • headend grants the data burst bandwidth to the data provider over the asynchronous communication medium.
  • FIG. 1 is a block diagram representing an example operating environment of the present invention according to an embodiment of the present invention.
  • FIG. 2 illustrates an example of granted bandwidth according to an embodiment of the present invention.
  • FIG. 3 is a high level flowchart that describes the process of combining bandwidth requests according to an embodiment of the present invention.
  • FIG. 4 describes in detail the step of combining bandwidth requests from the same data provider (e.g., cable modem 104) to create a data burst bandwidth
  • FIG. 5 illustrates multiple queues with example priority identifiers values according to an embodiment of the present invention.
  • FIG. 6 illustrates an example scheduling that is based on the example data structure shown in FIG. 5 according to another embodiment of the present invention.
  • FIG. 7 illustrates how the CMTS scheduler utilizes an example schedule shown in FIG. 6 to combine bandwidth requests from the same cable modem to create a single data burst bandwidth for each cable modem according to another embodiment of the present invention.
  • FIG. 8 describes in detail the step of combining bandwidth requests from the same data provider (e.g., cable modem 104) to create a data burst bandwidth
  • FIG. 9 illustrates a table used by the flowchart in FIG. 8 according to another embodiment of the present invention.
  • FIG. 10 illustrates an example computer used to implement the CMTS, the CMTS scheduler and the cable modem scheduler according to and embodiment of the present invention. DETAILED DESCRIPTION OF THE INVENTION
  • the present invention is described in terms of being utilized with a cable network. It should be understood that the present invention is not limited to use with a cable network. In fact, the present invention may be used with any communication medium, including but not limited to, the Internet, intranets, fiber optic networks, wireless networks and satellites.
  • Data in the present invention includes any type of information. This includes, but is not limited to, digital, voice, video, audio, etc.
  • FIG. 1 is a block diagram representing an example operating environment of the present invention. It should be understood that the example operating environment in FIG. 1 is shown for illustrative purposes only and does not limit the invention. Other implementations of the operating environment described herein will be apparent to persons skilled in the relevant art(s) based on the teachings contained herein, and the invention is directed to such other implementations.
  • CMTS 102 a CMTS 102, a cable modem 104, downstream communication 106 and upstream communication 108, are shown.
  • CMTS 102 further includes a CMTS scheduler 102 and a data structure 112.
  • Cable modem 104 includes a cable modem scheduler 1 16. Each of these components will be briefly described next.
  • cable modem 104 forwards or provides data via asynchronous communications on cable networks.
  • Cable modem 104 receives data from a user that needs to be transferred via a cable network. In order to do this, cable modem 104 requests that CMTS 102 grant to it the necessary bandwidth.
  • cable modem 104 receives data from a user to be transferred via a cable network.
  • Different types of data require different modes of transfer since the importance of timing is different with different types of data. For example, voice data cannot tolerate delays in its transfer. Alternatively, the type of data involved in web surfing can tolerate delays in its transfer.
  • Cable modem scheduler 116 is coupled to cable modem 104.
  • Cable modem scheduler 116 is described in detail in related non-provisional application, entitled “Method, System and Computer Program Product for Scheduling Upstream Communications", (Attorney Docket No. 1875.0440002), filed concurrently with the present invention (incorporated herein by reference in its entirety).
  • cable modem scheduler 116 is responsible for multiplexing the internal traffic, (i.e., requesting the necessary bandwidth that cable modem 116 needs to transfer its current types of data). Cable modem scheduler 116 must take into consideration the different priorities given to the current data to be transferred and to request bandwidth from CMTS 102 accordingly.
  • DOCSIS is a common cable modem standard used today.
  • DOCSIS provides standard centralized scheduling decisions that do not allow for flexibility in terms of deciding when cable modem 104 requests bandwidth from CMTS 102 in order to transfer its current data.
  • Cable modem scheduler 116 defines an architecture that overrules this DOCSIS standard in a seamless manner.
  • One main difference between the DOCSIS standard and cable modem scheduler 1 16 includes the decoupling of the request phase with the grant phase (i.e., grants of bandwidth received from CMTS 102).
  • cable modem scheduler 116 uses granted bandwidth as they are received regardless of their size and priority specification, thereby ignoring the DOCSIS standard.
  • Cable modem scheduler 116 ignores the priority id of the granted bandwidth. This means that cable modem scheduler 116 does not have to use the granted bandwidth in the same order in which it was requested.
  • piggyback requests may be separate requests for bandwidth instead of extended header as done in the DOCSIS standard.
  • piggyback requests are handled by the present invention in detail in related non-provisional application, entitled “Method, System and Computer Program Product for Scheduling Upstream Communications", (Attorney Docket No. 1875.0440002).
  • piggybacks requests are treated as separate requests for bandwidth and may or may not be given a priority identifier.
  • the present invention assigns voice data the highest priority, piggyback requests have the second highest priority and other types of data (including data required for web surfing) is given the lowest priority.
  • cable modem scheduler 116 sends bandwidth requests to
  • each bandwidth request may include three fields.
  • the three fields are a data provider identifier, a priority identifier, and the amount of required bandwidth.
  • the bandwidth request does not include the data provider identifier as a field.
  • the data provider identifier is implicit (e.g., piggyback requests).
  • Each cable modem 104 has a unique data provider identifier.
  • CMTS 102 uses this identifier to grant the requested bandwidth to cable modem 104.
  • Priority identifiers indicate the priority given to the data and thus indicating the type of data that will be transferred over the cable network via the granted bandwidth.
  • the last field is value indicating the amount of required bandwidth needed to transfer the data.
  • CMTS 102, CMTS scheduler 110 and data structure 112 will now be described.
  • CMTS 102 is a central device for connecting the cable network to a data network.
  • CMTS scheduler 102 is a bandwidth manager.
  • CMTS scheduler 102 decides how to grant available bandwidth according to the current bandwidth requests.
  • This grant is done via downstream communication 106 in such as way as to reduce overhead. This ability to decide how to grant available bandwidth provides flexibility. This flexibility allows the present invention to reduce the overhead involved in granting bandwidth to cable modem 104 via downstream communication.
  • Data structure 112 is used to organized the received bandwidth requests in such as way as to take into consideration the type of data (via the priority identifiers) and the order in which the requests were received.
  • CMTS scheduler 1 10 grants bandwidth to cable modem 104 so that to decrease overhead will be described in detail below.
  • the overhead in each granted bandwidth will be described next with reference to FIG. 2.
  • FIG. 2 illustrates an example of granted bandwidth 202.
  • granted bandwidth shows overhead 204 including a preamble, a guard band and a forward error correction ("FEC").
  • the preamble is a pattern of bits transmitted at the start of a frame used to implement transmitter and receiver synchronization.
  • the guard band is the time left vacant between adjacent transmissions to allow for detection certainty and clock synchronization inaccuracies in an asynchronous communication system.
  • the FEC is the process whereby additional bits are appended to a block of bits so that the receiver will be able to both detect and correct transmission errors.
  • Overhead 204 may be referred to as the physical layer overhead.
  • overhead 204 uses approximately the same amount of bytes.
  • the FEC is a variable size that depends on the amount of bandwidth. Therefore, the larger the granted bandwidth, the greater the efficiency. However, larger granted bandwidths mean greater end-to-end delay experienced by a voice call, for example. Thus, when granting bandwidth, end-to- end delay versus gained efficiency must be taken into consideration.
  • cable modem scheduler 116 may send different bandwidth requests to CMTS 102, including but not limited to, voice, piggyback and data for activities such as web surfing.
  • CMTS 102 may have more than one request for the same cable modem. This is especially true since cable modem scheduler 104 piggybacks requests as often as possible. These requests may have different priority identifiers values or the same priority identifier value for data that has arrived at CMTS 102 at different times.
  • a goal of the present invention is to combine all pending bandwidth requests from the same cable modem into one data burst bandwidth request.
  • the present invention reduces the physical over to one for all of the individual requests by combining them. This can be accomplished by the present invention partly because there is a decoupling of the request phase (i.e., bandwidth requests from cable modem 104) with the grant phase (i.e., grants of bandwidth received from CMTS 102), as mentioned above.
  • CMTS scheduler 110 needs to take into consideration end-to-end delay verses the gained efficiency.
  • FIG. 3 is a high level flowchart that describes the process of combining bandwidth requests according to an embodiment of the present invention.
  • control starts at step 302.
  • CMTS 102 receives one or more bandwidths requests from one or more cable modems 104 via upstream communication 108.
  • Control then passes to step 304.
  • CMTS scheduler 110 combines one or more bandwidths requests from the same cable modem 104 to create a single data burst bandwidth. Control then passes to step 306.
  • CMTS 102 grants the data burst bandwidth to the appropriate cable modem 104 via downstream communication 106.
  • the flowchart in FIG. 3 ends at this point.
  • two different embodiments of step 304 are described. The first embodiment is described with reference to FIGs. 4-6. Here, bandwidth requests are scheduled to be serviced based on priority identifiers (i.e., type of data) and the order in which the requests for bandwidth were received. The second embodiment of step 304 is described with reference to FIGs. 8 and 9. Here, bandwidth requests are scheduled to be serviced based on various quality of service parameters.
  • FIG. 4 describes in detail the step of combining bandwidth requests from the same data provider (e.g., cable modem 104) to create a data burst bandwidth (step 304 of FIG. 3) according to an embodiment of the present invention.
  • control starts at step 402.
  • CMTS scheduler 112 stores each bandwidth request in data structure 1 12.
  • data structure 1 12 is implemented as one or more queues and CMTS scheduler 112 is implements as a priority first come first serve scheduler.
  • Data structure 112 as implemented as one or more queues is shown in FIG. 5.
  • FIG. 5 illustrates multiple queues with priority identifiers values 1 through n.
  • Queue 502 stores the data request with the highest priority (i.e., 0).
  • Queue 508 stores the data with the lowest priority (i.e., n).
  • Queues 504 and 506 store data with priority values in between the highest and the lowest. In any event, each queue has its own priority value and all requests stored in any of the queues must have the same priority identifier values.
  • queue 502 currently stores three bandwidth requests, including requests 510-514.
  • Queue 504 stores two bandwidth request, including requests 516 and 518.
  • Neither queue 506 or queue 508 are currently storing any bandwidth request.
  • Each bandwidth request is indicated as (n,m), where n is the data provider identifier and m is the amount of required bandwidth.
  • each bandwidth request includes at least three fields, including the data provider identifier, the priority identifier, and the amount of required bandwidth.
  • bandwidth request 510 has a priority identifier value of 0, the cable modem 104 who sent the request has the data provider identifier of 1 and it is requesting 5 units of bandwidth.
  • bandwidth request 510 arrived at CMTS 102 before bandwidth request 512, which in turn arrived before bandwidth request 514, as indicated by their positions in queue 502. It is important to note that bandwidth request 516 may arrive at CMTS 102 before bandwidth request 514, but bandwidth request 514 is still likely to be granted bandwidth first due to it having a higher priority identifier.
  • the cable modem 104 that has the data provider value of 2 has two bandwidth requests, including requests 512 and 516. It is important to note that these two requests are for data that have different priority identifier values (e.g., requests for voice and piggyback). Control then passes to step 404.
  • CMTS scheduler 110 schedules each bandwidth request stored in data structure 1 12 in an order to be serviced by the present invention.
  • bandwidth requests are scheduled to be serviced based on priority identifiers (i.e., type of data) and the order in which the requests for bandwidth were received.
  • priority identifiers i.e., type of data
  • FIG. 6 An example scheduling that is based on the example data structure shown in FIG. 5 is shown in FIG. 6 as schedule 602. In schedule 602, request 510 is scheduled first, request 512 is scheduled second, and so forth. Control then passes to step 406.
  • CMTS scheduler 110 utilizes schedule 602 to combine bandwidth requests from the same cable modem 104 to create a single data burst bandwidth for each cable modem 104 (i.e., data provider identifier). This is illustrated in FIG. 7.
  • data burst bandwidth 702 is created by combining bandwidth requests 510 and 514.
  • Data burst bandwidth 704 is created by combining bandwidth requests 512 and 516.
  • data burst bandwidth 706 is identical to bandwidth request 518. It is important to note that the conversion between storage units may alter the units of storage required. For example, this account for why data burst bandwidth 702 is (1,6) and not (1,7). This is for illustration purposes only and is not meant to limit the present invention.
  • step 304 The second embodiment of step 304 will now be described with reference to FIGs. 8 and 9.
  • bandwidth requests in this embodiment are scheduled to be serviced based on various quality of service parameters.
  • FIG. 8 describes in detail the step of combining bandwidth requests from the same data provider (e.g., cable modem 104) to create a data burst bandwidth (step 304 of FIG. 3) according to another embodiment of the present invention.
  • control starts at step 802.
  • CMTS scheduler 112 combines or accumulates the sum of the units of bandwidth requested per priority identifier and data provider identifier. This sum represents what will be required to represent the data burst bandwidths.
  • the accumulation of units of bandwidth requested is illustrated in FIG. 9.
  • a table 902 is shown.
  • the columns of table 902 represent the priority identifier (i.e., type of data in the request).
  • the rows of table 902 represent the data provider identifiers.
  • the cells of table 902 represent the accumulation of units of requested bandwidth by priority identifier and data provider identifier.
  • an accumulation 904 (with the value 7) is calculated by bandwidth request 510 and bandwidth request 514 (requesting 5 and 2 units of bandwidth, respectively). Control then passes to step 804.
  • CMTS scheduler 110 schedules each data burst bandwidth based on quality of service parameters.
  • Quality of service parameters include efficiency of transmission and transfer delay tolerance.
  • different types of data require different modes of transfer since the importance of timing is different with different types of data. For example, voice data cannot tolerate delays in its transfer. Alternatively, the type of data involved in web surfing can tolerate delays in its transfer.
  • the priority identifier specified in the request is not significantly important since the cable modem scheduler does not use it 104 when transferring data via the bandwidth.
  • the present invention may specify that the priority identifier of the data burst bandwidth gets the lowest priority that contributes to the accumulated sum.
  • this embodiment may choice to incorporate scheduling, as shown in FIG. 6 above, and the combination of bandwidth requests, as shown in FIG. 7 above. At this point, data burst bandwidths are ready to be granted to their appropriate cable modems as accomplished in step 306 (FIG. 3).
  • the flowchart in FIG. 8 ends at this point.
  • CMTS 102, CMTS scheduler 110 and cable modem scheduler 116 may be implemented using computer 1000 as shown in FIG. 10. Obviously, more than one of these functional components could be implemented on a single computer 1000.
  • the present invention may be implemented using hardware, software or a combination thereof and may be implemented in a computer system or other processing system. In fact, in one embodiment, the invention is directed toward one or more computer systems capable of carrying out the functionality described herein.
  • the computer system 1000 includes one or more processors, such as processor 1004.
  • the processor 1004 is connected to a communication bus 1006.
  • Various software embodiments are described in terms of this example computer system. After reading this description, it will become apparent to a person skilled in the relevant art how to implement the invention using other computer systems and/or computer architectures.
  • Computer system 1000 also includes a main memory 1008, preferably random access memory (RAM), and can also include a secondary memory 1010.
  • the secondary memory 1010 can include, for example, a hard disk drive 1012 and/or a removable storage drive 1014, representing a floppy disk drive, a magnetic tape drive, an optical disk drive, etc.
  • the removable storage drive 1014 reads from and/or writes to a removable storage unit 1018 in a well known manner.
  • Removable storage unit 1018 represents a floppy disk, magnetic tape, optical disk, etc. which is read by and written to by removable storage drive 1014.
  • the removable storage unit 1018 includes a computer usable storage medium having stored therein computer software and/or data.
  • secondary memory 1010 may include other similar means for allowing computer programs or other instructions to be loaded into computer system 1000.
  • Such means can include, for example, a removable storage unit 1022 and an interface 1020. Examples of such can include a program cartridge and cartridge interface (such as that found in video game devices), a removable memory chip (such as an EPROM, or PROM) and associated socket, and other removable storage units 1022 and interfaces 1020 which allow software and data to be transferred from the removable storage unit 1018 to computer system 1000.
  • Computer system 1000 can also include a communications interface 1024.
  • Communications interface 1024 allows software and data to be transferred between computer system 1000 and external devices.
  • Examples of communications interface 1024 can include a modem, a network interface (such as an Ethernet card), a communications port, a PCMCIA slot and card, etc.
  • Software and data transferred via communications interface 1024 are in the form of signals which can be electronic, electromagnetic, optical or other signals capable of being received by communications interface 1024.
  • These signals 1026 are provided to communications interface via a channel 1028.
  • This channel 1028 carries signals 1026 and can be implemented using wire or cable, fiber optics, a phone line, a cellular phone link, an RF link and other communications channels.
  • computer program medium and “computer usable medium” are used to generally refer to media such as removable storage device 1018, a hard disk installed in hard disk drive 1012, and signals 1026. These computer program products are means for providing software to computer system 1000.
  • Computer programs are stored in main memory and/or secondary memory 1010. Computer programs can also be received via communications interface 1024. Such computer programs, when executed, enable the computer system 1000 to perform the features of the present invention as discussed herein. In particular, the computer programs, when executed, enable the processor 1004 to perform the features of the present invention. Accordingly, such computer programs represent controllers of the computer system 1000.
  • the software may be stored in a computer program product and loaded into computer system 1000 using removable storage drive 1014, hard drive 1012 or communications interface 1024.
  • the control logic (software), when executed by the processor 1004, causes the processor 1004 to perform the functions of the invention as described herein.
  • the invention is implemented primarily in hardware using, for example, hardware components such as application specific integrated circuits (ASICs). Implementation of the hardware state machine so as to perform the functions described herein will be apparent to persons skilled in the relevant art(s).
  • the invention is implemented using a combination of both hardware and software.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Multimedia (AREA)
  • Computer Security & Cryptography (AREA)
  • General Business, Economics & Management (AREA)
  • Databases & Information Systems (AREA)
  • Business, Economics & Management (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Communication Control (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Time-Division Multiplex Systems (AREA)
  • Transmitters (AREA)
  • Machine Translation (AREA)
  • Devices For Executing Special Programs (AREA)

Abstract

A method and system for combining requests for data bandwidth by a data provider for transmission of data over an asynchronous communication medium is provided. A headend receives one or more bandwidths requests from one or more cable modems via upstream communication. A scheduler then combines one or more bandwidths requests from the same cable modem to create a single data burst bandwidth. The headend then grants the data burst bandwidth to the appropriate cable modem via downstream communication.

Description

SYSTEM AND METHOD FOR COMBINING REQUESTS FOR DATA
BANDWIDTH BY A DATA PROVIDER FOR TRANSMISSION OF DATA
ONER AN ASYNCHRONOUS COMMUNICATION MEDIUM
BACKGROUND OF THE INVENTION
Field of the Invention
[0001] The present invention is generally related to increasing the efficiency of providing requested bandwidth to a data provider via asynchronous communication mediums.
Background Art
[0002] The importance to the modern economy of rapid data access and exchange cannot be overstated. This explains the exponentially increasing popularity of the data access and exchange via cable networks (including coaxial cable or Hybrid fiber coaxial cable), the Internet, intranets, wireless networks, satellites and so forth (i.e., communication mediums). Rapid data access and exchange is partly dependent upon how efficiently bandwidth is allocated to a data provider in order for the data provider to transfer the requested data to a user via one of the communication mediums mentioned above.
[0003] One very desirable solution for rapid data access and exchange is via cable networks and cable modems. Cable modems provide asynchronous communications on cable networks. In general, a user connects a cable modem to the TV outlet for his or her cable TV, and the cable TN operator connects a cable modem termination system ("CMTS") in the operator's headend. The CMTS is a central device for connecting the cable network to a data network like the Internet. The CMTS is a central distribution point for a cable system. Data flows "downstream" from the CMTS to the cable modem (i.e., downstream communication). Alternatively, data flows "upstream" from the cable modem to the CMTS (i.e., upstream communication). [0004] A common cable modem standard today is the Data Over Cable Service
Interface Specification ("DOCSIS"). DOCSIS defines technical specifications for both cable modems and CMTS. DOCSIS downstream communication is quite restrictive in the way the control information is conveyed to the data provider (e.g., cable modem) via a DOCSIS CMTS scheduler. What is needed is to override the CMTS scheduler of DOCSIS and provide a CMTS scheduler that reduces the overhead of bandwidth grants via downstream communication by providing flexibility in the allocation of the bandwidth.
BRIEF SUMMARY OF THE INVENTION
[0005] The present invention is a system and method for combining requests for bandwidth by a data provider for transmission of data over an asynchronous communication medium. An embodiment of the method comprises the first step of receiving bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth. The next step is storing each of the bandwidth requests in a data structure so as to maintain the order in which the bandwidth requests were received. The third step is, based on the priority identifier and the order of each bandwidth request, scheduling each the bandwidth request in an order to be serviced. The next step is combining each of the bandwidth requests having the same the data provider identifier into a data burst bandwidth. The final step is granting the data burst bandwidth to the data provider over the asynchronous communication medium.
[0006] In another embodiment of the method of the present invention, the first step involves receiving bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth. The second step is combining, by data provider identifier and priority identifier, the amount of bandwidth required to represent a data burst bandwidth. The fourth step is, based on one or more quality of service parameters (which varies from priority to priority), scheduling each the data burst bandwidth in an order to be serviced. The final step involves granting the data burst bandwidth to the data provider over the asynchronous communication medium.
[0007] An embodiment of the system comprises a headend and a scheduler that are coupled together. The scheduler receives bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth. The scheduler then stores each of the bandwidth requests in a data structure so as to maintain the order in which the bandwidth requests were received. Then the scheduler schedules each the bandwidth request in an order to be serviced based on the priority identifier and the order of each bandwidth request. Next, the scheduler combines each of the bandwidth requests having the same the data provider identifier into a data burst bandwidth. Finally, the headend grants the data burst bandwidth to the data provider over the asynchronous communication medium.
[0008] Another embodiment of the system also includes a headend and a scheduler coupled together. Here, the scheduler receives bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth. The scheduler then combines, by data provider identifier and priority identifier, the amount of bandwidth required to represent a data burst bandwidth. The scheduler, based on one or more quality of service parameters (which varies from priority to priority), schedules each the data burst bandwidth in an order to be serviced. Finally, headend grants the data burst bandwidth to the data provider over the asynchronous communication medium.
BRIEF DESCRIPTION OF THE DRAWINGS/FIGURES
[0009] The present invention will be described with reference to the accompanying drawings, wherein: [0010] FIG. 1 is a block diagram representing an example operating environment of the present invention according to an embodiment of the present invention. [0011] FIG. 2 illustrates an example of granted bandwidth according to an embodiment of the present invention. [0012] FIG. 3 is a high level flowchart that describes the process of combining bandwidth requests according to an embodiment of the present invention. [0013] FIG. 4 describes in detail the step of combining bandwidth requests from the same data provider (e.g., cable modem 104) to create a data burst bandwidth
(step 304 of FIG. 3) according to an embodiment of the present invention. [0014] FIG. 5 illustrates multiple queues with example priority identifiers values according to an embodiment of the present invention. [0015] FIG. 6 illustrates an example scheduling that is based on the example data structure shown in FIG. 5 according to another embodiment of the present invention. [0016] FIG. 7 illustrates how the CMTS scheduler utilizes an example schedule shown in FIG. 6 to combine bandwidth requests from the same cable modem to create a single data burst bandwidth for each cable modem according to another embodiment of the present invention. [0017] FIG. 8 describes in detail the step of combining bandwidth requests from the same data provider (e.g., cable modem 104) to create a data burst bandwidth
(step 304 of FIG. 3) according to another embodiment of the present invention. [0018] FIG. 9 illustrates a table used by the flowchart in FIG. 8 according to another embodiment of the present invention. [0019] FIG. 10 illustrates an example computer used to implement the CMTS, the CMTS scheduler and the cable modem scheduler according to and embodiment of the present invention. DETAILED DESCRIPTION OF THE INVENTION
A. Overview of the Invention
[0020] For illustration purposes, the present invention is described in terms of being utilized with a cable network. It should be understood that the present invention is not limited to use with a cable network. In fact, the present invention may be used with any communication medium, including but not limited to, the Internet, intranets, fiber optic networks, wireless networks and satellites.
[0021] Data in the present invention includes any type of information. This includes, but is not limited to, digital, voice, video, audio, etc.
B. System Architecture Overview
[0022] FIG. 1 is a block diagram representing an example operating environment of the present invention. It should be understood that the example operating environment in FIG. 1 is shown for illustrative purposes only and does not limit the invention. Other implementations of the operating environment described herein will be apparent to persons skilled in the relevant art(s) based on the teachings contained herein, and the invention is directed to such other implementations. Referring to FIG. 1, a CMTS 102, a cable modem 104, downstream communication 106 and upstream communication 108, are shown. CMTS 102 further includes a CMTS scheduler 102 and a data structure 112. Cable modem 104 includes a cable modem scheduler 1 16. Each of these components will be briefly described next.
[0023] In general, cable modem 104 forwards or provides data via asynchronous communications on cable networks. Cable modem 104 receives data from a user that needs to be transferred via a cable network. In order to do this, cable modem 104 requests that CMTS 102 grant to it the necessary bandwidth. [0024] As mentioned, cable modem 104 receives data from a user to be transferred via a cable network. Different types of data require different modes of transfer since the importance of timing is different with different types of data. For example, voice data cannot tolerate delays in its transfer. Alternatively, the type of data involved in web surfing can tolerate delays in its transfer.
[0025] In order to ensure the importance of timing is maintained, cable modem
104 assigns different priority identifiers to different types of data. The higher the priority a data has, the less of a delay that type of data will experience in its transfer via the cable network. Thus, voice data would be assigned a priority identifier with a higher priority than data involved in web surfing.
[0026] Cable modem scheduler 116 is coupled to cable modem 104. Cable modem scheduler 116 is described in detail in related non-provisional application, entitled "Method, System and Computer Program Product for Scheduling Upstream Communications", (Attorney Docket No. 1875.0440002), filed concurrently with the present invention (incorporated herein by reference in its entirety). In general, cable modem scheduler 116 is responsible for multiplexing the internal traffic, (i.e., requesting the necessary bandwidth that cable modem 116 needs to transfer its current types of data). Cable modem scheduler 116 must take into consideration the different priorities given to the current data to be transferred and to request bandwidth from CMTS 102 accordingly.
[0027] As stated above, DOCSIS is a common cable modem standard used today.
DOCSIS provides standard centralized scheduling decisions that do not allow for flexibility in terms of deciding when cable modem 104 requests bandwidth from CMTS 102 in order to transfer its current data. Cable modem scheduler 116 defines an architecture that overrules this DOCSIS standard in a seamless manner. Some of the main differences between the DOCSIS standard and cable modem scheduler 116 are described next.
[0028] One main difference between the DOCSIS standard and cable modem scheduler 1 16 includes the decoupling of the request phase with the grant phase (i.e., grants of bandwidth received from CMTS 102). Here, cable modem scheduler 116 uses granted bandwidth as they are received regardless of their size and priority specification, thereby ignoring the DOCSIS standard. Cable modem scheduler 116 ignores the priority id of the granted bandwidth. This means that cable modem scheduler 116 does not have to use the granted bandwidth in the same order in which it was requested. In addition, piggyback requests may be separate requests for bandwidth instead of extended header as done in the DOCSIS standard. How piggyback requests are handled by the present invention are described in detail in related non-provisional application, entitled "Method, System and Computer Program Product for Scheduling Upstream Communications", (Attorney Docket No. 1875.0440002). Here, it is important to note that piggybacks requests are treated as separate requests for bandwidth and may or may not be given a priority identifier. In an embodiment, the present invention assigns voice data the highest priority, piggyback requests have the second highest priority and other types of data (including data required for web surfing) is given the lowest priority.
[0029] Therefore, cable modem scheduler 116 sends bandwidth requests to
CMTS 102 via upstream communication 108. At a high level, each bandwidth request may include three fields. The three fields are a data provider identifier, a priority identifier, and the amount of required bandwidth. In an embodiment of the present invention, the bandwidth request does not include the data provider identifier as a field. Here, the data provider identifier is implicit (e.g., piggyback requests). These three fields will be briefly described next.
[0030] Each cable modem 104 has a unique data provider identifier. CMTS 102 uses this identifier to grant the requested bandwidth to cable modem 104. Priority identifiers indicate the priority given to the data and thus indicating the type of data that will be transferred over the cable network via the granted bandwidth. Finally, the last field is value indicating the amount of required bandwidth needed to transfer the data. CMTS 102, CMTS scheduler 110 and data structure 112 will now be described. [0031] CMTS 102 is a central device for connecting the cable network to a data network. CMTS scheduler 102 is a bandwidth manager. CMTS scheduler 102, as a bandwidth manager, decides how to grant available bandwidth according to the current bandwidth requests. This grant is done via downstream communication 106 in such as way as to reduce overhead. This ability to decide how to grant available bandwidth provides flexibility. This flexibility allows the present invention to reduce the overhead involved in granting bandwidth to cable modem 104 via downstream communication. Data structure 112 is used to organized the received bandwidth requests in such as way as to take into consideration the type of data (via the priority identifiers) and the order in which the requests were received.
[0032] As described above, the way in which the DOCSIS CMTS scheduler grants bandwidth is quite restrictive, thus creating unnecessary overhead in downstream communication. The details of how CMTS scheduler 1 10 grants bandwidth to cable modem 104 so that to decrease overhead will be described in detail below. The overhead in each granted bandwidth will be described next with reference to FIG. 2.
C. Granted Bandwidth Overhead
[0033] FIG. 2 illustrates an example of granted bandwidth 202. As shown, granted bandwidth shows overhead 204 including a preamble, a guard band and a forward error correction ("FEC"). The preamble is a pattern of bits transmitted at the start of a frame used to implement transmitter and receiver synchronization. The guard band is the time left vacant between adjacent transmissions to allow for detection certainty and clock synchronization inaccuracies in an asynchronous communication system. The FEC is the process whereby additional bits are appended to a block of bits so that the receiver will be able to both detect and correct transmission errors. [0034] Overhead 204 may be referred to as the physical layer overhead.
Regardless of the size of granted bandwidth 202, overhead 204 uses approximately the same amount of bytes. Where the preamble and guard band are typically fixed in size, the FEC is a variable size that depends on the amount of bandwidth. Therefore, the larger the granted bandwidth, the greater the efficiency. However, larger granted bandwidths mean greater end-to-end delay experienced by a voice call, for example. Thus, when granting bandwidth, end-to- end delay versus gained efficiency must be taken into consideration.
[0035] Different systems may reserve different amount of bytes for overhead
204. How the present invention combines bandwidth requests from the same cable modem 104 to create a single data burst bandwidth is described next.
D. Combination of Bandwidth Grants
[0036] As mentioned above, cable modem scheduler 116 may send different bandwidth requests to CMTS 102, including but not limited to, voice, piggyback and data for activities such as web surfing. Thus, at any given time, CMTS 102 may have more than one request for the same cable modem. This is especially true since cable modem scheduler 104 piggybacks requests as often as possible. These requests may have different priority identifiers values or the same priority identifier value for data that has arrived at CMTS 102 at different times.
[0037] A goal of the present invention is to combine all pending bandwidth requests from the same cable modem into one data burst bandwidth request. Here, instead of individual requests being granted which would require physical overhead for each grant, the present invention reduces the physical over to one for all of the individual requests by combining them. This can be accomplished by the present invention partly because there is a decoupling of the request phase (i.e., bandwidth requests from cable modem 104) with the grant phase (i.e., grants of bandwidth received from CMTS 102), as mentioned above. CMTS scheduler 110 needs to take into consideration end-to-end delay verses the gained efficiency. FIG. 3 is a high level flowchart that describes the process of combining bandwidth requests according to an embodiment of the present invention.
[0038] In FIG. 3, control starts at step 302. In step 302, CMTS 102 receives one or more bandwidths requests from one or more cable modems 104 via upstream communication 108. Control then passes to step 304.
[0039] In step 304, CMTS scheduler 110 combines one or more bandwidths requests from the same cable modem 104 to create a single data burst bandwidth. Control then passes to step 306.
[0040] In step 306, CMTS 102 grants the data burst bandwidth to the appropriate cable modem 104 via downstream communication 106. The flowchart in FIG. 3 ends at this point. Next, two different embodiments of step 304 are described. The first embodiment is described with reference to FIGs. 4-6. Here, bandwidth requests are scheduled to be serviced based on priority identifiers (i.e., type of data) and the order in which the requests for bandwidth were received. The second embodiment of step 304 is described with reference to FIGs. 8 and 9. Here, bandwidth requests are scheduled to be serviced based on various quality of service parameters.
[0041] FIG. 4 describes in detail the step of combining bandwidth requests from the same data provider (e.g., cable modem 104) to create a data burst bandwidth (step 304 of FIG. 3) according to an embodiment of the present invention. In FIG. 4, control starts at step 402. In step 402, as CMTS 102 receives bandwidth requests from one or more cable modems 104, CMTS scheduler 112 stores each bandwidth request in data structure 1 12. In an embodiment of the present invention, data structure 1 12 is implemented as one or more queues and CMTS scheduler 112 is implements as a priority first come first serve scheduler. Data structure 112 as implemented as one or more queues is shown in FIG. 5.
[0042] FIG. 5 illustrates multiple queues with priority identifiers values 1 through n. Queue 502 stores the data request with the highest priority (i.e., 0). Queue 508 stores the data with the lowest priority (i.e., n). Queues 504 and 506 store data with priority values in between the highest and the lowest. In any event, each queue has its own priority value and all requests stored in any of the queues must have the same priority identifier values.
[0043] As illustrated in FIG. 5, queue 502 currently stores three bandwidth requests, including requests 510-514. Queue 504 stores two bandwidth request, including requests 516 and 518. Neither queue 506 or queue 508 are currently storing any bandwidth request.
[0044] Each bandwidth request is indicated as (n,m), where n is the data provider identifier and m is the amount of required bandwidth. As described above, each bandwidth request includes at least three fields, including the data provider identifier, the priority identifier, and the amount of required bandwidth. For example, bandwidth request 510 has a priority identifier value of 0, the cable modem 104 who sent the request has the data provider identifier of 1 and it is requesting 5 units of bandwidth. In addition, bandwidth request 510 arrived at CMTS 102 before bandwidth request 512, which in turn arrived before bandwidth request 514, as indicated by their positions in queue 502. It is important to note that bandwidth request 516 may arrive at CMTS 102 before bandwidth request 514, but bandwidth request 514 is still likely to be granted bandwidth first due to it having a higher priority identifier.
[0045] Also illustrated by FIG. 5 is that the cable modem 104 that has the data provider value of 2 has two bandwidth requests, including requests 512 and 516. It is important to note that these two requests are for data that have different priority identifier values (e.g., requests for voice and piggyback). Control then passes to step 404.
[0046] In step 404, CMTS scheduler 110 schedules each bandwidth request stored in data structure 1 12 in an order to be serviced by the present invention. Here, bandwidth requests are scheduled to be serviced based on priority identifiers (i.e., type of data) and the order in which the requests for bandwidth were received. An example scheduling that is based on the example data structure shown in FIG. 5 is shown in FIG. 6 as schedule 602. In schedule 602, request 510 is scheduled first, request 512 is scheduled second, and so forth. Control then passes to step 406.
[0047] In step 406, CMTS scheduler 110 utilizes schedule 602 to combine bandwidth requests from the same cable modem 104 to create a single data burst bandwidth for each cable modem 104 (i.e., data provider identifier). This is illustrated in FIG. 7. In FIG. 7, data burst bandwidth 702 is created by combining bandwidth requests 510 and 514. Data burst bandwidth 704 is created by combining bandwidth requests 512 and 516. Finally, data burst bandwidth 706 is identical to bandwidth request 518. It is important to note that the conversion between storage units may alter the units of storage required. For example, this account for why data burst bandwidth 702 is (1,6) and not (1,7). This is for illustration purposes only and is not meant to limit the present invention.
[0048] At this point, data burst bandwidths 702-706 are ready to be granted to their appropriate cable modems as accomplished in step 306 (FIG. 3). The flowchart in FIG. 4 ends at this point. The second embodiment of step 304 will now be described with reference to FIGs. 8 and 9.
[0049] As mentioned above, bandwidth requests in this embodiment are scheduled to be serviced based on various quality of service parameters.
[0050] FIG. 8 describes in detail the step of combining bandwidth requests from the same data provider (e.g., cable modem 104) to create a data burst bandwidth (step 304 of FIG. 3) according to another embodiment of the present invention. In FIG. 8, control starts at step 802. In step 802, as CMTS 102 receives bandwidth requests from one or more cable modems 104, CMTS scheduler 112 combines or accumulates the sum of the units of bandwidth requested per priority identifier and data provider identifier. This sum represents what will be required to represent the data burst bandwidths. The accumulation of units of bandwidth requested is illustrated in FIG. 9.
[0051] In FIG. 9, a table 902 is shown. The columns of table 902 represent the priority identifier (i.e., type of data in the request). The rows of table 902 represent the data provider identifiers. The cells of table 902 represent the accumulation of units of requested bandwidth by priority identifier and data provider identifier. For illustration purposes, it is assumed that the same bandwidth requests are received by CMTS 102 as received and explained with reference to FIG. 5 above. Therefore, an accumulation 904 (with the value 7) is calculated by bandwidth request 510 and bandwidth request 514 (requesting 5 and 2 units of bandwidth, respectively). Control then passes to step 804.
[0052] In step 804, CMTS scheduler 110 schedules each data burst bandwidth based on quality of service parameters. Quality of service parameters include efficiency of transmission and transfer delay tolerance. As stated above, different types of data require different modes of transfer since the importance of timing is different with different types of data. For example, voice data cannot tolerate delays in its transfer. Alternatively, the type of data involved in web surfing can tolerate delays in its transfer.
[0053] The priority identifier specified in the request is not significantly important since the cable modem scheduler does not use it 104 when transferring data via the bandwidth. For consistency in all cases is desired, the present invention may specify that the priority identifier of the data burst bandwidth gets the lowest priority that contributes to the accumulated sum. Also note that this embodiment may choice to incorporate scheduling, as shown in FIG. 6 above, and the combination of bandwidth requests, as shown in FIG. 7 above. At this point, data burst bandwidths are ready to be granted to their appropriate cable modems as accomplished in step 306 (FIG. 3). The flowchart in FIG. 8 ends at this point.
E. Example Environment of the Present Invention
[0054] CMTS 102, CMTS scheduler 110 and cable modem scheduler 116 may be implemented using computer 1000 as shown in FIG. 10. Obviously, more than one of these functional components could be implemented on a single computer 1000. [0055] The present invention may be implemented using hardware, software or a combination thereof and may be implemented in a computer system or other processing system. In fact, in one embodiment, the invention is directed toward one or more computer systems capable of carrying out the functionality described herein. The computer system 1000 includes one or more processors, such as processor 1004. The processor 1004 is connected to a communication bus 1006. Various software embodiments are described in terms of this example computer system. After reading this description, it will become apparent to a person skilled in the relevant art how to implement the invention using other computer systems and/or computer architectures.
[0056] Computer system 1000 also includes a main memory 1008, preferably random access memory (RAM), and can also include a secondary memory 1010. The secondary memory 1010 can include, for example, a hard disk drive 1012 and/or a removable storage drive 1014, representing a floppy disk drive, a magnetic tape drive, an optical disk drive, etc. The removable storage drive 1014 reads from and/or writes to a removable storage unit 1018 in a well known manner. Removable storage unit 1018, represents a floppy disk, magnetic tape, optical disk, etc. which is read by and written to by removable storage drive 1014. As will be appreciated, the removable storage unit 1018 includes a computer usable storage medium having stored therein computer software and/or data.
[0057] In alternative embodiments, secondary memory 1010 may include other similar means for allowing computer programs or other instructions to be loaded into computer system 1000. Such means can include, for example, a removable storage unit 1022 and an interface 1020. Examples of such can include a program cartridge and cartridge interface (such as that found in video game devices), a removable memory chip (such as an EPROM, or PROM) and associated socket, and other removable storage units 1022 and interfaces 1020 which allow software and data to be transferred from the removable storage unit 1018 to computer system 1000. [0058] Computer system 1000 can also include a communications interface 1024.
Communications interface 1024 allows software and data to be transferred between computer system 1000 and external devices. Examples of communications interface 1024 can include a modem, a network interface (such as an Ethernet card), a communications port, a PCMCIA slot and card, etc. Software and data transferred via communications interface 1024 are in the form of signals which can be electronic, electromagnetic, optical or other signals capable of being received by communications interface 1024. These signals 1026 are provided to communications interface via a channel 1028. This channel 1028 carries signals 1026 and can be implemented using wire or cable, fiber optics, a phone line, a cellular phone link, an RF link and other communications channels.
[0059] In this document, the terms "computer program medium" and "computer usable medium" are used to generally refer to media such as removable storage device 1018, a hard disk installed in hard disk drive 1012, and signals 1026. These computer program products are means for providing software to computer system 1000.
[0060] Computer programs (also called computer control logic) are stored in main memory and/or secondary memory 1010. Computer programs can also be received via communications interface 1024. Such computer programs, when executed, enable the computer system 1000 to perform the features of the present invention as discussed herein. In particular, the computer programs, when executed, enable the processor 1004 to perform the features of the present invention. Accordingly, such computer programs represent controllers of the computer system 1000.
[0061] In an embodiment where the invention is implemented using software, the software may be stored in a computer program product and loaded into computer system 1000 using removable storage drive 1014, hard drive 1012 or communications interface 1024. The control logic (software), when executed by the processor 1004, causes the processor 1004 to perform the functions of the invention as described herein. [0062] In another embodiment, the invention is implemented primarily in hardware using, for example, hardware components such as application specific integrated circuits (ASICs). Implementation of the hardware state machine so as to perform the functions described herein will be apparent to persons skilled in the relevant art(s). In yet another embodiment, the invention is implemented using a combination of both hardware and software.
F. Conclusion
[0063] While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example, and not limitation. It will be apparent to persons skilled in the relevant art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention. This is especially true in light of technology and terms within the relevant art(s) that may be later developed. Thus, the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.

Claims

WHAT IS CLAIMED IS:
1. A method for combining requests for bandwidth by a data provider for transmission of data over an asynchronous communication medium, comprising the steps of: receiving bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth; storing each of the bandwidth requests in a data structure so as to maintain the order in which the bandwidth requests were received; based on said priority identifier and said order of each bandwidth request, scheduling each said bandwidth request in an order to be serviced; combining each of said bandwidth requests having the same said data provider identifier into a data burst bandwidth; and granting said data burst bandwidth to the data provider over the asynchronous communication medium.
2. The method of claim 1, wherein said asynchronous communication medium is cable TV.
3. The method of claim 1, wherein said asynchronous communication medium is wireless.
4. The method of claim 1 , wherein said asynchronous communication medium is satellite.
5. The method of claim 1, wherein said asynchronous communication medium is the Internet.
6. The method of claim 1, wherein said order is priority first come first served.
7. The method of claim 1 , wherein each said data burst may contain bandwidth requests with different priority identifiers.
8. The method of claim 1, wherein said data structure is comprised of one or more queues.
9. A method for combining requests for bandwidth by a data provider for transmission of data over an asynchronous communication medium, comprising the steps of: receiving bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth; combining, by data provider identifier and priority identifier, the amount of bandwidth required to represent a data burst bandwidth; based on one or more quality of service parameters (which varies from priority to priority), scheduling each said data burst bandwidth in an order to be serviced; and granting said data burst bandwidth to the data provider over the asynchronous communication medium.
10. The method of claim 9, wherein said quality of service parameters include efficiency of transmission and transfer delay tolerance.
1 1. The method of claim 9, wherein said asynchronous communication medium is cable TV.
12. The method of claim 9, wherein said asynchronous communication medium is wireless.
13. The method of claim 9, wherein said asynchronous communication medium is satellite.
14. The method of claim 9, wherein said asynchronous communication medium is the Internet.
15. The method of claim 9, wherein said order is priority first come first served.
16. The method of claim 9, wherein each said data burst may contain bandwidth requests with different priority identifiers.
17. A system for combining requests for bandwidth by a data provider for transmission of data over an asynchronous communication medium, comprising: a headend; and a scheduler coupled to said headend, wherein said scheduler receives bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth, wherein said scheduler stores each of the bandwidth requests in a data structure so as to maintain the order in which the bandwidth requests were received, wherein said scheduler schedules each said bandwidth request in an order to be serviced based on said priority identifier and said order of each bandwidth request, and wherein said scheduler combines each of said bandwidth requests having the same said data provider identifier into a data burst bandwidth, and wherein said headend grants said data burst bandwidth to the data provider over the asynchronous communication medium.
18. The system of claim 17, wherein said asynchronous communication medium is cable TV.
19. The system of claim 17, wherein said asynchronous communication medium is wireless.
20. The system of claim 17, wherein said asynchronous communication medium is satellite.
21. The system of claim 17, wherein said asynchronous communication medium is the Internet.
22. The system of claim 17, wherein said order is priority first come first served.
23. The system of claim 17, wherein each said data burst may contain bandwidth requests with different priority identifiers.
24. The system of claim 17, wherein said data structure is comprised of one or more queues.
25. A system for combining requests for bandwidth by a data provider for transmission of data over an asynchronous communication medium, comprising: a headend; and a scheduler coupled to said headend, wherein said scheduler receives bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth, wherein said scheduler combines, by data provider identifier and priority identifier, the amount of bandwidth required to represent a data burst bandwidth, wherein said scheduler, based on one or more quality of service parameters (which varies from priority to priority), schedules each said data burst bandwidth in an order to be serviced, and wherein said headend grants said data burst bandwidth to the data provider over the asynchronous communication medium.
26. The system of claim 25, wherein said quality of service parameters include efficiency of transmission and transfer delay tolerance.
27. The system of claim 25, wherein said asynchronous communication medium is cable TV.
28. The system of claim 25, wherein said asynchronous communication medium is wireless.
29. The system of claim 25, wherein said asynchronous communication medium is satellite.
30. The system of claim 25, wherein said asynchronous communication medium is the Internet.
31. The system of claim 25, wherein said order is priority first come first served.
32. The system of claim 25, wherein each said data burst may contain bandwidth requests with different priority identifiers.
33. A method for combining requests for bandwidth by a data provider for transmission of data over an asynchronous communication medium, comprising the steps of: receiving bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth; combining each of said bandwidth requests having the same said data provider identifier into a data burst bandwidth; and granting said data burst bandwidth to the data provider over the asynchronous communication medium.
34. A system for combining requests for bandwidth by a data provider for transmission of data over an asynchronous communication medium, comprising a headend that receives bandwidth requests from one or more data providers, each bandwidth request having a data provider identifier, a priority identifier, and the amount of required bandwidth, wherein said headend combines each of said bandwidth requests having the same said data provider identifier into a data burst bandwidth, and wherein said headend grants said data burst bandwidth to the data provider over the asynchronous communication medium.
PCT/US2001/004820 2000-02-15 2001-02-15 System and method for combining data bandwidth requests by a dataprovider for transmission of data over an asynchronous communication medium WO2001060767A2 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
DE60137115T DE60137115D1 (en) 2000-02-15 2001-02-15 SYSTEM AND METHOD FOR COMBINING DATA BANDWIDTH REQUIREMENTS FROM A DATA PROVIDER FOR NSMEDIUM
EP01910717A EP1257514B1 (en) 2000-02-15 2001-02-15 System and method for combining data bandwidth requests by a data provider for transmission of data over an asynchronous communication medium
AU2001238298A AU2001238298A1 (en) 2000-02-15 2001-02-15 System and method for combining requests for data bandwidth by a data provider for transmission of data over an asynchronous communication medium

Applications Claiming Priority (10)

Application Number Priority Date Filing Date Title
US18247000P 2000-02-15 2000-02-15
US60/182,470 2000-02-15
US24718800P 2000-11-09 2000-11-09
US60/247,188 2000-11-09
US25441500P 2000-12-08 2000-12-08
US60/254,415 2000-12-08
US26220301P 2001-01-17 2001-01-17
US26220101P 2001-01-17 2001-01-17
US60/262,203 2001-01-17
US60/262,201 2001-01-17

Publications (2)

Publication Number Publication Date
WO2001060767A2 true WO2001060767A2 (en) 2001-08-23
WO2001060767A3 WO2001060767A3 (en) 2002-01-03

Family

ID=27539074

Family Applications (5)

Application Number Title Priority Date Filing Date
PCT/US2001/004819 WO2001062008A2 (en) 2000-02-15 2001-02-15 Method, system and computer program product for scheduling upstream communications
PCT/US2001/004820 WO2001060767A2 (en) 2000-02-15 2001-02-15 System and method for combining data bandwidth requests by a dataprovider for transmission of data over an asynchronous communication medium
PCT/US2001/004818 WO2001061924A2 (en) 2000-02-15 2001-02-15 Cable modem system and method for specialized data transfer
PCT/US2001/004841 WO2001061925A2 (en) 2000-02-15 2001-02-15 System and method for suppressing silence in voice traffic over an asynchronous communication medium
PCT/US2001/004904 WO2001061983A2 (en) 2000-02-15 2001-02-15 Voice architecture for transmission over a shared, contention based medium

Family Applications Before (1)

Application Number Title Priority Date Filing Date
PCT/US2001/004819 WO2001062008A2 (en) 2000-02-15 2001-02-15 Method, system and computer program product for scheduling upstream communications

Family Applications After (3)

Application Number Title Priority Date Filing Date
PCT/US2001/004818 WO2001061924A2 (en) 2000-02-15 2001-02-15 Cable modem system and method for specialized data transfer
PCT/US2001/004841 WO2001061925A2 (en) 2000-02-15 2001-02-15 System and method for suppressing silence in voice traffic over an asynchronous communication medium
PCT/US2001/004904 WO2001061983A2 (en) 2000-02-15 2001-02-15 Voice architecture for transmission over a shared, contention based medium

Country Status (6)

Country Link
US (1) US7388884B2 (en)
EP (5) EP1258101B1 (en)
AT (5) ATE418528T1 (en)
AU (5) AU2001238298A1 (en)
DE (3) DE60132071T2 (en)
WO (5) WO2001062008A2 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1390840A1 (en) * 2001-05-25 2004-02-25 N2 Broadband, Inc. System and method for scheduling the distribution of assets from multiple asset providers to multiple receivers
US7568209B1 (en) 2003-11-14 2009-07-28 Tanderberg Television, Inc. Method and system for the management of targeted material insertion using a campaign manager
US8024766B2 (en) 2001-08-01 2011-09-20 Ericsson Television, Inc. System and method for distributing network-based personal video

Families Citing this family (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6804251B1 (en) * 1998-11-12 2004-10-12 Broadcom Corporation System and method for multiplexing data from multiple sources
US7333495B2 (en) * 1999-10-27 2008-02-19 Broadcom Corporation Method for scheduling upstream communications
US6999414B2 (en) * 1999-10-27 2006-02-14 Broadcom Corporation System and method for combining requests for data bandwidth by a data provider for transmission of data over an asynchronous communication medium
US6993007B2 (en) * 1999-10-27 2006-01-31 Broadcom Corporation System and method for suppressing silence in voice traffic over an asynchronous communication medium
US7769047B2 (en) * 2001-02-15 2010-08-03 Broadcom Corporation Methods for specialized data transfer in a wireless communication system
US7177324B1 (en) * 2001-07-12 2007-02-13 At&T Corp. Network having bandwidth sharing
US20030041162A1 (en) * 2001-08-27 2003-02-27 Hochmuth Roland M. System and method for communicating graphics images over a computer network
US7379472B2 (en) * 2001-09-27 2008-05-27 Broadcom Corporation Hardware filtering of unsolicited grant service extended headers
US7319666B2 (en) * 2002-02-06 2008-01-15 Thomson Licensing Method and apparatus for concatenating and piggybacking data packets
CN100380879C (en) * 2002-02-06 2008-04-09 汤姆森许可公司 Method and apparatus for concatenating and piggybacking data packets
US7796583B1 (en) 2002-07-17 2010-09-14 Nortel Networks Limited Packet handler for high-speed data networks
US7739359B1 (en) * 2002-09-12 2010-06-15 Cisco Technology, Inc. Methods and apparatus for secure cable modem provisioning
CN101129005A (en) * 2004-08-25 2008-02-20 汤姆逊许可公司 Wired data service compressing method
US20090125958A1 (en) 2005-11-23 2009-05-14 Pak Siripunkaw Method of upgrading a platform in a subscriber gateway device
US8628522B2 (en) 2007-05-21 2014-01-14 Estech, Inc. (Endoscopic Technologies, Inc.) Cardiac ablation systems and methods
US8108911B2 (en) 2007-11-01 2012-01-31 Comcast Cable Holdings, Llc Method and system for directing user between captive and open domains
US20130236170A1 (en) * 2010-11-24 2013-09-12 Mitsubishi Electric Corporation Communication apparatus
JP2011125039A (en) * 2011-01-06 2011-06-23 Thomson Licensing Compression in cable data service
US9729431B1 (en) * 2011-08-16 2017-08-08 Marvell International Ltd. Using standard fields to carry meta-information
US9942290B2 (en) * 2015-09-09 2018-04-10 Ericsson Ab Fast channel change in a multicast adaptive bitrate (MABR) streaming network using HTTP download segment recovery in a shared progressive ABR download pipe
US9788053B2 (en) * 2015-09-09 2017-10-10 Ericsson Ab Fast channel change in a multicast adaptive bitrate (MABR) streaming network using HTTP download segment recovery in a dedicated bandwidth pipe
US11038811B2 (en) 2017-05-17 2021-06-15 Cisco Technology, Inc. Waterfall granting
US12047965B1 (en) * 2021-07-20 2024-07-23 Apple Inc. Communication scheduler

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0774848A2 (en) * 1995-11-15 1997-05-21 Xerox Corporation Method for providing integrated packet services over a shared-media network
US5850400A (en) * 1995-04-27 1998-12-15 Next Level Communications System, method, and apparatus for bidirectional transport of digital data between a digital network and a plurality of devices
US5926478A (en) * 1996-12-19 1999-07-20 Ericsson, Inc. Data transmission over a point-to-multipoint optical network

Family Cites Families (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4534024A (en) 1982-12-02 1985-08-06 At&T Bell Laboratories System and method for controlling a multiple access data communications system including both data packets and voice packets being communicated over a cable television system
US4712210A (en) 1984-09-07 1987-12-08 Lee Data Corporation Signal conversion circuit for interconnecting coaxial cable and a twisted pair
US5341374A (en) 1991-03-01 1994-08-23 Trilan Systems Corporation Communication network integrating voice data and video with distributed call processing
US5421030A (en) 1991-09-17 1995-05-30 Com21, Inc. Communications system and method for bi-directional communications between an upstream control facility and downstream user terminals
US5425027A (en) 1993-01-04 1995-06-13 Com21, Inc. Wide area fiber and TV cable fast packet cell network
US5539449A (en) 1993-05-03 1996-07-23 At&T Corp. Integrated television services system
RO111887B1 (en) 1993-05-28 1997-02-28 Us West Technologies Inc Method and network for the separation of telephonic services from special services
US5515379A (en) 1993-10-18 1996-05-07 Motorola, Inc. Time slot allocation method
US5463624A (en) * 1994-04-15 1995-10-31 Dsc Communications Corporation Bus arbitration method for telecommunications switching
US5570355A (en) 1994-11-17 1996-10-29 Lucent Technologies Inc. Method and apparatus enabling synchronous transfer mode and packet mode access for multiple services on a broadband communication network
US5631908A (en) * 1995-03-28 1997-05-20 Digital Equipment Corporation Method and apparatus for generating and implementing smooth schedules for forwarding data flows across cell-based switches
US5742592A (en) 1995-09-01 1998-04-21 Motorola, Inc. Method for communicating data in a wireless communication system
US5606561A (en) 1995-07-28 1997-02-25 Motorola, Inc. Method, device/microprocessor, and computer software for providing packet fragmentation for fair, efficient downlink transmission with low packet delay
US5756280A (en) 1995-10-03 1998-05-26 International Business Machines Corporation Multimedia distribution network including video switch
SE515901C2 (en) 1995-12-28 2001-10-22 Dynarc Ab Resource management, plans and arrangements
US6055268A (en) 1996-05-09 2000-04-25 Texas Instruments Incorporated Multimode digital modem
US6078564A (en) 1996-08-30 2000-06-20 Lucent Technologies, Inc. System for improving data throughput of a TCP/IP network connection with slow return channel
US5946323A (en) * 1996-11-20 1999-08-31 At&T Corp Asynchronous transfer mode integrated access service
US6370571B1 (en) * 1997-03-05 2002-04-09 At Home Corporation System and method for delivering high-performance online multimedia services
US5963557A (en) 1997-04-11 1999-10-05 Eng; John W. High capacity reservation multiple access network with multiple shared unidirectional paths
US6249526B1 (en) 1997-06-30 2001-06-19 Intel Corporation Versatile time division multiple access slot assignment unit
US6032197A (en) * 1997-09-25 2000-02-29 Microsoft Corporation Data packet header compression for unidirectional transmission
WO1999018718A1 (en) 1997-10-02 1999-04-15 Thomson Licensing S.A. Multimedia decoder and bi-directional broadcast communication system
US6567416B1 (en) * 1997-10-14 2003-05-20 Lucent Technologies Inc. Method for access control in a multiple access system for communications networks
US6137793A (en) * 1997-12-05 2000-10-24 Com21, Inc. Reverse path multiplexer for use in high speed data transmissions
US6185224B1 (en) 1998-01-12 2001-02-06 Georgia Tech Research Corporation System and method for communicating data in a cable network
US6233687B1 (en) * 1998-01-21 2001-05-15 Nortel Networks Limited Method and apparatus for providing configuration information in a network
US6115394A (en) * 1998-03-04 2000-09-05 Ericsson Inc. Methods, apparatus and computer program products for packet transport over wireless communication links
US6510162B1 (en) * 1998-05-27 2003-01-21 3Com Corporation System and method for managing channel usage in a data over cable system
US6272131B1 (en) 1998-06-11 2001-08-07 Synchrodyne Networks, Inc. Integrated data packet network using a common time reference
US6230326B1 (en) * 1998-07-30 2001-05-08 Nortel Networks Limited Method and apparatus for initialization of a cable modem
US6438123B1 (en) * 1998-11-10 2002-08-20 Cisco Technology, Inc. Method and apparatus for supporting header suppression and multiple microflows in a network
US6804251B1 (en) 1998-11-12 2004-10-12 Broadcom Corporation System and method for multiplexing data from multiple sources
US6618386B1 (en) * 1999-03-04 2003-09-09 Webtv Networks, Inc. Hosting a cable modem in a computer using a virtual bridge
US6643780B1 (en) * 1999-05-07 2003-11-04 Ericsson Inc. Modems that block data transfers during safe mode of operation and related methods
US6715075B1 (en) * 1999-07-08 2004-03-30 Intel Corporation Providing a configuration file to a communication device
US6788707B1 (en) * 1999-08-31 2004-09-07 Broadcom Corporation Method for the suppression and expansion of packet header information in cable modem and cable modem termination system devices
US7203164B2 (en) * 1999-10-27 2007-04-10 Broadcom Corporation Voice architecture for transmission over a shared, contention based medium
EP1243115B1 (en) * 1999-12-23 2005-10-26 Broadcom Corporation Method for opening a proprietary mac protocol in a non-docsis modem compatibly with a docsis modem
US6466986B1 (en) * 1999-12-30 2002-10-15 Nortel Networks Limited Method and apparatus for providing dynamic host configuration protocol (DHCP) tagging
EP1338128B1 (en) * 2000-10-11 2006-06-07 Broadcom Corporation Efficiently transmitting RTP packets in a network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5850400A (en) * 1995-04-27 1998-12-15 Next Level Communications System, method, and apparatus for bidirectional transport of digital data between a digital network and a plurality of devices
EP0774848A2 (en) * 1995-11-15 1997-05-21 Xerox Corporation Method for providing integrated packet services over a shared-media network
US5926478A (en) * 1996-12-19 1999-07-20 Ericsson, Inc. Data transmission over a point-to-multipoint optical network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
LIMB J O ET AL: "AN ACCESS PROTOCOL TO SUPPORT MULTIMEDIA TRAFFIC OVER HYBRID FIBER/COAX SYSTEMS" PROCEEDINGS OF THE INTERNATIONAL WORKSHOP ON COMMUNITY NETWORKINGINTEGRATED MULTIMEDIA SERVICES TO THE HOME, XX, XX, 20 June 1995 (1995-06-20), pages 35-40, XP000984181 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1390840A1 (en) * 2001-05-25 2004-02-25 N2 Broadband, Inc. System and method for scheduling the distribution of assets from multiple asset providers to multiple receivers
EP1390840A4 (en) * 2001-05-25 2004-08-18 N2 Broadband Inc System and method for scheduling the distribution of assets from multiple asset providers to multiple receivers
US8024766B2 (en) 2001-08-01 2011-09-20 Ericsson Television, Inc. System and method for distributing network-based personal video
US7568209B1 (en) 2003-11-14 2009-07-28 Tanderberg Television, Inc. Method and system for the management of targeted material insertion using a campaign manager

Also Published As

Publication number Publication date
EP1258102B1 (en) 2011-10-19
EP1266526B1 (en) 2012-04-25
AU2001247200A1 (en) 2001-08-27
WO2001061983A2 (en) 2001-08-23
DE60132071D1 (en) 2008-02-07
EP1258101A2 (en) 2002-11-20
US20010053159A1 (en) 2001-12-20
WO2001061924A3 (en) 2002-02-28
ATE555604T1 (en) 2012-05-15
WO2001061924A9 (en) 2002-10-24
EP1257514A2 (en) 2002-11-20
EP1256229B1 (en) 2005-01-26
WO2001061924A2 (en) 2001-08-23
WO2001062008A3 (en) 2001-12-20
AU2001238296A1 (en) 2001-08-27
DE60108612D1 (en) 2005-03-03
WO2001061925A9 (en) 2002-10-24
AU2001238298A1 (en) 2001-08-27
ATE418528T1 (en) 2009-01-15
US7388884B2 (en) 2008-06-17
WO2001061925A2 (en) 2001-08-23
EP1266526A2 (en) 2002-12-18
ATE529969T1 (en) 2011-11-15
DE60132071T2 (en) 2008-12-18
ATE382240T1 (en) 2008-01-15
EP1257514B1 (en) 2008-12-24
WO2001060767A3 (en) 2002-01-03
WO2001061983A9 (en) 2002-11-28
WO2001062008A2 (en) 2001-08-23
EP1258102A2 (en) 2002-11-20
EP1258101B1 (en) 2007-12-26
AU2001245274A1 (en) 2001-08-27
WO2001061925A3 (en) 2002-02-14
DE60137115D1 (en) 2009-02-05
EP1256229A2 (en) 2002-11-13
ATE288168T1 (en) 2005-02-15
WO2001061983A3 (en) 2002-02-28
AU2001238297A1 (en) 2001-08-27
DE60108612T2 (en) 2006-03-23

Similar Documents

Publication Publication Date Title
US7697426B2 (en) System and method for combining requests for data bandwidth by a data source for transmission of data over a wireless communication medium
EP1257514B1 (en) System and method for combining data bandwidth requests by a data provider for transmission of data over an asynchronous communication medium
US8593966B2 (en) Method for dropping lower priority packets that are slated for wireless transmission
US7333495B2 (en) Method for scheduling upstream communications
US6993007B2 (en) System and method for suppressing silence in voice traffic over an asynchronous communication medium
US20070076766A1 (en) System And Method For A Guaranteed Delay Jitter Bound When Scheduling Bandwidth Grants For Voice Calls Via A Cable Network
US8018963B2 (en) Systems for flexible wireless channel association
US20020095684A1 (en) Methods, systems and computer program products for bandwidth allocation based on throughput guarantees
US7839785B2 (en) System and method for dropping lower priority packets that are slated for transmission
US7646979B1 (en) Multiple access protocol system and related techniques for multi-gigabit optical wavelength division multiplexed local area networks

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
AK Designated states

Kind code of ref document: A3

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

WWE Wipo information: entry into national phase

Ref document number: 2001910717

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 2001910717

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase

Ref country code: JP