• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권12호
• /
• pp.5803-5819
• /
• 2017

In this paper, we proposed a contract theory based cooperative spectrum sharing scheme with joint power and bandwidth optimization under asymmetric information, where the primary user (PU) does not know the secondary users' (SUs) private information. To improve performance, PU needs to provide incentives to stimulate nearby SUs to help forward its signal. By using contract theory, PU and SUs' negotiations are modeled as a labor market. PU and SUs act as the employer and employees, respectively. Specifically, SUs provide labor (i.e. the relay power, which can be used for forwarding PU's signal) in exchange for the reward (i.e. the spectrum access bandwidth which can be used for transmitting their own signals). PU needs to overcome a challenge how to balance the relationship between contributions and incentives for the SUs. We study the optimal contract design which consists of relay power and spectrum access bandwidth allocation. We show that the most efficient SUs will be hired by the PU to attend the cooperative communication. PU can achieve the same maximum utility as in the symmetric information scenario. Simulation results confirm that the utility of PU is significantly enhanced with our proposed cooperative spectrum sharing scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5243-5263
• /
• 2017

Data center networks provide critical bandwidth for the continuous growth of cloud computing, multimedia storage, data analysis and other businesses. The problem of low link bandwidth utilization in data center network is gradually addressed in more hot fields. However, the current scheduling strategies applied in data center network do not adapt to the real-time dynamic change of the traffic in the network. Thus, they fail to distribute resources due to the lack of intelligent management. In this paper, we present an improved adaptive traffic scheduling strategy utilizing the simulated annealing genetic algorithm (SAGA). Inspired by the idea of software defined network, when a flow arrives, our strategy changes the bandwidth demand dynamically to filter out the flow. Then, SAGA distributes the path for the flow by considering the scheduling of the different pods as well as the same pod. It is implemented through software defined network technology. Simulation results show that the bisection bandwidth of our strategy is higher than state-of-the-art mechanisms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3583-3598
• /
• 2019

In order to improve the reliability and repair efficiency of distributed storage systems, minimum bandwidth regenerating (MBR) codes based on cyclic variable fractional repetition (VFR) codes are constructed in this thesis, which can repair failed nodes accurately. Specifically, in order to consider the imbalance of data accessed by the users, cyclic VFR codes are constructed according to that data with different heat degrees are copied in different repetition degrees. Moreover, we divide the storage nodes into groups, and construct MBR codes based on cyclic VFR codes to improve the file download speed. Performance analysis and simulation results show that, the repair locality of a single node failure is always 2 when MBR codes based on cyclic VFR codes are adopted in distributed storage systems, which is obviously superior to the traditional MBR codes. Compared with RS codes and simple regenerating codes, the proposed MBR codes based on cyclic VFR codes have lower repair locality, repair complexity and bandwidth overhead, as well as higher repair efficiency. Moreover, relative to FR codes, the MBR codes based on cyclic VFR codes can be applicable to more storage systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권6호
• /
• pp.575-596
• /
• 2009

Facing limited network resources such as bandwidth and processing capability, the Internet will have congestion from time to time. In this paper, we propose a scheme to maximize the total utility offered by the network to the end user during congested times. We believe the only way to achieve our goal is to make the scheme application-aware, that is, to take advantage of the characteristics of the application. To make our scheme scalable, it is designed to be class-based. Traffic from applications with similar characteristics is classified into the same class. We adopted the RED queue management mechanism to adaptively control the traffic belonging to the same class. To achieve the optimal utility, the traffic belonging to different classes should be controlled differently. By adjusting link bandwidth assignments of different classes, the scheme can achieve the goal and adapt to the changes of dynamical incoming traffic. We use the control theoretical approach to analyze our scheme. In this paper, we focus on optimizing the control on two types of traffic flows: TCP and Simple UDP (SUDP, modeling audio or video applications based on UDP). We derive the differential equations to model the dynamics of SUDP traffic flows and drive stability conditions for the system with both SUDP and TCP traffic flows. In our study, we also find analytical results on the TCP traffic stable point are not accurate, so we derived new formulas on the TCP traffic stable point. We verified the proposed scheme with extensive NS2 simulations.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제6권4호
• /
• pp.430-440
• /
• 2000

인터넷에서 기존의 최선형 서비스 외에 QoS를 제공하기 위한 노력으로 IETF에서는 새로운 서비스 모델로 통합서비스 모델과 이 서비스의 지원을 위한 자원 예약 시그널링 프로토콜로 RSVP를 제시하였다. 그러나 RSVP는 링크 계층의 기술과는 독립적으로 정의되었기 때문에 실제 사용하는 링크 계층의 기술에 맞는 자원 예약 방법과 서비스 매핑 방법이 필요하다. 이를 위해서 IETF에서는 RSVP를 IEEE802 형태의 망에 매핑 시키기 위한 방법으로 SBM을 제시하였다. 그러나 IETF의 SBM은 RSVP의 시그널링 메커니즘에 종속적이기 때문에 항상 RSVP와 함께 사용되어야 한다는 제한점과 RSVP의 시그널링 경로를 데이타 경로도 그대로 따라야함으로써 데이타 전달이 늦어지는 단점이 있다. 본 논문에서는 RSVP와 독립적이면서 시그널링 경로와 데이타 전달 경로를 분리한 새로운 메커니즘을 제시한다. 또한, 현재 가장 널리 쓰이고 있으면서 특성상 대역폭 관리가 어렵다고 알려져 있는 링크 계층 기술인 이더넷에서 대역폭 관리를 수행할 수 있는 이더넷 대역폭 관리기에 대해서 기술한다. 이더넷 대역폭 관리기의 설계를 위해서 이더넷 대역폭 특성을 파악하기 위한 시뮬레이션을 수행하였으며, 이 결과를 이용해 실제 이더넷 대역폭 관리기를 구현한 결과를 보인다. 또한 본 논문에서 제시하는 메커니즘은 네트워크 계층의 시그널링 프로토콜과는 독립적으로 설계되었기 때문에 SBM의 제한점 및 한계점을 극복할 수 있으며 이 메커니즘을 이용해서 이더넷 상에서 기존의 최선형 서비스 이외에 통합서비스 중에서 부하제어형 서비스를 제공할 수 있음을 확인할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권11호
• /
• pp.2920-2939
• /
• 2012

Enterprises that develop online games have to deploy supporting infrastructures, including hardware and bandwidth resources, in order to provide a good service to users. First Person Shooter games generate high rates of small UDP packets from the client to the server, so the overhead is significant. This work analyzes a method that saves bandwidth, by the addition of a local agent which queues packets, compresses headers and uses a tunnel to send a number of packets within a multiplexed packet. The behavior of the system has been studied, showing that significant bandwidth savings can be achieved. For certain titles, up to 38% of the bandwidth can be saved for IPv4. This percentage increases to 54% for IPv6, as this protocol has a bigger overhead. The cost of these bandwidth savings is the addition of a new delay, which has an upper bound that can be modified. So there is a tradeoff: the greater the added delays, the greater the bandwidth savings. Significant reductions in the amounts of packets per second generated can also be obtained. Tests have been deployed in an emulated scenario matching an access network, showing that if the number of players is big enough, the added delays can be acceptable in terms of user experience.

• 한국인터넷방송통신학회논문지
• /
• 제20권3호
• /
• pp.97-103
• /
• 2020

리눅스 Cgroups은 컨테이너 기반 클라우드 서비스 구축에서 각 컨테이너 별 시스템 자원을 할당하기 위한 핵심적인 역할을 담당하고 있다. 특히 입출력 자원의 경우 리눅스 Cgroups은 컨테이너의 가중치에 따라 입출력 대역폭을 분배하는 기법을 지원하고 있다. 그러나 성능 분석 결과에 따르면 현재 리눅스 Cgroups의 입출력 대역폭 분배 기법은 NVMe SSD와 같은 고성능 저장장치를 사용할 경우 입출력 성능이 크게 저하된다는 한계점을 가지고 있다. 따라서 본 논문에서는 리눅스 Cgroups을 위한 새로운 피드백 기반의 동적 대역폭 분배 기법을 제안하고자 한다. 제안하는 기법은 가중치에 따라 입출력 크레딧을 분배하며 고성능 저장장치의 성능 변화를 동적으로 반영해 입출력 크레딧을 계산함으로써 저장장치의 성능 저하를 최소화한다. 제안된 기법은 리눅스 커널 5.3에 구현되었으며 성능 평가 결과 정확한 입출력 대역폭 분배를 수행할 뿐만 아니라 기존 기법에 비해 최대 2배 높은 입출력 성능을 보여주었다.

• 한국인터넷방송통신학회논문지
• /
• 제18권4호
• /
• pp.123-130
• /
• 2018

많은 대규모 멀티플레이어 온라인 게임(MMOG)들은 서버 측의 막대한 대역폭 요건이 필요한 클라이언트-서버 구조를 사용한다. 본 논문에서 클라이언트-서버 구조와 peer-to-peer 구조의 장점을 결합하며 게임 상태를 변경시키는 중요한 이벤트들만 서버에서 처리하는 영역 기반의 하이브리드 게임 구조를 제시한다. 이 하이브리드 구조에서 중앙 서버는 게임을 영역들로 분할하며 중요 갱신 작업을 각 영역 내에서 분산시키는 플레이어를 영역 서버로 설정한다. 즉 중앙 서버는 영역 서버를 통하여 플레이어들에게 상태 갱신 작업을 전송한다. 동일 영역에 있는 모든 플레이어들은 게임 상태에 영향을 주지 않는 갱신 작업만 직접 상호 교환한다. 분담된 작업은 중앙 서버의 대역폭을 매우 감소시키며 중앙 서버가 더 많은 플레이어들을 동시에 실행시킬 수 있도록 한다. 실험 결과 3 단계 계층의 영역 기반 하이브리드 구조는 클라이언트-서버 구조보다 규모조정 능력이 우수하며 영역 서버로 작용하는 플레이어들의 충분한 대역폭을 요구하는 반면 중앙 서버의 상당한 대역폭을 감소시킬 수 있는 것으로 나타났다.

• 한국정보처리학회논문지
• /
• 제6권11S호
• /
• pp.3320-3331
• /
• 1999

In this paper, we explore two ways to improve the bandwidth assurance performance of Assured Service(AS). It is well known that AS fails to meet the bandwidth assurance target for large-profile TCP flows competing with many small-profile flows. This flows after the back-offs induced by packet drops. Thus currently proposed solution to this problem naturally focus on modifying TCP's behavior to counter the unfairness in the TCP dynamics. Unfortunately, these proposals lack practicability in terms of the required changes in the incumbent Internet infrastructure. Admitting this difficulty, we instead look to not yet deployed Diff-Serv mechanisms for practical solutions. In particular, we investigate the role of RIO, RED with IN(in-profile) and OUT(out-profile), queue management scheme in the assurance failure for As. Specifically, we identify the inadequacy of RIO that aggravates the bandwidth assurance failure. Then we alleviates the bandwidth assurance failure problem by separately controlling the out-of-profile packet queue length. Through extensive simulations we demonstrate that RI+O extends the regime where AS consistently provides the bandwidth assurance.

• ETRI Journal
• /
• 제35권2호
• /
• pp.234-244
• /
• 2013

Internet protocol television (IPTV) service depends on the network quality of service (QoS) and bandwidth of the broadband service provider. IEEE 802.16j mobile multihop relay Worldwide Interoperability for Microwave Access networks have the opportunity to offer high bandwidth capacity by introducing relay stations. However, to actually satisfy QoS requirements for offering IPTV services (HDTV, SDTV, Web TV, and mobile TV) for heterogeneous users' requests, providers must use a video server for each IPTV service type, which increases the network load, especially bandwidth consumption and forwarding time. In this paper, we present a solution for forwarding IPTV video streaming to diverse subscribers via an 802.16j broadband wireless access network. In particular, we propose a new multicast tree construction and aggregation mechanism based on the unique property of prime numbers. Performance evaluation results show that the proposed scheme reduces both bandwidth consumption and forwarding time.