• Title/Summary/Keyword: QoS Management

Search Result 619, Processing Time 0.031 seconds

A Multi-Agent Message Transfer Architecture based on the Messaging Middleware ZeroMQ (메시지 지향 미들웨어 ZeroMQ 기반의 다중 에이전트 메시지 전송 구조)

  • Chang, Hai Jin
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.4
    • /
    • pp.290-298
    • /
    • 2015
  • This paper suggests a multi-agent message transport architecture based on the message-oriented middleware ZeroMQ. Compared with the other middlewares such as CORBA, Ice, and Thrift, ZeroMQ receives a good score in the evaluation of performance, QoS (Quality of Service), patterns, user friendliness, and resources. The suggested message transfer architecture borrowed many basic concepts like agent platform, AMS (Agent Management System), and MTS (Message Transfer System) from FIPA (Foundation for Intelligent Physical Agents) standard multi-agent specifications, and the architecture inherited the strength of the architecture from the multi-agent framework SMAF (Smart Multi-Agent Framework). The architecture suggested in this paper is a novel peer-to-peer architecture which is not known to the ZeroMQ community. In the suggested architecture, every MTS agent uses only one ZeroMQ router socket to support peer-to-peer communication among MTS agents. The suggested architecture can support closely collaborating software areas such as intelligent robots as well as the traditional application areas of multi-agent architecture. The suggested architecture has interoperability and scalability with the ZeroMQ devices and patterns.

Performance Improvement of the Statistic Signature based Traffic Identification System (통계 시그니쳐 기반 트래픽 분석 시스템의 성능 향상)

  • Park, Jin-Wan;Kim, Myung-Sup
    • The KIPS Transactions:PartC
    • /
    • v.18C no.4
    • /
    • pp.243-250
    • /
    • 2011
  • Nowadays, the traffic type and behavior are extremely diverse due to the appearance of various services on Internet, which makes the need of traffic identification important for efficient operation and management of network. In recent years traffic identification methodology using statistical features of flow has been broadly studied. We also proposed a traffic identification methodology using payload size distribution in our previous work, which has a problem of low completeness. In this paper, we improved the completeness by solving the PSD conflict using IP and port. And we improved the accuracy by changing the distance measurement between flow and statistic signature from vector distance to per-packet distance. The feasibility of our methodology was proved via experimental evaluation on our campus network.

Analysis of Operation Areas for Automatically Tuning Burst Size-based Loss Differentiation Scheme Suitable for Transferring High Resolution Medical Data (고해상도 의학 데이터 전송에 적합한 자동 제어 버스트 크기 기반 손실 차등화 기법을 위한 동작 영역 분석)

  • Lee, Yonggyu
    • Journal of Digital Convergence
    • /
    • v.20 no.4
    • /
    • pp.459-468
    • /
    • 2022
  • In medical area, very high resolution images, which is loss sensitive data, are used. Therefore, the use of optical internet with high bandwidth and the transmission of high realiability is required. However, according to the nature of the Internet, various data use the same bandwidth and a new scheme is needed to differentiate effectively these data. In order to achieve the differentiation, optical delay line buffers are used. However, these buffers is constructed based on some optimal values such as the average offered load, measured data burst length, and basic delay unit. Once the buffers are installed, they are impossible to reinstall new buffers. So, the scheme changing burst length dynamically was considered. However, this method is highly unstable. Therefore, in this article, in order to guarantee the stable operation of the scheme, the analysis of operation conditions is performed. With the analysis together with the scheme, high resolution medical data with the higher class can transmit stably without loss.

A New Recovery Method to Privide Diverse Service Demands for Loss Sensitive Medical Data on IP over WDM Networks (IP over WDM 네트워크에서 손실에 민감한 의료 데이터를 위한 다양한 서비스 요구사항을 만족하는 새로운 복구 방법)

  • Lee, Yonggyu
    • Journal of Digital Convergence
    • /
    • v.20 no.3
    • /
    • pp.377-388
    • /
    • 2022
  • Various researches are actively studied to satisfy exponentially increasing the usage of the Internet as well as the diverse service demands. Especially the Optical Internet that delivers several Tbps through a single optical fiber requires the intelligence to satisfy the various types of survivability requirements. In the paper, a novel recovery scheme that satisfies the various restoration demands in IP over WDM networks is proposed. The scheme classifies the restoration services into three classes and applies dedicated protection and shared restoration scheme with different priorities for each class. Also, a configuration scheme for information database to support the scheme is proposed. This scheme satisfies the different degree of restoration demands in terms of restoration time, blocking rate and resource usage. With the scheme, medical data can be transmitted without loss.

Adaptive Burst Size-based Loss Differentiation for Transmitting Massive Medical Data in Optical Internet (광 인터넷에서 대용량 의학 데이터 전송을 위한 적응형 버스트 길이 기반 손실 차등화 기법)

  • Lee, Yonggyu
    • Journal of Digital Convergence
    • /
    • v.20 no.3
    • /
    • pp.389-397
    • /
    • 2022
  • As increasing the growth of the Internet in medical area, a new technology to transmit effectively massive medical data is required. In optical internet, all OBS nodes have fiber delay lines, hardware components. These components are calculated under some optimal traffic conditions, and this means that if the conditions change, then the components should be altered. Therefore, in this article a new service differentiation algorithm using the previously installed components is proposed, which is used although the conditions vary. When traffic conditions change, the algorithm dynamically recalculates the threshold value used to decide the length of data bursts. By doing so, irrelevant to changes, the algorithm can maintain the service differentiation between classes without replacing any fiber delay lines. With the algorithm, loss sensitive medical data can be transferred well.

