• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.11A
• /
• pp.1630-1641
• /
• 2000

본 논문은 셀룰러 시스템 상향 링크에서 음성데이터 및 실시간 영상데이터로 구성된 화상전화서비스, 고속 및 저속 데이터베이스의 다중 전송률 멀티미디어 서비스를 통합 지원할수 있는 CDMA R-ALOHA 프로토콜을 제안하였다. 제안된 프로토콜은 액세스슬롯과 전송슬롯으로 구분된 프레임의 구조를 이용한 코드할당 방식으로 전송슬롯에서의 간섭을 줄였다. 그리고, 각 서비스의 트래픽 특성에 따른 전송코드 예약과 화상전화서비스 사용자의 핸드오프호를 고려하여 분석된 각 서비스 부시스템의 Markov-chain 모델을 이용한 각 서비스의 채널 경쟁 사용자수 추정을 기반으로 서비스별 액세스 허용확률을 제안하여, 액세스슬롯에서의 패킷 충돌을 감소시키고 핸드오프호의 우선권을 보장할 수있다. 또한 화상전화서비스의 영상데이터 전송정보를 이용한 코드 예약방식을 제안하여, 음성 트래픽을 패킷의 손실이 없이 지원하였고 고속 및 저속 데이터베이스를 통해 채널 이용효율을 극대화하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.684-690
• /
• 2003

In this paper, a contention-based reservation access control algorithm and a slot allocation algorithm are proposed for non-real-time bursty traffic services in the wireless ATM networks. In order to reduce the collisions of the reservation request packets, the base station scheduler calculates the transmission probability using the number of RAS minislots and the estimated load of the reservation request packets. And it broadcasts the calculated transmission probability over the downlink control channel. Mobile terminals, which have traffic burst, select randomly a RAS minislot and transmit the reservation request packet by the received transmission probability. The reservation request packet contains the number of packets in the buffer. The slot allocation is based on the buffer status of the received reservation request packets. The base station scheduler allocates slots in proportion to the total number of slots that are requested by each terminal.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.117-120
• /
• 2001

In this paper, a contention-based reservation MAC protocol is proposed for non-real-time bursty traffic services in the wireless ATM networks. In order to reduce the collisions of the reservation request packets, the base station scheduler calculates the transmission probability using the number of RAS minislots and the estimated load of the reservation request packets. And it broadcasts the calculated transmission probability through the downlink control channel. Mobile terminals, which have a traffic burst, select randomly a RAS minislot and transmit the reservation request packet with the received transmission probability. The reservation request packet contains the number of packets in the buffer. The base station allocates slots based on the buffer status of the received reservation request packets.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.604-607
• /
• 2013

A handoff call require more high QoS than that of a new call to satisfy continuity of communication on cellular networks. In case of a handoff call, after start connection of communication, the handoff call moves among cells. Therefore, Blocking of handoff call provides more bad service to respect to user. In this paper, we propose a 3 states guard channel schem to provide a stable environment of communication for a handoff call. The proposed scheme assigns the number of usable channels discriminatorily by distinguishing between of a new call and a handoff call. This scheme can reduce a handoff call blocking probability and improvement QoS of cellular networks. In this scheme, a handoff call classify by a partial handoff call and a full handoff call according to their handoff probability otherwise known as a previous guard scheme.

• Journal of Digital Contents Society
• /
• v.13 no.2
• /
• pp.197-203
• /
• 2012

Although the increase in number of the programs provides rich entertainment to viewers, it also has caused a negative of making it hard for viewers to find out their favorite programs. To address the problem, several researches have been performed mainly focusing on the technologies to analyze a viewer's TV watching-patterns and to recommend a program (or a channel) based on the analysis when a viewer changes channels. The researches, however, have the trouble of frequently failing to choose proper programs because, in the real-world broadcasting circumstance, the programs are re-broadcast over a number of the channels and a set of programs of a genre are usually playing in the overlapped times. To avoid the trouble, the data service, proposed in the paper, allows a viewer to book "explicitly" his/her favorite programs and provides a set of functions of listing up the booked program's broadcasting schedules and reserving viewing or recording the booked programs.

• Journal of Advanced Navigation Technology
• /
• v.19 no.4
• /
• pp.318-322
• /
• 2015

