• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.826-834
• /
• 2002

Asynchronous third generation mobile communication system is able to service Packet Switching through adding GPRS Network to the second generation system GSM. Therefore, it is necessary to study packet traffic service of GGSN node which is due to perform gateway role that GPRS Network is enable to inter-connect with Internet in order to optimize the capability and performance of GGSN. In this paper, the Internet packet traffic model that it is arrived to GGSN node from the Internet is studied and In order to process the Inter traffic efficiently, performance analysis model in GGSN is proposed to optimize packet processing capability of each processor. In order to guarantee QoS requirement of the real time traffic Speech and Video, several scheduling algorithm is applied to performance model and each mechanism is compared with several performance parameters.

• Journal of Digital Contents Society
• /
• v.2 no.1
• /
• pp.73-79
• /
• 2001

Most of the existing algorithms try to disseminate the multimedia contents of internet service provider(ISP), without taking into account the needs and characteristics of specific websites including e-learning systems with web-based .educational contents. Sometimes the client must select the best one among the replicated repositories. However, this is a less reliable approach because clients' selections are made without prior information on server load capacity. In this paper we propose an agent system inspired by the need of improving QoS of delivering web-based educational multimedia contents without incurring long access delays. This agent system consists of three components, Analyzer, Knowledge Base, and Automaton embedded the capacity algorithm. It analyzes and investigates traffic information collected from individual replicated server by learners' requests, and selects a server which is available and is expected to provide the fastest latency time and the lowest loaded capacity, and achieves high performance by dynamic replicating web resources among multiple repositories.

• 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.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.95-112
• /
• 2007

Spatial Multiplexing techniques, which is a kind of Multiple antenna techniques, provide high data transmission rate by transmitting independent data at different transmit antenna with the same spectral resource. OFDM (Orthogonal Frequency Division Multiplexing) is applied to MIMO (Multiple-Input Multiple-Output) system to combat ISI (Inter-Symbol Interference) and frequency selective fading channel, which degrade MIMO system performance. But, orthogonality between subcarriers of OFDM can't be guaranteed under high-mobility condition. As a result, severe performance degradation due to ICI is induced. In this paper, both ICI and CAI (Co-Antenna Interference) which occurs due to correlation between multiple antennas, and performance degradation due to both ICI and CAI are analyzed. In addition to the proposed CIR (Channel Impulse Response) estimation method for avoiding loss in data transmission rate, HIC (Hybrid Interference Cancellation) approach for guaranteeing QoS of MIMO-OFDM receiver is proposed. We observe the results on analytical performance degradation due to both ICI & CAI are coincide with the simulation results and performance improvement due to HIC are also verified by simulation under SCM-E Sub-urban Macro MIMO channel.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.11
• /
• pp.35-43
• /
• 2011

In this paper, we propose a novel architecture for seamless mobility management to provide users with seamless Internet connection when users roam between diverse wireless local area networks (WLANS) controlled by different management entities. There have been many researches in IETF, i.e., MIPv6, HMIPv6, and PMIPv6, to provide the mobility management. However, practically since wireless access points or access routers, which are managed by an individual manager or ISP managers, have different authentication scheme and the supported mobility management, the previous mobility management protocol developed by IETF can not guarantee the quality of service of application services as the mobile node performs the handover. To solve this drawback, we propose the mobility management scheme to provide QoS-guaranteed Internet services during the handover by configurating the wireless networks which is defined by users. More specifically, we present a model, the architecture and an algorithm for user-defined network (UDN) to provide the seamless Internet service. Finally, the performance of the proposed algorithm is evaluated by the network simulation tool.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.683-701
• /
• 2012

IEEE 802.11 standard has achieved huge success in the past decade and is still under development to provide higher physical data rate and better quality of service (QoS). An important problem for the development and optimization of IEEE 802.11 networks is the modeling of the MAC layer channel access protocol. Although there are already many theoretic analysis for the 802.11 MAC protocol in the literature, most of the models focus on the saturated traffic and assume infinite buffer at the MAC layer. In this paper we develop a unified analytical model for IEEE 802.11 MAC protocol in ad hoc networks. The impacts of channel access parameters, traffic rate and buffer size at the MAC layer are modeled with the assistance of a generalized Markov chain and an M/G/1/K queue model. The performance of throughput, packet delivery delay and dropping probability can be achieved. Extensive simulations show the analytical model is highly accurate. From the analytical model it is shown that for practical buffer configuration (e.g. buffer size larger than one), we can maximize the total throughput and reduce the packet blocking probability (due to limited buffer size) and the average queuing delay to zero by effectively controlling the offered load. The average MAC layer service delay as well as its standard deviation, is also much lower than that in saturated conditions and has an upper bound. It is also observed that the optimal load is very close to the maximum achievable throughput regardless of the number of stations or buffer size. Moreover, the model is scalable for performance analysis of 802.11e in unsaturated conditions and 802.11 ad hoc networks with heterogenous traffic flows.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.33-42
• /
• 2013