A refinement of customer satisfactory factors in multimedia contentware evaluation process - focused on company website design - (멀티미디어 컨텐트웨어 상품에 대한 소비자 감성 평가 요소(문화성 인자)추출에 관한 연구 - 기업 웹사이트를 중심으로 -)

  • 이종호;김명석;이현이;김태균
    • Archives of design research
    • /
    • v.11 no.1
    • /
    • pp.291-302
    • /
    • 1998
  • This paper covers the development process of multimedia evaluation system, especially focused on customer satisfactory factors while customers navigating net-based Interactive multimedia system. Customers usually experience new level of interaction cased by newly developed web-based technology In ordinary multimedia system. However, if it gives customers satisfactory experience is a matter of question. To find out the relationship between customer satisfaction and interactivity factors exposed by multimedia system, a model has been developed which describes the structure of web-based multimedia system and its relation to customer satisfactory factors. Five different experiments, including 'semantic differential', 'focus group interview', and 'expert review', has been conducted and four customer satisfactory factors were identified. Those are 'customery value', 'structural perfectness', 'visual perfectness', and 'contemporaneity'. With these factors and newly delveoped evaluation system, 7 different web-site has been evaluated and analyzed at the end of this report.

  • PDF

Adaptive Power Control Dynamic Range Algorithm in WCDMA Downlink Systems (WCDMA 하향 링크 시스템에서의 적응적 PCDR 알고리즘)

  • Jung, Soo-Sung;Park, Hyung-Won;Lim, Jae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9A
    • /
    • pp.1048-1057
    • /
    • 2004
  • WCDMA system is 3rd generation wireless mobile system specified by 3GPP. In WCDMA downlink, two power control schemes are operated. One is inner loop power control operated m every slot Another is outer loop power control based on one frame time. Base staion (BS) can estimate proper transmission power by these two power control schemes. However, because each MS's transmission power makes a severe effect on BS's performance, BS cannot give excessive transmission power to the speclfic user 3GPP defined Power Control Dynamic Range (PCDR) to guarantee proper BS's performance. In this paper, we propose Adaptive PCDR algorithm. By APCDR algorithm, Radio Network Controller (RNC) can estimate each MS's current state using received signal to interference ratio (SIR) APCDR algorithm changes MS's maximum code channel power based on frame. By proposed scheme, each MS can reduce wireless channel effect and endure outages in cell edge. Therefore, each MS can obtain better QoS. Simulation result indicate that APCDR algorithm show more attractive output than fixed PCDR algorithm.

Improvement of F-GCRA Algorithm for ATM-GFR Service (ATM-GFR 서비스를 위한 F-GCRA 알고리즘 개선)

  • Park, In-Yong
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7 s.110
    • /
    • pp.889-896
    • /
    • 2006
  • ATM Forum has defined a guaranteed frame rate (GFR) service to serve Internet traffic efficiently. The GFR service provides virtual connections (VCs) for minimum cell rate (MCR) guarantees and allows them to fairly share the residual bandwidth. And ATM Forum has recommended a frame-based generic cell rate algorithm (F-GCRA) as a frame classifier, which determines whether an Am cell is eligible to use the guaranteed bandwidth in a frame level. An ATM switch accommodates cells in its buffer or drops them in a frame level according to current buffer occupancy. A FIFO shared buffer has so simple structure as to be feasibly implemented in switches, but has not been able to provide an MCR guarantee for each VC without buffer management based on per-VC accounting. In this paper, we enhance the F-GCRA frame classifier to guarantee an MCR of each VC without buffer management based on per-VC accounting. The enhanced frame classifier considers burstness of TCP traffic caused by congestion control algorithm so as to enable each VC to use its reserved bandwidth sufficiently. In addition, it is able to alleviate the unfairness problem in usage of the residual bandwidth. Simulation results show that the enhanced frame classifier satisfies quality of services (QoSs) of the GFR service for the TCP traffic.

Big Data Based Dynamic Flow Aggregation over 5G Network Slicing

  • Sun, Guolin;Mareri, Bruce;Liu, Guisong;Fang, Xiufen;Jiang, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4717-4737
    • /
    • 2017
  • Today, smart grids, smart homes, smart water networks, and intelligent transportation, are infrastructure systems that connect our world more than we ever thought possible and are associated with a single concept, the Internet of Things (IoT). The number of devices connected to the IoT and hence the number of traffic flow increases continuously, as well as the emergence of new applications. Although cutting-edge hardware technology can be employed to achieve a fast implementation to handle this huge data streams, there will always be a limit on size of traffic supported by a given architecture. However, recent cloud-based big data technologies fortunately offer an ideal environment to handle this issue. Moreover, the ever-increasing high volume of traffic created on demand presents great challenges for flow management. As a solution, flow aggregation decreases the number of flows needed to be processed by the network. The previous works in the literature prove that most of aggregation strategies designed for smart grids aim at optimizing system operation performance. They consider a common identifier to aggregate traffic on each device, having its independent static aggregation policy. In this paper, we propose a dynamic approach to aggregate flows based on traffic characteristics and device preferences. Our algorithm runs on a big data platform to provide an end-to-end network visibility of flows, which performs high-speed and high-volume computations to identify the clusters of similar flows and aggregate massive number of mice flows into a few meta-flows. Compared with existing solutions, our approach dynamically aggregates large number of such small flows into fewer flows, based on traffic characteristics and access node preferences. Using this approach, we alleviate the problem of processing a large amount of micro flows, and also significantly improve the accuracy of meeting the access node QoS demands. We conducted experiments, using a dataset of up to 100,000 flows, and studied the performance of our algorithm analytically. The experimental results are presented to show the promising effectiveness and scalability of our proposed approach.