• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.331-335
• /
• 2007

방송과 초고속인터넷 서비스를 동시에 제공할 수 있는 HFC(Hybrid Fiber Coaxial) 망은 상/하향이 비대칭 구조이며, 하향속도에 비해 상향속도가 1/10 수준이어서 상향 트래픽이 과다하게 생성될 경우 인터넷속도 지연이 발생한다. 지연에 민감한 VoIP 서비스의 품질보장 방안으로는, DOCSIS(Data Over Cable System Interface Specification) 1.1 기반의 상향 스케쥴링 기능을 이 용한 VoCM(Voice Over Cable Modem)이 있다. 그러나 별도의 VoCM을 사용해야 하며 아날로그 전화기를 사용해 IP 기반의 VoIP 단말을 사용할 수 없다는 단점이 있다. 일반 CM(Cable Modem)에 DOCSIS 1.1 Config File을 이용하여 VoIP 품질을 보장할 경우 별도의 트래픽 대역을 항상 점유해야 하는 단점이 있다. 이에, 본 논문에서는 효율적 대역폭 이용과 단말장비에 종속적이지 않은 방안을 제안하고 일반 CM을 통한 유무선 환경하에서 Dynamic QoS(Quality Of Service)를 제공할 수 있는 PCMM(Packet Cable MultiMedia) 적용 방안 및 시험결과에 대해 고찰하고자 한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.1
• /
• pp.59-65
• /
• 2007

HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Service), nrtPS(non-real time Polling Service), and BE (Best Effort) under different QoS (Quality of Service) requirements and limited wireless channel resources, efficient packet scheduling mechanisms are necessary to increase the utilization of channels as well as to satisfy the various QoS requirements. This study regards the traffic data to be served as time series and proposes a new packet scheduling algorithm based on the nonparametric statistical test. The performance of the newly proposed algorithm is evaluated through the simulation analysis using a simulator that can evaluate the performance of packet scheduling mechanisms under various values of system parameters and measures such as packet delay time, data transmission rate, number of loss packets, and channel utilization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4287-4306
• /
• 2016

Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1006-1022
• /
• 2010

In this paper, a cross-layer resource allocation mechanism is proposed for wireless multimedia service. In particular, a game theory based on quality of service (QoS) for multimedia users is introduced to deal with the fairness of network resource allocation in wireless networks. Moreover, the channel states of wireless users are additionally regarded under the cross-layer design in WiMAX environment. In details, the bargaining solution is adopted to discover the efficient and fair resource allocation strategy for multimedia service in considering QoS in the peak signal-to-noise ratio (PSNR) and the channel states in the carrier-to-interface ratio (CINR). The proposed mechanism is illustrated and evaluated by simulation results of transmitting video sequences in WiMAX environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10B
• /
• pp.660-668
• /
• 2005

Recently, the Internet-based communication method has been adopted as an open networking solution in the field of remote control and data acquisition. In the current Internet, most networking applications are developed according to the client-server approach. In this paper, we propose an innovative Device Configuration Protocol (DCP) that exchanges the traditional role between client and server to provide a uniform device interface over the Internet for various field devices. The proposed protocol is implemented as an application-level protocol running on top of the standard TCP/IP protocols. Also, the DCP protocol is extended with real-time processing to work with the FlowLabel of IPv6 for QoS (Quality of Service) support. The simulation results show that the real-time packets can be processed prior to the given deadline regardless of throughput, as compared to the normal packets.

• Journal of Information Processing Systems
• /
• v.5 no.1
• /
• pp.25-32
• /
• 2009

It is absolutely essential to implement advanced IP network technologies such as QoS, Multicast, High Availability, and Security in order to provide real-time services like IPTV via IP backbone network. In reality, the existing commercial networks of internet service providers are subject to certain technical difficulties and limitations in embodying those technologies. On-going research efforts involve the experimental engineering works and implementation experience to trigger IPTV service on the premium-level IP backbone which has recently been developed. This paper introduces the core network technologies that will enable the deployment of a high-quality IPTV service, and then proposes a suitable methodology for application and deployment policies on each technology to lead the establishment and globalization of the IPTV service.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.10
• /
• pp.40-46
• /
• 2009

Recently CAN (Controller Area Network) is widely used as an in-vehicle networking protocol for intelligent vehicle. The identifier field (ID) of CAN is used not only to differentiate the messages but also to give different priorities to access the bus. This paper presents a dynamic 10 allocation algorithm in order to enhance the real-time quality-of-service (QoS) performance. When the network traffic is increased, this algorithm can allocate a network resource to lower priority message without degradation of the real-time QoS performance of higher priority message. In order to demonstrate the algorithm's feasibility, message transmission delays have been measured with and without the algorithm on an experimental network test bed.

• Annual Conference of KIPS
• /
• 2001.04b
• /
• pp.1161-1164
• /
• 2001

본 논문에서는 무선 ATM 망에서 VBR(Variable Bit Rate) 트래픽의 QoS(quality of Service)를 보장하고 무선 채널의 효율성을 극대화 할 수 있는 새로운 적응적 슬롯 할당 알고리즘인 In-VDSA를 제안한다. 제안된 알고리즘에서는 ATM 셀 헤더 부분의 GFC(Generic Flow Field) 필드 상에 단말기의 버퍼 상태를 부호화하여 piggybacking하는 방식을 채택하였으며 다음 프레임에 할당할 슬롯의 개수를 기존의 다른 방식과는 달리 유동적으로 조절하여 할당함으로써 단말기의 셀 손실이나 지연에 대한 QoS를 보장하고 채널 이용 효율을 높일 수 있었다. 제안된 알고리즘은 BONeS tool을 이용한 시뮬레이션을 통하여 기존의 방식과 비교 분석한 결과 그 정당성을 확인하였다.

• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.27-33
• /
• 2006

To guarantee QoS (Quality of Service), routers should determine routing paths satisfying service requirements, based on link state information as well as network topology. Link status database (LSD) in routers should be efficiently managed to effectively reflect the current state of all links. However, there is a trade off between the exact reflection of the current link status and its update cost. For exactly reflecting the current link status, each router immediately notifies its neighbors that link state information is changed. This may degrade performance of the router due to the processing of link state update messages. On the other side, if the current link state information is not updated appropriately, a route setup request can be rejected because of the discrepancy between the current link state information and previously updated link state information in LSD. In this paper, we propose a traffic variation based link state update algorithm for adaptively controlling the generation of link state update messages and compare its performance with those of four existing algorithms by intensive simulations.