Earticle

본 논문에서는 협상 게임 이론의 특성을 이용하여 서비스 요구 사항이 상이한 다수의 서비스 클래스들이 노드의 대역폭을 공유하는 경우 효율성 증대와 클래스별 비례적 공정성을 보장할 수 있는 대역폭 할당 기법을 제안한다. 일반적으로 각 클래스의 트래픽 입력율은 대부분의 시간에 비대칭적이기 때문에 제안기법은 클래스별 입력율에 따라 비례적으로 대역폭을 할당함으로써 시스템 측면에서 대역폭 이용 효율을 증대시킨다. 또한 제안 기법은 특정 클래스의 과도한 트래픽 입력으로 인한 타 클래스의 서비스 품질 저하를 방지하며, 클래스별 가중치에 따라 차등적이며 공정하게 대역폭을 할당한다.

In this paper, using the bargaining game theory, we propose a bandwidth management scheme that allocates bandwidth in an efficient and proportionally fair manner between the service classes with different service requirements. Since the traffic input rates of the classes are asymmetric in most of the time, the proposed scheme allocates bandwidth in proportion to the traffic input rates to increase the bandwidth utilization while protecting the quality of service of a class against the excessive traffic input of the other classes. In addition, the proposed method considers the weights of classes so that the bandwidth is allocated differentially among the classes.

인터넷의 성장은 다양한 분야에서 정보통신 기술의 활용한 새로운 서비스를 창출하고 있지만, 인터넷의 구조 적인 문제로 인하여 다양한 네트워크 구조와 서비스의 발전을 저해하고 있다. 네트워크 가상화는 현재 인터넷의 구 조적 문제를 극복할 수 있는 대안으로 연구되고 있으며, 많은 연구 분야 중에서도 가상 네트워크 자원 할당 방안이 중요 연구 분야중의 하나이다. 본 논문에서는 가상 네트워크의 신뢰성을 향상시켜 네트워크상에서의 단일 링크 장애 를 복구할 수 있는 방안을 제안한다. 다수의 가상 네트워크가 하나의 공유 백업 대역폭을 이용하여 다중 경로를 지원 함으로 신뢰성을 향상시킬 수 있다. 가상 네트워크들이 백업자원을 공유함으로 한정된 물리 자원의 효율성을 향상시 키고, 사전에 할당된 백업 자원을 이용하여 빠른 장애 복구가 가능하다는 장점이 있다. 실험을 통하여 제안된 알고리 즘의 다중 경로 생성 소요 시간이 기존 연구보다 약 50% 정도 성능 향상되었음을 확인하였다.

With the advance of ICT, the Internet has been creating new services in various fields. However, due to the architectural problem of the Internet, it may inhibit the development of network architectures and various services. Network virtualization is being investigated as an alternative to overcome the architectural problem of the Internet and a virtual network resource allocation algorithm is a very important issue. In this paper, we propose a multiple path resource allocation algorithm with shared backup bandwidth in order to overcome single link failure. It will be improved survivability of the virtual networks. Through our experiments, we confirmed that the multi-path creation time of the proposed algorithm has about 50% performance improvement than previous works.

인터넷의 경직성으로 인하여 다양한 서비스를 제공하기 어려운 문제를 해결하기 위한 가장 효과적인 방법 이 네트워크 가상화 방안이다. 공통의 물리 네트워크 자원을 공유하는 가상 네트워크를 효율적으로 생성하기 위해서 는 자원을 효율적으로 사용할 수 있는 방안이 필요하다. 이러한 한정된 물리 자원을 효율적으로 사용하기 위하여 본 논문에서는 사용중인 자원이라도 더 높은 서비스 우선순위를 갖는 가상 네트워크에 할당하는 방법을 제안한다. 높은 우선순위의 네트워크 생성 요청을 위하여 운용중인 낮은 우선순위의 가상 네트워크에서 효율적으로 대역폭을 회수하 는 알고리즘을 제안한다. 제안하는 대역폭 할당 알고리즘은 낮은 우선순위를 갖는 가상 네트워크에서 서비스 지속성 을 유지하면서 할당된 대역폭을 회수할 수 있다. 제안한 알고리즘의 실험을 통하여 약 8%정도의 가상 네트워크 생 성 수락률의 향상을 확인하였다.

