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

Search Result 78, Processing Time 0.022 seconds

Approximate Analysis of MAC Protocol with Multiple Self-tokens in a Slotted Ring

  • Sakuta, Makoto;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.249-257
    • /
    • 2003
  • Ring networks are very commonly exploited among local area and metropolitan area networks (LAN/MAN), whereas cells or small fixed-size packets are widely used in synchronized ring networks. In this paper, we present an analytical method for evaluating the delay-throughput performance of a MAC protocol with multiple self-tokens in a slotted ring network under uniform traffic. In our analysis, we introduce the stationary probability, which indicates the number of packets in a node. Also, it is assumed that each node has a sufficiently large amount of self-tokens, and a slotted ring has the symmetry. The analytical results with respect to delay-throughput performance have similar values to computer simulated ones. Furthermore, in order to achieve fair access under non-uniform traffic, we propose an adaptive MAC protocol, where the number of self-tokens in a node dynamically varies, based on the number of packets transmitted within a specified period. In the proposed protocol, when the number of packets transmitted by a node within a specified period is larger than a specified threshold, the node decreases the number of self-tokens in a per-node distributed method. That results in creating free slots in the ring, thus all nodes can obtain an equal opportunity to transmit into the ring. Performance results obtained by computer simulation show that our proposed protocol can maintain throughput fairness under non-uniform traffic.

Performance of LDPC Decoder of HSS based on Non-Uniform Quantization (비균일 양자화 방식 기반 HSS 방식의 LDPC 복호기 성능)

  • Kim, Tae-Hun;Kwon, Hae-Chan;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.9
    • /
    • pp.2029-2035
    • /
    • 2013
  • In this paper, we presented non-uniform quantization method for LDPC decoder specified in DVB-S2 standard. There are some problems in order to implement LDPC decoder in aspect to algorithm and implementation. In algorithm aspect, because of large number of iterations, LDPC decoding in general give rise to a large number of computation operations, mass power consumption, and decoding delay. Therefore, this paper studies Horizontal Shuffle Scheduling (HSS) algorithm which reduced iteration number without performance loss. In aspect of implementation, there are some solutions to improve the decoding speed, however this paper focused on non-uniform quantization which reduce the quantization bits of LDPC decoder. In simulation results, Decoding throughput of HSS LDPC decoder based on non-uniform quantization is 816Mbps and it improved 12% compared to conventional one.

ASYMPTOTIC MAXIMUM PACKET SWITCH THROUGHPUT UNDER NONUNIFORM TRAFFIC

  • JEONG-HUN PARK
    • Management Science and Financial Engineering
    • /
    • v.4 no.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

Dynamic Resource Allocation of Random Access for MTC Devices

  • Lee, Sung-Hyung;Jung, So-Yi;Kim, Jae-Hyun
    • ETRI Journal
    • /
    • v.39 no.4
    • /
    • pp.546-557
    • /
    • 2017
  • In a long term evolution-advanced (LTE-A) system, the traffic overload of machine type communication devices is a challenge because too many devices attempt to access a base station (BS) simultaneously in a short period of time. We discuss the challenge of the gap between the theoretical maximum throughput and the actual throughput. A gap occurs when the BS cannot change the number of preambles for a random access channel (RACH) until multiple numbers of RACHs are completed. In addition, a preamble partition approach is proposed in this paper that uses two groups of preambles to reduce this gap. A performance evaluation shows that the proposed approach increases the average throughput. For 100,000 devices in a cell, the throughput is increased by 29.7% to 114.4% and 23.0% to 91.3% with uniform and Beta-distributed arrivals of devices, respectively.

Traffic Grooming Algorithm for Maximizing Throughput in WDM Multi-Ring Networks (WDM 멀티링에서 전송효율을 최대화하기 위한 트래픽 그루밍 알고리즘)

  • Yoon, Seung-Jin;Lim, Chul-Soo
    • Journal of IKEEE
    • /
    • v.15 no.2
    • /
    • pp.157-163
    • /
    • 2011
  • In this paper, novel traffic groomming algorithms are proposed with a primary goal for maximizing throughput in WDM Multi-ring networks. To achieve this goal, we design four network topologys that are ITG, STG, MTG, PMTG and simulate the throughput in uniform traffic environments. From this methods, we proposed novel traffic groomming algorithms to maximize throughput in WDM Multi-ring networks.

