• Title/Summary/Keyword: Information provisioning function

Search Result 24, Processing Time 0.019 seconds

Implementation of Bandwidth Broker and Router for End-to-end QoS in Differentiated Service Networks (종단간 QoS 보장을 위한 차별화 서비스 지원 대역 브로커 및 라우터 구현)

  • 최영수;박기현;이성협;이강원;채희성;한태만;조유제
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.125-135
    • /
    • 2003
  • In this paper, we developmed and implemented router and bandwidth broker that provides end-to-end QoS in differentiated service IP networks. Our design goal is to provide end-to-end premium service using the EF PHB. The bandwidth broker and router were implemented in the FreeBSD 4.6 platform. For the DiffServ router, we implemented QoS daemon, rollback managment routine, monitoring, and COPS-PR client. Also, Ive implemented bandwith broker which has SLS and resource management function, and signaling protocols for interfacing intra-and inter-domain. On the testbed, we have validated and evaluated the performance of the implemented DiffServ router and bandwidth broker using the inter-domain signaling protocol client in MS Windows platform. The test results show that the end-to-end QoS can be guaranteed for the inter-domain diffServ by the implemented system.

Resource Request Scheduling for Best Effort Service in Wireless MAN : Performance Analysis (Wireless MAN에서 Best Effort 서비스를 위한 자원 요청 스케줄링 방식의 성능 분석)

  • Park, Jin-Kyung;Shin, Woo-Cheol;Ha, Jun;Choi, Cheon-Won
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.57-60
    • /
    • 2003
  • IEEE 802.16 Wireless MAN standard specifies the air interface of fixed point-to-multipoint broadband wireless access systems providing multiple service. Among the service classes supported by the wireless MAN, the BE class is ranked on the lowest position in priority and is usually deployed by multicast and broadcast polling MAC scheme. In provisioning such BE service, the delay performance is influenced by a number of components including restrictions on resource request per SS, the number of request opportunities in upward frame, scheduling requests at BS, and contention resolution method. As candidate components of MAC function for BE service, we propose single and multiple request schemes (for controling the number of requests per SS), exhaustive and limited request schemes (for regulating the amount of grant per request) and FCFS, H-SMF, pure SMF, SS-wise Round Robin, and pure Round Robin (for scheduling requests at BS). Then, we construct MAC schemes by combining the above components and evaluate the delay performance exhibited by each MAC scheme using a simulation method. From numerical results, we investigate the effect of MAC components on average delay and delay variation and observe the dissonance on collision reduction in a resource - limited environment.

  • PDF

Autoscaling Mechanism based on Execution-times for VNFM in NFV Platforms (NFV 플랫폼에서 VNFM의 실행 시간에 기반한 자동 자원 조정 메커니즘)

  • Mehmood, Asif;Diaz Rivera, Javier;Khan, Talha Ahmed;Song, Wang-Cheol
    • KNOM Review
    • /
    • v.22 no.1
    • /
    • pp.1-10
    • /
    • 2019
  • The process to determine the required number of resources depends on the factors being considered. Autoscaling is one such mechanism that uses a wide range of factors to decide and is a critical process in NFV. As the networks are being shifted onto the cloud after the invention of SDN, we require better resource managers in the future. To solve this problem, we propose a solution that allows the VNFMs to autoscale the system resources depending on the factors such as overhead of hyperthreading, number of requests, execution-times for the virtual network functions. It is a known fact that the hyperthreaded virtual-cores are not fully capable of performing like the physical cores. Also, as there are different types of core having different frequencies so the process to calculate the number of cores needs to be measured accurately and precisely. The platform independency is achieved by proposing another solution in the form of a monitoring microservice, which communicates through APIs. Hence, by the use of our autoscaling application and a monitoring microservice, we enhance the resource provisioning process to meet the criteria of future networks.

Provisioning Anonymous Communication in Ad Hoc Networks (Ad Hoc 네트워크상에서 익명성을 보장하는 방법에 관한 연구)

  • Kang, Seung-Seok
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.1
    • /
    • pp.77-85
    • /
    • 2006
  • The cost of downloading content from the Internet may be costly for mobile device users using its 3G connection, because the 3G connection cost to download data from the Internet is a function of the amount of data downloaded. This paper introduces an approach in which mobile devices, called peers, form an ad hoc network and share their downloaded content with others. As an example, spectators may want to collect/share information about players and game records in a stadium. In an art gallery, visitors may want to retrieve some background information about the displayed work from the nearby ad hoc network. In an outdoor class, a teacher may download today's topic files from the Internet, and all students may share the content with minimal or no cost paid. This is possible if mobile device has both a 3G interface and a wireless LAN interface. If the peers want to improve privacy md discourage traffic analysis when sharing content, this paper describes a low-delay anonymous connection between the sending peer and the receiving peer using two additional peers. Simulation results show that the transmission time overhead of the anonymous connection may increase 50% or less as the number of peers increase or the peers are scattered over the larger area.

  • PDF