Due to the ossification of the Internet, it is difficult to accommodate variety services. One of the efficient solution to this problem is network virtualization. It allows multiple parallel virtual networks to run on the shared physical infrastructure. It needs new resource allocation mechanism to share efficient physical resources. In this paper, we present efficient bandwidth allocation algorithm for virtual network request with high service priority. Our proposed algorithm can withdraw allocated bandwidth from low-level priority virtual network and maintain low-level virtual network service. We evaluated the performance of our proposed algorithm using simulation and found the improvement of approximately 8% acceptance rate.

By considering the limited energy of Internet of Things (IoT) devices. We take the resource allocation to guarantee the stringent Quality of Service (QoS) depending on the joint optimization of power control and finite blocklength of channel. To achieve large volumes of arrival rates, we propose Adversarial Training based Generative Adversarial Networks (AT-GANs), which utilize a significant number of extreme events to provide high reliability and adjust real data in real-time. Simulation results show that Deep-Reinforcement Learning (Deep-RL) for AT-GAN could eliminate the transient training time. As a result, the AT-GAN keeps the reliability higher than 99.9999%.

With respect to the rapidly growing Fourth Generation (4G) wireless communication system, an outstanding feature is the heterogeneous wireless access. Despite the fact that this amazing feature allows users to connect to several wireless access networks simultaneously, various challenges with respect to bandwidth allocation (BA) among various heterogeneous networks also arise. A feasible and effective solution to tackle this problem has been proposed in this paper, which concerns a bandwidth allocation using game (BAG) algorithm with respect to heterogeneous wireless networks. This paper proposes modeling a Resource allocation RA or Bandwidth Allocation problem as a game, and then formulating it to increase the total utility to a maximum of the dissimilar networks. The game model that has been proposed in this paper also establishes the existence of the Experimental Economic Method (EEM). In order to divert assigning too much Resource or bandwidth to a single user, utility functions have also been designed. Moreover, simulation results reveal that the scheme proposed in this paper not only achieves a high utility, but also reduces blocking probability within a few iterations.

In this letter, we propose an optimal joint bandwidth and power allocation method for heterogeneous wireless networks (HetNets) by maximizing the users’ quality of experience (QoE), which is a widely used subjective metric reflecting the users’ satisfaction of the multimedia service. By taking two factors into consideration simultaneously: Rate Factor (RF) and Energy Factor (EF), we can measure the QoE of end-users effectively. An optimal QoE-driven allocation algorithm is further developed for maximizing the end-users’ QoE utility subject to the constraints of transmit bandwidth, power and data rate. The simulation results demonstrate the theoretical analysis.

최근 기간망의 전송속도는 괄목할 만한 성장을 이루고 있으나 가입자 전송망의 전송속도는 이전 수준에 비교해서 진정이 없는 상태이다. 그래서 가입자 접속 구간은 다수의 LAN과 백본망 사이에 병목지점으로 지적되고 있다. 현재 가입자 구간은 VOD, 양방향게임, 양방향 영상회의와 같은 새로운 대용량 멀티미디어 서비스를 수용하기에 충분한 대역폭을 제공하지 못하고 있다. 그런 가운데 저가의 이더넷 장비와 광선로 인프라를 융합한 EPON(Ethernet Passive Optical Network)이 차세대 가입자 접속망에 가장 적합하다. 하지만 이러한 우수성을 가진 EPON도 안정적인 대용량 멀티미디어 서비스를 제공하기에는 부족함을 가지고 있다. EPON에서 ONU가 수신할 수 있는 대역폭은 1GBPS이지만 송신하기 위한 대역폭은 모든 ONU가 공유해야 하므로 부족하다. 따라서 양방향 초고속 가입자 접속망을 위해 FTTx를 지원하는 EPON의 부족한 상향 전송 대역폭을 충족시키는 상향 대역폭 할당 방법이 필요하다. 본 논문에서는 EPON의 상향 트래픽에 대한 QoS를 보장하기 위한 우선순위 큐를 고려한 가중치 기반의 차등대역폭 할당 방식을 제안한다.

