• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1609-1612
• /
• 2000

무선망에서 기존의 회선 서비스뿐만 아니라 패킷 서비스 및 영상 서비스 등을 수용하는 데 있어서 고려되어야 할 것들 중 하나는 무선 자원의 활용이다. 특히 패킷 서비스의 경우 가변적인 패킷의 길이와 양으로 효율적인 무선 자원관리를 어렵게 하는 요소를 지니고 있다. 즉, 무선 자원을 효율적으로 운용하기 위해서는 동적인 무선 자원할당 메커니즘이 중요한 역할을 한다. UMTS 표준 문서에서는 계층 2 전송 프로토콜인 RLC (Radio Link Control) 버퍼의 양만을 측정하여 무선 자원 할당이 제어가 되도록 권고하고 있다. 하지만 트래픽 양의 변화가 큰 VBR 트래픽의 경우, 이와 같은 방법은 갑자기 증가하거나 감소하는 트래픽 양에 적응하기 힘들고 이는 무선 자원의 효율성을 저하시키며, QoS 제공도 어렵다. 본 논문에서는 먼저 트래픽 특성을 알 수 있는 토큰 버켓 모델을 RLC에 적용하고, 동적 무선 자원 할당을 위해 RLC 버퍼의 양뿐만 아니라 예상되는 유입 트래픽 양을 측정 및 보고하는 메커니즘을 제안한다.

• Journal of Internet Computing and Services
• /
• v.4 no.5
• /
• pp.61-68
• /
• 2003

In this paper, we propose a wireless MAC protocol named APRMA, which is capable of supporting the ABR type data service and Maximizing channel utilization. Data terminals with random data packets are not provided slot reservation with PRMA protocol. That is, slot reservation is applicable to the time constraint voice packet exclusively. But the reservation scheme have to be performed for loss sensitive data packet, and contended their quality of service, Therefore, in wireless MAC, reservation technique has to be used for both voice and data services. So the terminal which wants to request for ABR type service, is allocated a minimum bandwidth from system for the first time, If the system have some extra available bandwidth, ABR terminals would acquire additional bandwidth slot by slot, As a result, APRMA protocol can support the data service with loss sensitivity and maintain their channel utilization high.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.1
• /
• pp.53-63
• /
• 1999

ATM 네트워크에서 다양한 트래픽을 특성과 QoS 요구사항을 갖는 멀티미디어 서비스의 종단간 품질을 만족시키면서 망 자원을 효율적으로 이용하기 위해서는 가상경로(virtual path : VP) 의 적절한 배치 및 대역 할당을 통한 논리적 망의 구성, 호 접속 시의 종적 경로 설정, 그리고 그와 연계된 효율적인 동적 대역 관리가 필수적으로 요구된다. 본 논문에서는 새로운 호가 시도될 때 논리적 망의 설계에서 설정된 가상경로의 대역으로 호의 품질 요구사항을 만족 시킬수 없거나 또는 미리 설정해 놓은 가상경로연결(VP Connection) 이 존재하지 않을 경우에 물리적 링크의 잔여용량을 기반으로 적절한 가상경로를 선택하여 용량을 재조정하기 위한 최적 관리 모델로서 MHR (Minimum Hop Route), MCR(Maximum Capacity Route), 그리고 MRCR (MaxMin Residual Capacity Route)방식을 제안하고 이에 대한 최적화 정식을 제안하였다. 제안된 각 최적화 모델에 대한 해를 노드의 수가 m인 네트워크에서 O(m2)의 복잡도로 구할 수 있는 알고리즘을 제시하고 시뮬레이션을 통해 제안된 최적화 모델이 망의 성능에 미치는 영향을 평균 호 차단률 평균 이용 링크의 수 , 그리고 노드 쌍간의 호 차단률의 분산등에 의해 망 운용의 효율성과 공평성등을 비교분석하였다.

• Journal of Internet Computing and Services
• /
• v.23 no.2
• /
• pp.1-7
• /
• 2022

Machine learning (ML) algorithms have been intended to seamlessly collaborate for enabling intelligent networking in terms of massive service differentiation, prediction, and provides high-accuracy recommendation systems. Mobile edge computing (MEC) servers are located close to the edge networks to overcome the responsibility for massive requests from user devices and perform local service offloading. Moreover, there are required lightweight methods for handling real-time Internet of Things (IoT) communication perspectives, especially for ultra-reliable low-latency communication (URLLC) and optimal resource utilization. To overcome the abovementioned issues, this paper proposed an intelligent scheme for traffic steering based on the integration of MEC and lightweight ML, namely support vector machine (SVM) for effectively routing for lightweight and resource constraint networks. The scheme provides dynamic resource handling for the real-time IoT user systems based on the awareness of obvious network statues. The system evaluations were conducted by utillizing computer software simulations, and the proposed approach is remarkably outperformed the conventional schemes in terms of significant QoS metrics, including communication latency, reliability, and communication throughput.

• The KIPS Transactions:PartC
• /
• v.15C no.5
• /
• pp.391-398
• /
• 2008

To provide IPTV service over mobile networks, the mechanism that reduce packet loss and interrupt of multimedia service during the handover should be supported. Especially, buffering based mechanism is preferable for supporting IPTV services in the way of preserving streaming service using stored data and recovering non-received data after handover. But previous research doesn't consider the buffer allocation for applying various environments which can change handover time or end to end delay of relay node. This paper propose DBAHAJ mechanism that optimize buffer size of mobile nodes and relay node for supporting seamless IPTV service over mobile environments. Mobile node determines buffer size by checking handover time and maximum difference of sequence to keep playing video data. And multicast agent recovers packet loss during the handover by sending buffered data. By these two procedure, node supports seamless IPTV service on mobile networks. We confirm performance of this mechanism on NS-2 simulator.

