• Title/Summary/Keyword: 대역폭 이용률

Search Result 267, Processing Time 0.026 seconds

A Hierarchical Multicast for Dynamic Adaptation to Network Congestion Status (네트워크 혼잡상태에 동적 적응을 위한 계층적 멀티캐스트)

  • Kim, Chang-Geun;Song, Jin-Kook;Gu, Myeong-Mo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.8
    • /
    • pp.1427-1433
    • /
    • 2008
  • There is SARLM scheme for dynamic adaptation to network congestion status which arises from multicast applications. However, in this scheme, when congestion occurs in a local, the waste of available bandwidth occurs in non-congestion local because of reducing of transmission rate in congestion local. In this paper, we propose a hierarchical multicast for dynamic adaptation to network congestion. In proposed scheme, we select a representative in each local. while congestion status. It receives packet from multicast sender and hierarchically transmits packet to the representative in congestion status by unicast for preventing decrease of transmission rate and the representative in congestion local transmits packet to the receivers in local by multicast. In experimental results, it was known that the proposed scheme could improve transmission rate of receivers in congestion status and more efficiently used available bandwidth.

A Combined Call Control Algorithm based on Moving Speed and Bandwidth in Hierarchical Cellular Systems (계층셀 구조에서 이동 속도와 대역폭을 고려한 복합 호 처리 알고리즘)

  • Park, Jeong-Eun;Chae, Ki-Joon
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.299-313
    • /
    • 2002
  • Recently, the demand for mobile communications and multimedia services has rapidly increased so that conventional cellular system cannot fulfill the requirement of users (capacity and QoS) any more. Therefore, the hierarchical cellular system has been suggested in order to guarantee the QoS and to admit large population of users. IMT-2000 adopts the hierarchical cellular structure, which requires a call control algorithm capable of manipulating and utilizing the complicated structure of hierarchical cellular structure with handiness and efficiency. In this thesis, as an improvement of conventional combined algorithm, a new call control algorithm considering the moving speed of terminal and bandwidth is suggested. This algorithm employs buffers and guard channels to reduce the failure rate. Also, this algorithm considers the moving speed of terminal and bandwidth to elevate the efficiency. Furthermore, calls are handled separately according to the moving speeds of terminal and bandwidths to improve the QoS and reduce the handover rate. As an evaluation of the suggested algorithm, a model hierarchical cellular system is constructed and simulations are conducted with various types of traffic. As the result of the simulations, such indices as block rate, drop rate, channel utilization, and the number of inter layer handovers are examined to demonstrate the excellency fo the suggested algorithm.

A New Energy Saving Transport Protocol in Wireless Environments (무선 환경에서 새로운 에너지 절약형 전송 프로토콜)

  • Hwang, Sae-Joon;Lee, Jung-Min;Chung, Kwang-Sue
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.654-662
    • /
    • 2005
  • Mobile portable devices for wireless network solely depend on a limited battery power. Therefore, we need to design for wireless communication protocols with an energy efficiency. TCP-Westwood is one of the most important approaches on TCP performance improvement in wireless environments that estimates the available bandwidth by using the sampling mechanism. The advantage is that data can be transmitted efficiently using the estimation of available bandwidth. However, when the sender with TCP-Westwood is in a wireless environment, it does not consider of the sampling mechanism operation. In this thesis, a new energy saving transport protocol, called E2TP(Energy Efficient Transport Protocol), is proposed to solve problems which occur when the sender with TCP-Westwood is in a wireless environment. Also, when there are packet loss while doing frequent link error in a wireless environment, E2TP provides the instantaneous segment size adjustment for a more efficient data retransmission. The simulation result proves that the proposed E2TP has better performance in energy efficiency and throughput than both TCP and TCP-Westwood.

