• 제목/요약/키워드: ASYMPTOTIC THROUGHPUT

검색결과 15건 처리시간 0.019초

ASYMPTOTIC MAXIMUM PACKET SWITCH THROUGHPUT UNDER NONUNIFORM TRAFFIC

  • JEONG-HUN PARK
    • Management Science and Financial Engineering
    • /
    • 제4권2호
    • /
    • pp.43-58
    • /
    • 1998
  • Packet switch is a key component in high speed digital networks. This paper investigates congestion phenomena in the packet switching with input buffers. For large value of switch size N, mathematical models have been developed to analyze asymptotic maximum switch throughput under nonuniform traffic. Simulation study has also been done for small values of finite N. The rapid convergence of the switch performance with finite switch size to asymptotic solutions implies that asymptotic analytical solutions approximate very closely to maximum throughputs for reasonably large but finite N. Numerical examples show that non-uniformity in traffic pattern could result in serious degradation in packet switch performance, while the maximum switch throughput is 0.586 when the traffic load is uniform over the output trunks. Window scheduling policy seems to work only when the traffic is relatively uniformly distributed. As traffic non-uniformity increases, the effect of window size on throughput is getting mediocre.

  • PDF

다중 사용자 다이버시티로부터 얻게 되는 처리율 증가에 대한 새로운 근사적 분석 (A New Asymptotic Analysis of Throughput Enhancement from Selection Diversity in Multiuser Systems)

  • 서우현;김성태;곽경철;홍대식
    • 한국통신학회논문지
    • /
    • 제32권11C호
    • /
    • pp.1111-1118
    • /
    • 2007
  • 본 논문은 다중 사용자 시스템에서 좋은 채널을 가진 사용자를 선택함으로써 얻을 수 있는 다이버시티, 즉 다중 사용자 다이버시티로부터 증대되는 처리율 (throughput)에 대해 새로운 접근 방식을 이용하여 분석하였다. 이와 같은 다중 사용자 다이버시티 이득으로부터 도출되는 처리율의 증가를 근사적 형태의 식으로 유도하기 위하여, 본 논문에서는 Puiseux 급수를 이용하였고 이를 통해 단순화된 맺음식 (closed form)의 결과를 얻을 수 있었다. 이 결과식은 다중 사용자 다이버시티 이득이 신호 대 잡음비 (SNR)에 독립적이라는 것을 보여주고 있다. 또한 본 논문에서는 위의 결과를 Max C/I과 proportional fair scheduling과 같은 스케줄링 알고리즘에 확대 적용하였다. 그리고 제시한 결과식을 모의실험과 비교하여 검증하였다.

Throughput-Reliability Tradeoff in Decode-and-Forward Cooperative Relay Channels: A Network Information Theory Approach

  • Li, Jun;Chen, Wen
    • Journal of Communications and Networks
    • /
    • 제11권5호
    • /
    • pp.445-454
    • /
    • 2009
  • Cooperative transmission protocols are always designed to achieve the largest diversity gain and the network capacity simultaneously. The concept of diversity-multiplexing tradeoff (DMT) in multiple input multiple output (MIMO) systems has been extended to this field. However, DMT constrains a better understanding of the asymptotic interplay between transmission rate, outage probability (OP) and signal-to-noise ratio. Another formulation called the throughput-reliability tradeoff (TRT) was then proposed to avoid such a limitation. By this new rule, Azarian and Gamal well elucidated the asymptotic trends exhibited by the OP curves in block-fading MIMO channels. Meanwhile they doubted whether the new rule can be used in more general channels and protocols. In this paper, we will prove that it does hold true in decode-and-forward cooperative protocols. We deduce the theoretic OP curves predicted by TRT and demonstrate by simulations that the OP curves will asymptotically overlap with the theoretic curves predicted by TRT.

