• Title/Summary/Keyword: 트래픽 감소기법

Search Result 173, Processing Time 0.024 seconds

Effective Channel Allocation Scheme in the wireless multimedia environment considering multitier cell structure (무선 멀티미디어 환경에서의 중첩셀 구조를 고려한 효율적인 대역폭 할당 기법)

  • Kwon, Jae-Woo;Cho, Tae-Kyung;Choi, Myung-Ryul
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.04a
    • /
    • pp.502-506
    • /
    • 2000
  • 본 논문에서는 이동국의 위치를 추정하여 최근접셀과 인접셀을 구분하고 차등적인 대역폭 할당을 하므로써 대역폭의 효율적인 활용을 가능하게 하였고, 서비스 트래픽을 실시간 서비스와 비실시간 서비스로 분류함으로써 무선 멀티미디어 환경하에서 QoS를 보장해 줄 수 있는 방법을 제안했다. 또한 서로 다른 크기의 셀이 혼재하는 중첩 구조에서의 셀특성을 살려 신규호 및 핸드오프 호의 blocking확률과 dropping확률을 감소시킬 수 있는 방법을 제안하고 기존의 대역폭 할당방법과 비교 시뮬레이션하였다.

  • PDF

An Analytical Model of Transition Decision for Energy Saving in Optical Burst Switching Network (광 버스트 스위칭 네트워크에서의 에너지 절감을 위한 상태천이결정 분석 모델)

  • Kang, Dong-Ki;Youn, Chan-Hyun;Kim, Young-Chon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.04a
    • /
    • pp.540-543
    • /
    • 2012
  • 최근에 녹색 IT의 일환으로 IT 장비에서 소비하는 에너지 크기를 감소시킴으로써 발생하는 탄소발생률을 줄이고, 장비 운용 비용을 낮추는 연구가 각광을 받고 있다. 그에 따라 본 논문에서는 차세대 통신망의 강력한 후보로 예상되는 광 버스트 스위칭 망에서 에너지 절감 기법 중 하나인 저 전력대기 방식을 사용할 때 발생하는 에너지 소비량에 대한 수식 모델을 제안한다. 제안된 수식 모델에서는 입력되는 트래픽 패턴을 고려하여 가져갈 수 있는 상태천이확률을 구하고 이에 따른 에너지 소비량을 예측해 볼 수 있다.

Time-based DHT Peer Searching Scheme for P2P VOD Service (P2P VOD 서비스를 위한 시간 기반 DHT 피어 탐색 기법)

  • Suh, Chedu;Ko, Choonghyo;Choi, Changyeol;Choi, Hwangkyu
    • Journal of Digital Contents Society
    • /
    • v.15 no.2
    • /
    • pp.251-261
    • /
    • 2014
  • In the typical P2P VOD system, it is very important to develop the fast and efficient peer searching scheme since the peers frequently join and leave to/from P2P system. This paper proposes a new peer searching scheme for P2P VOD system based on DHT network environment. The proposed scheme constructs DHT network by managing the peers having close playback starting times and close network locations into a peer all together. The peer information is mapped onto DHT nodes by hashing the key values each of which consists of the starting time and network location of the peer. From the simulation results, the number of messages required to search the partner peers are decreased, and the number of buffer maps exchanging among the peers are also decreased. The proposed scheme can reduce the average network distances among the partner peers. As a result, the proposed scheme makes routing more efficient and it saves the network resources by decreasing communication traffic overhead.

TCP NJ+: Packet Loss Differentiated Transmission Mechanism Robust to High BER Environments (TCP NJ+ : 높은 BER에 강인한 패킷 손실 원인별 처리기반 전송방식)

  • Kim, Jung-Rae;Lee, You-Ho;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.125-132
    • /
    • 2007
  • Transmission mechanisms that include an available bandwidth estimation algorithm and a packet loss differentiation scheme, in general, exhibit higher TCP performance in wireless networks. TCP New Jersey, known as the best existing scheme in terms of goodput, improves wireless TCP performance using the available bandwidth estimation at the sender and the congestion warning at intermediate routers. Although TCP New Jersey achieves 17% and 85% improvements in goodput over TCP Westwood and TCP Reno, respectively, we further improve TCP New Jersey by exploring improved available bandwidth estimation, retransmission timeout, and recovery mechanisms. Hence, we propose TCP New Jersey PLUS (shortly TCP NJ+), showing that under 1% packet loss rate, it outperforms 3% by TCP New Jersey and 5% by TCP Wes1wood. In 5% packet loss rate, a characteristic of high bit-error-rate wireless network, it outperforms other TCP variants by 19% to 104% in terms of goodput even when the network is in bi-directional congestion.

  • PDF

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.

