Throughput

View this topic in
In communication networks, such as Ethernet or packet radio, throughput or network throughput is the average rate of successful message delivery over a communication channel. (Wikipedia.org)






Conferences related to Throughput

Back to Top

2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

The International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) is an annual academic conference in the wireless research arena organized by the Institute of Electrical and Electronics Engineers' Communications Society. This event has emerged as one of the Communications Society flagship conferences in telecommunications with a long history of bringing together academia, industry and regulatory bodies.


2013 IEEE International Symposium on Low Power Electronics and Design (ISLPED)

technology, architecture, circuits, tools, systems, software and applications


2013 19th Asia-Pacific Conference on Communications (APCC)

Technical forum for researchers and engineers to interact and disseminate information on the latest developments in advanced communication and information technologies

  • 2011 IEEE 17th Asia-Pacific Conference on Communications (APCC)

    Mobile and Wireless Communications, Optical Communication System, Telecommunication Networks, Wireless Ad Hoc and Sensor Networks, Information and Coding Theory, Internet Technologies

  • 2010 16th Asia-Pacific Conference on Communications (APCC)

    The 16th Asia-Pacific Conference on Communications (APCC2010) will be held in the City of Sails Auckland, New Zealand. This will be in conjunction with ATNAC 2010. Since 1993, APCC has been the forum for researchers and engineers to present and discuss topics related to advanced information and communication technologies and services, while at the same time opening the door to the world of industry and users. Prospective authors are invited to submit original technical papers for presentation at the confere


2012 Eighth International Conference on Mobile Ad-hoc and Sensor Networks (MSN)

The subjects of MSN'12 are relevant to the taxonomy of C.2.7.c, C.2.8 and J.9.f.

  • 2008 4th International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2008)


2012 Third Asian Himalayas International Conference on Internet (AH-ICI)

Home and Health networking, rural communications, Mobility and Mobile Payment, Broadband access, satellite services, rural communications and Mobile and Wireless Communications, optical communications and networking, architectures, & protocols.

  • 2011 Second Asian Himalayas International Conference on Internet (AH-ICI)

    Home and Health networking, Electronic commerce, Mobility and Mobile Payment, Broadband access, satellite services, rural communications and Mobile and Wireless Communications, optical communications and networking, architectures, protocols, planning and design, management and operation, simulation and performance modeling.

  • 2009 First Asian Himalayas International Conference on Internet (AH-ICI)

    The First South Central Asian Himalayas Regional IFIP International Conference on INTERNET AH ICI 2009 invites high-quality recent research results in the areas of Home and Health networking, Electronic commerce, Mobility and Mobile Payment, Broadband access, satellite services, rural communications and Mobile and Wireless Communications, optical communications and networking, architectures, protocols, planning and design, management and operation, simulation and performance modeling. AH ICI 2009 brin


More Conferences

Periodicals related to Throughput

Back to Top

Information Theory, IEEE Transactions on

The fundamental nature of the communication process; storage, transmission and utilization of information; coding and decoding of digital and analog communication transmissions; study of random interference and information-bearing signals; and the development of information-theoretic techniques in diverse areas, including data communication and recording systems, communication networks, cryptography, detection systems, pattern recognition, learning, and automata.


Mobile Computing, IEEE Transactions on

IEEE Transactions on Mobile Computing publishes archival research results on mobility of users, systems, data and computing, issues in information organization and access, and services, management, and applications; Emphasis on various areas of nomadic computing, multimedia applications, mobile data and knowledge management, and mobile communication systems and networking. TMC focuses on key technical issues related to (a) architectures, (b) support ...


Multimedia, IEEE Transactions on

The goal of IEEE Transactions on Multimedia is to integrate all aspects of multimedia systems and technology, signal processing, and applications. It will cover various aspects of research in multimedia technology and applications including, but not limited to: circuits, algorithms and macro/micro-architectures, software, detailed design, synchronization, interaction, joint processing and coordination of multimedia and multimodal signals/data, compression, storage, retrieval, communication, ...


Networking, IEEE/ACM Transactions on

Network architecture and design, communication protocols, network software, network technologies, network software, network technologies, network services and applications, and network operations and management.


Vehicular Technology, IEEE Transactions on

IEEE Transactions on Vehicular Technology was one of the most-cited journals, ranking number-six (tying with IEEE Communications Letters) in telecommunications in 2002, according to the annual Journal Citation Report (2002 edition) published by the Institute for Scientific Information. This periodical covers land, airborne, and maritime mobile services; portable or hand-carried and citizens' communications services, when used as an adjunct to ...



