• 제목/요약/키워드: network throughput

검색결과 1,545건 처리시간 0.025초

WDM passive star coupler 망에서 예약 방식에 기반한 임의 접근 프로토콜에 관한 연구 (A study on random access protocol based on reservation access for WDM passive star coupler network)

  • 백선욱;최양희;김종상
    • 한국통신학회논문지
    • /
    • 제21권4호
    • /
    • pp.893-910
    • /
    • 1996
  • Recently, there ary many researches on local area multichannel network as WDM technology developes. An ideal media access protocol in a multichannel network is one that shows short access delay under low load and high throughput under heavy load. This paper proposed a new media access protocol for WDM passive star coupler network. The proposed one is a random access rpotocol based on reservation. Access delay is short under low load by using random access method, and high throughput is achieved under heavy load by usin greservation access. Analytic model for the performance analysis of the proposed protocol is developed and performance of the proposed protocol is compared with the previous ones. The effect on the performance of the number of the nodes and channels, and the number of transceivers in each node are analyzed.

  • PDF

무선 에드혹 네트워크에서 분산화된 opportunistic 패킷스케줄링 (Distributed opportunistic packet scheduling for wireless ad-hoc network)

  • 박형근;유윤섭
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
    • /
    • pp.204-206
    • /
    • 2009
  • Opportunistic scheduling is one of the important techniques to maximize multiuser diversity gain. In this paper, we propose a distributed opportunistic scheduling scheme for ad-hoc network. In the proposed distributed scheduling scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed scheduling using extensive simulation and simulation results show that proposed scheduling obtains higher network throughput than conventional scheduling schemes and has a flexibility to control the fairness and throughput by controlling the system parameter.

  • PDF

Databases and tools for constructing signal transduction networks in cancer

  • Nam, Seungyoon
    • BMB Reports
    • /
    • 제50권1호
    • /
    • pp.12-19
    • /
    • 2017
  • Traditionally, biologists have devoted their careers to studying individual biological entities of their own interest, partly due to lack of available data regarding that entity. Large, high-throughput data, too complex for conventional processing methods (i.e., "big data"), has accumulated in cancer biology, which is freely available in public data repositories. Such challenges urge biologists to inspect their biological entities of interest using novel approaches, firstly including repository data retrieval. Essentially, these revolutionary changes demand new interpretations of huge datasets at a systems-level, by so called "systems biology". One of the representative applications of systems biology is to generate a biological network from high-throughput big data, providing a global map of molecular events associated with specific phenotype changes. In this review, we introduce the repositories of cancer big data and cutting-edge systems biology tools for network generation, and improved identification of therapeutic targets.

두 단계로 구성된 순환대기네트워크의 설계 (A Design Problem of a Two-Stage Cyclic Queueing Network)

  • 김성철
    • 한국경영과학회지
    • /
    • 제31권1호
    • /
    • pp.1-13
    • /
    • 2006
  • In this paper we consider a design problem of a cyclic queueing network with two stages, each with a local buffer of limited capacity. Based on the theory of reversibility and product-form solution, we derive the throughput function of the network as a key performance measure to maximize. Two cases are considered. In case each stage consists of a single server, an optimal allocation policy of a given buffer capacity and work load between stages as well as the optimal number of customers is identified by exploiting the properties of the throughput function. In case each stage consists of multiple servers, the optimal policy developed for the single server case doesn't hold any more and an algorithm is developed to allocate with a small number of computations a given number of servers, buffer capacity as well as total work load and the total number of customers. The differences of the optimal policies between two cases and the implications of the results are also discussed. The results can be applied to support the design of certain manufacturing and computer/communication systems.

Adaptive Queue Management Based On the Change Trend of Queue Size

  • Tang, Liangrui;Tan, Yaomu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권3호
    • /
    • pp.1345-1362
    • /
    • 2019
  • Most active queue management algorithms manage network congestion based on the size of the queue but ignore the network environment which makes queue size change. It seriously affects the response speed of the algorithm. In this paper, a new AQM algorithm named CT-AQM (Change Trend-Adaptive Queue Management) is proposed. CT-AQM predicts the change trend of queue size in the soon future based on the change rate of queue size and the network environment, and optimizes its dropping function. Simulation results indicate that CT-AQM scheme has a significant improvement in loss-rate and throughput.

협대역 다중홉 전투무선망에서 기회적 데이터 중계 기법 (Opportunistic Data Relay Scheme for Narrowband Multihop Combat Radio Networks)

  • 이종관
    • 한국군사과학기술학회지
    • /
    • 제25권1호
    • /
    • pp.65-71
    • /
    • 2022
  • In this paper, we propose an opportunistic data relay scheme in narrowband multihop combat radio networks. Narrowband networks have physical restrictions on high-speed transmission. Furthermore, the topology changes dynamically due to the jamming of the enemy, signal interference between friendly forces, and movement of network entities. Therefore, the traditional relay scheme that collects topology information and calculates a relay path before transmission is unsuitable for such networks. Our proposed scheme does not collect topology information and transmits data opportunistically. The scheme can cause unnecessary data relaying that is not related to data delivery to the destination node. However, for small networks, the effect of increasing network throughput by not gathering topology information is much greater than the effect of reducing throughput by unnecessary data relays. We demonstrate the performance superiority of the proposed scheme through simulation in the worst case of network topology.