Wavelength assignment algorithm to reduce discontinuity of virtual links in dynamic WDM network (동적인 WDM 네트워크에서 가상 링크의 불연속성을 감소시키는 파장 할당 기법)

  • You Seung-Yeon;Kim Sung-Chun
    • The KIPS Transactions:PartC
    • /
    • v.13C no.2 s.105
    • /
    • pp.167-170
    • /
    • 2006
  • Most wavelength assignment algorithms assume that every node has infinite ADMs and I/O blocking is excluded. Furthermore wavelengths continue to occur intermittently in the network using existing algorithms. This can result in increased link blocking under dynamic traffic circumstances. In audition, it can create time-complexity problems such as O(W $N^3$) in the worst case scenario. In this paper, we propose a new wavelength assignment algorithm which has time-complexity of O(W $N^2$) and considers both I/O and link blocking. The basic idea is to maximize the number of links where wavelengths will be assigned continuously after present assignment. As a result, the number of intermittent wavelengths is minimized, and blocking probabilities are decreased.

Performance Improvement of LSU Algorithms in QoS Routing (QoS 라우팅의 LSU 알고리즘 성능 향상 기법)

  • Cho, Kang-Hong
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.3
    • /
    • pp.49-57
    • /
    • 2009
  • This paper has proposed Flow Holding Time based Link State Update(LSU) Algorithm that can improve the performance of the existing LSU algorithms. As the existing LSU algorithms are based on the network traffic information, the proposed algorithm is based on flow holding time so we can minimize the LSU message overhead and has not had a strong influence on the depreciation of QoS routing performance. We apply a flow holding time in order to decrease the number of LSU message. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

A Load Sharing Scheme to Decrease Network Traffic Using Genetic Algorithm in Heterogeneous Environment (이질형 환경에서 네트워크 트래픽 감소를 위한 유전 알고리즘을 이용한 부하 균형 기법)

  • Cho Kwang-Moon;Lee Seong-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.5 no.3
    • /
    • pp.183-191
    • /
    • 2005
  • In a sender-initiated load sharing algorithms, sender(overloaded processor) continues to send unnecessary request messages for load transfer until receiver(underloaded processor) is found while the system load is heavy. Therefore, it yields many problems such as low CPU utilization and system throughput because of inefficient inter-processor communications until the sender receives an accept message from the receiver in this environment. This paper presents an approach based on genetic algorithm(GA) for dynamic load sharing in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off is determined by the proposed GA to decrease unnecessary request messages.

  • PDF

A Reliable Data Transfer Mechanism Using Directed Diffusion in Wireless Sensor Networks (무선 센서 네트워크에서 Directed Diffusion을 이용한 신뢰성 있는 데이터 전달 기법)

  • Choi Jae-Won;Lee Kwang-Hui
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.8 s.350
    • /
    • pp.77-83
    • /
    • 2006
  • In this paper, we have pesented a reliable data transfer mechanism using Directed Diffusion in WSNs (fireless Sensor Networks). This mechanism involves selecting a route with higher reachability and transferring data along the route chosen, which is based on the end-to-end reliability calculated by the dissemination procedure of Interest packets, while each node of a sensor network maintains the only information on its neighborhood. We performed various experiments changing the link error rates and the number of nodes and discovered that this proposed mechanism improves event-to-sink data transfer reliability in WSNs. We also found that this mechanism spreads traffic load over and reduces energy consumption, which in turn prolongs network lifetime.

Distributed OCSP Certificate Verification Model for Reducing Response Time (응답시간 단축을 위한 분산 OCSP 인증서 검증 모델)

  • Choi Seung kwon;Jang Yoon sik;Ji Hong il;Shin Seung soo;Cho Yong hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4A
    • /
    • pp.304-311
    • /
    • 2005
  • OCSP has specific characters which can suspend, close, and correct in real time. But, as more clients use the OCSP server verification, more updated information is needed, which can lead to jamming in the OCSP server. To apply this technique of Distributed OCSP server so as to reduce the certificate verification OCSP from jamming. Also, the Distributed OCSP server will solve the problems of the intensive central structure. Simulation results show that the average reply time of certificate verification request and server load are reduced in the case using distributed OCSP. In addition to this advantage, resource distribution and fault tolerance are acquired because of multiple OCSP.