In the early stage of P2P, the technology was limited to narrow usage of file sharing, but currently, P2P technology has become essential to maximize the efficiency between associated technologies without additional deployment of high costly infrastructure and also the burden of the server. Especially, P2P media streaming service is a highly attractive service to mobile users. which requires a higher quality in the mobile environment in accordance with the development of technology of wired network as well as better mobile terminals. However, P2P technology should consider the trade-off between 'peer selfishness' and QoE for providing fairness. The P2P system also try to maximize the resource utilization through an incentive mechanism for service differentiation and encourage peers to contribute continuously for improving the overall system performance. In this paper, we propose an point-based incentive mechanism based on peer's contribution level and energy availability for service differentiation. We also introduce that the proposed mechanism efficiently enhances the system performance as the peer with incentive using contribution and energy obtains more effective resource distribution.

• Journal of Gastric Cancer
• /
• v.17 no.2
• /
• pp.132-144
• /
• 2017

Purpose: To identify baseline prognostic factors for survival in patients with disease progression, during or after chemotherapy for the treatment of advanced gastric or gastroesophageal junction (GEJ) cancer. Materials and Methods: We pooled data from patients randomized between 2009 and 2012 in 2 phase III, global double-blind studies of ramucirumab for the treatment of advanced gastric or GEJ adenocarcinoma following disease progression on first-line platinum- and/or fluoropyrimidine-containing therapy (REGARD and RAINBOW). Forty-one key baseline clinical and laboratory factors common in both studies were examined. Model building started with covariate screening using univariate Cox models (significance level=0.05). A stepwise multivariable Cox model identified the final prognostic factors (entry+exit significance level=0.01). Cox models were stratified by treatment and geographic region. The process was repeated to identify baseline prognostic quality of life (QoL) parameters. Results: Of 1,020 randomized patients, 953 (93%) patients without any missing covariates were included in the analysis. We identified 12 independent prognostic factors of poor survival: 1) peritoneal metastases; 2) Eastern Cooperative Oncology Group (ECOG) performance score 1; 3) the presence of a primary tumor; 4) time to progression since prior therapy <6 months; 5) poor/unknown tumor differentiation; abnormally low blood levels of 6) albumin, 7) sodium, and/or 8) lymphocytes; and abnormally high blood levels of 9) neutrophils, 10) aspartate aminotransferase (AST), 11) alkaline phosphatase (ALP), and/or 12) lactate dehydrogenase (LDH). Factors were used to devise a 4-tier prognostic index (median overall survival [OS] by risk [months]: high=3.4, moderate=6.4, medium=9.9, and low=14.5; Harrell's C-index=0.66; 95% confidence interval [CI], 0.64-0.68). Addition of QoL to the model identified patient-reported appetite loss as an independent prognostic factor. Conclusions: The identified prognostic factors and the reported prognostic index may help clinical decision-making, patient stratification, and planning of future clinical studies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.8
• /
• pp.1498-1507
• /
• 2017

According to recent report, global mobile data traffic is expected to increase by 11 times from 2016 to 2020. Moreover, this growth is expected to be driven mainly by mobile video traffic which is expected to account for about 70% of the total mobile data traffic. To cope with enormous mobile traffic, we need to understand video traffic's characteristic. Recently, the repetitive requests of some popular content such as popular YouTube videos cause a enormous network traffic overheads. If we constitute a network with the nodes capable of content caching based on the content popularity, we can reduce the network overheads by using the cached content for every request. Through device-to-device, multicast, and helpers, the video throughput can improve about 1.5~2 times and prefix caching reduces the playback delay by about 0.2~0.5 times than the conventional method. In this paper, we introduce some recent work on content popularity-based caching techniques in wireless networks.