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

Communications, IEEE Transactions on

Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...


Control Systems Technology, IEEE Transactions on

Serves as a compendium for papers on the technological advances in control engineering and as an archival publication which will bridge the gap between theory and practice. Papers will highlight the latest knowledge, exploratory developments, and practical applications in all aspects of the technology needed to implement control systems from analysis and design through simulation and hardware.


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, ...


More Periodicals


Xplore Articles related to Throughput

Back to Top

Modeling Alien-Line Impedance Mismatch in Wideband Vectored Wireline Systems

Eduardo Medeiros; Thomas Magesacher; Per Ödling; Dong Wei; Xiang Wang; Qiaojie Li; Per-Erik Eriksson; Chenguang Lu; Jeroen Boschma; Bas van den Heuvel IEEE Communications Letters, 2014

Sudden changes of channel coefficients in a wideband vectored wireline system (such as G.fast) due to changes in the terminating impedance of lines outside the vectored group can seriously degrade stability and throughput. This letter presents a model that predicts the impact of termination mismatch based exclusively on crosstalk data for the properly-terminated state. Experimental results confirm a tight fit ...


A novel multi-strategy cognitive routing

Chao Dai; Yong Zhang; Li Wang; Zhao Li; Jinghua Xiao 2011 Second International Conference on Mechanic Automation and Control Engineering, 2011

The cognitive routing can collect the network information, analyze the information and make the routing decision. A multi strategy cognitive routing will choose the routing strategy adaptively by different network environment. In this paper, a cognitive multi strategy routing with QoS constraint and load balance is proposed. If the payload of network is light, parameters of QoS performance, such as ...


A multiprocessor approach for meeting the processing requirements for OSI

M. R. Ito; L. Y. Takeuchi; G. W. Neufeld IEEE Journal on Selected Areas in Communications, 1993

To meet the increased communication processing requirements of high-speed networks, a multiprocessing network interface is considered for processing multiple layers of a communication protocol stack. In particular, the processing of the open systems interconnection (OSI) layers 2 to 6 on the network interface are considered. OSI processing is computationally expensive because of the inclusion of the transfer syntax conversion at ...


A comparative analysis of energy-aware routing protocols in wireless sensor networks

Mohsin Raza; Ghufran Ahmed; Noor M Khan; M. Awais; Qasim Badar 2011 International Conference on Information and Communication Technologies, 2011

This paper presents the implementation of two routing protocols for Wireless Sensor Networks (WSNs): GRACE (GRAdient Cost Establishment for Energy Aware routing) and GRAB (GRAdient Broadcasting) along with their comparative analysis using Sun SPOT sensor nodes, developed by Sun Microsystems. The performance of both the routing protocols is evaluated on the basis of various performance metrics including network lifetime, throughput ...


Regular flow line models for semiconductor cluster tools: A case of lot dependent process times

James R. Morrison 2009 IEEE International Conference on Automation Science and Engineering, 2009

We develop a reduced complexity recursion for the wafer delay in each server in flow lines with wafer dependent deterministic or regular process times and demonstrate how it can serve to model lot production in semiconductor cluster tools with setups. Under certain assumptions on the process times, it is shown that the system behavior shares some similarities with the case ...


More Xplore Articles

Educational Resources on Throughput

Back to Top

eLearning

Modeling Alien-Line Impedance Mismatch in Wideband Vectored Wireline Systems

Eduardo Medeiros; Thomas Magesacher; Per Ödling; Dong Wei; Xiang Wang; Qiaojie Li; Per-Erik Eriksson; Chenguang Lu; Jeroen Boschma; Bas van den Heuvel IEEE Communications Letters, 2014

Sudden changes of channel coefficients in a wideband vectored wireline system (such as G.fast) due to changes in the terminating impedance of lines outside the vectored group can seriously degrade stability and throughput. This letter presents a model that predicts the impact of termination mismatch based exclusively on crosstalk data for the properly-terminated state. Experimental results confirm a tight fit ...


A novel multi-strategy cognitive routing

Chao Dai; Yong Zhang; Li Wang; Zhao Li; Jinghua Xiao 2011 Second International Conference on Mechanic Automation and Control Engineering, 2011

