• 제목/요약/키워드: QoS based routing

검색결과 203건 처리시간 0.035초

Dynamic Routing and Priority-based Data Transmission Schemes in Avionic Ethernet for Improving Network QoS (항공전자 이더넷의 네트워크 성능 향상을 위한 동적 라우팅 기법 및 우선순위기반 데이터 전송 기법)

  • Lee, Won Jin;Kim, Yong Min
    • Journal of Advanced Navigation Technology
    • /
    • 제23권4호
    • /
    • pp.302-308
    • /
    • 2019
  • Aircraft data network (ADN) is a data networking for signal transmission among avionic systems in aircraft, and it mostly has been applied MIL-STD-1553B that guarantees high reliability considering its application environments. However, commercial Ethernet has been widely applied for ADN recently, and its range of applications have increased. Ethernet provides high speed of data transmission, however, it could not guarantee quality of service (QoS) so high as MIL-STD-1553B. In this paper, we propose dynamic routing and priority based data transmission schemes in order to improve the QoS of legacy Ethernet. Our propose schemes can be applied to Ethernet switch, and it is able to manage network traffic efficiently, and reduce the time for data transmission. We analyze the packet transmission time for both legacy and proposed schemes in Ethernet environments using simulation, and we show that our proposed scheme can reduce the time for data transmission compare to legacy spanning tree protocol.

Delay-Margin based Traffic Engineering for MPLS-DiffServ Networks

  • Ashour, Mohamed;Le-Ngoc, Tho
    • Journal of Communications and Networks
    • /
    • 제10권3호
    • /
    • pp.351-361
    • /
    • 2008
  • This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.

Improving QoS using Cellular-IP/PRC in Hospital Wireless Network

  • Kim, Sung-Hong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • 제1권2호
    • /
    • pp.120-126
    • /
    • 2006
  • In this paper, we propose for improving QoS in hospital wireless network using Cellular-IP/PRC(Paging Route Cache) with Paging Cache and Route Cache in Cellular-IP. Although the Cellular-IP/PRC technology is devised for mobile internet communication, it has its vulnerability in frequent handoff environment. This handoff state machine using differentiated handoff improves quality of services in Cellular-IP/PRC. Suggested algorithm shows better performance than existing technology in wireless mobile internet communication environment. When speech quality is secured considering increment of interference to receive in case of suppose that proposed acceptance method grooves base radio station capacity of transfer node is plenty, and most of contiguity cell transfer node was accepted at groove base radio station with a blow, groove base radio station new trench lake acceptance method based on transmission of a message electric power estimate of transfer node be. Do it so that may apply composing PC(Paging Cache) and RC(Routing Cache) that was used to manage paging and router in radio Internet network in integral management and all nodes as one PRC(Paging Router Cache), and add hand off state machine in transfer node so that can manage hand off of transfer node and Roaming state efficiently, and studies so that achieve connection function at node. Analyze benevolent person who influence on telephone traffic in system environment and forecasts each link currency rank and imbalance degree, forecast most close and important lake interception probability and lake falling off probability, GoS(Grade of Service), efficiency of cell capacity in QoS because applies algorithm proposing based on algorithm use gun send-receive electric power that judge by looking downward link whether currency book was limited and accepts or intercept lake and handles and displays QoS performance improvement.

  • PDF

An Energy Efficient Data-Centric Probing Priority Determination Method for Mobile Sinks in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율을 고려한 모바일 싱크의 데이터 중심 탐색 우선순위결정 기법)

  • Seong, Dong-Ook;Lee, Ji-Hee;Yeo, Myung-Ho;Yoo, Jae-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • 제16권5호
    • /
    • pp.561-565
    • /
    • 2010
  • Many methods have been researched to prolong sensor network lifetime using mobile technologies. In the mobile sink research, there are the track based methods and the anchor points based methods as representative operation methods for mobile sinks. However, the existing methods decrease Quality of Service (QoS) and lead the routing hotspot in the vicinity of the mobile sink. The reason is that they use static mobile paths that are not concerned about the network environments such as the query position and the data priority. In this paper, we propose the novel mobile sink operation method that solves the problems of the existing methods. In our method, the probing priority of the mobile sink is determined with the data priorities for increasing the QoS and the mobile features are used for reducing the routing hotspot. The experimental results show that the proposed method reduces query response time and improves network lifetime over the existing methods.

Design of QoS Supporting Mechanism using Openflow Protocol in Wireless Mesh Network Environments (무선 매시 네트워크 환경에서 오픈플로우 프로토콜을 이용한 QoS 지원 기법 설계)

  • Kang, Yong-Hyeog;Kim, Moon Jeong;Kim, Su-Sun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • 제18권9호
    • /
    • pp.34-41
    • /
    • 2017
  • Wireless mesh networks contain multi-hop routing protocols between wireless nodes and are connected to the Internet through a gateway. These networks perform a role as a backbone and are scalable for main applications. We propose the design of QoS supporting mechanisms for wireless mesh networks using software defined networking. Our proposed scheme is cost-effective and features adaptive QoS mechanisms for wireless router's resource constraints. The QoS mechanisms use software defined networking technology with Openflow protocol based on diffserv and intserv models with MPLS mechanism and RSVP respectively. A performance evaluation model is suggested to verify the validity of the proposed scheme using several QoSmetrics of the wireless mesh networks.

