CN101193258B - Time slice and confliction avoidance method in CATV network - Google Patents
Time slice and confliction avoidance method in CATV network Download PDFInfo
- Publication number
- CN101193258B CN101193258B CN200610144313XA CN200610144313A CN101193258B CN 101193258 B CN101193258 B CN 101193258B CN 200610144313X A CN200610144313X A CN 200610144313XA CN 200610144313 A CN200610144313 A CN 200610144313A CN 101193258 B CN101193258 B CN 101193258B
- Authority
- CN
- China
- Prior art keywords
- frame
- time
- time slot
- data
- cable
- 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.)
- Active
Links
Images
Landscapes
- Small-Scale Networks (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The invention provides a method for time slicing and collision avoidance of a transmission network for cable TV, which belongs to the transmission field of cable TV. To solve the problem of extremely easy generation of data collision in the prior art when a plurality of CM_Vs transmit upstream information to a GW2 at the same time, the invention provides the method for time slicing and collision avoidance in the transmission network of cable TV, which includes the processes: the GW2 slices time, transmits broadcast frames to the CM_Vs according to a stated period and then responds to response frames after receiving data frames from the CM_Vs; and CM_Vs generate new serial numbers of time slot after detecting data collision so as to occupy the time slot again and transmit the data frames. By time slicing and generating new serial numbers of time slot after data collision to occupy the transmission data frame again, the invention reduces the probability of data collision again to the minimal, thus guaranteeing the high efficiency of bidirectional transmission of data; and the new serial numbers generated by combing with bits which are elected from calibration and CSC calibration at random are applied, so the same probability is quite small.
Description
Technical field
The present invention relates to the CATV transmission field, the method that time slicing and conflict are kept out of the way in particularly a kind of cable TV transmission network network.
Background technology
Present HFC (Hybrid Fiber Coax, hybrid fiber/ coax, HFC) network is the hybrid fiber coax network network with radio and television characteristic, its feature is that a cable is registered one's residence and both can be provided cable television service, can provide the Internet to insert and the interconnected business again; Data, video move based on consolidated network; Data transfer rate height, technology maturation etc. utilize the transformation of CHINA RFTCOM Co Ltd to make network can realize that the data of Cable Modem (cable modem) insert.In the CHINA RFTCOM Co Ltd of transforming, be the topological structure of multiple spot between GW2 (GateWay2, gateway 2) and the CM V (Cable Modem Video On Demand, video request program cable modem), as shown in Figure 1 to single-point.GW2 belongs to edge equipment, can be connected with a plurality of CM V equipment below each GW2, and CM V is arranged in user house, and STB (Set Top Box, top box of digital machine) is connected.When a plurality of CM V simultaneously when GW2 sends uplink information, very easily produce the problem of data collision (being the phase mutual interference), may cause GW2 not receive correct Frame, make the inefficiency of communication.
Summary of the invention
In order to solve a plurality of CM V in the prior art very easily produce data collision simultaneously when GW2 sends uplink information problem, the invention provides the method that time slicing and conflict are kept out of the way in a kind of cable TV transmission network network, specifically may further comprise the steps:
Steps A: GW2 carries out burst to the time, and regularly issue the broadcast frame that comprises the time slicing parameter and give all CM_V that link to each other, described time slicing parameter comprises time slot width, the total number of time slot and timeslot number synchronization character, the total number of described time slot refers to allow CM_V to seize uploads the number of time slots of Frame, is to be provided with according to the CM_V quantity that GW2 reality is connected; After receiving the Frame that certain CM_V sends, send acknowledgement frame to this CM_V, comprise the hardware address of this CM_V and the data frame sequence number that receives in the described acknowledgement frame, also comprise a sign that is used for representing whether to receive the correct data frame;
Step B: described CM_V regularly detects the acknowledgement frame that receives, and judge according to the sign in the acknowledgement frame that receives and to send whether success last time, if do not have, then from the Frame that needs resend with verification and two bytes of CSC verification in randomly draw one or more bits and make up, generate a new time slot sequence number, and seize time slot according to described new time slot sequence number and send described Frame.
Described GW2 will be divided into up timeslice and downgoing time sheet the time, described GW2 sends broadcast frame to all CM_V that link to each other in described downgoing time sheet, and to described CM_V transmission reply data frame, described CM_V sends Frame to described GW2 in described up timeslice.
The Frame that GW2 receives described in the described steps A is to seize a time slot in the timeslot number synchronization character of described CM_V from the broadcast frame of receiving to send.
Described new time slot sequence number for from described Frame with verification and CSC verification randomly draw bit and make up generation.
Beneficial effect of the present invention mainly shows:
1, by resending Frame to generating new time slot sequence number after time slicing and the data collision, the probability that data are collided has once more dropped to minimum, has guaranteed the high efficiency of data double-way transmission.
2, adopt from verification, CSC verification randomly draw the new time slot sequence number that bit makes up generation, identical probability is very little.
Description of drawings
Fig. 1 is the topology diagram between GW2 and the CM_V in the prior art;
Fig. 2 is a time slicing and the method embodiment flow chart that conflicts and keep out of the way in the cable TV transmission network network of the present invention;
Fig. 3 is a time slicing structural representation of the present invention;
Fig. 4 is the present invention's back off algorithm principle schematic of conflicting.
Embodiment
The invention will be further described below in conjunction with the drawings and specific embodiments, but not as a limitation of the invention.
GW2 and CM_V adopt time slicing and seize slotted mode and carry out communication among the present invention.GW2 regularly sends broadcast data down to CM_V, and responds the reply data frame after receiving the Frame that CM_V sends.The total number that has comprised time slot width and time slot in the downlink broadcast frame, CM_V uploads data and gives GW2 in the time slot that allows to upload, data collision takes place after, employing is seized the mode that time slot sends Frame again by newly-generated time slot sequence number, substantially the possibility of having avoided data to collide once more, realized conflicting and kept out of the way, can reach very high accuracy, improved the efficient of data double-way transmission.
Referring to Fig. 2, the invention provides time slicing and the method for conflicting and keeping out of the way in a kind of cable TV transmission network network, the step below at first carrying out:
Step 101:GW2 at first carries out burst to the time, be divided into uplink information timeslice and downlink information timeslice in the time slicing, the uplink information timeslice is used for CM_V and sends Frame to GW2, and the downgoing time sheet is used for GW2 and sends broadcast frame and reply data frame to CM_V.
The included timeslot number of uplink information timeslice and downlink information timeslice can be provided with as required.For example, the uplink information timeslice is set comprises 4 time slots, the downlink information timeslice comprises 1 time slot, and then a timeslice includes 5 time slots altogether in the cycle; And be defined in each timeslice in the cycle, and initial is the downlink information timeslice, and then interior the 1st time slot of timeslice cycle is the downlink information timeslice, and 4 time slots in back are the uplink information timeslice, as shown in Figure 3.
Step 102:GW2 timed sending broadcast frame is given descending all CM_V that link to each other with it, has set each parameter of timeslice in the broadcast frame, and is as shown in table 1, wherein comprised parameters such as time slot width and the total number of time slot.
| Time slot width | The total number of time slot | The timeslot number synchronization character | Maximum is uploaded frame length | The other system configuration information | CM V hardware address | The transmitting power word | Growth data |
| 2Byte | 2Byte | 2Byte | 1Byte | 4Byte | 3Byte | 2Byte | 4Byte |
Table 1
Time slot width is meant each time slots width, for example, is made as 4ms, and referring to Fig. 3, then CM_V sends a Frame to GW2, and perhaps GW2 sends a broadcast frame/reply data frame to CM_V, all finishes within 4ms.The total number of time slot is meant and allows CM_V to seize the number of time slots of uploading Frame that the CM_V quantity that is connected according to GW2 reality is provided with usually.For example, suppose to connect 10 CM_V below the GW2, it is 10 that the total number of time slot then is set, and all CM_V select one of them time slot to send Frame to GW2 with preempt-mode.The timeslot number synchronization character is meant employed all time slot sequence numbers when GW2 allows CM_V upwards to send Frame, is generally a plurality of.
Carry out following steps then:
Step 103: referring to Fig. 4, domestic consumer's terminal STB1 (not drawing among the figure) sends up video request program information and other business information to CM_V1, and these business information are transferred to CM_V1 by existing communication protocol.
After step 104:CM_V1 receives the business information that STB1 sends, choose a time slot one time slot 2 in the timeslot number synchronization character of from the broadcast frame of receiving, stipulating according to fixing rule, seize and send the business information Frame to GW2.
After step 105:GW2 receives the Frame that CM_V1 sends, in the downgoing time sheet, send corresponding acknowledgement frame to CM_V1 through verification, analysis back, in the acknowledgement frame except that hardware address that comprises CM_V1 and the information such as data frame sequence number that receive, also comprise a sign, be used for expression whether to receive the correct data frame.For example, the correct data frame is received in 1 expression, and error data frame is received in 0 expression.
Step 106:CM_V1 regularly detects the acknowledgement frame of reception, and according to the sign in the acknowledgement frame, judges whether transmission last time is successful, if repeating transmission is then seized in success.Suppose that CM_V2 has also seized time slot 2 and upwards sent Frame, and data collision then takes place when CM_V1 sends Frame, so the algorithm that CM_V1 and CM_V2 need adopt conflict to keep out of the way comes the retransmission data frame, detailed process is as follows:
CM_V1 from the Frame that needs resend with verification and two bytes of CSC verification in, take out one or more bits at random, form a new time slot sequence number, seize this time slot then and resend Frame and give GW2.For example, choose a bit " 1 ", obtaining the time slot sequence number is 1, and then CM_V1 seizes time slot 1 and resends Frame.If CM_V2 chooses two bits " 1 ", the new time slot sequence number of composition is 3, and then CM_V2 seizes time slot 3 and resends Frame.Because CM_V1 is different with the new time slot sequence number that CM_V2 generates, therefore data collision can not take place once more.
Because the data of uplink information Frame have nothing in common with each other, and with verification and CSC verification very big difference is arranged also, and randomly draw bit, the probability that the new time slot sequence number of Zu Chenging is identical is minimum like this, thereby has avoided data collision once more.
Further, a threshold value can also be set, the number of times that restriction is retransmitted.For example, it is 5 that threshold value is set, and then a Frame sends 5 times does not continuously all have success, and CM_V can abandon this Frame.
Above-described embodiment, the present invention embodiment a kind of more preferably just, the common variation that those skilled in the art carries out in the technical solution of the present invention scope and replacing all should be included in protection scope of the present invention.
Claims (3)
1. the method that time slicing and conflict are kept out of the way in the cable TV transmission network network is characterized in that described method comprises:
Steps A: gateway GW2 carries out burst to the time, and regularly issue the broadcast frame that comprises the time slicing parameter and give all video request program cable modem CM_V that link to each other, described time slicing parameter comprises time slot width, the total number of time slot and timeslot number synchronization character, the total number of described time slot refers to allow CM_V to seize uploads the number of time slots of Frame, is to be provided with according to the CM_V quantity that GW2 reality is connected; Described GW2 sends acknowledgement frame to this CM_V after receiving the Frame that certain CM_V sends, comprise the hardware address of this CM_V and the data frame sequence number that receives in the described acknowledgement frame, comprise that also one is used for representing whether described GW2 receives the sign of correct data frame;
Step B: described CM_V regularly detects the acknowledgement frame that receives, and judge according to the sign in the acknowledgement frame that receives and to send whether success last time, if do not have, then from the Frame that needs resend with verification and two bytes of CSC verification in randomly draw one or more bits and make up, generate a new time slot sequence number, and seize time slot according to described new time slot sequence number and send described Frame.
2. the method that time slicing and conflict are kept out of the way in the cable TV transmission network network according to claim 1, it is characterized in that, described GW2 will be divided into up timeslice and downgoing time sheet the time, described GW2 sends broadcast frame to all CM_V that link to each other in described downgoing time sheet, and to described CM_V transmission acknowledgement frame, described CM_V sends Frame to described GW2 in described up timeslice.
3. the method that time slicing and conflict are kept out of the way in the cable TV transmission network network according to claim 1, it is characterized in that the Frame that GW2 receives described in the described steps A is to seize a time slot in the timeslot number synchronization character of described CM_V from the broadcast frame of receiving to send.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610144313XA CN101193258B (en) | 2006-12-01 | 2006-12-01 | Time slice and confliction avoidance method in CATV network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610144313XA CN101193258B (en) | 2006-12-01 | 2006-12-01 | Time slice and confliction avoidance method in CATV network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101193258A CN101193258A (en) | 2008-06-04 |
| CN101193258B true CN101193258B (en) | 2011-04-06 |
Family
ID=39487962
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200610144313XA Active CN101193258B (en) | 2006-12-01 | 2006-12-01 | Time slice and confliction avoidance method in CATV network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101193258B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103927364B (en) * | 2014-04-18 | 2017-03-01 | 苏州科达科技股份有限公司 | A kind of storage method of video frequency abstract data, system and display systems |
| CN109586851B (en) * | 2018-11-28 | 2022-02-08 | 视联动力信息技术股份有限公司 | Data transmission method and device based on video network |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1165602A (en) * | 1995-08-09 | 1997-11-19 | 菲利浦电子有限公司 | Transmission control method between a plurality of stations and corresponding stations and communication systems |
| CN1189744A (en) * | 1996-10-22 | 1998-08-05 | Lg电子株式会社 | Dynamic search tree for resolution of contention between transmitting stations |
| US5930475A (en) * | 1995-11-28 | 1999-07-27 | Pioneer Eectronics Corporation | CATV communication system, method of communication by the same, and center and terminal devices thereof |
| CN1272981A (en) * | 1997-04-11 | 2000-11-08 | 伍伟铮 | Method and device for reserving resources one or more multiple access communication channels |
| CN1459976A (en) * | 2002-05-16 | 2003-12-03 | 广威网讯股份有限公司 | Video image converter host machine time slot distribution system and its method |
| CN1543214A (en) * | 2003-04-29 | 2004-11-03 | 电子科技大学 | A collision resolving algorithm supporting priority for CATV network |
| CN1764264A (en) * | 2004-10-18 | 2006-04-26 | 三星电子株式会社 | Method in open cable digital broadcasting system and this system |
-
2006
- 2006-12-01 CN CN200610144313XA patent/CN101193258B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1165602A (en) * | 1995-08-09 | 1997-11-19 | 菲利浦电子有限公司 | Transmission control method between a plurality of stations and corresponding stations and communication systems |
| US5930475A (en) * | 1995-11-28 | 1999-07-27 | Pioneer Eectronics Corporation | CATV communication system, method of communication by the same, and center and terminal devices thereof |
| CN1189744A (en) * | 1996-10-22 | 1998-08-05 | Lg电子株式会社 | Dynamic search tree for resolution of contention between transmitting stations |
| CN1272981A (en) * | 1997-04-11 | 2000-11-08 | 伍伟铮 | Method and device for reserving resources one or more multiple access communication channels |
| CN1459976A (en) * | 2002-05-16 | 2003-12-03 | 广威网讯股份有限公司 | Video image converter host machine time slot distribution system and its method |
| CN1543214A (en) * | 2003-04-29 | 2004-11-03 | 电子科技大学 | A collision resolving algorithm supporting priority for CATV network |
| CN1764264A (en) * | 2004-10-18 | 2006-04-26 | 三星电子株式会社 | Method in open cable digital broadcasting system and this system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101193258A (en) | 2008-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101877672B (en) | System and method for retransmitting packets over a network of communication channels | |
| CN102210118B (en) | A method of data rate adaptation for multicast communication | |
| US5734833A (en) | Shared communications channel with enhanced reservation and collision resolution protocols allows any subset of stations to transmit data after collision occured in contention slot | |
| US9826492B2 (en) | Wireless communication apparatus | |
| CN101521586B (en) | Multicast method in wireless local area network | |
| KR100935976B1 (en) | Method of transmitting data to multi destinations in wireless lan system | |
| CN101459973B (en) | Wireless communication apparatus and wireless communication method | |
| CN102187621B (en) | Method to improve channel utilization in a time division multiple access based protocol | |
| CN101663861B (en) | Frequency scanning to form a communication network | |
| CN101438515A (en) | Method and system for reliable broadcast or multicast communication in wireless networks | |
| CN102369521A (en) | Managing transmissions among nodes communicating over a shared communication medium | |
| CN107211323A (en) | System and method for transmitting data in WLAN multi-user transmission chance | |
| Bao et al. | Performance analysis of reliable MAC-layer multicast for IEEE 802.11 wireless LANs | |
| CN101193258B (en) | Time slice and confliction avoidance method in CATV network | |
| CN101431510B (en) | Multicast method in wireless local area network | |
| CN108347788B (en) | Data concurrent transmission method based on Slotted-FAMA protocol and utilizing propagation delay | |
| EP2015472B1 (en) | Methods of data transmission by relay nodes in a synchronous communications network, corresponding reception method, computer program product, storage means and nodes. | |
| US20180042049A1 (en) | Multi-destination burst protocol | |
| CN106961696B (en) | Avoidable grouping method for hidden terminals of wireless local area network | |
| CN107071925B (en) | A kind of broadcast channel method for reliable transmission under CSMA/CA mechanism | |
| EP2178236A1 (en) | Method and apparatus of communication using adjustable group acknowledgement protocol | |
| CN102714874A (en) | Communication system and communication method | |
| CN112888081B (en) | Multiple access method based on fast feedback mechanism | |
| Kim et al. | Reliable wireless multicasting with minimum overheads in OFDM-based WLANs | |
| Kim et al. | Reliable multicast MAC protocol for wireless ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: BEIJING ORIENT VIEW TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: BEIJING ORIENTAL GUANGSHI SCIENCE AND TECHNOLOGY LIMITED LIABILITY COMPANY Effective date: 20100324 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 102206 SHAHE QILIQU INDUSTRIAL PARK DISTRICT, CHANGPING DISTRICT, BEIJING CITY TO: 102206 NO.7, LIYE ROAD, BEIJING INTERNATIONAL INFORMATION INDUSTRY BASE, HUILONGGUAN, CHANGPING DISTRICT, BEIJING CITY |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20100324 Address after: 102206, No. 7, Liye Road, Huilongguan international information industry base, Changping District, Beijing, Beijing Applicant after: Beijing Orient View Technology Co., Ltd. Address before: 102206 Beijing City, Changping District Shahe qiliqu Industrial Park Applicant before: Beijing OrientView Technology Ltd. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |