• Title/Summary/Keyword: 트래픽 부하

Search Result 598, Processing Time 0.024 seconds

An Efficient SIP Messages Control in Distributed Conference Model (분산형 컨퍼런스 모델에서의 효율적 SIP 메시지 제어)

  • Jang, Choon-Seo;Lee, Ky-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.10
    • /
    • pp.71-77
    • /
    • 2012
  • In this paper, We have proposed an efficient SIP(Session Initiation Protocol) messages control which can be used to reduce conference servers load in distributed conference model. Each conference participant can control the amount of event notification messages from the conference server in real time according to its processing capacity and network circumstances. And the amount of SIP messages needed to maintain session with the conference servers can also be controlled actively in our system. The amount of SIP messages which should be processed by the conference servers can be reduced largely by using our suggested method. Therefore the conference system can be more easily expandable and total network traffic can be reduced largely in SIP environment. We have suggested new conference event packages and conference information data model with some added elements that are necessary for efficient SIP messages control. The performance of the proposed system has been evaluated by experiments.

m-Health System for Processing of Clinical Biosignals based Android Platform (안드로이드 플랫폼 기반의 임상 바이오신호 처리를 위한 모바일 헬스 시스템)

  • Seo, Jung-Hee;Park, Hung-Bog
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.7
    • /
    • pp.97-106
    • /
    • 2012
  • Management of biosignal data in mobile devices causes many problems in real-time transmission of large volume of multimedia data or storage devices. Therefore, this research paper intends to suggest an m-Health system, a clinical data processing system using mobile in order to provide quick medical service. This system deployed health system on IP network, compounded outputs from many bio sensing in remote sites and performed integrated data processing electronically on various bio sensors. The m-health system measures and monitors various biosignals and sends them to data servers of remote hospitals. It is an Android-based mobile application which patients and their family and medical staff can use anywhere anytime. Medical staff access patient data from hospital data servers and provide feedback on medical diagnosis and prescription to patients or users. Video stream for patient monitoring uses a scalable transcoding technique to decides data size appropriate for network traffic and sends video stream, remarkably reducing loads of mobile systems and networks.

Labeling network applicaion study policy settings for optimized transmission of multimedia internet (멀티미디어 인터넷망의 최적화 전송을 위한 라벨링망 응용 정책설정 고찰)

  • Gu, Hyun-Sil;Hwang, Seong-kyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.8
    • /
    • pp.1780-1784
    • /
    • 2015
  • Traditional IP routing, see only the Destination Address When Forwarding Layer 3 routing and exchange information and Destination-Based Routing Lookup is required for all Hop. Thus, all routers Full Internet routing information, the route information of more than about 120,000 may require. Therefore, the router configuration, which can be dispersed in the environment, the traffic load is required in accordance with this congestion. In this study, a unique characteristic of the Internet in the environment of an existing network Best Effect for QoS guarantee and hardware high speed switching of large multimedia data transmitted using a Labeling for forwarding a packet environment configuration is required. Video Stream Broadcast Transport Labeling rather than in much of the higher performance of the multi-step policy to most of the Video Stream Packet deulim was fixed to Labeling Header Format proposes a method of applying an effective QoS policy to a more simplified policy.

A New Mobility Management Scheme Using Pointer Forwarding in Proxy Mobile IPv6 Networks (Proxy Mobile IPv6 네트워크에서 포인터 포워딩을 이용한 이동성 관리기법)

  • Yi, Myung-Kyu;Kim, Hyung-Heon;Park, Seok-Cheon;Yang, Young-Kyu
    • The KIPS Transactions:PartC
    • /
    • v.17C no.1
    • /
    • pp.109-118
    • /
    • 2010
  • Proxy mobile IPv6 (PMIPv6) protocol is a network-based mobility management protocol to support mobility for IPv6 nodes without host involvement. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. This increases network overhead on the LMA, wastes network resources, and lengthens the delay time. Therefore, we propose a new mobility management scheme for minimizing signaling cost using the pointer forwarding. Our proposal can reduce signaling costs by registration with the neighbor MAG instead of the remote LMA using the pointer forwarding. The cost analysis using imbedded Markov chain presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

A Study on the Performance of VPN based on MPLS Networks (MPLS 망을 기반으로 하는 VPN의 성능에 관한 연구)

  • Shin, Tae-Sam;Kim, Young-Beom
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.8 no.1
    • /
    • pp.51-57
    • /
    • 2007
  • In this paper we introduce the concept of MPLS-based VPN and propose a scheme for providing VPN services in MPLS networks. Furthermore, we design the control components and the operational procedures and evaluated the performance of traditional VPN implementation methods and MPLS-based VPN. In this scheme it is possible to solve several problems that IP-based VPN pertains via the allocation of VPN ID and virtual space without tunneling, thereby providing effective VPN services. In other words, the MPLS-based VPN scheme uses MPLS networking technology together with the PSTN which can achieve a perfect segregation of user traffic on per-customer basis in a physical link and can guarantee high reliability and security levels. Specially, in the perspective of customers, it can save networking facilities installation and maintenance costs considerably. On the contrary, it possesses some shortcomings in that its deployment tends to be restricted within an ISP's network boundary and it is vulnerable to external security break-ins when going through public networks such as the Internet due to its lack of data encryption capability.

  • PDF

