• Title/Summary/Keyword: Network Overload

Search Result 238, Processing Time 0.025 seconds

Building Low Delay Application Layer Multicasting Trees for Streaming Services (스트리밍 서비스를 위한 적은 지연의 응용계층 멀티캐스트 트리 구축)

  • Kim, Jong-Gyung
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.10
    • /
    • pp.20-26
    • /
    • 2008
  • The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.

A Study on the Weight Allocation Method of Humanist Input Value and Multiplex Modality using Tacit Data (암묵 데이터를 활용한 인문학 인풋값과 다중 모달리티의 가중치 할당 방법에 관한 연구)

  • Lee, Won-Tae;Kang, Jang-Mook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.157-163
    • /
    • 2014
  • User's sensitivity is recognized as a very important parameter for communication between company, government and personnel. Especially in many studies, researchers use voice tone, voice speed, facial expression, moving direction and speed of body, and gestures to recognize the sensitivity. Multiplex modality is more precise than single modality however it has limited recognition rate and overload of data processing according to multi-sensing also an excellent algorithm is needed to deduce the sensing value. That is as each modality has different concept and property, errors might be happened to convert the human sensibility to standard values. To deal with this matter, the sensibility expression modality is needed to be extracted using technologies like analyzing of relational network, understanding of context and digital filter from multiplex modality. In specific situation to recognize the sensibility if the priority modality and other surrounding modalities are processed to implicit values, a robust system can be composed in comparison to the consuming of computer resource. As a result of this paper, it is proposed how to assign the weight of multiplex modality using implicit data.

Performance Analysis of Bandwidth Allocation Scheme using POBP Method in ATM Networks. (ATM 네트워크에서 POBP 방식을 이용한 대역폭 할당 방법의 성능분석)

  • 한상엽;박광채
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.3
    • /
    • pp.537-548
    • /
    • 2000
  • ATM is the effective information transmission method which multiply statistical and can accept effective the traffic of the various transmission rate. However, it can happen excessive cell loss probability and cell delay when it have temporarily overload. Therefore, it is required the effective traffic control and network resource management for which guarantee QoS(Quality of Service) in terms of users and bandwidth utilization maximization in terms of networks. In this paper, we proposed POBP(PushOut BP) scheme which mixed pushout scheme with BP(Back Pressure), reactive control scheme recommended at the ATM Forum, to guarantee QoS in two stages ATM switch networks. In proposed method, we have to understand exactly using bandwidth information in real-time and become traffic shaping. Thorough these processes, we can not only use effectively unused bandwidth, but also guarantee the fair bandwidth utilization and then can improve cell-loss possibility happened by congestion states in two stage ATM networks.

  • PDF

Application and conversion system of MPEG2-TS to RTP (MPEG2-TS를 RTP로의 적용 및 변환 시스템)

  • Shin, Geuk-Jae;Kim, Ho-Kyom;Hong, Jin-Woo;Jung, Hoe-Kyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.839-844
    • /
    • 2011
  • IPTV contents are based on MPEG2-TS(Moving Picture Expert Group-2 Transport Stream). The Created content is delivered to each home's Set-Top box through the Internet service network, which will be visible on television through the decoding process. The using and spending of content expanding were quite limited in the other existing lines' devices. For this end, provided methods are to convert MPEG2-TS to other format and then transmit it. These methods are causing not only an overload to the system but also its increasing the hardware resource requirements. In this paper, the MPEG2-TS of IPTV's content using RTP(Real time Transport Protocol) provided by the applicable variety of devices and environmental system, was designed and implemented. Through this paper, the existing MPEG2-TS is providing other devices for distribution and consumption that can give better content to the consumers which means that the QoS(Quality of Service) was enhanced. And, the increased consumption and use of content will help the IPTV business to get more development and activation.

PC Cluster Based Parallel Genetic Algorithm-Tabu Search for Service Restoration of Distribution Systems (PC 클러스터 기반 병렬 유전 알고리즘-타부 탐색을 이용한 배전계통 고장 복구)

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.8
    • /
    • pp.375-387
    • /
    • 2005
  • This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

Analysis of Performance for Computer System using BCMP Queueing Net work with Priority Levels (우선순위를 고려한 BCMP 큐잉 네트워크를 이용한 컴퓨터 시스템의 성능 분석)

  • Park, Dong-Jun;Lee, Sang-Hun;Jeong, Sang-Geun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.1
    • /
    • pp.191-199
    • /
    • 1996
  • In this paper, We assume that the closed computer system model composed of multiprocessor system is analyzed by BCMP queueing network theory with priority levels. In this system that contains terminals, processors and I/O devices, We show maximum throughput and the number of active terminals in the optimum multiprogramming levels. It is compared the performance with the other. In the result, it is obtained the optimum number of processors and active terminals. Therefore, the system model consisted of the optimum number of processor and multiprogramming level m is analyzed by the servers with a priority level. Each server is applied to the type of server which is characterized terminal, processor I/O device etc.. This model is analyzed by the server with a probability ditribution. Ideal state is proposed by the modeling for priority levels. Finally, we try to increase the performance in overload system.

  • PDF

