Conferences related to Round robin

Back to Top

2013 19th IEEE International Conference on Networks (ICON)

The conference provides an open forum for researchers, engineers and academia to exchange latest innovations and research advancements on computer network (wired, wireless, ad-hoc, mesh, sensor) architectures, protocols and algorithms, content networking & multimedia delivery technologies, as well as centralized & distributed networked systems, applications and services. Topics of interest include: content distribution networks; delay tolerant networks; DLNA, uPnP & inter-networking; flow & congestion control; media, session handoffs and roaming; multicasting and application-level routing; network middleware; network fault-tolerance and reliability; network pricing and billing; network security; networking issues and challenges in Internet of Things/cloud, grid computing/smart-grid/storage area networks/multimedia, web and gaming applications/rural living/military and space applications; next-generation networks; optical and photonic networks; peer-to-peer and overlay networks, etc.

  • 2012 18th IEEE International Conference on Networks (ICON)

    The conference provides an open forum for researchers, engineers and academia to exchange the latest innovations and research advancements on next-generation computer network architectures, protocols and algorithms (wired, wireless, ad-hoc, mesh, sensor), content networking and multimedia delivery technologies, as well as centralized and distributed networked systems, applications and services.

  • 2011 17th IEEE International Conference on Networks (ICON)

    The conference provides an open forum for researchers, engineers and academia to exchange the latest innovations and research advancements on next-generation computer network architectures, protocols and algorithms (wired, wireless, ad-hoc, mesh, sensor), content networking and multimedia delivery technologies, as well as centralized and distributed networked systems, applications and services.

  • 2008 16th IEEE International Conference on Networks (ICON)

    The Conference will provide a forum for representatives from industry, academia and government agencies to share ideas and discuss the innovations in the area of computer networks and communications.

  • 2007 15th IEEE International Conference on Networks (ICON)

    The 15th IEEE International Conference on Networks ICON 2007 will provide an international forum for experts, researchers and practitioners, to discuss innovations and recent advances in computer networks and communications. The conference program will feature one day of tutorials by experts in the field and two days of technical (papers and posters) presentations. It will also include presentations by invited speakers of international standing in the field.

  • 2006 14th IEEE International Conference on Networks (ICON)

  • 2005 IEEE Malaysia International Conference on Communications and IEEE International Conference on Networks (MICC & ICON 2005)


TENCON 2013 - 2013 IEEE Region 10 Conference

Communication and network,Signal and information processing,Automatic control,Computational intelligence,Intelligent transportation,Grid and cloud computing,Cognitive radio and system,Internet of things,Computer science and technology,Audio and speech processing,Electronic devices,Circuits and systems,Power and energy,Microwave, antennas and propagation,Information and data security,System design and implementation

  • TENCON 2012 - 2012 IEEE Region 10 Conference

    TENCON is a general engineering conference covering electrical and electronics engineering and computer science. The theme of the conference is "Sustainable Development through Humanitarian Technology". The conference will be organized under several different tracks consisting of power engineering, signal processing, communications, computing, circuits and systems, software systems and the theme.

  • TENCON 2011 - 2011 IEEE Region 10 Conference

    Trends and Development in Converging Technology towards 2020

  • TENCON 2010 - 2010 IEEE Region 10 Conference

    Information and Communication Technologies

  • TENCON 2009 - 2009 IEEE Region 10 Conference

    The theme of the conference is "Emerging Technologies for Sustainable Development". Topics of interest include, but are not limited to, Power and Energy; Signal Processing; Networks and Communications; Circuits and Systems; Computational Intelligence; Computing Architectures & Systems; Software and Database Systems.

  • TENCON 2008 - 2008 IEEE Region 10 Conference

    TENCON 2008 is a general engineering conference covering electrical and electronics engineering and computer science. The theme of the conference is 'innovative technologies for societal transformation'. The conference will be organized under seven different tracks consisting of power engineering, signal processing, communications, computing, circuits and systems, software systems and the theme.

  • TENCON 2007 - 2007 IEEE Region 10 Conference

    Computing, Communications, Signal Processing, Energy & Infrastructure, Antennas and Propagation, System-on-Chip, Computer Networks, Optical Electronics , Technology & Society

  • TENCON 2006 - 2006 IEEE Region 10 Conference


2012 21st International Conference on Computer Communications and Networks - ICCCN 2012

