• Journal of Communications and Networks
• /
• 제14권3호
• /
• pp.319-335
• /
• 2012

In this study, we design an applicable model enabling internet protocol television (IPTV) service providers to use a virtual network (VN) for IPTV service delivery. The model addresses the guaranteed service delivery, cost effectiveness, flexible control, and scalable network infrastructure limitations of backbone or IP overlay-based content networks. There are two major challenges involved in this research: i) The design of an efficient, cost effective, and reliable virtual network topology (VNT) for IPTV service delivery and the handling of a VN allocation failure by infrastructure providers (InPs) and ii) the proper approach to reduce the cost of VNT recontruction and reallocation caused by VNT allocation failure. Therefore, in this study, we design a more reliable virtual network topology for solving a single virtual node, virtual link, or video server failure. We develop a novel optimization objective and an efficient VN construction algorithm for building the proposed topology. In addition, we address the VN allocation failure problem by proposing VNT decomposition and reconstruction algorithms. Various simulations are conducted to verify the effectiveness of the proposed VNT, as well as that of the associated construction, decomposition, and reconstruction algorithms in terms of reliability and efficiency. The simulation results are compared with the findings of existing works, and an improvement in performance is observed.

• 한국정보처리학회논문지
• /
• 제6권3호
• /
• pp.692-698
• /
• 1999

이 논문에서는 CDMA(C여e Division Multiple Access) 셀롤러 시스템에서 전력할당개념 (Power Allocation Concept)을 이용한 채널할당기법(Channel Assignment Scheme)을 제안하였다. 또한, 제안한 기법의 성능을 분석한 후 고정 전력할당을 이용한 채널할당기법의 성능과 서로 비교하였다. 제안한 기법에서는 순방향링크(Forward Link)에서 인접 셀(Neighbor Cells) 의 트래픽 부하 및 트래픽 분포 패턴에 따라 적용적으로 전력을 할당한다 제안한 기법에 대한 분석결과, 전체 호 블럭킹 확률(Call Blocking Probability: Pr)은 물리적인 채널의 수($C_{th}$)가 30인 경우에 고갈 확률(Outage Probability: Po)보다 블럭킹 확률(Blocking Probability : $P_B$)에 더 의존적이라는 사실을 발견할 수 있었다. 그리고 Pr는 $C_{th}$가 32인 경우, $P_B$ 및 Po 에 동일 비율로 종속되고 이 경우에 $P_{TA}$(blc$\xi$king probability for the adaptive power 머location)는 $P_{TF}$(blocking probability f for the fixed power allocation) 보다 6%정도 높음을 알 수 있었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.97-100
• /
• 1997