The cognitive routing can collect the network information, analyze the information and make the routing decision. A multi strategy cognitive routing will choose the routing strategy adaptively by different network environment. In this paper, a cognitive multi strategy routing with QoS constraint and load balance is proposed. If the payload of network is light, parameters of QoS performance, such as ...


A multiprocessor approach for meeting the processing requirements for OSI

M. R. Ito; L. Y. Takeuchi; G. W. Neufeld IEEE Journal on Selected Areas in Communications, 1993

To meet the increased communication processing requirements of high-speed networks, a multiprocessing network interface is considered for processing multiple layers of a communication protocol stack. In particular, the processing of the open systems interconnection (OSI) layers 2 to 6 on the network interface are considered. OSI processing is computationally expensive because of the inclusion of the transfer syntax conversion at ...


A comparative analysis of energy-aware routing protocols in wireless sensor networks

Mohsin Raza; Ghufran Ahmed; Noor M Khan; M. Awais; Qasim Badar 2011 International Conference on Information and Communication Technologies, 2011

This paper presents the implementation of two routing protocols for Wireless Sensor Networks (WSNs): GRACE (GRAdient Cost Establishment for Energy Aware routing) and GRAB (GRAdient Broadcasting) along with their comparative analysis using Sun SPOT sensor nodes, developed by Sun Microsystems. The performance of both the routing protocols is evaluated on the basis of various performance metrics including network lifetime, throughput ...


Regular flow line models for semiconductor cluster tools: A case of lot dependent process times

James R. Morrison 2009 IEEE International Conference on Automation Science and Engineering, 2009