Design of PoV(Push-to-Talk over VoIP) using ROHC(RObust Header Compressiong) Algorithm (ROHC(RObust Header Compression) 알고리즘을 이용한 PoV(Push-to-Talk over VoIP) 설계)

  • Kim, Soo-Hee;Jung, In-Sang;Jung, In-Hwang
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.324-329
    • /
    • 2006
  • PTT(Push-To-Talk)란 모든 IP기반의 유, 무선 통합 인터넷 환경으로 진화하고 있는 이동통신망을 통하여 음성 및 텍스트 기반의 일대일 및 그룹 즉시 통신을 제공하기 위한 서비스이다. 스위치를 누르고 말하면서 즉시 의사소통을 할 수 있으므로 일반적인 통화 유형의 대기 시간에 비해 매우 빠른 통화 서비스를 제공함에 따라 각 업체 및 사무실에서 사용하고 있으며 카메라폰에 이은 새로운 어플리케이션으로 부상하고 있다. 현재 이동통신망은 기본의 TDM 방식의 코어 망에서 IP방식의 코어 망으로 천이하고 있으며, 인터넷의 보급과 확산에 따른 인터넷 기술의 발전과 IMT-2000, WIBRO 등의 시스템 도입에 의해 점차 이동통신망 내의 모든 NE를 권고하고 있다. 그러나 무선망에서의 음성 통신은 기존의 통신망에서 보다는 대역폭을 많이 차지하는 단점이 있다. 또한 통화 연결에서 1:1이 아닌 1:N의 관계에 의해 통화 연결이 폭발적으로 일어나기 때문에 대역폭의 확보가 필요하며 안정적인 주파수 사용률 확보가 필요하다. 따라서 본 논문에서는 VoIP망에서의 SIP를 이용한 PTT를 서비스를 설계하고 위와 같은 문제점을 해결하기 위하여 ROHC 알고리즘을 적용하여 PTT 서비스를 설계한다.

  • PDF

A Reserved Band-Based Probabilistic Cell Scheduling Algorithm for Input Buffered ATM Switches (입력 단 저장 방식 ATM 스위치의 예약 대역폭에 기반 한 셀 스케쥴링 알고리듬)

  • 이영근;김진상;김진상
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.114-121
    • /
    • 2000
  • The problem of an input-buffered switch is the HOL(head-of-line) blocking which limits the maximum throughput but it is easy to implement in hardware. However, HOL blocking can be eliminated using aVOQ(virtual-output-queueing) technique. 0 this paper, we propose a new cell-scheduling algorithm for aninput-buffered ATM switch. The proposed algorithm, called PPIM(Probabilistic Parallel Iterative Matching), imposesa weight to every request based on the reserved bandwidth. It is shown that the input-buffered ATM switch withthe proposed PPIM algorithm not only provides high throughput and low delay but it also reduces the jitter,compared with the existing WPIM(Weighted PIM).

  • PDF

Design of Vehicle Integrated Gateway System Using Ethernet Network (이더넷을 적용한 차량 통합 게이트웨이 시스템의 설계 방안)

  • Jang, Sung-Jin;Jang, Jong-wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.705-707
    • /
    • 2014
  • The vehicle network such as CAN, MOST, Ethernet has different protocols. In the case of Ethernet data, when data is transmitted from Ethernet to MOST150, it cannot be treated by Ethernet channel of MOST150, leading to data loss and transmission delays. Thus, this thesis proposes vehicle integration GATEWAY, which can form a network by organically connecting the Ethernet and MOST150 networks and minimize the delay and data losses caused by the differences in bandwidth.

  • PDF