Fieldbuses are used as the lowest level communication network for real-time communication in factory automation and process control systems. Data generated from field devices can be divided into three categories: sporadic real-time, periodic real-time and non real-time data. Since these data share one fieldbus network medium, it needs a method that allocate the limited bandwidth of fieldbus network to the sporadic real-time, periodic real-time and non real-time traffic. This paper introduces an implementation method of bandwidth allocation scheme introduced in [51 on PROFIBUS. Using the modified PROFIBUS FDL(Fieldbus Data Link layer), the bandwidth allocation scheme introduced in [51 is verified by the experiments.

• 디지털융복합연구
• /
• 제18권10호
• /
• pp.225-232
• /
• 2020

5G 셀룰러 네트워크 하의 언더레이 기법은 매우 전망 있는 자원공유 기법으로써 이 기법은 5G의 서비스 성능향상과 셀룰러 링크와 D2D(Device to Device) 링크 간의 통신 부하를 줄일 수 있는 효과적인 기법이다. 본 논문에서는 gNB(gNodeB)상에서 5G기반의 멀티 클래스 서비스를 수행하는데 있어서 발생하는 자원간섭을 최소화하고, 분석된 간섭의 제어조건에 따라 5G 통신 서비스를 극대화하기 위한 협력적 우선순위 기반의 자원할당 스케줄링 CPRAS(Cooperative Priority-based Resource Allocation Scheduling)기법을 제안한다. 제안된 CPRAS기법은 각 디바이스들에 대한 통신 자원을 최적화하며, 5G의 통신에 필요한 서비스 요청과 네트워크의 현재 상태에 따라 자원할당을 최적화한다. 또한 제안된 기법은 gNB하의 셀룰러 링크와 D2D링크 간의 자원간섭을 최소화함으로써 기가급의 서비스를 보장하는 기능을 제공한다. 시뮬레이션 결과 제안된 기법이 Pure cellular기법과 Force cellular기법에 비해서 더 나은 시스템 성능을 보였으며, 특히 우선순위가 높고 UE(User Equipment)들 간의 협력이 높을수록 자원간섭 제어가 효과적임을 보인다.

• 제어로봇시스템학회논문지
• /
• 제7권10호
• /
• pp.882-890
• /
• 2001

The data link layer of Foundation Fieldbus is operated on the basis of scheduling and token-passing disciplines. This paper presents a network design method of Foundation Fieldbus using a bandwidth allocation scheme. Fieldbus traffic consists of periodic data and sporadically generated time-critical and time-available data. The bandwidth allocation scheme schedules the transmission of periodic data. Time-critical and time-available data are transmitted via a token-passing service. The validity of this bandwidth allocation scheme is determined using an experimental model of a network system. The results obtained from the experimental model show that the proposed scheme restricts the delay of both periodic and time-critical data to a pre-specified bound. The proposed bandwidth allocation scheme also fully utilizes the bandwidth resource of the network system.

• Journal of information and communication convergence engineering
• /
• 제15권1호
• /
• pp.21-27
• /
• 2017

In this research, we study the outage probability for distributed space-time coding-based cooperative (DSTC) systems with amplify-and-forward relaying over Rayleigh fading channels with a high temporal correlation where the direct link between the source and the destination is available. In particular, we derive the upper and lower bounds of the outage probability as well as their corresponding asymptotic expressions. In addition, using only the average channel powers for the source-to-relay and relay-to-destination links, we propose an efficient power allocation scheme between the source and the relay to minimize the asymptotic upper bound of the outage probability. Through a numerical investigation, we verify the analytical expressions as well as the effectiveness of the proposed efficient power allocation. The numerical results show that the lower and upper bounds tightly correspond to the exact outage probability, and the proposed efficient power allocation scheme provides an outage probability similar to that of the optimal power allocation scheme that minimizes the exact outage probability.

• 제어로봇시스템학회논문지
• /
• 제6권11호
• /
• pp.943-954
• /
• 2000

Fieldbus is the lowest level industrial network in the communication hierarchy of factory automation and distributed process control systems. Data generated from field devices are largely divided into three categories : time-critical, periodic and time-available data. Because these data share one fieldbus medium, it needs a method that allocates these data to the bandwidth-limited fieldbus medium. This paper introduces an implementation method of bandwidth allocation scheme on PROFIBUS. In order to implement bandwidth allocation scheme on PROFIBUS, the following functions need to be supplemented on the FDL(Fieldbus Datalink Layer) protocol: (i) separation of medium bandwidth into periodic and non-periodic intervals, (ii) synchronization of node timers over a local link. In order to examine the validity of bandwidth allocation scheme on PROFIBUS, this paper develops an experimental model of a network system. The results obtained from the experimental model show that the bandwidth allocation scheme satisfies the performance requirement of time-critical, periodic and time-available data.

• ETRI Journal
• /
• 제34권2호
• /
• pp.159-167
• /
• 2012

In this paper, a new distributed resource allocation algorithm is proposed to alleviate the cross-tier interference for orthogonal frequency division multiplexing access macrocell and femtocell overlay. Specifically, the resource allocation problem is modeled as a non-cooperative game. Based on game theory, we propose an iterative algorithm between subchannel and power allocation called distributed resource allocation which requires no coordination among the two-hierarchy networks. Finally, a macrocell link quality protection process is proposed to guarantee the macrocell UE's quality of service to avoid severe cross-tier interference from femtocells. Simulation results show that the proposed algorithm can achieve remarkable performance gains as compared to the pure waterfilling algorithm.

• ETRI Journal
• /
• 제36권6호
• /
• pp.960-967
• /
• 2014

In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

• 대한산업공학회지
• /
• 제24권2호
• /
• pp.241-249
• /
• 1998

In this paper, we seek to find an optimal allocation of link capacity in a data communication network. The architecture of the data communication network considered in the study is an online-service network based on public switched telephone network(PSTN) and packet switched data network(PSDN). In designing the architecture of the network, we need to deal with various measures of quality of service(QoS). Two important service measures are the call blocking probability in PSTN and the data transfer delay time in PSDN. Considering the tradeoff between the call blocking probability and the data transfer delay time in the network, we have developed the optimal link capacity allocation model that minimizes the total link cost, while guarantees the call blocking probability and the data transfer delay time within an acceptable level of QoS. This problem can be formulated as a non-linear integer programming model. We have solved the problem with tabu search and simulated annealing methods. In addition, we have analyzed the sensitivity of the model and provided the insight of the model along with computational results.