We develop a reduced complexity recursion for the wafer delay in each server in flow lines with wafer dependent deterministic or regular process times and demonstrate how it can serve to model lot production in semiconductor cluster tools with setups. Under certain assumptions on the process times, it is shown that the system behavior shares some similarities with the case ...


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

    Designing Asynchronous Circuits using NULL Convention Logic (NCL) begins with an introduction to asynchronous (clockless) logic in general, and then focuses on delay-insensitive asynchronous logic design using the NCL paradigm. The book details design of input-complete and observable dual-rail and quad-rail combinational circuits, and then discusses implementation of sequential circuits, which require datapath feedback. Next, throughput optimization techniques are presented, including pipelining, embedding registration, early completion, and NULL cycle reduction. Subsequently, low-power design techniques, such as wavefront steering and Multi-Threshold CMOS (MTCMOS) for NCL, are discussed. The book culminates with a comprehensive design example of an optimized Greatest Common Divisor circuit. Readers should have prior knowledge of basic logic design concepts, such as Boolean algebra and Karnaugh maps. After studying this book, readers should have a good understanding of the differences between asynchronous and synchronous circuits, and should be able to design arbitrary NCL circuits, optimized for area, throughput, and power. Table of Contents: Introduction to Asynchronous Logic / Overview of NULL Convention Logic (NCL) / Combinational NCL Circuit Design / Sequential NCL Circuit Design / NCL Throughput Optimization / Low-Power NCL Design / Comprehensive NCL Design Example

  • A Monolithic 480 Mb/s Parallel AGC/Decision/ClockRecovery Circuit in 1.2m CMOS

    A parallel architecture for high-data-rate AGC/decision/clock-recovery circuit, recovering digital NRZ data in optical-fiber receivers, is described. Improvement over traditional architecture in throughput is achieved through the use of parallel signal paths. An experimental prototype, fabricated in a 1.2-µm double-poly double-metal n-well CMOS process, achieves a maximum bit rate of 480 Mb/s. The chip contains variable gain amplifiers, clock recovery, and demultiplexing circuits. It yields a HER of 10- 11 with an 18 mV p-p differential input signal. The power consumption is 900 mW from a single 5 V supply.

  • Comparison of Buffering Strategies for Asymmetric Packet Switch Modules

    This paper analyzes the performance of a class of asymmetric packet switch modules with channel grouping. The switch module considered has _n_ inputs and _m_ outputs. A packet destined for a particular output address (out of _g_) needs to access only one of the _r_ available physical output ports; _m_ = _gr_. The motivation for the study of these switch modules is that they are the key building blocks in many large multistage switch architectures. We concentrate on the performance of input-buffered and output-buffered switch modules under geometrically bursty traffic. A combination of exact derivation, numerical analysis, and simulation yields the saturation throughput of input- buffered switch modules and the mean delay of the input-buffered and output- buffered switch modules. Tables and formulas useful for traffic engineering are presented. Our results show that increasing the number of output ports per output address (_r_) can significantly improve switch performance, especially when traffic is bursty. An interesting observation is that although output- buffered switch modules have significantly better performance than input- buffered switch modules when there are equal numbers of input and output ports, this performance difference becomes significantly smaller when the switch dimensions are asymmetric.

  • No title

    The last decade has seen an unprecedented growth in the demand for wireless services. These services are fueled by applications that often require not only high data rates, but also very low latency to function as desired. However, as wireless networks grow and support increasingly large numbers of users, these control algorithms must also incur only low complexity in order to be implemented in practice. Therefore, there is a pressing need to develop wireless control algorithms that can achieve both high throughput and low delay, but with low-complexity operations. While these three performance metrics, i.e., throughput, delay, and complexity, are widely acknowledged as being among the most important for modern wireless networks, existing approaches often have had to sacrifice a subset of them in order to optimize the others, leading to wireless resource allocation algorithms that either suffer poor performance or are difficult to implement. In contrast, the recent results presented i this book demonstrate that, by cleverly taking advantage of multiple physical or virtual channels, one can develop new low-complexity algorithms that attain both provably high throughput and provably low delay. The book covers both the intra-cell and network-wide settings. In each case, after the pitfalls of existing approaches are examined, new systematic methodologies are provided to develop algorithms that perform provably well in all three dimensions.

  • The Zebra Striped Network File System

    Zebra is a network file system that increases throughput by striping file data across multiple servers. Rather than striping each file separately, Zebra forms all the new data from each client into a single stream, which it then stripes using an approach similar to a log-structured file system. This provides high performance for writes of small files as well as for reads and writes of large files. Zebra also writes parity information in each stripe in the style of RAID disk arrays; this increases storage costs slightly but allows the system to continue operation even while a single storage server is unavailable. A prototype implementation of Zebra, built in the Sprite operating system, provides 4-5 times the throughput of the standard Sprite file system or NFS for large files and a 15% to 300% improvement for writing small files.

  • Personal Mobility in an Urbanizing World

    This chapter contains sections titled: Vehicle Ownership, Personal Wealth, and Population Density, Urban Trips Are Short, Urban Driving Speeds Are Low, Traffic Congestion Diminishes Throughput and Energy Efficiency, Parking Competes with Other Uses of Urban Space, Automobile Use Has Negative Externalities, Cities Are Limiting Automobile Use, Safety Improvements with USVs, Energy Efficiency Goals Achievable through USVs, Throughput Improvements, Parking Space Reductions, Overall Effects on Urban Space and Civic Amenity, Summary: Livable, Sustainable Cities

  • 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.

  • Performance Study of an Input Queueing Packet Switch with Two Priority Classes

    This paper studies an _N_ Ã? _N_ nonblocking packet switch with input queues and two priority classes which can be used to support traffic with different requirements. The switch operation is slotted and, at each time slot, fixed size packets arrive at the inputs with distinct Bernoulli distributions for both tbe high and low priority classes. Two policies are studied. In the first policy, packets of both priority classes are queued when waiting for service. In the second policy, only low priority packets are queued, and high priority packets not delivered at first attempt are dropped from the system. Under both policies, high priority packets prevail over low priority packets at the inputs as well as the outputs. Because of the service dependencies introduced by the switch structure, an exact analysis of this system is intractable. This paper provides an approximate analysis based on some independence assumptions and uses an equivalent queueing system to estimate the service capability seen by each input. Using this approach, an expression for the input queue length distribution is obtained. The maximum system throughput is also derived and shown to exceed that of a single priority switch. Numerical results are compared to simulations and found to be in good agreement.

  • The Design and Testing of MIPS-X

    MIPS-X is a high performance RISC microprocessor that can run with a peak throughput of 16 MIPS. The design began in the spring of 1984, and in the summer of 1987 we were able to execute Pascal programs on a prototype system. This paper describes the design of MIPS-X examining the strengths and weaknesses of our tools, methodology and design environment. We found that consistency within a representation and across representations of the design was an important issue and that having an executable description of the design in the form of a functional simulator was key to the success of our project. We describe a technique we call comparison-mode simulation that made final verification and system integration much easier.