• 기술사
• /
• 제34권4호
• /
• pp.41-47
• /
• 2001

The paper describes SR3 (Synchronous Round Robin with Reservations), a collision-free medium access control protocol for all-optical slotted packet networks based on WDM multi-channel ring topologies where nodes are equipped with one fixed-wavelength receiver and one wavelength-tunable transmitter SR3 is derived from the SRR and MMR protocols previously proposed by the same authors for the same class of all-optical networks. SRR and MMR already achieve an efficient exploitation of the available bandwidth, while guaranteeing a throughput-fair access to each node. SR3, In addition, allows nodes to reserve slots. thereby achieving a stronger control on access delays; it is thus well suited to meet tight delay requirements, as it is the case for multimedia applications. Simulation results show that SR3 provides very good performance to guaranteed qualify traffic, but also brings signigicant performance improvements for best-effort traffic. Energy effciency is an important issue for optical network since they must rely on their batteries. We present a novel MAC protocol that achieves a good energy efficiency of optical interface of the network and provides support for diverse traffic types and QoS. The scheduler of the base station is responsible to provide the required QoS to connections on the optical link and to minimise the amount of energy spend by the High speed Network. The main principles of the MaC protocol are to avoid unsuccessful actions, minimise the number of transitions , and synchronise the mobile and the base-station. We will show that considerable amounts of energy can be saved using these principles.

• ETRI Journal
• /
• 제27권6호
• /
• pp.777-787
• /
• 2005

In this paper, we propose an urgency- and efficiency-based wireless packet scheduling (UEPS) algorithm that is able to schedule real-time (RT) and non-real-time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality-of-service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.

• 산업공학
• /
• 제17권spc호
• /
• pp.111-121
• /
• 2004

In this paper, we propose an urgency and efficiency based wireless packet scheduling (UEPS) algorithm that is able to schedule real time (RT) and non-real time (NRT) traffics at the same time. The proposed UEPS algorithm is designed to support wireless downlink packet scheduling in the OFDMA system which is a strong candidate wireless system for the next generation mobile communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average one as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics with satisfying QoS requirements of RT traffics. The simulation study shows that the proposed UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF) while satisfying QoS requirements of RT traffics such as the average delay and the packet loss rate under various traffic loads.

• 한국멀티미디어학회논문지
• /
• 제9권8호
• /
• pp.1020-1029
• /
• 2006

대용량 QoS(Quality-of-Service) 라우터의 구현을 위해서는 보다 낮은 복잡도의 공정패킷 스케줄러가 요구된다. 타임스탬프기반 공정패킷 스케줄러의 이상적 복잡도는 O(logV), 여기서 V는 최대 수락 흐름 수, 이지만 최근 빈(bin)개념을 도입하여 O(1)으로 대폭 줄였다. 하지만 지연 특성이 악화되고 대역폭 이용도 특성이 저하될뿐만 아니라 엄격한 지연규격의 트래픽 흐름을 수용할 수 없는 문제가 발생할 수 있다. 본 논문에서는 이러한 문제를 해결하기 위해 가변 복잡도를 갖는 MBST(Mini-Bin based Start-Time) 스케줄러를 제안하고 성능특성을 분석하였다. MBST 스케줄러는 대역폭 이용도를 높이기 위해 시작시각 기반 스케줄러의 타임스탬프 계산 방식을 적용하고, 지연 특성을 개선하기 위해 미니빈(mini-bin) 개념을 도입한다. 성능 평가 결과 대역폭 이용도의 저하 없이 시작시각 기반 스케줄러의 복잡도를 $1.8{\sim}5$배 낮출 수 있었다.

• 전자공학회논문지C
• /
• 제36C권7호
• /
• pp.36-45
• /
• 1999

ATM망에서 트래픽 흐름을 제어하고 망 자원 사용을 효율적으로 사용하기 위해서는 폭주(Congestion)발생에 의한 망 성능 저하를 막고 폭주현상에 대처할 수 있는 적응적인 제어가 필요하다. 본 논문에서는 모든 트래픽에 대해 고정된 형태의 제어를 하는 Buffered Leaky Bucket과 적응성과 예측 기능을 갖는 신경회로망(Neural Network)을 이용하여 버퍼의 효율성을 높이고 망의 서비스 품질(QoS)로 구별되는 셀 손실율과 버퍼 지연을 테스트 및 성능 비교를 하였다. 또한 입력 트래픽의 다중화를 위해 사용되는 DWRR과 DWEDF의 셀 스케쥴링 알고리즘이 균등 지연을 만족할 수 있도록 개선하였다. 셀 스케쥴러로부터 망의 폭주 정보는 신경회로망을 이용한 Leaky Bucket에서 예측된 트래픽 손실율을 제어하고 손실율 정도에 따라 토큰 발생율과 버퍼 한계값은 제어된다. 이러한 트래픽 손실율 예측은 다음 입력 트래픽에 대한 손실과 버퍼지연을 줄일 수 있도록 제어의 효율성을 높일 수 있으며 다른 제어방식에도 응용될 수 있다. ATM 트래픽에 대한 신경회로망 학습과 예측 테스트를 위해 확률 랜덤 변수에 의해 발생된 셀 발생과 예측을 모의 실험하였으며, 이때 다양한 트래픽의 QoS가 향상되었음을 알 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1768-1789
• /
• 2016