Most published Xplore authors for Throughput

Back to Top

Xplore Articles related to Throughput

Back to Top

To Send or Not to Send - Learning MAC Contention

SaiDhiraj Amuru; Yuanzhang Xiao; Mihaela van der Schaar; R. Michael Buehrer 2015 IEEE Global Communications Conference (GLOBECOM), 2015

The exponential back-off mechanism, proposed for reducing MAC- layer contention in the 802.11 standard, is sub-optimal in terms of the network throughput. This back-off mechanism and its improved variants are especially inefficient under unknown dynamics such as packet arrivals and user entry/exit. In this paper, we formulate the problem of optimizing this back- off mechanism as a Markov decision process, ...


Optimizing Speed of a True Random Number Generator in FPGA by Spectral Analysis

Knut Wold; Slobodan Petrovic 2009 Fourth International Conference on Computer Sciences and Convergence Information Technology, 2009

Security and speed are two important properties of today's communication systems. In order to generate initialization vectors and keys for such communication fast enough, a true random number generator (TRNG) with a high bit rate is needed. In this paper an FPGA implementation of a TRNG based on several equal length oscillator rings that achieves a high bit rate is ...


Network Quality Adaptive Video Transmission

Fakher Oueslati; Jean-Charles Grégoire 2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing, 2015

Steady improvements in bandwidth offerings over wireline and most recently even wireless networks has helped the emergence of so-called Over the top (OTT) services, that is, quality-sensitive applications which adapt to device and network conditions to deliver a service with a suitable quality for its users. Unlike traditional multimedia deployed over quality-enabled networks, OTT services cannot rely on guaranteed quality ...


Asymmetry-Aware Work-Stealing Runtimes

Christopher Torng; Moyang Wang; Christopher Batten 2016 ACM/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA), 2016

Amdahl's law provides architects a compelling reason to introduce system asymmetry to optimize for both serial and parallel regions of execution. Asymmetry in a multicore processor can arise statically (e.g., from core microarchitecture) or dynamically (e.g., applying dynamic voltage/frequency scaling). Work stealing is an increasingly popular approach to task distribution that elegantly balances task-based parallelism across multiple worker threads. In ...


Receiver-Based Flow Control for Networks in Overload

Chih-ping Li; Eytan Modiano IEEE/ACM Transactions on Networking, 2015

We consider utility maximization in networks where the sources do not employ flow control and may consequently overload the network. In the absence of flow control at the sources, some packets will inevitably have to be dropped when the network is in overload. To that end, we first develop a distributed, threshold-based packet-dropping policy that maximizes the weighted sum throughput. ...


More Xplore Articles

Educational Resources on Throughput

Back to Top

eLearning

To Send or Not to Send - Learning MAC Contention

SaiDhiraj Amuru; Yuanzhang Xiao; Mihaela van der Schaar; R. Michael Buehrer 2015 IEEE Global Communications Conference (GLOBECOM), 2015

The exponential back-off mechanism, proposed for reducing MAC- layer contention in the 802.11 standard, is sub-optimal in terms of the network throughput. This back-off mechanism and its improved variants are especially inefficient under unknown dynamics such as packet arrivals and user entry/exit. In this paper, we formulate the problem of optimizing this back- off mechanism as a Markov decision process, ...


Optimizing Speed of a True Random Number Generator in FPGA by Spectral Analysis

Knut Wold; Slobodan Petrovic 2009 Fourth International Conference on Computer Sciences and Convergence Information Technology, 2009

Security and speed are two important properties of today's communication systems. In order to generate initialization vectors and keys for such communication fast enough, a true random number generator (TRNG) with a high bit rate is needed. In this paper an FPGA implementation of a TRNG based on several equal length oscillator rings that achieves a high bit rate is ...


Network Quality Adaptive Video Transmission

Fakher Oueslati; Jean-Charles Grégoire 2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing, 2015

Steady improvements in bandwidth offerings over wireline and most recently even wireless networks has helped the emergence of so-called Over the top (OTT) services, that is, quality-sensitive applications which adapt to device and network conditions to deliver a service with a suitable quality for its users. Unlike traditional multimedia deployed over quality-enabled networks, OTT services cannot rely on guaranteed quality ...


Asymmetry-Aware Work-Stealing Runtimes

Christopher Torng; Moyang Wang; Christopher Batten 2016 ACM/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA), 2016