Covers Computer Communications and Networks, Wireless and Sensor Networks, Optical Networks, High-speed Systems/Grid/Cloud Computing, Internet Services, Multimedia and P2P, Network Security. Network Architecture/Algorithms, OoS, Social Networks, Networking for Sustainability.

  • 2011 20th International Conference on Computer Communications and Networks - ICCCN 2011

    Covers the following and related areas: Computer Communications and Networks, Wireless and Sensor Networks, Optical Networks, High-Speed Systems/Grid, Internet Services, Multimedia and P2P, Network Security.

  • 2010 19th International Conference on Computer Communications and Networks - ICCCN 2010

    Covers the following and related areas: Computer Communications and Networks, Wireless and Sensor Networks, Optical Networks, High-Speed Systems/Grid, Internet Services, Multimedia and P2P, Network Security.

  • 2009 18th International Conference on Computer Communications and Networks - ICCCN 2009

    ICCCN is one of the leading international conferences for presenting novel ideas and fundamental advances in the fields of computer communications and networks. ICCCN serves to foster communication among researchers and practitioners with a common interest in improving communications and networking through scientific and technological innovation.

  • 2008 17th International Conference on Computer Communications and Networks - ICCCN 2008

    ICCCN is a major international conference for the presentation of novel and fundamental advances in the field of Computer Communications and Networks. It also serves to foster communication among researchers and practitioners working in a wide variety of scientific areas with a common interest in improving Computer Communications and Networks.

  • 2007 16th International Conference on Computer Communications and Networks - IC3N 2007

    Computer communications and networks related research and applications.

  • 2006 15th International Conference on Computer Communications and Networks - IC3N 2006

  • 2005 14th International Conference on Computer Communications and Networks - IC3N 2005



Periodicals related to Round robin

Back to Top

Computers, IEEE Transactions on

Design and analysis of algorithms, computer systems, and digital networks; methods for specifying, measuring, and modeling the performance of computers and computer systems; design of computer components, such as arithmetic units, data storage devices, and interface devices; design of reliable and testable digital devices and systems; computer networks and distributed computer systems; new computer organizations and architectures; applications of VLSI ...


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.




Xplore Articles related to Round robin

Back to Top

Performance analysis of Exhaustive Limited Service Round Robin Matching Algorithm

I. Radusinovic; Z. Veljovic International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06), 2006

In this paper a performance analysis of exhaustive round-robin with limited service (ELRR) scheduling algorithm for combined input-crosspoint crossbar switches is presented. We propose using of this scheduling system for arbitration at inputs and crosspoints. If the virtual output queue (crosspoint buffer) becomes empty, the input (crosspoint) arbiter updates its pointer to the next location in a fixed order. Otherwise, ...


Efficient load balancing for bursty demand in web based application services via domain name services

Mei Lu Chin; Chong Eng Tan; Mohd Imran Bandan 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, 2010

In this paper, we propose an enhancement to the conventional Round Robin DNS load balancing technique which allows a single domain name to be associated with several web server IP addresses in a rotated order in a server cluster. Once the DNS server resolves the domain name to one of the web server IP address, the subsequent requests from the ...


An Ant Based Hyper-heuristic for the Travelling Tournament Problem

Pai-Chun Chen; Graham Kendall; Greet Vanden Berghe 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

The travelling tournament problem is a challenging sports timetabling problem which is widely believed to be NP-hard. The objective is to establish a feasible double round robin tournament schedule, with minimum travel distances. This paper investigates the application of an ant based hyper- heuristic algorithm for this problem. Ant algorithms, a well known meta- heuristic, have been successfully applied to ...


A New Lower Bound to the Traveling Tournament Problem

Sebastian Urrutia; Celso C. Ribeiro; Rafael A. Melo 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

Optimization in sports is a field of increasing interest. The traveling tournament problem abstracts certain characteristics of sports scheduling problems. We propose a new method for determining a lower bound to this problem. The new bound improves upon the previously best known lower bound. Numerical results on benchmark instances showed reductions as large as 38.6% in the gaps between lower ...


Stochastic fairness queueing

P. E. McKenney INFOCOM '90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, IEEE, 1990

A class of algorithms called stochastic fairness queuing is presented. The algorithms are probabilistic variants of fairness queuing. They do not require an exact mapping and thus are suitable for high-speed software or firmware implementation. The algorithms span a broad range of CPU, memory, and fairness tradeoffs. It is shown that the worst-case execution-speed stochastic fairness queuing is faster than ...


More Xplore Articles

Educational Resources on Round robin

Back to Top

eLearning

Performance analysis of Exhaustive Limited Service Round Robin Matching Algorithm

I. Radusinovic; Z. Veljovic International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06), 2006