In wireless communication networks, most of the prediction techniques are used for predicting the amount of resource required by user's calls for improving their demanding quality of service. However, we propose a channel allocation scheme based on predicting the resources of white spectrum holes for improving the QoS of rental user's spectrum handoff calls for cognitive radio networks in this paper. This method is supported by Wiener predictor to predict the amount of white spectrum holes of license user's free spectrum resources. We classify rental user's calls into initial calls and spectrum handoff calls, and some portion of predicted spectrum-hole resources is reserved for spectrum handoff calls' priority allocation. Simulations show that the performance of the proposed scheme outperforms in spectrum handoff call's dropping rate than an existing method without spectrum hole prediction(11% average improvement in 50% reservation).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.514-524
• /
• 2005

In optical burst switching(OBS) networks, the ingress edge router assembles packets in the same class queue into the appropriate size of burst. A burst control packet(BCP) is generated for channel reservation of corresponding data burst and sent earlier than the corresponding data burst with an offset time. Offset time is determined considering the number of hops from source to destination and the required quality of service(QoS). After offset time, the burst data is passed through tile pre-configured optical switches without any O/E/O conversion. But a failure in OBS networks may lead to the loss of bursts until the ingress nodes receive the failure indication signal. This results in a significant degradation in QoS. Therefore, in this paper, we propose a fault-tolerant node architecture based on sub-carrier multiplexing to reduce the effects of failure in OBS networks. The Performance of the proposed fault-tolerant node architecture exhibits considerable improvement as compared with the previous ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.296-304
• /
• 2005

ATCoP(Abnormal traffic controller based on prediction) is presented to securely support reliable Internet service and to guarantee network survivability, which is deployed in Internet access point. ATCoP is a method to control abnormal traffic that is entering into the network When unknown attack generates excessive traffic, service survivability is guaranteed by giving the priority to normal traffic than abnormal traffic, that is reserving some channels for normal traffic. If the reserved channel number increases, abnormal traffic has lower quality service by ATCoP system and then its service survivability becomes worse. As an analytic result, the proposed scheme maintains the blocking probability of normal traffic on the predefined level in the specific interval of input traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9A
• /
• pp.1601-1608
• /
• 2001

본 논문에서는 무선 ATM 환경에서 음성과 같은 실시간 서비스가 요구되는 트래픽의 QoS를 보장하기 위한 구현 방법을 제안하였다. 음성은 셀이 발생되는 토크스퍼트 구간과 셀이 발생되지 않는 휴지구간이 주기적으로 반복되는 특성을 갖는다. 따라서 음성과 같은 실시간 서비스의 QoS를 보장하기 위해서는 휴지구간 상태에 있는 음성단말의 수와 음성단말의 상태를 고려하여 음성단말의 수에 관계없이 일정한 QoS를 보장할 수 있어야 한다. 음성단말의 수에 관계없이 일정한 연결 지연시간을 제공하기 위하여, 휴지 상태에 있는 음성 단말 수와 휴지 상태의 지속시간에 따라서 동적으로 음성 예약 슬롯을 할당하는 방식을 제안한다. 컴퓨터 시뮬레이션을 통하여 slotted-ALOHA나 NC-PRMA 같은 기존의 슬롯 할당방법과 비교하였으며, 그 결과 제안된 방법이 동적으로 예약슬롯을 할당하여 부하에 관계없이 음성 트래픽에 일정한 지연시간과 낮은 충돌율을 제공하면서 프레임에 예약슬롯의 오버헤드를 최소화하므로, 채널 사용 효율을 높일 수 있음을 알 수 있었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.155-158
• /
• 2001

본 논문은 주문형 서비스의 한 분야로서 부족한 네트워크 자원을 고갈시키지 않을 뿐만 아니라 서버의 부하를 크게 경감시켜 MOD의 성능을 최대화시켜 효율적인 노래방 서비스를 위한 새로운 프락시 캐슁을 제안한다. 제안된 프락시 캐슁 구조는 일반적인 unicast 전송으로 멀티미디어 데이터를 서비스 받고 동시에 요청된 데이터가 다른 종단노드(HEN)에 이미 캐슁 되어 있을 경우 후 순위 예약 곡들을 그 종단노드(HEN)로부터 데이터를 전송 받아 스위칭 에이전트(SA)의 스위칭 테이블을 통해 미리 디스크에 저장하여 unicast 채널의 서비스 종료된 다음 후 순위 예약 곡을 서비스 받는 방법을 사용한다. 제안된 분산 프락시 캐슁은 예약 곡목이 많을수록 서버 부하와 과도한 네트워크 트래픽으로 인한 병목현상으로 인한 지연을 크게 감소시킬 수 있고, 시뮬레이션을 통해 성능의 우수함을 확인하였다.