CN100380879C - Method and apparatus for concatenating and piggybacking data packets - Google Patents

Method and apparatus for concatenating and piggybacking data packets Download PDF

Info

Publication number
CN100380879C
CN100380879C CNB038034603A CN03803460A CN100380879C CN 100380879 C CN100380879 C CN 100380879C CN B038034603 A CNB038034603 A CN B038034603A CN 03803460 A CN03803460 A CN 03803460A CN 100380879 C CN100380879 C CN 100380879C
Authority
CN
China
Prior art keywords
packet
ready
sending
transmit queue
cable modem
Prior art date
Legal status (The legal status 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 status listed.)
Expired - Fee Related
Application number
CNB038034603A
Other languages
Chinese (zh)
Other versions
CN1692604A (en
Inventor
T·F·古斯曼
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Thomson Licensing SAS
RCA Licensing Corp
Original Assignee
RCA Licensing Corp
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 RCA Licensing Corp filed Critical RCA Licensing Corp
Publication of CN1692604A publication Critical patent/CN1692604A/en
Application granted granted Critical
Publication of CN100380879C publication Critical patent/CN100380879C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A method and apparatus for concatenating (200) and piggybacking (300) data packets in a bi-directional communication device (120) include, in response to a first transmission queue (455) of the bi-directional communication device (120) containing less than a threshold number of data packets, transferring (120) a data packet from a second transmission queue (425) in the bi-directional communication device (120) to the first transmission queue (455), the transferred data packet comprising at least two concatenated data packets. The method and apparatus further include identifying (120) the transferred data packet as a ready-to-send data packet in the first transmission queue (455) after the transfer, and indicating the presence of a subsequent ready-to-send data packet in a primary ready-to-send data packet, the primary ready-to-send data packet and the subsequent ready-to-send data packet existing in a sequence of ready-to-send data packets in the first transmission queue (455).

Description

Be used for the cascade and the method and apparatus of packet incidentally
The cross reference of related application
The sequence number that present patent application requires on February 6th, 2002 to submit to is the rights and interests of 60/355,637 U.S. Provisional Application, and it is included in here this application in full by reference.
Technical field
The present invention relates to the intercommunication system field, and be particularly related to the cascade of packet in the intercommunication system and incidentally (piggybacking).
Background technology
Packet network such as the internet is that global data and voice communication are to provide a kind of effective delivery vehicle than the much lower cost of PSTN (PSTN).Similarly, need to expand communication capacity more and more via the internet.Although prior art is existed the restriction of some these targets of inhibition.
When the data transmission rate of making great efforts to increase in the limiting bandwidth intercommunication system, cascade is used to reduce the amount to Cable Modem Terminal System (CMTS) bandwidth on demand.
Cascade is a kind of method of describing in Docsis 1.0/1.1 RFI standard, and this method allows more effectively transmission of data packets of the packet of packet in upstream direction (promptly from the modulator-demodulator to CMTS or head end) thereby by a large amount of individual datas groupings being combined into a cascade.In the example of a use cascade, different bandwidth request is opposite with each packet is made, and the docsis cable modulator-demodulator is only made a bandwidth request (with the form of a cascade data grouping) to a plurality of packets.Though Docsis 1.0/1.1 RFI specification description realize the agreement of cascade, this standard does not point out how and when to carry out, and use how to optimize cascade best.A shortcoming is, cascade is typically by waiting for until will upstream transmission realizing at cable modem (CM) to queuing data packet's wait of the necessary amount of CMTS, and do not know to want the next packet of upstream transmission when to arrive the CM formation usually.This can cause unknown transmission delay.
The second method that is called " incidentally " is also described in Docsis 1.0/1.1 RFI standard, and it allows more effectively to utilize the upstream bandwidth.In order to realize that incidentally the packet of necessary amount must be waited in line in the packet descriptor formation of CM IC.If given this condition, CM IC will make first packet generate the incidentally request to second packet automatically.Similarly, if when being ready for sending second packet, there is the 3rd packet, when sending second packet, will generate incidentally request so by CM to the 3rd packet.As long as have in packet descriptor queue that its ownership bit (ownership bit) is set etc. packet to be sent, just continue this and incidentally operate.Although current piggybacking method once can only transmit an available packet.
Summary of the invention
The invention provides a kind of being used at the intercommunication system advantageously cascade of binding data grouping and method and apparatus incidentally, so that reduce processing time and increase data transmission rate.
In one embodiment of the invention, a kind of method comprises, response comprises first transmit queue of the bi-directional communication device of the packet that is lower than number of thresholds, second transmit queue of packet from bi-directional communication device transferred to first transmit queue, and the packet of being shifted comprises the packet of two cascades at least.Described method also is included in after the transfer and the packet of being shifted is defined as the packet that is ready for sending in first transmit queue, and there is the packet be ready for sending subsequently in indication in the packet that is ready for sending at first, and packet that is ready for sending at first and the packet that is ready for sending subsequently are present in the sequence of data packets that is ready for sending in first transmit queue.
In another embodiment of the present invention, a kind of equipment comprises first transmit queue that is used to store packet and first group of instruction, packet and second group of second transmit queue that instructs that is used for storing the predetermined threshold number that surpasses the packet that will be stored in first transmit queue.This equipment also comprises a processor, when carrying out first group of instruction and second group of instruction, it is configured to, response comprises first transmit queue of the packet that is less than number of thresholds, packet is transferred to first transmit queue from second transmit queue, the packet of being shifted comprises the packet of two cascades at least, the packet of being shifted is defined as the packet that is ready for sending in first transmit queue, and the indication packet that existence is ready for sending subsequently in the packet that is ready for sending at first, packet that is ready for sending at first and the packet that is ready for sending subsequently are present in the sequence of data packets that is ready for sending in first transmit queue.
In another embodiment of the present invention, a kind of equipment comprises: being used for a plurality of packets of cascade is the device of a data grouping; And the device that is used for the packet of incidentally described cascade or the grouping of incidentally single not cascade data.
Description of drawings
Consider that in conjunction with the drawings following detailed description can understand instruction of the present invention easily, in the accompanying drawings:
Fig. 1 has described to comprise the high level block diagram of the intercommunication system of one embodiment of the invention;
Fig. 2 has described the block diagram of the packet of cascade;
Fig. 3 has described the block diagram of exemplary media access control header;
Fig. 4 has described to be adapted at the high level block diagram of an embodiment of the cable modem that uses in the communication system of Fig. 1; And
Fig. 5 has described to be used for according to the present invention at the intercommunication system cascade and the flow chart of the method for packet incidentally.
For easy to understand, if possible, use identical reference number to indicate the total identical element of accompanying drawing.
Embodiment
The model that to make in the Broadcom company that utilizes Irving city, California be to describe the present invention under the background of modulator-demodulator of 3350 docsis cable modulator-demodulator IC.Yet, it will be apparent to one skilled in the art that the present invention can be realized by the cable modem that utilizes other cable modems IC or the like equally.And principle of the present invention may be used on other bi-directional communication devices except the cable modem of upstream communication.Advantageously, the invention provides a kind of method and apparatus, thus be used in conjunction with the cascade of intercommunication system and incidentally packet reduce the processing time and increase data transmission rate.
Fig. 1 has described to comprise the high level block diagram of the intercommunication system of the embodiment of the invention.The intercommunication system 100 of Fig. 1 comprises personal computer (PC) 110, cable modem (CM) 120, is connected to the Cable Modem Terminal System (CMTS) 130 of Access Network such as Internet service provider (ISP) 135 and the network such as internet 140.As shown in Figure 1, cable modem (CM) 120 allows pc user's high speed access internet 140.CM 120 receives packet so that subsequently to CMTS 130 transmission from PC 110 or other customer headend equipments (CPE).CM 120 is comprised in the part of the specific cable modem application software of cable modem IC (being illustrated as Broadcom 3350 DOCSIS single-chip cable modem IC) and this IC.Broadcom 3350 DOCSIS single-chip cable modem IC comprise packet descriptor formation and software (not shown), and with cable modem application software binding operation so that start two-way communication.
CMTS 130 controls to the information flow of CM 120, and this is called downstream transfer, also controls from the information flow of CM 120 to CMTS 130, and this is called upstream transmission.CMTS 130 sends it and is grouped into Internet service provider (ISP) network, and this network forwards the packet to internet 140 then.Though the intercommunication system 100 of Fig. 1 is depicted as the communication system between PC and the internet, it will be apparent to one skilled in the art that the present invention can be advantageously comprises a plurality of PC or other CPE realize at other in the intercommunication system of the communication between internet or other IP or the data packet network.
In the intercommunication system 100 of Fig. 1, the available bandwidth of upstream direction typically is lower than the available bandwidth of downstream direction.In order more effectively to utilize available upstream bandwidth, according to embodiments of the invention, CM 120 is inserted into cascade and combination incidentally in the upstream transmission in new arrangement.The present invention's other cascade and piggybacking method can utilize the existing communication software and hardware to implement, this for those skilled in the art be clearly and also here no longer describe in detail.Yet the present invention is used at intercommunication system in conjunction with cascade and piggybacking method so that the method and apparatus that reduces the processing time and increase data transmission rate is unknown, and here will be described in detail.
Fig. 2 shows the packet of a cascade.The cascade data of Fig. 2 grouping 200 is by two each and every one other packets 210 on media interviews control (MAC) layer 1With 210 2Form, these two packet assemblings together.Cascade header 211 is added to cascade data grouping 200 so that storage is used for decompress(ion) after a while or extracts the information of the packet of cascade.For example in the DOCSIS1.0/1.1 RFI standard various Cascading Methods are being described.
In one embodiment, in order to realize cascade, a large amount of other packets that received from LAN side (or CPE) equipment that is used for upstream transmission by cable modem are incorporated into the individual data grouping that has the proper data packet header.Cascade is by waiting for until just being realized at cable modem by queuing data packet's wait of upstream transmission to the necessary amount of CMTS.In case obtain the packet of necessary amount, with regard to the cascade data grouping, add a header, and give CMTS the packet upstream transmission of institute's cascade.If send packet individually, will use independent request to send each packet so.Packet for cascade only need send single request.
Fig. 3 shows the typical data grouping 300 as seeing at the MAC layer.Each packet has a mac header 310, this header and then be made up of a large amount of fields; One of them is a header field 320.A large amount of realizations of extension header are defined in DOCSIS RFI 1.0/1.1 standard.DOCSIS RFI 1.0/1.1 has defined a large amount of header field, if be ready for sending another packet (except when outside preceding that data grouping that just is being sent out), this header field allows to make a request so.The process of the bandwidth of the next packet of request is called incidentally request in the extension header of the current packet that just is being sent out.This method allows only to utilize an independent initial request (request subsequently is piggybacked) to send a plurality of packets.
Fig. 4 has described to be suitable for the high level block diagram of an embodiment of the cable modem 120 of use in the communication system 100 of Fig. 1.The cable modem 120 of Fig. 4 comprises processor 410 and memory 420.Memory 420 is used for stored information and application software routine etc.Memory 420 also comprises software queue 425.Processor 410 and the conventional support circuitry 430 such as power supply, clock circuit, buffer storage or the like and auxiliary execution are stored in the circuit collaborative work of the software routines in the memory 420.In alternative embodiment, processor 410 is integrated among the cable modem IC so that save money and printed circuit board space.Similarly, can in hardware, realize, for example, be embodied as with processor 410 collaborative works so that carry out the circuit of different step in these some treatment step expections as the software processes discussion.Cable modem 120 also comprises input-output circuit 440, the interface between these various function element that circuit 440 forms with cable modem 120 is communicated by letter.For example, in the embodiment in figure 1, cable modem 120 is communicated by letter via signal path S1 with PC 110 and is communicated by letter with internet 140 via signal path S2.Cable modem 120 also comprises cable modem IC (being illustrated as Broadcom 3350 DOCSIS single-chip cable modem IC) 450.Cable modem IC 450 and institute's saved software routine binding operation are so that start two-way communication.Cable modem IC 450 comprises packet descriptor (PD) formation 455.
Programming is so that carry out the all-purpose computer of various controlled function according to the present invention though the cable modem 120 of Fig. 4 is depicted as in fact, and this function can realize in hardware, for example, is embodied as application-specific integrated circuit (ASIC) (ASIC).Similarly, treatment step described here briefly is interpreted as coming equivalence to carry out by software, hardware or its combination.
With reference to figure 1-4, in one embodiment, maximum number packet (3 or packet independent or cascade are shown) is placed in the sequence of data packets in the packet descriptor formation 455 of cable modem IC 450, and its ownership bit is put 1 (being ready for sending).Anyly received, or first packet in three data groupings in PD formation 455 is placed in the software queue 425 for the additional data packet (above 3) that receives before the CMTS 130 by upstream transmission.Though be depicted as three (3) above being grouped in of the maximum number in the PD formation 455 of cable modem IC 450, the maximum number that it will be apparent to one skilled in the art that packet can be any number greater than two (2).
CM 120 send for original date grouping (first packet) initial bandwidth request to CMTS 130 before, CM 120 determines whether to exist the packet that is ready for sending of predetermined maximum number in PD formation 455.If the packet that is ready for sending of predetermined maximum number is not present in the PD formation 455, so just check the packet in the software queue 425.
If can obtain the individual data grouping in software queue 425, the ownership bit of this packet is set and is placed in the PD formation 455 so that increase the sum of the packet that is ready for sending in the PD formation so.If a plurality of packets are available in software queue 425, this packet is combined into the packet 200 (quantity capable of being combined is considered and available space in packet descriptor queue based on rate limit) of a cascade and its ownership bit set is placed in the PD formation 455 so.In Broadcom 3350 IC, when cascade is activated therein, carry out cascade by software interactive.
Continuation obtains the packet that is ready for sending of pre-determined maximum number or no longer includes any packet until software queue 425 until the PD formation from the process of software queue 425 to PD formations 455 transferring datas grouping.According to principle of the present invention,, suspend whole process so, because packet can not be piggybacked or cascade again if in software queue 425, do not have packet and in PD formation 455, have to be less than two data groupings.
In an alternative embodiment, when having two packets that are ready for sending in the PD formation 455 at least, the process that packet is transferred to PD formation 455 from software queue 425 stops.That is to say, opposite with said method (wherein continue this method and obtain the packet that maximum number is ready for sending) until PD formation 455, if two packets that are ready for sending are arranged in PD formation 455, no longer include packet so and be transferred to PD formation 455 from software queue 425.The 2nd, for to carry out of the present invention incidentally with Cascading Methods for the minimal amount of desired data grouping in the PD formation 455.
After the process that withdraws from the transferring data grouping, send the request of the abundant small time slot of request (mini-slot) so that send first packet to CMTS 130 then.When CMTS 130 received this request, CMTS 130 assessed received request and suitable permission (grant) is sent it back CM 120.In case receive the permission to first packet, CM 120 just is ready for sending first packet and gives CMTS 130.Before transmission first packet was to CMTS 130, the indication of subsequent data grouping was inserted in the extension header 320 of first packet.Be inserted into the indication of grouping subsequently in the extension header 320 of first packet and comprise the indication of the number that sends required small time slot of subsequent data grouping (second packet) (sending the required portions of bandwidth of grouping).In first packet to subsequent data the divide into groups indication of number of required small time slot take on the incidentally request of second grouping that will be transferred to CMTS 130.When CMTS 130 receives first when sending packet, CMTS 130 recognizes first and sends incidentally request (if existence) in the extension header 320 of packet and the issue new permission to the subsequent data grouping.Similarly, needs have been alleviated in the PD formation 455 of CM 120 to subsequent data grouping detach request.In Broadcom 3350 IC, when feature incidentally is activated and have at least another packet prepare to be sent by upstream the current just processed packet except one, produces incidentally automatically and ask.
After CM 120 received the permission that subsequent data is divided into groups, CM just determined whether to exist in the PD formation 455 packet that is ready for sending of predetermined maximum number back then.With in the past the same,, so just check the packet in the software queue 425 and repeat transfer process if the packet that is ready for sending of pre-determined maximum number is not present in the PD formation 455.Still as previously described, before second data packet transmission was given CMTS 130, its ownership bit was put any other packet of (preparing transmission) in the CM 120 assessment PD formations 455.If there is any such packet really, the request of small time slot is placed in the extension header 320 of second packet, the size of the subsequent data grouping (the 3rd packet) that is transmitted is waited in indication.The number that continues the packet that whole process is ready for sending until do not have the remaining and PD formation 455 of packet in software queue 425 in is not more than one.
Fig. 5 has described to be used for reducing in conjunction with cascade and piggybacking method at intercommunication system the flow chart of a processing time and an embodiment of the method 500 that increases data transmission rate.Though method 500 will illustrate under the background of the modulator-demodulator that utilizes Broadcom 3350 docsis cable modulator-demodulator IC, but one skilled in the art will appreciate that the present invention can be realized by the cable modem that utilizes other cable modems IC equally.And principle of the present invention can be used for other bi-directional communication devices that are used for upstream communication except cable modem.
When the packet descriptor formation from CM sends a data grouping, or replacedly, when receiving a data grouping in the software queue at CM, at step 502 access method 500.
In step 504, how many packets are method 500 define is prepared to send to CMTS from the packet descriptor formation of CM.Suppose to be configured to wait in line the individual data grouping of N (scheduled volume) in the packet descriptor formation that allows transmission of data packets to CM before the CMTS, if the number of the packet that is ready for sending in the packet descriptor formation is more than or equal to N, this method advances to step 506-2 so; If the number of the packet that is ready for sending in the packet descriptor queue is less than N, then this method enters step 506.
In step 506, method 500 determines whether any packet is arranged in the software queue of CM.If do not have packet in the software queue of CM, then this method advances to step 506-2.If in the software queue of CM packet is arranged, then method 500 enters step 508.
At step 506-2, exist greater than 1 packet that is ready for sending in the packet descriptor formation of method 500 checking CM.If the packet that is ready for sending greater than 1 is arranged in the packet descriptor formation, then this method enters step 510; If in the PD formation,, withdraw from method 500 (at this moment, this process can begin in step 502 once more) so not greater than a packet that is ready for sending.If in the packet descriptor formation,, withdraw from method 500 so, because incidentally part of the present invention can not realize and can the independent packet that is ready for sending be sent to CMTS via conventional method not greater than a packet that is ready for sending.
In step 508, the grouping of what data is arranged in the software queue of method 500 definite CM.If only there is an independent packet in the software queue of CM, this method enters step 508-2 so; If yet in the software queue of CM, there are a plurality of packets, this method enters step 508-4 so.
At step 508-2, packet is moved out of and is forwarded to the packet descriptor formation and be marked as and is ready for sending (grouping that is ready for sending) to CMTS from software queue.This method is returned step 504 then.
At step 508-4, packet is combined into the packet (having a cascade header) of cascade, shifts out and be forwarded to the packet descriptor formation and be labeled as from software queue to be ready for sending to CMTS.It should be noted that, if available packet outnumbers the number that can be cascaded to the packet in the individual data grouping in the software queue of CM, cascade data grouping available packet from sequence that so may be maximum is created, and the remainder that can obtain packet is stayed in the software queue of CM.The number of the packet that can be cascaded is based on available space in rate limit consideration and the packet descriptor queue.Method turns back to step 504 then.
In the embodiment of said method 500, method 500 turns back to step 504 after completing steps 508-2 or 508-4.A purpose that turns back to step 504 is to attempt to fill up the PD formation with N data groupings (maximum number of packet) before entering step 510.One skilled in the art will appreciate that the present invention can be configured to return step 506-2 after step 508-2 or 508-4, and this still within the scope of the invention.Turn back in the alternate embodiment of step 506-2 in this method, in the PD formation, do not have to continue under the data conditions that is ready for sending of maximum number this method.That is to say that as long as at least two data groupings are arranged in the packet descriptor formation of CM, the incidentally part of this method just can be carried out and carry out to this method.
In step 510, the indicating device of the packet that is ready for sending subsequently is inserted in the extension header of the packet that is ready for sending at first in the packet descriptor formation of CM.That is to say, before packet is transferred to CMTS from CM, carry out search so that the packet that is ready for sending subsequently in the packet descriptor formation of identification CM.If there is the packet be ready for sending subsequently, will be inserted into the indication of data grouping so in the extension header of the packet (first packet that is ready for sending) that is ready for sending at first in the packet descriptor formation of CM so that produce being ready for sending the permission of packet subsequently from CMTS.Be inserted into indicating device identification in the extension header of the packet that is ready for sending at first and admit the number of the required small time slot of packet.
In step 512, the packet that is ready for sending at first that comprises the indicating device of the packet that is ready for sending subsequently is transferred to CMTS from CM.
In step 514, assessed the initial packet that is ready for sending that sends from CM at CMTS, and after the existence of the packet that is ready for sending subsequently of identification, CM receives permission to the packet that is ready for sending subsequently from CMTS.Method 500 turns back to step 504 then.When not having at least two packets that are ready for sending in the packet descriptor formation of CM and not having packet to withdraw from method 500 when the software queue of CM is transferred to the packet descriptor formation.
Though the some embodiments of the present invention that concentrate on noted earlier can design of the present invention other and not depart from its base region with further embodiment.Similarly, correct scope of the present invention is determined according to claims subsequently.

Claims (20)

1. method comprises:
First transmit queue (455) that comprises the packet that is less than threshold number in the response bi-directional communication device (120), carry out the following step:
Second transmit queue (425) of packet from described bi-directional communication device (120) transferred to described first transmit queue (455), and the packet of described transfer forms by two data groupings of cascade at least;
The packet of described transfer is defined as the packet that is ready for sending in described first transmit queue (455); And
There is the packet be ready for sending subsequently in indication in the packet that is ready for sending at first, and described packet that is ready for sending at first and the described packet that is ready for sending subsequently are present in described first transmit queue (455) and are ready for sending in the sequence of packet.
2. the method for claim 1 is characterized in that, an indication exists the designator that is ready for sending packet subsequently to be inserted in the header (320) of the described packet that is ready for sending at first.
3. the method for claim 1 is characterized in that, described indication was performed before the packet that uplink is ready for sending at first.
4. the method for claim 1 also comprises:
Be ready for sending the described packet that is ready for sending at first of control appliance (130) uplink that has the designator that is ready for sending packet subsequently in the packet at first to being fit to the identification indication; And
Reception is to the permission of the bandwidth of the packet that is used for being ready for sending subsequently.
5. the method for claim 1 is characterized in that, repeats described transfer step is ready for sending packet in described first transmit queue (455) number and equals described threshold number.
6. the method for claim 1 also comprises:
Checking has at least two packets that are ready for sending to be present in described first transmit queue (455) before described indication step.
7. the method for claim 1 is characterized in that, the described packet that is ready for sending is that the ownership bit is changed to the packet of first state separately.
8. the method for claim 1 is characterized in that, described bi-directional communication device (120) is a cable modem.
9. method as claimed in claim 8 is characterized in that, described cable modem (120) comprises cable modem IC (450).
10. method as claimed in claim 9 is characterized in that, described cable modem IC is Broadcom 3350 docsis cable modulator-demodulator IC.
11. method as claimed in claim 10 is characterized in that, described first transmit queue (455) is the packet descriptor formation among the described Broadcom 3350 docsis cable modulator-demodulator IC.
12. method as claimed in claim 8 is characterized in that, described second transmit queue (425) is the software queue in the described cable modem.
13. an equipment comprises:
First transmit queue (455) is used to store packet and first group of instruction;
Second transmit queue (425) is used for packet and second group of instruction that storage exceeds the predetermined threshold number packet that will be stored in described first transmit queue (455); And
Processor (410) when carrying out described first group of instruction and described second group of instruction, is arranged to:
Response comprises first transmit queue (455) of the packet that is less than threshold number, carries out the following step:
Packet is transferred to described first transmit queue (455) from described second transmit queue (425), and the packet of described transfer comprises the packet that forms by at least two data groupings of cascade;
The packet of described transfer is defined as the packet that is ready for sending in described first transmit queue (455); And
There is the packet be ready for sending subsequently in indication in the packet that is ready for sending at first, and described packet that is ready for sending at first and the described packet that is ready for sending subsequently are present in the sequence that is ready for sending packet in described first transmit queue (455).
14. equipment as claimed in claim 13 is characterized in that, indication exists the designator be ready for sending packet subsequently to be inserted in the described header (320) that is ready for sending packet at first.
15. equipment as claimed in claim 13 is characterized in that, described equipment is cable modem.
16. equipment as claimed in claim 15 is characterized in that, described cable modem comprises cable modem IC (450).
17. equipment as claimed in claim 16 is characterized in that, described cable modem IC is Broadcom 3350 docsis cable modulator-demodulator IC.
18. equipment as claimed in claim 17 is characterized in that, described first transmit queue (455) is the packet descriptor formation among the described Broadcom 3350 docsis cable modulator-demodulator IC.
19. equipment as claimed in claim 15 is characterized in that, described second transmit queue (425) is the software queue in the described cable modem.
20. an equipment comprises:
Being used for a plurality of packets of cascade (300) is the device of data groupings (200); And
The device that is used for the packet (200) or the grouping of incidentally single not cascade data of incidentally described cascade.
CNB038034603A 2002-02-06 2003-02-05 Method and apparatus for concatenating and piggybacking data packets Expired - Fee Related CN100380879C (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US35563702P 2002-02-06 2002-02-06
US60/355,637 2002-02-06
US10/339,616 2003-01-09

Publications (2)

Publication Number Publication Date
CN1692604A CN1692604A (en) 2005-11-02
CN100380879C true CN100380879C (en) 2008-04-09

Family

ID=35347026

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB038034603A Expired - Fee Related CN100380879C (en) 2002-02-06 2003-02-05 Method and apparatus for concatenating and piggybacking data packets

Country Status (1)

Country Link
CN (1) CN100380879C (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090201947A1 (en) * 2006-05-30 2009-08-13 Rune Goeran Method And Arrangement For Reducing The Amount Of Messages Sent In A Communication Network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1224553A (en) * 1996-07-15 1999-07-28 冲电信公司 Subsequent frame variable data rate indication method for various variable data rate systems
WO1999057848A2 (en) * 1998-05-06 1999-11-11 Siemens Aktiengesellschaft Method for transmitting useful data in telecommunication systems
WO2001061924A2 (en) * 2000-02-15 2001-08-23 Broadcom Corporation Cable modem system and method for specialized data transfer

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1224553A (en) * 1996-07-15 1999-07-28 冲电信公司 Subsequent frame variable data rate indication method for various variable data rate systems
WO1999057848A2 (en) * 1998-05-06 1999-11-11 Siemens Aktiengesellschaft Method for transmitting useful data in telecommunication systems
WO2001061924A2 (en) * 2000-02-15 2001-08-23 Broadcom Corporation Cable modem system and method for specialized data transfer

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Radio Frequency Interface Specification. Data-Over-Cable Service Interface Specifications,Vol.1.1 No.I07. 2001 *

Also Published As

Publication number Publication date
CN1692604A (en) 2005-11-02

Similar Documents

Publication Publication Date Title
KR100945262B1 (en) Method and apparatus for concatenating and piggybacking data packets
US7492710B2 (en) Packet flow control
US20080049617A1 (en) System for fine grained flow-control concurrency to prevent excessive packet loss
US6321269B1 (en) Optimized performance for transaction-oriented communications using stream-based network protocols
CN101485152B (en) Method, system, and computer program product for resequencing of high performance binding
US20070127521A1 (en) Interface between network data bus application and avionics data bus
CN101047615B (en) Control method for Ethernet data flow
US7493431B2 (en) Method and apparatus for extending the range of the universal serial bus protocol
WO2000049507A1 (en) Method and apparatus for extending the range of the universal serial bus protocol
CN101494579B (en) Bus scheduling device and method
CN112929455B (en) UDP-based data transmission method, device, equipment and readable storage medium
EP1570369A2 (en) An apparatus and method for receive transport protocol termination
CN101453751A (en) Method for large file transmission under narrow-band network environment
CN109818710A (en) A kind of data transmission method and corresponding intrument
KR100478112B1 (en) Packet control system and communication method
JP3439320B2 (en) Data communication method, data communication device, and data communication program recording medium
US6574294B1 (en) Data streaming for non-DMA digital computing devices
CN100380879C (en) Method and apparatus for concatenating and piggybacking data packets
CN103916906A (en) Method, device and system for distributing and processing user data messages
CN108234595A (en) Log transmission method and system
US20090216894A1 (en) Relay apparatus for use in e-mail-based chat system
US8811407B1 (en) Weighted data packet communication system
CN101227688A (en) Method for transmitting data through USB interface on mobile phone
US20020085525A1 (en) Wireless transmission system
US20030105875A1 (en) Transmission management device of a server

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20080409

Termination date: 20170205