In contemporary video streaming systems based on HTTP protocol, video players at the client side are responsible for adjusting video quality to network conditions and user expectations. However, when multiple video clips are streamed simultaneously, an intricate application logic implemented in the video players overlays the TCP mechanism which is responsible for a balanced access to a shared network link. As a result, some video players may not obtain a fair share of network throughput and may be vulnerable to an unstable video bit-rate. Therefore, we propose to simplify the algorithms implemented in the video players, which are responsible for the adjustment of video quality and constrain their functionality only to sending feedback to a server about a state of the player buffer. The main logic of the system is shifted to the server, which is now responsible for bit-rate selection and prioritisation of the video streams transmitted to multiple clients. To verify our proposition, we performed several experiments in a laboratory environment which show that when the server cooperates with the clients, the video players experience fewer quality switches and the system achieves better fairness when allocating network throughput among the video players. However, this comes at the cost of worse utilisation of network bandwidth.

• 디지털콘텐츠학회 논문지
• /
• 제2권2호
• /
• pp.129-138
• /
• 2001

오늘날 인터넷의 급격한 확산과 여러가지 서비스의 개발에 따라 사용되는 데이터의 포맷도 문자, 음성, 동영상등 다양한 형태의 멀티미디어 데이터로 빠르게 변화하고 있다. 이러한 다양한 형태의 가변 데이터를 ATM 망을 통해 서비스하기 위해서는 최소 대역폭을 보장하고 사용 가능한 대역폭을 동적으로 할당하는 것이 필요하다. 이를 위해 개선된 형태의 수정된 DFBA(Differential Fair Buffer Allocation) 알고리즘을 제안하였다. 제안한 알고리즘은 최소 대역폭을 보장하면서 기존 방법의 단점인 공평성과 효율의 불균형을 해소시켜 효과적인 대역폭 관리를 하는 방안으로, 이의 성능을 시뮬레이션을 통하여 확인하였다.

• 컴퓨터교육학회논문지
• /
• 제7권1호
• /
• pp.37-44
• /
• 2004

차별서비스 네트워크는 IP 네트워크를 기반으로 서비스 품질에 대해 유사한 요구조건을 갖는 연결 집합에 대해 동일한 서비스를 제공한다. 트래픽 조절 메커니즘은 차별서비스 네트워크를 실현시키는 핵심 기능 중의 하나이다. 본 논문은 TCP 와 UDP 트래픽이 공존하는 네트워크 상황에서 TCP 트래픽의 예약 전송률을 보장하고, 과잉 배치된 네트워크 구조에서 UDP와 TCP 흐름이 여분 대역폭을 공평하게 분배할 수 있는 개선된 트래픽 조절 메커니즘을 제안한다. 시뮬레이션 방법에 의한 분석을 통해, 제안된 메커니즘은 다양한 네트워크 상황에 대해서 UDP 흐름에 따른 TCP 트래픽의 성능 저하 문제를 크게 완화하고, 여분 대역폭에 대해서도 비교적 공평하게 분배한 것으로 나타났다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.4068-4086
• /
• 2014

Due to the prevalence of powerful mobile terminals and the rapid advancements in wireless communication technologies, the wireless video streaming service has become increasingly more popular. Recent studies show that video streaming services via Transmission Control Protocol (TCP) are becoming more practical. TCP has more advantages than User Diagram Protocol (UDP), including firewall traversal, bandwidth fairness, and reliability. However, each video service shares an equal portion of the limited bandwidth because of the fair sharing characteristics inherent in TCP and this bandwidth fair sharing cannot always guarantee the video quality for each user. To solve this challenging problem, an Adaptive Multiple TCP (AM-TCP) scheme is proposed in this paper to guarantee the video quality for mobile devices in wireless networks. AM-TCP adaptively controls the number of TCP connections according to the video Rate Distortion (RD) characteristics of each stream and network status. The proposed scheme can minimize the total distortion of all participating video streams and maximize the service quality by guaranteeing the quality of each video streaming session. The simulation results show that the proposed scheme can significantly improve the quality of video streaming in wireless networks.

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

To achieve high-speed communication and to improve QoS characteristics, ATM is now being used as underlying transfer mechanism of Internet protocols, or TCP/IP. When TCP uses the ABR service in ATM networks, the ABR service control is important to improve the performance of TCP/IP traffic as long as there is no interaction between ABR rate control and TCP flow control. In such environment, the interoperability of EFCI and ER switches becomes unavoidable in order to more effectively control ABR traffic in ATM network. In this paper, we use the model of mixed EFCI-ER environment and discuss the performance issues, e.g., the fairness of bandwidth allocation, drop rate, throughput by using various ER switch algorithms. Among various ERSwitch algorithms, we present one algorithm that have a less network topology and allocate the fair share of VC bandwidth by simulation results.