Multi-hop Relay System for Multicast and Broadcast Service over Mobile WiMAX (멀티캐스트와 브로드캐스트 서비스의 성능 향상을 위한 모바일 와이맥스 중계 시스템)

  • Cho, Chi-Hyun;Youn, Hee-Yong
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.3
    • /
    • pp.227-234
    • /
    • 2008
  • The development of wireless network technology allows high data rate seamless communication irrespective of the place and time in various emerging mobile service environment. Unlike wired networks, however, wireless networks utilize expensive limited bandwidth. MBS(Multicast Broadcast Service), which is supported by mobile WiMAX system based on IEEE802.16e, overcomes this problem using a shared downlink channel for efficiently supporting a number of users. However. the coverage and throughput of the system are significantly affected by the channel condition. In this paper we propose on MBS system employing Mobile Multi-Hop Relay(MMR) and adaptive modulation and coding(AMC) scheme. The result of NS-2 computer simulation shows that the throughput and transmission time are substantially improved by the proposed approach compared to the existing MBS system.

Call Admission Control for Shared Buffer Memory Switch Network with Self-Similar Traffic (Self-Similar 트래픽을 갖는 공유버퍼 메모리 스위치 네트워크 환경에서 호 수락 제어 방법)

  • Kim Ki wan;Kim Doo yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.162-169
    • /
    • 2005
  • Network traffic measurements show that the data traffic on packet switched networks has the self-similar features which is different from the traditional traffic models such as Poisson distribution or Markovian process model. Most of the call admission control researches have been done on the performance analysis of a single network switch. It is necessary to consider the performance analysis of the proposed admission control scheme under interconnected switch environment because the data traffic transmits through switches in networks. From the simulation results, it is shown that the call admission control scheme may not operate properly on the interconnected switch even though the scheme works well on a single switch. In this parer, we analyze the cell loss probability, utilization and self-similarity of output ports of the interconnected networks switch by using shared buffer memory management schemes and propose the new call admission control scheme considering the interconnected network switches under self-similar traffic environments.

A Route Selection Algorithm using a Statistical Approach (통계적 기법을 이용한 경로 선택 알고리즘)

  • Kim, Young-Min;Ahn, Sang-Hyun
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.1
    • /
    • pp.57-64
    • /
    • 2002
  • Since most of the current route selection algorithms use the shortest path algorithm, network resources can not be efficiently used also traffics be concentrated on specific paths resulting in congestgion. In this paper we propose the statistical route selections(SRS) algorithm which adopts a statistical mechanism to utilize the network resource efficiently and to avoid congestion. The SRS algorithm handles requests on demand and chooses a path that meets the requested bandwidth. With the advent of the MPLS it becomes possible to establish an explicit LSP which can be used for traffic load balancing. The SRS algorithm finds a set of link utilizations for route selection, computes link weights using statistical mechanism and finds the shortest path from the weights. Our statistical mechanism computes the mean and the variance of link utilizations and selects a route such that it can reduce the variance and the number of congested links and increase the utilization of network resources. Throughout the simulation, we show that the SRS algorithm performs better than other route selection algorithms on several metrics like the number of connection setup failures and the number of congested links.

The Optimum Path Selection Mechanism for Ubiquitous Multi-Homing Networks (유비쿼터스 멀티호밍 네트워크에서의 최적 경로 설정 메커니즘)

  • Kim, Dae-Sun;Hong, Choong-Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10d
    • /
    • pp.349-353
    • /
    • 2007
  • 유비쿼터스 네트워크환경에서 멀티호밍 기술은 무선 단말이 두 개 이상의 경로를 통해 인터넷에 연결 될 수 있는 기술로써 보다 효율적인 이동성 지원, 다중 경로를 이용한 신뢰성 보장 그리고 사용자를 위한 다양한 QoS(Quality of Service)를 제공할 수 있는 기술이다. 하지만 현재 IP 계층에서의 멀티호밍 기술은 멀티호밍의 필요성과 유용성에대한 정의 단계이며 이 기술을 지원하는 적합한 메커니즘이 없다. 따라서 본 논문에서는 IP 계층에서의 멀티호밍을 지원하기 위하여 신호의 세기, 데이터 전송률, 대역폭 사용률 그리고 트래픽의 특성과 같은 네트워크의 다양한 요소들을 분석하고 그에 따른 최적의 경로를 설정 할 수 있는 메커니즘을 제안하였다.

  • PDF