A Push-Caching and a Transmission Scheme of Continuous Media for NOD Service on the Internet (인테넷상에서 NOD 서비스를 위한 연속미디어 전송 및 푸쉬-캐싱 기법)

  • Park, Seong-Ho;Im, Eun-Ji;Choe, Tae-Uk;Jeong, Gi-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.6
    • /
    • pp.1766-1777
    • /
    • 2000
  • In multimedia new service on the internet, there are problems such as server overload, network congestion and initial latency. To overcome these problems, we propose a proxy push-caching scheme that stores a portion of continuous media stream or entire stream, and a transmission scheme of NOD continuous media, RTP-RR and RTP-nR to exploit push-caching scheme. With the proposed push-caching scheme, NOD server pushes fixed portion of stream to a proxy when new data is generated, and the cached size of each stream changes dynamically according to the caching utility value of each stream. As a result, the initial latency of client side could be reduced and the amount of data transmitted fro ma proxy server to client could be increased. Moreover, we estimate a caching utility value of each stream using correlation between disk space occupied by the stream and the amount of data stream requested by client. And we applied the caching utility value ot replacement policies. The performance of the proxy push-caching and continuous media transmission schemes proposed were compared with other schemes using simulations. In the simulation, these schemes show better results than other schemes in terms of BHR (Byte Hit Rate), initial latency, the number of replacement and packet loss rate.

  • PDF

System Design of IDS for DDoS Detect and Defense (DDoS공격감지 및 방어를 위한 침입방지 시스템의 설계)

  • Hong, Seong-Sik
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.11
    • /
    • pp.6845-6848
    • /
    • 2014
  • This paper proposes a system design of IDS for detecting and defending against DDoS attacks on a network. The proposed system has three parts; the Alert, Attack Analyzer and Defense agent. When the server resource was reduced too much by incoming traffic, the Alert Agent sends message and traffic information to the Attack Analyzer. The message and traffic to the Attack analyzer include only the sender & receiver address and packet numbers for minimizing the overload of Attack Analyzer. Message Received Attack Analyzer investigates the Message. If the pattern of traffic is the same as the DDoS Style, the Analyzer sends a message to the Defense Agent to block that traffic. In this system, at the serious state of the server-down, the Attack analyzer uncovers the DDoS Attacker and send a message to the Defense Agent to block that traffic. This works for server reactivation as soon as possible.

A Congestion release Advertisement Method to Improve the IEEE 802.17 Resilient Packet Ring (체증해제 통보에 방식에 의한 IEEE 802.17 레질런트 패킷 링의 성능개선 연구)

  • Kim Tae-joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9B
    • /
    • pp.581-590
    • /
    • 2005
  • The IEEE 802.17 Resilient Packet Ring Working Group develops standards to support the development and deployment of Resilient Packet Ring networks in Local, Metropolitan, and Wide Area Networks for resilient and efficient transfer of data Packets at rates scalable to many gigabits Per second. It was known that the fairness algorithm of the IEEE 802.17 Resilient Packet Ring suffers from throughput degradation under an unbalanced overload. This Paper proposes a congestion release advertisement method to improve this throughput degradation and discusses its performance. Under the proposed method, a congested node decides whether its congestion is released or not. If released, it advertises the congestion release to upstream nodes, and then upstream nodes transmit their traffic without uy regulation. The proposed method is compatible with the legacy fairness algorithm.

Chaos Based Random Number Generation In Tiny MCU (소형마이콤에서의 카오스난수 발생 함수구현)

  • Hyun, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.47 no.3
    • /
    • pp.1-4
    • /
    • 2010
  • RS-485, communication bases from small network system must prepare in collision. The collision is that mean the data transfer breaks. For a stabilized communication chooses 1:N polling methods. But polling is low speed in addition to maybe overload Master device. So, usual N:N Prefers a communication. In this case, must be preparing to avoid collision or some solutions. Generally, to after collision retransmits after short time. It's called delay time for short time. When making a delay time, uses address of each systems. (Address of each node) If the many nodes collided, the each node has different delay time. When making a delay time, uses a usual random number. Making a random number is hard job. So uses a usual pseudorandom number. It is more difficult from small size MCU. The Chaos random number provides stabled value. Finally, when uses the Chaos random number, the stability and reliability of system get better.