• Title/Summary/Keyword: Bandwidth Utilization

Search Result 369, Processing Time 0.03 seconds

A Study on Heuristic Approaches for Routing and Wavelength Assignment in WDM All-Optical Networks (WDM 전광망에서 라우팅과 파장할당을 위한 휴리스틱 방법에 대한 연구)

  • Kim, Ki-Won;Chung, Young-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.8
    • /
    • pp.19-29
    • /
    • 2001
  • The recent explosion in the Internet applications, Internet. host number and the traffic in the IP backbone network is posing new challenges for transport network. This requires a high-speed IP backbone network that has a substantially higher bandwidth than the one offered by current networks, which prompts the development of all-optical network. To obtain optical network utilization gains, we need a software which establishs logical topology to make possible the efficient use or physical topology, and control the optical network in combination with the IP layer routing protocols. Finally, the logical topology is required higher efficient than physical topology. For this an efficient algorithm for the routing and wavelength assignment(RWA) in the WDM all-optical network is necessary. In this paper, two kinds of heuristic algorithms to establish logical topology for WDM networks and arc applied to the design of logical topology of domestic backbone network. These algorithms are found to work quite well and they arc compared with each other in terms of blocking rate, etc.

  • PDF

Design and Performance Evaluation of Hierarchical Protocol for Underwater Acoustic Sensor Networks (수중음파 센서네트워크를 위한 계층별 프로토콜의 설계 및 성능 평가)

  • Kim, Ji-Eon;Yun, Nam-Yeol;Kim, Yung-Pyo;Shin, Soo-Young;Park, Soo-Hyun;Jeon, Jun-Ho;Park, Sung-Joon;Kim, Sang-Kyung;Kim, Chang-Hwa
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.4
    • /
    • pp.157-166
    • /
    • 2011
  • As underwater environment monitoring system's interest has increased, the research is proceeding about underwater acoustic sensor network. Underwater sensor network can be applicable to many fields, such as underwater environment monitoring, underwater resource exploration, oceanic data collection, military purposes, etc. It is essential to define the PHY-MAC protocol for revitalization of the underwater acoustic sensor network which is available utilization in a variety of fields. However, underwater acoustic sensor network has to implement by consideration of underwater environmental characteristics, such as limited bandwidth, multi-path, fading, long propagation delay caused by low acoustic speed. In this paper, we define frequency of adjusted PHY protocol, network topology, MAC protocol, PHY-MAC interface, data frame format by consideration of underwater environmental characteristics. We also present system configuration of our implementation and evaluate performance based on our implementation with test in real underwater field.

An Approach for Multi-User Multimedia Requests Service to Overlay Multicast Trees (다중 사용자의 멀티미디어 요구 서비스를 위한 오버레이 멀티캐스트 트리의 구성과 복구 방안)

  • Kang, Mi-Young;Yang, Hyun-Jong;Nam, Ji-Seung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12B
    • /
    • pp.1058-1065
    • /
    • 2008
  • In the Internet, as computer resource is developed, multimedia data request being increase more and more. It is effective way that process both high capacity-data and real-time data. Overlay Multicast is an effective method for efficient utilization of system resources and network bandwidth without using hardware customization. Overlay Multicast is an effective method for multimedia data service to multi-users. Multicast tree reconstruction is required when a non-leaf host leaves or fails. In this paper, relay-frame interval is selected as revealed network-state with jitter. In our proposal, multi-user service control algorithm gives a delay effect in multimedia request time. The simulation results show that our proposal takes shorter period of time than the other algorithms to reconstruct a similar tree and that it is a more effective way to deal with a lot of nodes that have lost their multi-user nodes.

A Study on a packet scheduling scheme to enhance throughput in IEEE 802.11e WLAN system (IEEE 802.11e 무선 LAN 시스템에서 Throughput 증대를 위한 패킷 스케줄링 기법 연구)

  • Jeon, Hyeong-Ik;Jang, Jae-Shin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.421-425
    • /
    • 2005
  • The increasing number of wireless subscribers who can use internet service any time and any place have caused wireless communications networks to flourish. However, since total communication channel bandwidth for wireless communications is limited, it is very important to find the solution for maximizing the channel utilization. Thus, in this work we propose a QoS packet scheduler for IEEE 802.11e EDCA scheme which is able to maximize the channel throughput with changing the CW value considering wireless channel condition. This proposed scheme is evaluated with NS-2 network simulator under various environments and it is easily shown from the numerical results that the proposed scheme provides better performance than that of the original IEEE 802.11e scheme.

  • PDF

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.