Spectrum Sharing SDMA with Limited Feedback: Throughput Analysis

  • Jo, Han-Shin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권12호
    • /
    • pp.3237-3256
    • /
    • 2012
  • In the context of effective usage of a scarce spectrum resource, emerging wireless communication standards will demand spectrum sharing with existing systems as well as multiple access with higher spectral efficiency. We mathematically analyze the sum throughput of a spectrum sharing space-division multiple access (SDMA) system, which forms a transmit null in the direction of other coexisting systems while satisfying orthogonal beamforming constraints. For a large number of users N, the SDMA throughput scales as log N at high signal-to-noise ratio (SNR) ((J-1) loglog N at normal SNR), where J is the number of transmit antennas. This indicates that multiplexing gain of the spectrum sharing SDMA is $\frac{J-1}{J}$ times less than that of the non-spectrum sharing SDMA only using orthogonal beamforming, whereas no loss in multiuser diversity gain. Although the spectrum sharing SDMA always has lower throughput compared to the non-spectrum sharing SDMA in the non-coexistence scenario, it offers an intriguing opportunity to reuse spectrum already allocated to other coexisting systems.

대규모 토큰-패싱 네트웍의 점근적 성능분석 및 적응제어 (Asymptotic performance analysis and adaptive control of large-scale token-passing networks)

  • 심광현;임종태
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
    • /
    • pp.37-42
    • /
    • 1992
  • The main purpose of the paper is to derive asymptotic formulae for performance characteristics(throughput, delay) of large-scale token-passing network with buffered stations and to optimize the buffer capacity with respect to the probability of data generation. We consider two versions of token-passing network: uniform and nonuniform token-passing time interval. All results obtained are supported by simulations.

  • PDF

우선순위 및 제한 서어비스를 갖는 대규모 토큰-패싱 네트워크의 점근적 성능해석 및 적응제어 (Ayymptotic performance analysis and adaptive control of large scale limited service token-passing networks with priorities)

  • 심광현;임종태
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
    • /
    • pp.1000-1005
    • /
    • 1993
  • In this paper asymptotic formulate for performance characteristics throughput, delay) of large scale token-passing networks with priorities and limited service are given. In particular, adaptive control procedures for obtaining optimal buffer capacity with respect to each priority and optimal limited service are shown. All results obtained are supported by simulations.

  • PDF

버스트 헤더 주소 방식의 FIFO 입력 버퍼링 메카니즘을 사용하는 입력 버퍼 패킷 스위치 (Input-buffered Packet Switch with a Burst Head Addressable FIFO input buffering mechanism)

  • 이현태;손장우;전상현;김승천;이재용;이상배
    • 한국정보통신학회논문지
    • /
    • 제2권1호
    • /
    • pp.117-124
    • /
    • 1998
  • 본 논문은 입력 버퍼링 구조를 갖는 패킷 스위치에서 윈도우 방식을 이용하는 스위치 성능 개선 구조가 윈도우의 크기를 충분히 크게 하여 성능을 개선할 수 있으나 버스트성 트래픽에 대해서는 충분한 윈도우의 효과를 얻을 수 없는 단점을 개선하기 위하여 버스티 단위로 윈도우를 적용하는 BHA-FIFO 입력 버퍼 구조를 제안한다. 제안된 BHA-FIFO의 성능 분석 연구를 통하여 일반적인 FIFO를 사용하는 윈도우 방식의 스위치 성능은 버스트 길이가 커질 수록 감소하여 최대 처리율이 0.5에 수렴하지만 버스트 단위로 윈도우를 갖는 BHA-FIFO 구성에서는 같은 윈도우 크기에 대하여 제안된 BHA-FIFO 스위치의 성능이 우수하게 개선되었다.

  • PDF

