• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.780-783
• /
• 2009

The application of MOST150 technology has been required to satisfy the demand for the automotive infotainment system and the higher bandwidth requirements caused by the increase of the multimedia processing capacity. The Ethernet technology applied gateway was implemented for an efficient transmission of multimedia, a vehicle diagnosis, an external communication, a data processing between the MOST150 and the CAN communication method applied to many existing vehicles. The new algorithm and application were suggested in order to efficiently perform the data processing between other types of communication systems. The existing MOST150 frame is mainly composed of the Control Channel, the Legacy Packet Channel(async) and the Synchronous /Isochronous Channels and performs the data processing through these sequential channels. With the sense of this process, this study suggested the new algorithm that the Mapping method of the IETF's QoS Management was applied to the MOST150 technology for the efficient QoS.

• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.1
• /
• pp.50-64
• /
• 2012

Quality of Service (QoS) and fairness considerations are undoubtedly essential parameters that need to be considered in the design of next generation scheduling algorithms. This work presents a novel game theoretic cross-layer design that offers optimal allocation of wireless resources to heterogeneous services in Orthogonal Frequency Division Multiple Access (OFDMA) networks. The method is based on the Axioms of the Symmetric Nash Bargaining Solution (S-NBS) concept used in cooperative game theory that provides Pareto optimality and symmetrically fair resource distribution. The proposed strategies are determined via convex optimization based on a new solution methodology and by the transformation of the subcarrier indexes by means of time-sharing. Simulation comparisons to relevant schemes in the literature show that the proposed design can be successfully employed to typify ideal resource allocation for next-generation broadband wireless systems by providing enhanced performance in terms of queuing delay, fairness provisions, QoS support, and power consumption, as well as a comparable total throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.39-46
• /
• 2005

As the multimedia application traffic takes more portion in the internet traffic, it is necessary to control the network congestion through the congestion control protocol. In addition, the QoS-enabled networks such as DiffServ become an indispensable technology when running the multimedia applications. However, the previously proposed end-to-end congestion control algorithms take the round trip time to react the network congestion. Thus, as the RTT becomes larger, the reaction against the congestion gets delayed further, while the network congestion gets worse. In addition the performance of end-to-end congestion control algorithm is degraded if the QoS-enabled network runs the congestion control mechanism in the network level without any coordination between them. In this paper, we propose the early rate adaptation protocol for the DiffServ network which effectively linke the congestion control algorithm at the host and the congestion mechanism in the network together. By taking advantage of early congestion notification from the network it is possible to react the network congestion more quickly and effectively.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.511-523
• /
• 2007

In broadband convergence network(BcN), heterogeneous broadband wired & wireless subnetworks and various terminal equipments will be interconnected. In order to provide end-to-end realtime multimedia services on such heterogeneous networking environment, as a result, two major problems should be resolved: i) Multimedia session establishment & negotiation that adjusts the differences in the capability of multimedia data processing at the end terminal nodes, ii) quality of service(QoS)-guaranteed connection establishment or resource reservation with connection admission control(CAC) in each heterogeneous subnetworks along the path. The session layer signaling(e.g., SIP/SDP) should be extended for QoS negotiation, and must be tightly cooperating with network layer signaling or resource reservation with CAC function. In this paper we propose a session and connection management architecture for the QoS-guaranteed realtime multimedia service provisioning on BcN, with Q-SIP/SDP, resource reservation protocol with traffic engineering extension, and CAC functions. The detailed interaction scenario and related algorithms for QoS-guaranteed realtime multimedia session, resource reservation and connection establishment are explained and analyzed. From the experimental implementation of the proposed scheme on a small scale BcN testbed, we verified that the proposed architecture is applicable for the realtime multimedia service provisioning. We analyze the network performance and QoS parameters in detail.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.407-412
• /
• 2002

A FR-ATM interworking function that has FR and ATM interfaces, should guarantee the QoS of both frame relay and ATM networks. The IWF requires the policing mechanisms for FR and ATM respectively, and needs to map the traffic parameters each other. In this case, traffic parameter mapping and policing function are performed independently. In the aspect of FR traffic policing, this function degrades processor performance if it is worked by software, or includes additional hardware function. The best way to solve this is to integrate this function into ATM function because ATM is performed by well defined hardware already. In this paper we propose the integrated traffic control mechanism. That is, frames are segmented to cells first, and then policing mechanism is applied to the cells to guarantee the FR QoS. Therefore proper policing algorithm is essential to the integrated FR traffic mechanism. The evaluations are done with simulations in comparison of existing FR algorithms, ATM VBR and GFR policing algorithms, and the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.1
• /
• pp.67-73
• /
• 2001