Implementation of Cognitive Radio System with Genetic Algorithm Using USRP 2 (유전자 알고리즘이 적용된 USRP 2를 이용한 인지무선 시스템 구현)

  • Yong, Seul-Ba-Ro;Jang, Sung-Jeen;Lee, In-Sun;Kim, Jae-Moung
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.1
    • /
    • pp.39-47
    • /
    • 2012
  • Currently, most of the frequency spectrum resources are allocated and due to the lack of frequency, low frequency band, optimal for wireless communication environment is not used. Therefore, Cognitive Radio (CR) is a critical issue to solve the spectrum scarcity and to improve frequency spectrum utilization in wireless communication. In this paper, we implement data transmission and receive in a real CR system using the USRP(Universal Software Radio Peripheral) board and GNU Radio package of an open source development kit. Concretely, we detect the Primary User by spectrum sensing, and then we send Primary User information to the database. After receiving the information, because the database already sent optimal transmit power, bandwidth and channel information to CR equipment, CR can communicate without any interference to Primary User.

Implementation of a Cluster VOD Server and an Embedded Client based on Linux (리눅스 기반의 클러스터 VOD서버와 내장형에 클라이언트의 구현)

  • Seo Dongmahn;Bang Cheolseok;Lee Joahyoung;Kim Byounggil;Jung Inbum
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.6
    • /
    • pp.435-447
    • /
    • 2004
  • For VOD systems, it is important to provide QoS to more users under the limited resources. To analyze QoS issues in real environment, we implement clustered VOD server and embedded client system based on the Linux open source platform. The parallel processing of MPEG data, load balancing for nodes and VCR like functions are implemented in the server side. To provide more user friendly interface, the general TV is used for a VOD client's terminal and the embedded board is used supporting for VCR functions. In this paper, we measure the performance of the implemented VOD system under the various user requirement features and evaluate the sources of performance limitations. From these analyses, we propose the dynamic admission control method based on the availability memory and network bandwidth. The proposed method enhances the utilization of the system resource for the more QoS media streams.

Performance Analysis of IEEE 1394 High Speed Serial Bus for Massive Multimedia Transmission (대용량 멀티미디어 전송을 위한 IEEE 1394고속 직렬 버스의 성능 분석)

  • 이희진;민구봉;김종권
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.4
    • /
    • pp.494-503
    • /
    • 2003
  • The IEEE 1394 High Speed Serial Bus is a versatile, high-performance, and low-cost method of promoting interoperability between all types of A/V and computing devices. IEEE 1394 provides two transfer modes: asynchronous mode for best effort service and isochronous mode for best effort service with bandwidth reservation. This paper shows the bus performance and compared the transfer odes first at the link level and then at the application level. For the application level performance, we analyze the bus systems with fixed and adaptive interfaces, applied between the upper layer and the 1394 layer, using polling systems. Also we verifies the analysis models with simulation studies. Based on our analysis, we conclude that the adaptive interface reduces the bus access time and so increases the bus utilization.

Performance Analysis of Flow Control Method Using Virtual Switchs on ATM (ATM에서 가상 스위치를 이용한 흐름 제어 방식의 성능 분석)

  • 조미령;양성현;이상훈
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.1
    • /
    • pp.85-94
    • /
    • 2002
  • EMRCA(Explicit Max_min Rate Control Algorithm) switch, which has been proposed in the ATM(Asychronous Transfer Mode) standard, controls the ABR(Available Bit Rate) service traffic in the ATM networks. The ABR service class of ATM networks uses a feedback control mechanism to adapt to varying link capacities. The VS/VD(Virtual Source/Virtual Destination) technique offers the possibility to segment the otherwise end-to-end ABR control loop into separate loops. The improved feedback delay and the control of ABR traffic inside closed segments provide a better performance and QoS(Quality of Service) for ABR connections with respect to throughput, delay, and jitter. This paper is study of an ABR VS/VD flow control method. Linear control theory offers the means to derive correct choices of parameters and to assess performance issues, like stability of the system, during the design phase. The performance goals are a high link utilization, fair bandwidth distribution and robust operation in various environments, which are verified by discrete event simulations. The major contribution of this work is the use of linear control theory to model and design an ABR flow control method tailored for the special layout of a VS/VD switch, the simulation shows that this techniques better than conventional method.

  • PDF

Performance Evaluation of Smoothing Algorithm for Efficient Use of Network Resources in IoT environments (IoT 환경에서 네트워크 자원의 효율적인 사용을 위한 스무딩 알고리즘의 성능평가)

  • Lee, MyounJae
    • Journal of Internet of Things and Convergence
    • /
    • v.7 no.2
    • /
    • pp.47-53
    • /
    • 2021
  • In order to transmit video data stored in servers with limited bandwidth in IoT environments to many clients, a transmission plan must be established by considering factors such as the number of transmission rate changes, peak transmission rate, and transmission rate changes. This transmission plan is called smoothing, and includes CBA that minimizes the number of transmission rate increases, MCBA that minimizes the number of transmission rate changes, and MVBA to minimize the transmission rate changes. In this work, to evaluate the performance of the proposed algorithm[16], we compare the proposed algorithm with the existing smoothing algorithms with the peak rate, the number of transmission rate changes, the rate increase, the peak rate utilization, and the average transmission rate with various video data and buffer sizes. The evaluation results show that the proposed algorithm helps to efficiently use the server's finite network resources by establishing a transport plan with the lowest average transfer rate.