• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.8-18
• /
• 2009

CableLAB published DOCSIS 3.0 Specifications to supply broadband access to homes and small businesses. The primary technique of DOCSIS 3.0 Specification is channel bonding which provides cable operators with a flexible way to significantly increase up/downstream speeds. In this paper, we propose the upstream scheduler that serves channel bonding. Proposed scheduler consists of two sub-scheduler: bonding group scheduler and channel scheduler. Also, we propose three scheduling algorithms to allocate request bandwidth of CM to each bonding channel: equivalent scheduling algorithm, current request-based scheduling algorithm, and last grant-based scheduling algorithm. In order to evaluate the performance of these algorithms and DOCSIS 3.0 MAC protocol, we develop the DOCSIS 3.0 simulator with the network simulator, OPNET, to model DOCSIS network, CMTS, and CM. Our results show that equivalent scheduling algorithm is superior to others in the view of transmission delay and throughput and DOCSIS 3.0 protocol provides higher throughput than pre-DOCSIS 3.0 protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.65-68
• /
• 2007

DOCSIS 3.0 MAC protocol regulate CM and CMTS Channel transfer times through MAP message. Standards does not include the details of MAP Inter-arrival Time affecting the performance of MAC protocols for DOCSIS 3.0. In this paper, we evaluationed the performance of protocol follow in MAP Inter-arrival Time on DOCSIS 3.0. Based on the evaluation results, we propose the optimal MAP Inter-arrival Time. We found that the protocol shows best performance when the MAP Inter-arrival Time is 0.05sec. The research results can apply to performance element which important for the construction of DOCSIS 3.0 base cable networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1069-1076
• /
• 2007

DOCSIS 3.0 protocol are proposed to support high-speed cable network DOCSIS 3.0 MAC protocol regulates CM and CMTS channel transfer times through MAP message. So MAP Inter-arrival time is primary factor of network performance. However, standards does not include the details of MAP Inter-arrival Time affecting the performance of MAC protocols for DOCSIS 3.0. In this paper, we evaluated the performance of DOCSIS 3.0 protocol follow in MAP Inter-arrival Time. Based on the evaluation results, we propose the optimal MAP Inter-arrival Time. We found that the protocol shows best performance when the MAP Inter-arrival Time is 0.05sec. The research results can apply to performance element which important for the construction of DOCSIS 3.0 base cable networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.69-72
• /
• 2007

DOCSIS 3.0 Protocol is proposed to make the advance of HFC network. In the DOCSIS based network, the upstream frame is divided into contention section reservation section. CMs to have packets send request messages through the contention section. That two or more CMs sends Request message at the same contention slot makes collison. In this paper, are propose the contention section establlish at algorithm considering of channel-bonding mechanism that is the primary technique of DOCSIS 3.0. Results of simulation display better performance int the number of contention slots and the utilization of contention section.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.21-27
• /
• 2008

In this paper, we design and implement the upstream packet bandwidth allocation algorithm on OPNET-based DOCSIS 3.0 simulator including channel-bonding CM (Cable Modem)s. Previous DOCSIS CM could not support channel bonding, it has problem in upstream bandwidth allocation and determine the contention area. The proposed upstream bandwidth allocation algorithm has been improved the queuing time and success rate. For the simulation, we design the MAC frame structure with channel bonding supported CM and not. And then, this paper design and implement the CMTS node model, CM node model, CMTS process model, and CM process model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1142-1150
• /
• 2009

In this paper, we propose an novel bandwidth scheduling algorithm for the MAC protocol employed by the Data Over Cable Service Interface Specifications (DOCSIS) 3.0 compliant cable networks. The proposed algorithm statistically improves the chances of request piggybacking to minimize the access delay. It utilizes the piggyback request feature of the segment packets that has been newly specified in DCOSIS 3.0. In DOCSIS 3.0, a bandwidth request can be granted to several upstream channels within an upstream bonding group. The grant on each individual channel is treated as a segment packet. We find the optimal segment placement to minimize the access delay in the proposed algorithm. We also use a self-similar traffic model for simulation and analysis to evaluate the performance of the proposed algorithm.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.3 no.4
• /
• pp.207-217
• /
• 2008