On the Trade-Off between Throughput Maximization and Energy Consumption Minimization in IEEE 802.11 WLANs

  • Serrano, Pablo;Hollick, Matthias;Banchs, Albert
    • Journal of Communications and Networks
    • /
    • 제12권2호
    • /
    • pp.150-157
    • /
    • 2010
  • Understanding and optimizing the energy consumption of wireless devices is critical to maximize the network lifetime and to provide guidelines for the design of new protocols and interfaces. In this work, we first provide an accurate analysis of the energy performance of an IEEE 802.11 WLAN, and then we derive the configuration to optimize it. We further analyze the impact of the energy configuration of the stations on the throughput performance, and we discuss under which circumstances throughput and energy efficiency can be both jointly maximized and where they constitute different challenges. Our findings are that, although an energy-optimized configuration typically yields gains in terms of throughput as compared against the default configuration, it comes with a reduction in performance as compared against the maximum-bandwidth configuration, a reduction that depends on the energy parameters of the wireless interface.

WDM 링에서 트래픽 전송효율을 최대화하기 위한 네크워크 설계방법 및 트래픽 그루밍 알고리즘 (The Network Designs And Traffic Grooming Algorithm to Maximize the Throughput in WDM Ring Networks)

  • 윤승진
    • 전기전자학회논문지
    • /
    • 제13권2호
    • /
    • pp.200-207
    • /
    • 2009
  • 본 논문은 WDM(Wavelength Division Multiplexing:파장 분할 다중화) 기법을 이용한 링 네트워크 구조의 여러가지 설계방법들을 분석하고, 트래픽 전송효율을 최대화하기 위한 트래픽 그루밍 알고리즘을 제안하였다. 이를 위하여 네트워크 구조를 크게 광경로(Lightpath) 관점을 이용한 여러 가상 토폴로지(Topology)에 의한 네트워크 설계방법과 연결-링방식의 관점을 이용한 네트워크 설계방법으로 나누어서 성능을 평가하고 비교 분석하였다. 이를 기반으로 WDM 링 네크워크 구조에서 트래픽 전송효율을 최대화할 수 있는 트래픽 그루밍 알고리즘을 제시하였다. 성능평가를 위하여 다양한 네크워크 설계방법들에 대하여 불균형 트래픽에 대하여 시뮬레이션을 실시하였다. 이를 통해 여러가지 설계방법중 최적의 방안을 도출하였고, 이를 기반으로 트래픽 전송효율을 최대화할 수 있는 트래픽 그루밍 알고리즘을 제안하였다.

  • PDF

다중-홉 선박 통신 네트워크를 위한 애드혹 자율 구성 TDMA 방식의 수율 성능 분석 (Throughput Analysis of ASO-TDMA in Multi-hop Maritime Communication Network)

  • 조구민;윤창호;강충구
    • 한국통신학회논문지
    • /
    • 제37B권9호
    • /
    • pp.741-749
    • /
    • 2012
  • 항해 중인 선박과 육상기지국간에 VHF 대역을 통해 다중-홉 데이터 통신을 수행하기 위해 애드-혹 자율 구성 TDMA (Ad Hoc Self-Organizing TDMA: ASO-TDMA) 방식이 제안된 바 있으며, 이를 통해 해로를 따라 넓은 영역에 걸쳐 항해 중인 선박들이 분산적으로 무선 자원을 공유하면서 다중-홉 애드-혹 네트워크를 구성할 수 있다. 본 논문에서는 마코프 체인 모델을 기반으로 ASO-TDMA 방식 매체접근제어 프로토콜의 평균 수율 성능을 분석한다. 또한, 모의실험을 통해 수학적 분석 결과를 검증하고, 각 홉 영역에서 부프레임의 크기와 선박의 수에 따라 수율을 최대화하기 위한 최적의 전송률이 존재함을 보인다.

OFDM 기반 무선 센서 네트워크에서의 Reserve Power를 이용한 효율적인 파워 할당 알고리즘 (An Efficient Power Allocation Algorithm in OFDM-based Wireless Sensor Networks using Reserve Power)

  • 김병호;오승열;김치하
    • 한국통신학회논문지
    • /
    • 제35권12B호
    • /
    • pp.1251-1258
    • /
    • 2010
  • OFDM은 높은 데이터 전송율을 지원할 수 있는 기술로 미래의 광대역 통신에 촉망받는 통신 방식이다. 이 논문은 주파수 선택적 페이팅 채널 환경에서 파워 예산을 각 부채널 상태에 적합하게 할당하는 알고리즘을 제안한다. 하지만 센서 네트워크의 하드웨어 제약상 기존의 파워할당 알고리즘을 적용하면 높은 계산 복잡도 때문에 실제 적용하는데 문제가 있다. 제안된 방식은 실제 환경과 비슷하게 구현되었으며 계산 복잡도를 현저히 줄여 최적의 방식에 비교할 수 있는 동시에 정해진 파워 예산을 만족 시킬 수 있다. 또한, 제안한 방식의 throughput은 최적의 throughput을 보여주는 알고리즘과 비교될 수 있을 정도의 성능을 낸다. 시뮬레이션 결과를 통해 기존 제안된 방식보다 throughput, 계산 복잡도가 뛰어남을 보여준다.