The Asymptotic Throughput and Connectivity of Cognitive Radio Networks with Directional Transmission

  • Wei, Zhiqing;Feng, Zhiyong;Zhang, Qixun;Li, Wei;Gulliver, T. Aaron
    • Journal of Communications and Networks
    • /
    • 제16권2호
    • /
    • pp.227-237
    • /
    • 2014
  • Throughput scaling laws for two coexisting ad hoc networks with m primary users (PUs) and n secondary users (SUs) randomly distributed in an unit area have been widely studied. Early work showed that the secondary network performs as well as stand-alone networks, namely, the per-node throughput of the secondary networks is ${\Theta}(1/\sqrt{n{\log}n})$. In this paper, we show that by exploiting directional spectrum opportunities in secondary network, the throughput of secondary network can be improved. If the beamwidth of secondary transmitter (TX)'s main lobe is ${\delta}=o(1/{\log}n)$, SUs can achieve a per-node throughput of ${\Theta}(1/\sqrt{n{\log}n})$ for directional transmission and omni reception (DTOR), which is ${\Theta}({\log}n)$ times higher than the throughput with-out directional transmission. On the contrary, if ${\delta}={\omega}(1/{\log}n)$, the throughput gain of SUs is $2{\pi}/{\delta}$ for DTOR compared with the throughput without directional antennas. Similarly, we have derived the throughput for other cases of directional transmission. The connectivity is another critical metric to evaluate the performance of random ad hoc networks. The relation between the number of SUs n and the number of PUs m is assumed to be $n=m^{\beta}$. We show that with the HDP-VDP routing scheme, which is widely employed in the analysis of throughput scaling laws of ad hoc networks, the connectivity of a single SU can be guaranteed when ${\beta}$ > 1, and the connectivity of a single secondary path can be guaranteed when ${\beta}$ > 2. While circumventing routing can improve the connectivity of cognitive radio ad hoc network, we verify that the connectivity of a single SU as well as a single secondary path can be guaranteed when ${\beta}$ > 1. Thus, to achieve the connectivity of secondary networks, the density of SUs should be (asymptotically) bigger than that of PUs.

Secrecy Performance of Multi-Antenna Satellite-Terrestrial Relay Networks with Jamming in the Presence of Spatial Eavesdroppers

  • Wang, Xiaoqi;Hou, Zheng;Zhang, Hanwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권9호
    • /
    • pp.3152-3171
    • /
    • 2022
  • This work investigates the physical layer secrecy of a multi-antenna hybrid satellite-terrestrial relay networks (HSTRN) with jamming, in which a satellite aims to make communication with a destination user by means of a relay, along with spatially random eavesdroppers. In order to weaken the signals of eavesdroppers, the conventional relay can also generate intentional interference, besides forwarding the received signal. Shadowed-Rician fading is adopted in satellite link, while Rayleigh fading is adopted in terrestrial link, eavesdropper link and jamming link. The analytical and asymptotic formulas for the system secrecy outage probability (SOP) are characterized. Practical insights on the diversity order of the network are revealed according to the asymptotic behavior of SOP at high signal-to-noise ratio (SNR) regime. Then, analysis of the system throughput is examined to assess the secrecy performance. In the end, numerical simulation results are presented to validate the theoretical analysis and point out: (1) The secrecy performance of the considered network is affected by the channel fading scenario, the system configuration; (2) Decrease of the relay coverage airspace can provide better SOP performance; (3) Jamming from the relay can improve secrecy performance without additional network resources.

다중셀 환경에서 MIMO-MC-CDMA시스템의 점근적 성능 (Asymptotic Performance of MIMO-MC-CDMA Systems in Multi-cell Environments)

  • 김경연;함재상;이충용
    • 대한전자공학회논문지TC
    • /
    • 제44권7호통권361호
    • /
    • pp.47-52
    • /
    • 2007
  • 본 논문은 다중 셀 환경에서 MMSE 수신기를 가지는 MIMO MC-CDMA시스템의 출력 SINR을 점근적으로 분석한다. 단일 셀에서의 점근적 성능 분석이 다중셀 환경으로 확장 적용된다. 점근적 분석을 위한 Haar 유니터리 코드의 사용은 다른 셀로부터의 간섭성분이 대각성분들의 값이 다른 대각행렬로 나타나게 한다. 본 논문에서는 다른 셀의 코드 간섭 성분을 mean square측면에서 간섭의 전력으로 수렴함을 보이고, 셀간 간섭 성분이 주어질 때 점근적으로 특정 SINR값을 찾는다. 다중 셀에서의 거리에 따른 느린 페이딩을 로그노말 분포를 가정하여 구한 이론적인 비트오차 확률과 실험을 비교하여 비슷함을 보이고, 점근적 성능에 의한 데이터 전송 수율의 셀 반경에 따른 성능을 보인다.