A novel scheme is presented for Traffic Encryption Key (TEK) rekeying with low communication overhead for an Internet Protocol television (IPTV) conditional access system over Data-Over-Cable Service Interface Specifications (DOCSIS) 3.0. The proposed scheme utilizes the DOCSIS system synchronization for periodic TEK rekeying instead of a conventional TEK rekeying negotiation process. Analysis shows that the communication overhead is only 0.012 Kbps when TEK rekeying frequency is 1 second.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.77-80
• /
• 2008

본 논문에서는 채널 결합 기법을 고려하여 DOCSIS 3.0 망에서 상향스트림 스케줄러를 설계하고 스케줄링 알고리즘을 제안하였다. 본 논문에서 제안하는 스케줄러는 Bonding Process Module, QoS Service Classifier, Upstream Scheduler, Framing Module 등으로 구성된다. 결합 채널에 대한 대역을 할당하기 위해 균등요구대역 할당알고리즘, 현재 요구대역할당을 고려한 요구대역 할당알고리즘, 이전 MAP의 대역 할당 정보를 고려한 요구대역 할당알고리즘을 제안하였다. 제안한 스케줄러 및 스케줄링 알고리즘의 성능을 비교평가하기 위해 OPNET 기반의 DOCSIS 3.0 시뮬레이션 모델을 개발하고, 시뮬레이션을 수행하였다. 성능평가 결과 CM에서 큐잉 지연과 CMTS에서 데이터 수신량 관점에서 균등요구할당 알고리즘이 우수한 성능을 나타냄을 확인할 수 있었다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.459-461
• /
• 2011

본 논문에서는 data over cable service interface specifications (DOCSIS) 3.0 상향 케이블 모뎀에서 프리앰블을 이용하여 주파수 옵셋을 추정하고 보상하는 알고리즘에 대해 설명한다. 또한 본 논문에서 설명한 알고리즘을 적용한 컴퓨터 모의실험 결과를 보여준다. 송수신기에서 사용하는 오실레이터의 주파수 차이에 의해 주파수 옵셋이 발생하며 이를 얼마나 정확히 추정하여 보상하는가에 의해 수신기의 성능이 좌우된다. DOSCIS 3.0 상향 케이블 모뎀의 패킷 구조는 수신기에서 타이밍 동기나 주파수 옵셋 보상 그리고 채널 등화를 용이하게 하기 위해 송수신기간에 알고 있는 시퀀스를 보내는 프리앰블과 사용자 데이터를 보내는 페이로드로 구성된다. 본 논문에서는 여러 개의 constant amplitude zero autocorrelation (CAZAC) 시퀀스를 프리앰블로 사용하였으며 이 CAZAC 시퀀스를 이용하여 주파수 옵셋을 추정하고 보상하였다.

• Journal of Digital Convergence
• /
• v.14 no.10
• /
• pp.261-269
• /
• 2016

This paper aims to propose a novel technology of network convergence to provide ultra high speed internet services over CATV networks, by which a CMC(cable modem concentrator) and CM(cable modem) of 1Gbps level are designed. This technology not only lowers the production cost in comparison to the existing bonding technology with DOCSIS specification but also enables the adjustment of data speed based on the channel bandwidth. According to the experiments, when convolutional code rate with 128QAM is changed to 1/2, 2/3, 3/4 and 7/8, the data recorded the maximum transmission speed of up to 299 Mbps at the zero error rate. As the convolutional code rates with 256QAM is increased, it showed 334Mbps at the error rate of $10^{-5}$. Based on the findings of this paper, if we secure the channel bandwidth of 200MHz and adjust the modulation order of QAM and the convolution code rate depending on the channel status, we can get the transmission speed of more than 1Gbps, which is much more competitive in its function and price than the existing technology based on DOCSIS.