Amdahl's law provides architects a compelling reason to introduce system asymmetry to optimize for both serial and parallel regions of execution. Asymmetry in a multicore processor can arise statically (e.g., from core microarchitecture) or dynamically (e.g., applying dynamic voltage/frequency scaling). Work stealing is an increasingly popular approach to task distribution that elegantly balances task-based parallelism across multiple worker threads. In ...


Receiver-Based Flow Control for Networks in Overload

Chih-ping Li; Eytan Modiano IEEE/ACM Transactions on Networking, 2015

We consider utility maximization in networks where the sources do not employ flow control and may consequently overload the network. In the absence of flow control at the sources, some packets will inevitably have to be dropped when the network is in overload. To that end, we first develop a distributed, threshold-based packet-dropping policy that maximizes the weighted sum throughput. ...


More eLearning Resources

IEEE-USA E-Books

  • No title

    This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels, mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput-utility, power, and distortion. Explicit performance-delay tradeoffs are provided to illustrate the cost of approaching optimality. This theory is also applicable to problems in operations research and economics, where energy-efficient and profit-maximizing decisions must be made without knowing the future. Topics in the text include the following: - Queue stability theory - Backpressure, max- weight, and virtual queue methods - Primal-dual methods for non-convex stochasti utility maximization - Universal scheduling theory for arbitrary sample paths - Approximate and randomized scheduling theory - Optimization of renewal systems and Markov decision systems Detailed examples and numerous problem set questions are provided to reinforce the main concepts. Table of Contents: Introduction / Introduction to Queues / Dynamic Scheduling Example / Optimizing Time Averages / Optimizing Functions of Time Averages / Approximate Scheduling / Optimization of Renewal Systems / Conclusions

  • No title

    With the explosive increase in the number of mobile devices and applications, it is anticipated that wireless traffic will increase exponentially in the coming years. Moreover, future wireless networks all carry a wide variety of flows, such as video streaming, online gaming, and VoIP, which have various quality of service (QoS) requirements. Therefore, a new mechanism that can provide satisfactory performance to the complete variety of all kinds of flows, in a coherent and unified framework, is needed. In this book, we introduce a framework for real-time wireless networks. This consists of a model that jointly addresses several practical concerns for real-time wireless networks, including per-packet delay bounds, throughput requirements, and heterogeneity of wireless channels. We detail how this framework can be employed to address a wide range of problems, including admission control, packet scheduling, and utility maximization. Table of Contents: Preface / Introduction / A Study of the Base Case / Admission Control / Scheduling Policies / Utility Maximization without Rate Adaptation / Utility Maximization with Rate Adaptation / Systems with Both Real-Time Flows and Non-Real-Time Flows / Broadcasting and Network Coding / Bibliography / Authors' Biographies

  • Application Service Quality

    This chapter considers the service offered by applications to end users and the metrics used to characterize the quality of that service. A handful of common service quality metrics that characterize application service quality are detailed. These user service key quality indicators (KQIs) are considered in depth. A simple cloud-based application with a pool of frontend components distributing work across a pool of backend components is illustrated. The chapter then focuses on two high-level application service boundaries: Application's customer facing service (CFS) boundary and Application's resource facing service (RFS) boundary. While different applications offer different functionality to end users, the primary service KQIs across the application's customer facing service boundary for end users of applications generally include one or more of the following: service availability; service latency; service reliability; service accessibility; service retainability; service throughput; service timestamp accuracy and application specific service quality measurements.

  • Bottleneck Flow Control

    The problem of optimally choosing message rates for users of a store-and- forward network is analyzed. Multiple users sharing the links of the network each attempt to adjust their message rates to achieve an ideal network operating point or an ideal tradeoff point between high throughput and low delay. Each user has a fixed path or virtual circuit. In this environment, a basic definition of ideal delay-throughput tradeoff is given and motivated. This definition concentrates on a fair allocation of network resources at network bottlenecks. This ideal policy is implemented via a decentralized algorithm that achieves the unique set at optimal throughputs. All sharers constrained by the same bottleneck are treated fairly by being assigned equal throughputs. A generalized definition of ideal tradeoff is then introduced to provide more flexibility in the choice of message rates. With this definition, the network may accommodate users with different types of message traffic. A transformation technique reduces the problem of optimizing this performance measure to the problem of optimizing the basic measure.

  • Contention Avoidance in OPS Networks

    Optical packet contention is the major problem for an Optical Packet Switched (OPS) network. Contention resolution, contention avoidance, and their combinations are the schemes to manage the contention problem. In this chapter, contention avoidance schemes proposed for both asynchronous OPS and synchronous (slotted) OPS networks are studied. A number of hardware-based and software-based schemes have been proposed to reduce the number of collision events in an OPS network. The objective of this chapter is to study the contention avoidance schemes that would minimize optical Packet Loss Rate (PLR), thus improving the throughput of OPS networks. Moreover, contention avoidance is a technique for providing quality of service (QoS) indirectly since it reduces traffic loss rate and improves the performance of the network.

  • A SelfRouting Multistage Switching Network for Broadband ISDN

    Many switching networks have been proposed for broadband ISDN [1]. Switching networks which are capable of achieving maximum throughput of 100% either have large internal speedup [2], [3] or require large amounts of hardware [4], [5]. For example, the input-output difference self-routing network [3] and ATOM switch [2] require large internal speed-up factors. In order to maintain the non-blocking property, the internal speed of an _N_ Ã? _N_ switching network has to be _N_ times higher than the maximum rate of the incoming packets. The internal speed can be reduced by introducing parallel switching planes thereby increasing the hardware complexity. In this paper, we propose a new switching network that approaches a maximum throughput of 100% as buffering is increased. This self-routing switching network consists of simple 2 Ã? 2 switching elements, distributors, and buffers located between stages and in the output ports. The proposed switching network requires speed-up of two. The structure and the operation of the switching network are described and the performance of the switching network is analyzed.

  • Practical Considerations

    This chapter discusses what might be called Kalman filter engineering, which is that body of applicable knowledge that has evolved through practical experience in the use and misuse of the Kalman filter. The discussion includes many more matters of practice than nonlinearities and finite-precision arithmetic. The chapter first discusses the methods for detecting and correcting anomalous behavior of estimators. It then discusses the evaluation of suboptimal filters (using dual-state filters) and sensitivity analysis methods. The chapter compares memory, throughput, and wordlength requirements for alternative implementation methods. Methods for decreasing computational requirements, and methods for assessing the influence on estimator performance of sensor location and type and the number of sensors are then discussed. Finally the chapter discusses the methods for top-down hierarchical system- level error budgeting, and demonstrates the application of square-root filtering techniques to an inertial navigation system (INS)-aided GPS navigator.

  • Introduction

    Computational molecular biology, or bioinformatics, draws on the disciplines of biology, mathematics, statistics, physics, chemistry, computer science, and engineering. It provides the computational support for functional genomics, which links the behavior of cells, organisms, and populations to the information encoded in the genomes, as well as for structural genomics. At the heart of all large-scale and high-throughput biotechnologies, it has a growing impact on health and medicine.This survey of computational molecular biology covers traditional topics such as protein structure modeling and sequence alignment, and more recent ones such as expression data analysis and comparative genomics. It combines algorithmic, statistical, database, and AI- based methods for studying biological problems. The book also contains an introductory chapter, as well as one on general statistical modeling and computational techniques in molecular biology. Each chapter presents a self- contained review of a specific subject.Not for sale in China, including Hong Kong

  • Contributors

    Computational molecular biology, or bioinformatics, draws on the disciplines of biology, mathematics, statistics, physics, chemistry, computer science, and engineering. It provides the computational support for functional genomics, which links the behavior of cells, organisms, and populations to the information encoded in the genomes, as well as for structural genomics. At the heart of all large-scale and high-throughput biotechnologies, it has a growing impact on health and medicine.This survey of computational molecular biology covers traditional topics such as protein structure modeling and sequence alignment, and more recent ones such as expression data analysis and comparative genomics. It combines algorithmic, statistical, database, and AI- based methods for studying biological problems. The book also contains an introductory chapter, as well as one on general statistical modeling and computational techniques in molecular biology. Each chapter presents a self- contained review of a specific subject.Not for sale in China, including Hong Kong

  • Performance Analysis of a Packet Switch Based on SingleBuffered Banyan Network

    Banyan networks are being proposed for interconnecting memory and processor modules in multiprocessor systems as well as for packet switching in communication networks. This paper describes an analysis of the performance of a packet switch based on a single-buffered Banyan network. A model of a single-buffered Banyan network provides results on the throughput, delay, and internal blocking. Results of this model are combined with models of the buffer controller (finite and infinite buffers). It is shown that for balanced loads, the switching delay is low for loads below maximum throughput (about 45 percent per input link) and the blocking at the input buffer controller is low for reasonable buffer sizes.




Jobs related to Throughput

Back to Top