The subscriber access network is cause of the bottleneck phenomenon because equipment and infrastructure were not originally designed for busty high-bandwidth traffic between MAN(Metro Area Network) and LAN(Local Area Network). Whether riding on shorter copper drops or optical fiber, Ethernet is emerging as the future broadband protocol of choice, offering plug and play simplicity, and low cost. EPON(Ethernet Passive Optical Network) combines point-to-multipoint optical infrastructure with low-cost high-bandwidth Ethernet. The future broadband access network will be a combination of point-to-point and point-to-multipoint Ethernet, optimized for transporting IP data, as well as time critical voice and video. EPON is being considered as a novel communications infrastructure for next-generation broadband access network for the convergence of low-cost Ethernet equipment and low-cost fiber infrastructure. But, EPON has a problem with duplex multimedia services. It is the insufficiency of bandwidth for upstream. Because all ONUs use a shared transmission media for upstream. In this paper, we addressed the problem of upstream bandwidth in EPONs. We presented a wavelength division EPON supporting QoS in the differentiated services framework.

UCS(upstream centric scheduling)을 이용하여 수면/활성 상태를 제어하는 E-PON에서의 에너지 절감률은ONU의 송, 수신기를 동시에 on/off 할 수 있다는 측면에서 상당히 효과적인 것으로 알려져 왔다. 그러나 E-PON 동적대역할당(DBA:Dynamic Bandwidth Allocation)방식으로 흔히 사용되고 있는 IPACT(Interleaved Polling with Adaptive cycle time) 제한된 서비스(limited service)에서는 상향 트래픽 요구에 따라 폴링 주기가 수시로변하므로 저부하 트래픽에서 고정대역할당(FBA:Fixed Bandwidth Allocation)에 비해 에너지 절감 효과가 상당히떨어진다. 본 논문에서는 이를 해결하기 위해 고정 폴링 사이클 갖는 제한된 서비스(LSFC: Limited Service with Fixed Cycle)을 동적대역할당 방식으로 제안한다. 시뮬레이션 결과에 의하면, 이 방식은 기존의 제한된 서비스 보다저부하 구간에서 queuing delay, throughput 성능 저하를 유발시키지만, QoS(Quality of Service) 요구 사항을만족시키는 범위 내에서 오버헤드 시간(overhead time)에 따라 약 11~66% 에너지 절감 효과를 볼 수 있다.

It has been widely known that the energy efficiency of E-PON using UCS(upstream centric scheduling) which controls active/sleep state is quite effective due to the functionality to turn on and off a transmitter and a receiver at the same time. However, for the IPACT(Interleaved Polling with Adaptive cycle time) with the limited service which is commonly used as a E-PON dynamic bandwidth allocation (DBA), the performance of energy efficiency will get worse compared to the fixed bandwidth allocation (FBA) due to frequently varying polling cycles depending on the requests of upstream traffic. To handle this problem, the paper propose a DBA called limited service with fixed cycle (LSFC). From the simulation results, the proposed scheme substantially gains energy savings of about 11 to 16 percent according to overhead time within tolerance of quality of service (QoS) in spite of some performance deterioration of queuing delay and throughput when the offered load is low.

Broadband networks are designed to support a wide variety of services with different traffic characteristics and demands for Quality of Services. Bandwidth allocation methods can be classified into two major categories： static and dynamic. In static allocation, bandwidth is allocated only at call setup time and the allocated bandwidth is maintained during a session. In dynamic allocation, the allocated bandwidth is negotiated during a session. The purpose of this paper is to develop policies for deciding and for adjusting the amount of bandwidth requested for a best effort connection over such as ATM networks.. This method is to develop such policies that a good trade off between utilization and latency using cell delay variation to the forecast the incoming traffic in the next period. The performances of the different polices are compared by simulations.

Broadband networks are designed to support a wide variety of services with different traffic characteristics and demands for Quality of Services. Bandwidth allocation methods can be classified into two major categories: static and dynamic. In static allocation, bandwidth is allocated only at call setup time and the allocated bandwidth is maintained during a session. In dynamic allocation, the allocated bandwidth is negotiated during a session. The purpose of this paper is to develop policies for deciding and for adjusting the amount of bandwidth requested for a best effort connection over such as ATM networks. This method is to develop such policies that a good trade off between utilization and latency using cell delay variation to the forecast the incoming traffic in the next period. The performances of the different polices are compared by simulations.