In this paper a performance analysis of exhaustive round-robin with limited service (ELRR) scheduling algorithm for combined input-crosspoint crossbar switches is presented. We propose using of this scheduling system for arbitration at inputs and crosspoints. If the virtual output queue (crosspoint buffer) becomes empty, the input (crosspoint) arbiter updates its pointer to the next location in a fixed order. Otherwise, ...


Efficient load balancing for bursty demand in web based application services via domain name services

Mei Lu Chin; Chong Eng Tan; Mohd Imran Bandan 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, 2010

In this paper, we propose an enhancement to the conventional Round Robin DNS load balancing technique which allows a single domain name to be associated with several web server IP addresses in a rotated order in a server cluster. Once the DNS server resolves the domain name to one of the web server IP address, the subsequent requests from the ...


An Ant Based Hyper-heuristic for the Travelling Tournament Problem

Pai-Chun Chen; Graham Kendall; Greet Vanden Berghe 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

The travelling tournament problem is a challenging sports timetabling problem which is widely believed to be NP-hard. The objective is to establish a feasible double round robin tournament schedule, with minimum travel distances. This paper investigates the application of an ant based hyper- heuristic algorithm for this problem. Ant algorithms, a well known meta- heuristic, have been successfully applied to ...


A New Lower Bound to the Traveling Tournament Problem

Sebastian Urrutia; Celso C. Ribeiro; Rafael A. Melo 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

Optimization in sports is a field of increasing interest. The traveling tournament problem abstracts certain characteristics of sports scheduling problems. We propose a new method for determining a lower bound to this problem. The new bound improves upon the previously best known lower bound. Numerical results on benchmark instances showed reductions as large as 38.6% in the gaps between lower ...


Stochastic fairness queueing

P. E. McKenney INFOCOM '90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, IEEE, 1990

A class of algorithms called stochastic fairness queuing is presented. The algorithms are probabilistic variants of fairness queuing. They do not require an exact mapping and thus are suitable for high-speed software or firmware implementation. The algorithms span a broad range of CPU, memory, and fairness tradeoffs. It is shown that the worst-case execution-speed stochastic fairness queuing is faster than ...


More eLearning Resources

IEEE-USA E-Books

  • ClosNetwork Switches

    This chapter contains sections titled: Routing Property of Clos Network Switches Looping Algorithm m-Matching Algorithm Euler Partition Algorithm Karol's Algorithm Frame-Based Matching Algorithm for Clos Network (f-MAC) Concurrent Matching Algorithm for Clos Network (c-MAC) Dual-Level Matching Algorithm for Clos Network (d-MAC) The ATLANTA Switch Concurrent Round-Robin Dispatching (CRRD) Scheme The Path Switch

  • Constraint-based Round Robin Tournament Planning

    Sport tournament planning becomes a complex task in the presence of heterogeneous requirements from teams, media, fans and other parties. Existing approaches to sport tournament planning often rely on precomputed tournament schemes which may be too rigid to cater for these requirements. Existing work on sport tournaments suggests a separation of the planning process into three phases. In this work, it is shown that all three phases can be solved using finite-domain constraint programming. The design of Friar Tuck, a generic constraint-based round robin planning tool, is outlined. New numerical results on round robin tournaments obtained with Friar Tuck underline the potential of constraints over finite domains in this area

  • Load Distribution and Balancing

    This chapter reviews the architectural, operational and service quality considerations of both proxy and nonproxy load balancing technologies. Load distribution algorithms implemented by proxy load balancers include simple methods such as static configuration, Round Robin, random choices, performance based, status based, and orchestration enabled. DNS is probably the most common nonproxy load distribution strategy used by applications. Unlike proxy load balancers, nonproxy load distribution is not generally in the critical delivery path particularly in the case of static configuration. Complex applications are generally architected with several tiers of service and functionality, and load distribution mechanisms and policies are generally implemented at each tier. The load balancer should provide metrics to an operational support system (OSS) or a virtual machine server controller (VMSC). The chapter also talks about cloud-based load balancing challenges, the role of load balancing in support of redundancy, and load balancing and application service quality.

  • Crosspoint Buffered Switches

    This chapter contains sections titled: Combined Input and Crosspoint Buffered Switches Combined Input and Crosspoint Buffered Switches with VOQ OCF_OCF: Oldest Cell First Scheduling LQF_RR: Longest Queue First and Round-Robin Scheduling in CIXB-1 MCBF: Most Critical Buffer First Scheduling



Standards related to Round robin

Back to Top

No standards are currently tagged "Round robin"


Jobs related to Round robin

Back to Top