Relationships between optimal number of wavelenghs and tuning time in WDM/TDM passive star network (WDM 수동성형성망에서의 TDM 스케쥴링시 최적파장수와 파장조정시간과의 관계)

  • 신홍섭;신용식;박구현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.7
    • /
    • pp.1785-1796
    • /
    • 1998
  • This paper is concerned with the relationships between optimal number of wavelengths and tuning time in time division multiplexing(TDM) scheduling on wavelength division multiplexing(WDM) optical passive star networks. We assume that the traffic is nonuniform and each node has a tunable transmitter and a fixed receiver. Each node transmits spckets to all other nodes. Most of the earlier protocols on TDM based scheduling for WDM star networks [7, 8, etc.] use whold given wavelength chnnels. But in this paper, we investigate the optimal number of wavelengths that yidels minimum frame length when tuning time exists. It appears within the availble number of wavelengths that yields minimum frame length when tuning time exists. It appears within the available number of wavelengths. We analyze the relationships between optimal number of wavelengths and tuning time by experiments. We analyze the reationships between optimal number of wavelengths and tuning time by experiments. We also discuss on the possibility of reduction of frame length by increasing the number of nodes trans-mitters and receivers.

  • PDF

Effective Scalable Caching Algorithm by Minimizing Normalized Buffer Size over Constant-Bit-Rate Channel (일정한 채널 대역폭상에서 정규화 된 버퍼크기를 이용한 효율적인 선택적 캐슁 알고리즘)

  • Oh, Hyung-Rai;Song, Ywang-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8B
    • /
    • pp.535-540
    • /
    • 2005
  • This paper presents a scalable caching algorithm of proxy server with the finite storage size minimizing client's buffer size and constant-bit-rate channel bandwidth. Under the general video traffic condition, it is observed that the amount of decreased client's buffer size and channel bandwidth after caching a video frame depends on the relative frame position in the time axis as the frame size. Based on this fact, we propose an effective caching algorithm to select the cached frames by using the normalized buffer size. Finally, experimental results are provided to show the superior performance of the proposed alghrithm.

Design of Fault-Tolerant Node Architecture based on SCM in Optical Burst Switching Networks (광 버스트 스위칭 망에서 장애에 둔감한 SCM 기반의 노드 구조 설계)

  • Song Kyu-Yeop;Yoo Kyoung-Min;Yoo Wan;Lee Hae-Joung;Kim Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8B
    • /
    • pp.514-524
    • /
    • 2005
  • In optical burst switching(OBS) networks, the ingress edge router assembles packets in the same class queue into the appropriate size of burst. A burst control packet(BCP) is generated for channel reservation of corresponding data burst and sent earlier than the corresponding data burst with an offset time. Offset time is determined considering the number of hops from source to destination and the required quality of service(QoS). After offset time, the burst data is passed through tile pre-configured optical switches without any O/E/O conversion. But a failure in OBS networks may lead to the loss of bursts until the ingress nodes receive the failure indication signal. This results in a significant degradation in QoS. Therefore, in this paper, we propose a fault-tolerant node architecture based on sub-carrier multiplexing to reduce the effects of failure in OBS networks. The Performance of the proposed fault-tolerant node architecture exhibits considerable improvement as compared with the previous ones.

A Performance Evaluation of CF-Poll Piggyback Algorithm for HCCA (HCCA의 CF-Poll 피기백 알고리즘의 성능평가)

  • Lee Hyun-Jin;Kim Jae-Hyun;Cho Sung-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9B
    • /
    • pp.785-791
    • /
    • 2006
  • A CF-Poll frame which contains the channel reservation time can be piggybacked in QoS-Data frame to increase the channel efficiency in HCCA. However, if any QSTA in the network uses the low physical transmission rate, the QoS-Data frame which includes the CF-Poll frame must be transmitted by the minimum transmission rate. Therefore, it can cause the decrease of the channel efficiency and the increase of the frame transmission delay for other traffic streams when any QSTA has the low physical transmission rate. In this paper, we define this phenomenon as the piggyback problem at the low physical transmission rate and evaluate the effect of this problem. In the simulation results, when a CF-Poll piggyback is used, the delay is increased about 25% if any QSTA has the low physical transmission rate, while the delay is decreased about 7.8% if all QSTA has the high physical transmission rate. We also found that the gain of the CF-Poll piggyback mechanism is achieved when all QSTA has higher physical transmission rate than 24 or 36Mbps.

A Study on OSPF for Active Routing in Wireless Tactical Communication Network (전술통신망에서 능동적 라우팅을 위한 OSPF에 대한 연구)

  • Lee, Seung-Hwan;Lee, Jong-Heon;Lee, Hoon-Seop;Rhee, Seung-Hyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12B
    • /
    • pp.1211-1218
    • /
    • 2010
  • OSPF is the optimized routing protocol in wired network and considered as a tactical routing protocol in wireless tactical communication network. However because it is designed basically based on wired environment, it runs inadequately in wireless tactical environment: noise and jamming signal. So, we proposed new OSPF cost function to develop active routing protocol in wireless tactical communication network. In redefined cost function, there are four parameters that are relative transmission speed, link weight, router utilization, link average BER(Bit Error Rate). These parameters reflect wireless tactical characters. Also, we remodel the option field in Hello packet. It can help user to periodically check the link state. From the simulation result, it is shown that proposed OSPF is better than OSPF in jamming situation and has accumulative delay gain with dispersion of traffic load in entire network.