LR-PON은 수동형 광가입자망 기술을 사용하여 서비스 영역이 100 km이상 확장된 광대역 가입자망이다. 서비스 영역이 확장된 LR-PON의 경우 OLT와 ONU들간 전송 지연시간이 큰 폭으로 증가하는 문제점으로 인해 효과적인 상향 대역할당에 어려움이 있다. 본 논문에서는 LR-PON망에서 동적인 상향 대역 할당을 효과적이며 공정하게 하기 위해서, 고정형 폴링 주기를 갖는 다중 스레드 기반의 새로운 동적대역할당 방안을 제안한다. 제시한 동적대역할당 방안의 우수성을 입증하기 위하여 상향 트래픽의 평균 지연시간을 기존의 DBA 방안들과 비교하였다. 특히, CoS 특성 분석을 위하여 다양한 트래픽 로드별로 지연 특성을 분석하였다.

Long-Reach PON (LR-PON) is a broadband access network using passive optical network (PON) technology which the reach is extended to 100 km or higher. A major challenge in LR-PON is that the propagation delay between OLT and ONUs is increased by a very significant amount. To effectively and fairly distribute the upstream bandwidth dynamically in LR-PON, we propose a new periodic and multi-thread polling based dynamic bandwidth allocation (DBA) algorithm. We compare the proposed algorithm with traditional DBAs and show its advantage on average packet delay. Numerical results are analyzed under varying offered loads.

온라인 게임에서 동영상은 게임을 홍보하는 중요한 수단이며, 게임 진행에 많은 도움을 준다. 이 경우에 동영상은 저장 공간의 효율적인 사용과 네트워크 자원의 효율성을 위해 가변 비트율 형태로 압축된다. 적응형 대역폭 할당은 게임 동영상에 대한 전송 계획을 세우고 이 계획에 의한 전송률이 가용 전송률보다 큰 경우에 가용 전송률을 만족시킬 때까지 일부 프레임을 폐기시켜서 전송하는 방법이다. 이때, 적응형 대역폭 할당 방법에서의 평가 요소들은 전송률을 설정하는데 크게 영향을 준 프레임들의 폐기 순서에 따라 크게 달라질 수 있다. 본 논문에서는 이를 살펴보기 위하여 전송 계획에 사용되는 CBA, MCBA, MVBA, [6]], [7]의 알고리즘들을 적응형 대역폭 할당 방법의 전송 계획으로 각각 적용하여 다양한 프레임 폐기 방법들로 성능을 평가한다.

A moving picture in online game is one of major ways to advertise online games, which gives a lot of help in playing game. In this case, a moving picture is compressed to variable bit rate for efficient storage use and network resource efficiency. Adaptable bandwidth allocation technique builds a transmission plan of a game moving picture. And, then some frames are discarded when transmission rate by the transmission plan is larger than available transmission rate, until transmission rate satisfies available transmission rate. Thus, performance evaluation factors in adaptable bandwidth allocation technique may be dependent on discarding order of a frame which transmission rate is much influenced. In this paper, in order to show the performance, a CBA algorithm, an MCBA algorithm, an MVBA algorithm, [6] and [7] algorithm were applied to a transmission plan in the adaptable band width allocation technique using various frame discard methods and performance evaluation factors were compared in among smoothing algorithms.

Measurement and data acquisition get the most accurate indicator, in mobile communication network. Channel occupancy for each cell shows the proportion of current traffic. In addition, call duration is another important target, which more precise estimate the users’usage situation in heterogeneous networks. A Flexible Bandwidth Allocation Scheme (FBS) using specified duration based data acquisition improves the quality of services (QoS) in heterogeneous networks. The FBS reduces the weight call loss probability (CLP) and improves performance in resource allocation and wireless channel utilization. Simulation results demonstrate the effectiveness of the scheme.

Denial of service attacks occur when the attacks are from a single host, whereas distributed denial of service attacks occur when multiple affected systems flood the bandwidth or resources of a targeted system. Although it is not possible to exempt entirely from denial of service or distributed denial of service attacks, we can limit the malicious user by controlling the traffic flow. In the paper, we propose to monitor the traffic pattern in order to alleviate distributed denial of service attacks. A bandwidth allocation policy will be adopted to assign normal users to a high priority queue and suspected attackers to a low priority queue. Simulations conducted in network simulator of our proposed priority queue-based scheme shows its effectiveness in blocking attacking traffic while maintaining constant flows for legitimate traffic.