Performance Analysis of Output Queued Batcher-Banyan Switch for ATM Network (ATM 망에 적용 가능한 출력단 버퍼형 Batcher-Banyan 스위치의 성능분석)

  • Keol-Woo Yu;Kyou Ho Lee
    • Journal of the Korea Society for Simulation
    • /
    • v.8 no.4
    • /
    • pp.1-8
    • /
    • 1999
  • This paper proposes an ATM switch architecture called Output Queued Batcher-Banyan switch (OQBBS). It consists of a Sorting Module, Expanding Module, and Output Queueing Modules. The principles of channel grouping and output queueing are used to increase the maximum throughput of an ATM switch. One distinctive feature of the OQBBS is that multiple cells can be simultaneously delivered to their desired output. The switch architecture is shown to be modular and easily expandable. The performance of the OQBBS in terms of throughput, cell delays, and cell loss rate under uniform random traffic condition is evaluated by computer simulation. The throughput and the average cell delay are close to the ideal performance behavior of a fully connected output queued crossbar switch. It is also shown that the OQBBS meets the cell loss probability requirement of $10^{-6}$.

  • PDF

Circuit-Switched “Network Capacity” under QoS Constraints

  • Wieselthier, Jeffrey E.;Nguyen, Gam D.;Ephremides, Anthony
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.230-245
    • /
    • 2002
  • Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

Design of the Dummy Block for Uniform Stamp Deformation in the UV Nanoimprint Lithography (UV 나노 임프린트 공정에서 스탬프 균일 변형을 위한 더미 블록 설계)

  • Kim, Nam-Woong;Kim, Kug-Weon;Chung, Tae-Eun;Sin, Hyo-Chol
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.17 no.5
    • /
    • pp.76-81
    • /
    • 2008
  • Nanoimprint lithography(NIL) is an emerging technology enabling cost-effective and high-throughput nanofabrication. Among NILs, significant efforts from both academia and industry have been put in UV NIL research and development because of its ability to pattern at room temperature and at low pressure. In UV NIL, there may be in-line set-up error of the stamp and the substrate. To compensate this error, the dummy blocks are put on the stamp and pressurized uniformly. Contact problems between the stamp and the photoresist layer on the substrate are often happened, which results in the non-uniform residual layer In this paper, the pressurization method on the dummy block is investigated by the finite element method. A new method is recommended and evaluated far the uniform stamp deformation.

The Development of Uniform Pressurizing System for Extremely Large Area UV-NIL (극대면적 UV-NIL 공정에서의 균일 가압 시스템 개발)

  • Choi, Won-Ho;Shin, Yoon-Hyuk;Yeo, Min-Ku;Yim, Hong-Jae;Sin, Dong-Hun;Jang, Si-Youl;Jeong, Jay-Il;Lee, Kee-Sung;Lim, Si-Hyung
    • Proceedings of the KSME Conference
    • /
    • 2008.11a
    • /
    • pp.1917-1921
    • /
    • 2008
  • Ultraviolet-nanoimprint lithography (UV-NIL) is promising technology for cost effectively defining micro/nano scale structure at room temperature and low pressure. In addition, this technology is fascinating because of it's possibility for high-throughput patterning without complex processes. However, to acquire good micro/nano patterns using this technology, there are some challenges such as uniformity and fidelity of patterns, etc. In this paper, we have focused on uniform contact mechanism and performed contact mechanics analysis. The dimension of the flexible sheet to get adequate uniform contact area has been obtained from contact mechanics simulation. Based on this analysis, we have made a uniform pressurizing device and confirmed its uniform pressurized zone using a pressure sensing paper.

  • PDF

p-Persistent MAC Protocol for WDM Ring Networks

  • So, Won-Ho;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9B
    • /
    • pp.589-597
    • /
    • 2007
  • In this paper, a WDM metro ring consisting of access nodes with $FT-FR^n$ (Fixed Transmitter - n Fixed Receivers) is considered. A trade-off exists between node throughput and transmission fairness because the access nodes share wavelength channels. In order to eliminate the transmission unfairness and to increase throughput, the p-persistent medium access control (MAC) protocol is proposed: each node uses an empty optical slot to transmit a packet and make it available with the extraction of a transferred packet at the source access node, called source-stripping. The local empty slot can be used to transfer a head-of-line packet in the local buffer with probability p or it is used for the next downstream nodes with 1-p. The proposed MAC protocol provides better node throughput than the non-persistent protocol and exhibits better fairness index than the 1-persistent protocol in WDM ring networks. In addition, numerical analysis shows that the proposed MAC protocol maximizes the node throughput under uniform traffic conditions. For more detailed results, we use the network simulation under Poisson and self-similar traffic. Furthermore, unpredictable traffic constructed by the combination of the former and the latter is also considered. The reasonable probability of the p-persistent protocol for a given architecture can be determined through simulation.