• Journal of Korea Society of Industrial Information Systems
• /
• v.19 no.2
• /
• pp.1-13
• /
• 2014

In IEEE 802.11p/1609-based vehicular networks, vehicles are allowed to exchange safety and control messages only within time periods, called control channel (CCH) interval, which are scheduled periodically. Currently, the length of the CCH interval is set to the fixed value (i.e. 50ms). However, the fixed-length intervals cannot be effective for dynamically changing traffic load. Hence, some protocols have been recently proposed to support variable-length CCH intervals in order to improve channel utilization. In existing protocols, the CCH interval is subdivided into safety and non-safety intervals, and the length of each interval is dynamically adjusted to accommodate the estimated traffic load. However, they do not consider the presence of hidden nodes. Consequently, messages transmitted in each interval are likely to overlap with simultaneous transmissions (i.e. interference) from hidden nodes. Particularly, life-critical safety messages which are exchanged within the safety interval can be unreliably delivered due to such interference, which deteriorates QoS of safety applications such as cooperative collision warning. In this paper, we therefore propose a new interference-aware Dynamic Safety Interval (DSI) protocol. DSI calculates the number of vehicles sharing the channel with the consideration of hidden nodes. The safety interval is derived based on the measured number of vehicles. From simulation study using the ns-2, we verified that DSI outperforms the existing protocols in terms of various metrics such as broadcast delivery ration, collision probability and safety message delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.406-415
• /
• 2005

The standards which use shared medium like IEEE 802.11 wireless LAN have transmission opportunity by contention in contention period. If there are collisions in contention period, medium access control protocol may solve problem by using backoff algorithm. Backoff algorithm is important part in medium access control, but legacy backoff method which is used under IEEE 802.11 standards is not adjusted when load is heavy because of increasing collisions. In this paper, we propose a new load-based dynamic backoff algorithm in contention-based wireless shared medium to improve throughput of medium and to reduce the number of collisions. Proposed backoff algorithm can increase the network utilization about $20\%$ higher than that of binary exponential backoff algorithm.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.805-814
• /
• 2001

In this paper, we propose a new scheduling algorithm that guarantees the delay property of real-time traffic, not considered in previous DWRR(Dynamic Weighted Round Robin) algorithm and also transmits non-real-time traffic efficiently. The proposed scheduling algorithm is a variation of DWRR algorithm to guarantee the delay property of real-time traffic by adding cell transmission method based on delay priority. It also uses the threshold to prevent the cell loss of non-real-time traffic due to cell transmission method based on delay priority. Proposed scheduling algorithm may increase some complexity over conventional DWRR scheme because of cell transmission method based on delay priority. However, the consideration of delay priority can minimize cell delay and require less size of temporary buffer. Also, the results of our performance study shows that the proposed scheduling algorithm has better performance than conventional DWRR scheme due to reliable ABR service and congestion avoidance capacity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.886-895
• /
• 2005

As the networked media technology have been grown in recent, there have been many research works to deliver high-quality video such as HDV and HDTV over the Internet. To realize high-quality media service over the Internet, however, the network adaptive streaming scheme is required to adopt to the dynamic fluctuation of underlying networks. In this paper, we design and implement the network-adaptive HD(high definition) MPEG-2 streaming system employing the frame-based prioritized packetization. Delivered video is inputted from the JVC HDV camera to the streaming sewer in real-time. It has a bit-rate of 19.2 Mbps and is multiplexed to the MPEG-2 TS (MPEG-2 MP@HL). For the monitoring of network status, the packet loss rate and the average jitter are measured by using parsing of RTP packet header in the streaming client and they are sent to the streaming server periodically The network adaptation manager in the streaming server estimates the current network status from feedback packets and adaptively adjusts the sending rate by frame dropping. For this, we propose the real-time parsing and the frame-based prioritized packetization of the TS packet. The proposed system is implemented in software and evaluated over the LAN testbed. The experimental results show that the proposed system can enhance the end-to-end QoS of HD video streaming over the best-effort network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.3
• /
• pp.929-946
• /
• 2022

Free viewpoint video (FVV) service is an immersive media service that allows a user to watch it from a desired location or viewpoint. It is composed of various forms according to the direction of the viewpoint of the provided video, and includes zoom in/out in the service. As consumers' demand for active watching is increasing, the importance of FVV services is expected to grow gradually. However, additional considerations are needed to seamlessly stream FVV service. FVV includes a plurality of videos, video changes may occur frequently due to movement of the viewpoint. Frequent occurrence of video switching or re-request another video can cause service delay and it also can lower user's quality of service (QoS). In this case, we assumed that if a video showing an object that the user wants to watch is selected and provided, it is highly likely to meet the needs of the viewer. In particular, it is important to provide an object-oriented FVV service when zooming in. When video zooming in in the usual way, it cannot be guaranteed to zoom in around the object. Zoom function does not consider about video viewing. It only considers the viewing screen size and it crop the video view as fixed screen location. To solve this problem, we propose a zoom in/out method of object-centered dynamic adaptive streaming of FVV in this paper. Through the method proposed in this paper, users can enjoy the optimal video service because they are provided with the desired object-based video.