With the rapid development of Internet technology, more flexible applications appeared and had a higher demand on dynamic allocation of network resources. However, allocating network resources dynamically is difficult to achieve in current TCP/IP networks due to the lack of programming interface of network devices for unified and effective control and management. In recent years, a new network architecture -- software-defined networks (SDN) emerged and it provides services providers or network managers an opportunity to realize the goals. In this paper, a user-reservation-based end-to-end dynamic bandwidth allocation procedure in SDN with OpenFlow protocol is proposed. Users can reserve bandwidth and controller can allocation bandwidth dynamically to satisfy users’ demand. Experiments are designed to verify the effectiveness of the allocation procedure. Results of the experiment show that the allocation procedure works well.

An XG-PON (10-Gbps-capable passive optical network) system is comprised of an OLT (optical line termination) and multiple ONUs (optical network units). In general, ONUs report their requests to the OLT and then the OLT performs a dynamic bandwidth allocation operation to allocate non-overlapping transmission slots to ONUs. In this paper, we consider an XG-PON system that ONUs do not report their requests to. The OLT estimates the ONU status by monitoring the upstream bandwidth usage of the ONU. We propose a dynamic bandwidth allocation method for the XG-PON system in which ONUs do not report their reports. The proposed method allocates a bandwidth to an ONU only if the ONU has fully used its upstream slot. Also, the proposed method periodically allocates a probe bandwidth to an ONU to prevent service starvation. Using simulation, we evaluate the performance of the proposed method under balanced and unbalanced traffic.

In this paper, we explore a low-complex bandwidth allocation (BA) scheme with multi-level service guarantees in VLC-OFDM systems. Effective capacity theory, which evaluates wireless channel capacity from a novel view, is utilized to model the system capacity under delay QoS constraints of the link layer. Since intensity modulation of light is used in the system, problems caused by frequency selectivity can be neglected. Then, the BA problem can be formulated as an integer programming problem and it is further relaxed and transformed into a concave one. Lagrangian formulation is used to reformulate the concave problem. Considering the inefficiency of traditional gradient-based schemes and the demand for distributed implementation in local area networks, we localize the global parameters and propose a quasi-distributed quadratic allocation algorithm to provide two-level service guarantees, the first level is QoS oriented, and the second level is QoE oriented. Simulations have shown the efficient performance of the proposed algorithm. The users with more stringent QoS requirements require more subcarriers to guarantee their statistical delay QoS requirements. We also analyze the effect of subcarrier granularity on the aggregate effective capacity via simulations.

This paper considers bandwidth allocation and scheduling problems on Ethernet Passive Optical Networks (EPON). EPON is one of the good candidates for the optical access network. This paper formulates the bandwidth allocation problem as a nonlinear mathematical one and characterizes the optimal bandwidth allocation which maximizes weighted sum of throughput and fairness. Based upon the characterization, two heuristic algorithms are suggested with various numerical tests. The test results show that our algorithms can be used for efficient bandwidth allocation on the EPON. This paper also shows that the WSPT (Weighted Shortest Processing Time) rule is optimal for minimization the total delay time in transmitting the traffic of the given allocated bandwidth.

The 5G mobile network is promising to handle the dynamic traffic demands of user equipment (UE). Unmanned aerial vehicles (UAVs) equipped with wireless transceivers can act as flying base stations in heterogeneous networks to ensure the quality of service of UE. However, it is challenging to efficiently allocate limited bandwidth to UE due to dynamic traffic demands and low network coverage. In this study, a blockchain-enabled bandwidth allocation framework is proposed for secure bandwidth trading. Furthermore, the proposed framework is based on the Cournot oligopoly game theoretical model to provide the optimal solution; that is, bandwidth is allocated to different UE based on the available bandwidth at UAV-assisted-based stations (UBSs) with optimal profit. The Cournot oligopoly game is performed between UBSs and cellular base stations (CBSs). Utility functions for both UBSs and CBSs are introduced on the basis of the available bandwidth, total demand of CSBs, and cost of providing cellular services. The proposed framework prevents security attacks and maximizes the utility functions of UBSs and CBSs.

Field devices in factory automation and process control system generate time-critical, periodic, and time-available data. These data share the bandwidth of one fieldbus network medium. This paper reviews a bandwidth allocation scheme (BAS) that is applicable to many different kinds of fieldbuses. The BAS satisfies the real-time transmission requirements of time-critical and periodic data, and fully utilizes the bandwidth resources of the fieldbus network. The basic concept of the BAS is introduced and its implementation in Foundation Fieldbus, Profibus, and CAN protocols is discussed.