Performance Evaluation for Multicasting Video over OpenFlow-based Small-scale Network

  • Thi, Thuyen Minh;Huynh, Thong;Kong, In-Yeup;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • 제17권9호
    • /
    • pp.1084-1091
    • /
    • 2014
  • When demand for transmitting multimedia data increases, network congestion is more likely to occur and users will suffer high loss rate as well as high delay. In order to enhance quality-of-service (QoS) of video multicasting, we need to raise transmission reliability and reduce end-to-end delay. This paper proposes a routing mechanism for a OpenFlow-based small-scale network in order to multicast video reliably with low delay. In our method, multipath routing will be applied to Multiple Description (MD) Coded video to exploit its multi-description property. Through performance evaluation, our method shows improvement on loss rate, delay and video distortion.

A Rendezvous Router Decision Algorithm Considering Routing Table Size (라우팅 테이블의 크기를 고려한 랑데부 라우터 선정 알고리즘)

  • Cho, Kee-Seong;Jang, Hee-Seon;Kim, Dong-Whee
    • The KIPS Transactions:PartC
    • /
    • 제13C권7호
    • /
    • pp.905-912
    • /
    • 2006
  • Depending on the location of the rendezvous point (RP), the network efficiency is determined in the core based tree (CBT) or protocol independent multicast-sparse mode (PIM-5M) multicasting protocol to provide the multicast services based on the shared tree. In this paper, a new algorithm to allocate the RP using the estimated values of the total cost and the size(number of entries) of the routing tables is proposed for efficiently controlling the cost and the number of routing table entries. The numerical results show that the proposed algorithm reduces the total cost in 5.37%, and the size of routing tables in 13.35% as compared to the previous algorithm.

A Routing Optimization Scheme based on XMIPv4 in Mobile IP Networks (Mobile IP에서 XMIPv4 기반 경로 최적화 방안)

  • 김성희;장길웅;한기준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 한국정보과학회 2002년도 봄 학술발표논문집 Vol.29 No.1 (A)
    • /
    • pp.553-555
    • /
    • 2002
  • 현재 화상 또는 음성 회의와 같은 네트워크에 기반한 응용들의 증가와 함께 멀티캐스트 서비스의 중요성이 한층 증가되었다. Xcast는 멀티캐스트 서비스를 제공하기 새롭게 제안된 방법이고, XMIF는 MIPv4와 MIPv6 환경에서 Xcast를 이용해서 멀티캐스트 서비스를 제공하기 위한 방법이다. 하지만 XMIFv4에서는 MIP가 가지는 Triangle Routing 문제를 그대로 가지고 있고 이동 중 심각한 패킷 손실이 발생 할 수 있다. 또한 QoS를 제공하기 위해 RSVP와 같은 프로토콜을 함께 사용할 때 확장성이 용이하지 않다. 따라서, 본 논문에서는 MIPv4 환경에서 XMIPv4가 가지는 문제를 해결하기 위한 방법으로 XMIPRO를 제안한다.

  • PDF

Implementation of a QoS routing path control based on KREONET OpenFlow Network Test-bed (KREONET OpenFlow 네트워크 테스트베드 기반의 QoS 라우팅 경로 제어 구현)

  • Kim, Seung-Ju;Min, Seok-Hong;Kim, Byung-Chul;Lee, Jae-Yong;Hong, Won-Taek
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • 제48권9호
    • /
    • pp.35-46
    • /
    • 2011
  • Future Internet should support more efficient mobility management, flexible traffic engineering and various emerging new services. So, lots of traffic engineering techniques have been suggested and developed, but it's impossible to apply them on the current running commercial Internet. To overcome this problem, OpenFlow protocol was proposed as a technique to control network equipments using network controller with various networking applications. It is a software defined network, so researchers can verify their own traffic engineering techniques by applying them on the controller. In addition, for high-speed packet processing in the OpenFlow network, programmable NetFPGA card with four 1G-interfaces and commercial Procurve OpenFlow switches can be used. In this paper, we implement an OpenFlow test-bed using hardware-accelerated NetFPGA cards and Procurve switches on the KREONET, and implement CSPF (Constraint-based Shortest Path First) algorithm, which is one of popular QoS routing algorithms, and apply it on the large-scale testbed to verify performance and efficiency of multimedia traffic engineering scheme in Future Internet.

A Study on an Efficient Routing Scheme for using a priority scheme in Wireless Sensor Networks (무선 센서 네트워크 환경에서 우선순위 기법을 이용한 효율적인 경로 설정에 대한 연구)

  • Won, Dae-Ho;Yang, Yeon-Mo
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • 제48권4호
    • /
    • pp.40-46
    • /
    • 2011
  • Wireless Sensor Networks(WSNs) have shown a lot of good outcomes in providing a various functions depending on industrial expectations by deploying ad-hoc networking with helps of light loaded and battery powered sensor nodes. In particular, it is strongly requested to develop an algorithm of cross-layer control between 2-layer and 3-layer to deriver the sensing data from the end node to the sink node on time. In this paper, based on the above observation we have proposed an IEEE802.15.4 based self priority routing scheme under UC Berkely TinyOS platform. The proposed beacon based priority routing (BPR) algorithm scheme utilizes beacon periods in sending message with embedding the high priority data and thus provides high quality of service(QoS) in the given criteria. The performance measures are the packet Throughput, delivery, latency, total energy consumption. Simulation results under TinyOS Simulator(TOSSIM) have shown the proposed scheme outcome the conventional Ad hoc On-Demand Distance Vector(AODV) Routing.