This paper proposes a new scheduling algorithm for broadband ATM access network. The existed scheduling algorithms (Train, Chao. Dynamic scheduling algorithm) have high cell loss rate and waste channel. These proposed mechanism utilize to control of multimedia services based on the quality of service level of the input traffic This paper suggests a functional architecture of scheduling and the scheduling algorithm to satisfy various QoS requirements. The performance measures of interest, namely steady-state cell loss probability and average delay, average delay, are discussed by simulation results.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.460-462
• /
• 2000

무선 이동통신 네트워크 환경에서는 제한된 네트워크 대역폭과 모바일 호스트(Mobile Host)의 잦은 이동성에 기인한 핸드오프(Hand-Off)로 인하여 다양한 종류의 트래픽(Traffic)에 대한 QoS(Quality of Service)를 보장하기가 용이하지 않다. 그러나, 이렇게 예측하기 힘든 다양한 특징을 가지는 무선 이동통신 네트워크 환경에서도 특정 종류의 트래픽, 예를 들자면 실시간 트래픽(Real-time Traffic)에 대하여 요구된 범위 내에서의 QoS(Quality of Service)가 반드시 보장되어야 한다. 본 논문에서는 모바일 호스트의 이동성을 제공하는 차세대 무선 이동통신 네트워크, 즉 2.5 세대라 불리는 IS-2000 무선 네트워크에서 다양한 종류의 실시간 트랙픽에 대해 QoS를 보장하기 위한 개선된 레져베이션 프로토콜(Advanced Reservation Protocol) 및 GPS 베이스드 (Global-Positioning-System Based)핸드오프 프리딕션 (Hand-Off Prediction) 알고리즘을 제안하였다.

• Journal of KIISE:Information Networking
• /
• v.27 no.3
• /
• pp.315-322
• /
• 2000

네트워크에서 QoS를 보장하기 위해 최근에 제안되는 패킷 스케줄링 알고리즘은 대부분 우선 순위에 입각한 패킷 전송 서비스를 한다. 이러한 우선 순위를 유지하기 위한 큐의 관리에는 많은 비용이 들므로 QoS를 보장하는 네트워크에서 우선 순위 큐의 관리 비용을 줄이는 노력이 필요하다. 패킷 스케줄링 알고리즘 중 RPO+(Rotate Priority Queue)는 우선 순위 FIFO(First in first out)큐를 사용하여 주기 적으로 재명명되는 패킷 스케줄링 알고리즘이다. FIFO 큐에 패킷들을 근사 정렬하여 패킷의 우선 순위를 유지하므로 계산 복잡도를 줄이지만, 패킷 우선 순위를 유지하기 위해 2배(2P)의 큐를 필요로 한다.[1] 본 논문에서는 필요한 큐의 개수를 P개의 큐로 제한하여 큐에 대한 관리 비용을 줄였으며 엔터프라이즈 환경에서 애플리케이션이 요구하는 서비스 특성에 따라 클래스로 구분하여 적합한 패킷 스케줄링 서비스를 제공하는 알고리즘을 제시한다. 본 기법은 추가적인 오버플로우 큐를 관리하고 패킷 어드미션 컨트롤러를 통해 패킷 전송 지연 시간을 제한함으로 다양한 애플리케이션의 네트워크 QoS 요구를 보장하고 패킷 전손 효율을 높였다.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.33-38
• /
• 2003

Most of the existing algorithms try to disseminate the multimedia contents of internet service provider (ISP), without taking into account characteristics and capacities of duplicated servers. However, they are less reliable without prior information on capacities of duplicated servers. In this paper we propose two algorithms, performance rating algorithm of hardware and capacity algorithm, inspired by the need of improving QoS of delivering multimedia contents without incurring long access delays when the capacities of duplicated servers are significantly different and clients locate in a fixed geographical domain Our simulation results show that they are better than HTTP response time algorithm when the multimedia contents are large and quite different from performances between duplicated servers.