Routing

View this topic in
Routing or routeing is the process of selecting paths in a network along which to send network traffic. (Wikipedia.org)






Conferences related to Routing

Back to Top

2014 IEEE 15th International Conference on High Performance Switching and Routing (HPSR)

Novel switching and routing techniques will be addressed that provide higherscalability and quality of service, including IP lookup, scheduling... Improvements of routers andswitches to provide better network security and lower power consumption will be analyzed.Implication of emerging applications on switching and routing will be considered.

  • 2012 IEEE 13th International Conference on High Performance Switching and Routing (HPSR)

    Novel switching and routing techniques will be addressed that provide higher scalability and quality of service, including IP lookup, scheduling... Improvements of routers and switches to provide better network security and lower power consumption will be analyzed. Implication of emerging applications on switching and routing will be considered.

  • 2011 IEEE 12th International Conference on High Performance Switching and Routing (HPSR)

    The goal of HPSR is to bring together researchers, engineers and practitioners from around the world. HPSR is focused on the technology of high-speed, high-capacity switches and routers, including architectural and algorithmic aspects of high-speed IP networks, possibly adopting optical technologies and wireless user access.

  • 2010 International Conference on High Performance Switching and Routing (HPSR)

    The focus of HPSR 2010 is the innovative technology of high-speed, high-capacity and high-quality data transmission and switching for wired and wireless networks. HPSR 2010 will comprise of technical sessions for presentations of novel results, panel sessions for discussion of hot topics, and tutorials presented by leading experts. The conference solicits high-quality papers reporting original work in both theoretical and experimental research areas.

  • 2009 International Conference on High Performance Switching and Routing (HPSR)

    HPSR 2009 brings together researchers on the forefront topics of switching and routing with associated topics of architecture, performance evaluation, algorithms, traffic control, protection, multi-layer and multi-domain networking and security. We are witnessing important design aspects such as power usage, design efficiency, secure routing, and path optimization. Presentations of the latest research results provide a unique opportunity at this workshop for discussions and exchange of ideas to further the

  • 2008 International Conference on High Performance Switching and Routing (HPSR)

    The goal of the 2008 International Workshop on High Performance Switching and Routing (HPSR 2008) is to identify new trends and presentations of the latest technologies in the area of high-speed, high-capacity, and high-quality switching and routing for both wired and wireless networks. The overall program of the HPSR 2008 event will be based on technical sessions for presentation of novel research results, tutorials presented by leading international experts, and posters presented by promising young resear


2013 15th IEEE International Conference on Communication Technology (ICCT)

ICCT2013 will be held in Guilin, China on November 17-19th, 2013. ICCT is an annual conference series, focusing on both theory and applications mainly covering the topic of communication technology. The ICCT2013 will bring together researchers, scientists, engineers, computer users, and students to exchange their experiences, new ideas, and research results about all aspects of communication and discuss the practical challenges encountered and the solutions adopted. In addition to the technical sessions, there will be invited sessions, keynote speeches and panel discussion.

  • 2012 IEEE 14th International Conference on Communication Technology (ICCT)

    The scope includes, but not limited to Communication and Networking, Network and Information Security, Computer Technology and Applications, Information Engineering and Computational Intelligence, Network Coding and Signal Processing, Internet of Things and Applications, etc.

  • 2011 IEEE 13th International Conference on Communication Technology (ICCT)

    Infrastructure for next generation networks, next generation internet, optical networking, communication hardware design, communication software, wireless and mobile communications, advanced digital signal processing for communications, network applications and services, etc.

  • 2010 12th IEEE International Conference on Communication Technology (ICCT)

    The conference will be devoted to all aspects of Communication Technology. Researchers from all over the world should gather in order to introduce their recent advances in the field and thereby promote the exchange of new ideas, results and techniques. The conference should be a key event in Communication Technology and support the advancement of science in this very important field.

  • 2008 11th IEEE International Conference on Communication Technology (ICCT 2008)

    Infrastructure for Next Generation Networks,Next Generation Internet ,Switching & Routing for Gigabit Networks ,Optical Networking -Optical Communication Systems and Networks -DWDM -Access Networks,Advanced Digital Signal Processing for Communications ,Network Applications & Services


2013 15th International Conference on Transparent Optical Networks (ICTON)

ICTON addresses applications of transparent and all optical technologies in telecommunication networks, systems, and components. ICTON topics are well balanced between basic optics and network engineering. Interactions between those two groups of professionals are a valuable merit of conference. ICTON combines high level invited talks with carefully selected regular submissions.

  • 2012 14th International Conference on Transparent Optical Networks (ICTON)

    ICTON addresses applications of transparent and all optical technologies in telecommunication networks, systems, and components. ICTON topics are well balanced between basic optics and network engineering. Interactions between those two groups of professionals are a valuable merit of conference. ICTON combines high level invited talks with carefully selected regular submissions.

  • 2011 13th International Conference on Transparent Optical Networks (ICTON)

    ICTON addresses applications of transparent and all optical technologies in telecommunication networks, systems, and components. ICTON topics are well balanced between basic optics and network engineering. Interactions between those two groups of professionals are a valuable merit of conference. ICTON combines high level invited talks with carefully selected regular submissions.

  • 2010 12th International Conference on Transparent Optical Networks (ICTON)

    ICTON addresses applications of transparent and all optical technologies in telecommunication networks, systems, and components. ICTON topics are well balanced between basic optics and network engineering. Interactions between those two groups of professionals are a valuable merit of conference. ICTON combines high level invited talks with carefully selected regular submissions.

  • 2009 11th International Conference on Transparent Optical Networks (ICTON 2009)

    ICTON scope is concentrated on the applications of transparent and all-optical technologies in telecommunication networks, systems, and components. ICTON topics are balanced between basic optics and network engineering. Interactions between those two groups of professionals are an important merit of conference. ICTON combines high level invited talks with regular submissions.


2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC)

ASP-DAC 2013 is the eighteenth annual international conference on VLSI design automation in Asia and South Pacific region, one of the most active regions of design and fabrication of silicon ships in the world.


2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

ICCAD serves EDA and Design professionals highlighting new challenges and innovative solutions for integrated circuit design technologies and systems. ICCAD covers the full range of CAD topics from device and circuit-level CAD up through system level CAD and embedded software as well as CAD for post CMOS design and novel application areas, such as biology and nanotechnology.

  • 2012 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

    ICCAD serves EDA and design professionals, highlighting new challenges and innovative solutions and integrated circuit design technologies and systems. ICCAD covers the full range of CAD topics from device and circuit-level CAD up through system-level CAD and embedded software, as well as CAD for post-CMOS design and novel application areas, such as biology and nanotechnology.

  • 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

    ICCAD serves EDA and design professionals, highlighting new challenges and innovative solutions for Integrated Circuit Design Technologies and Systems. ICCAD covers the full range of CAD topics from device and circuit-level CAD up through systemlevel CAD and embedded software, as well as CAD for post-CMOS design and novel application areas, such as biology and nanotechnology.

  • 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

    ICCAD serves EDA and design professionals, highlighting new challenges and innovative solutions for Integrated Circuit Design Technologies and Systems. ICCAD covers the full range of traditional CAD topics; in addition, it also covers CAD for supporting post-CMOS design, as well as design automation for novel application areas, such as biology and nanotechnology.

  • 2009 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

    ICCAD serves EDA and design professionals, highlighting new challenges and innovative solutions for Integrated Circuit Design Technologies and Systems. ICCAD covers the full range of traditional CAD topics; in addition, it also covers CAD for supporting post-CMOS design, as well as design automation for novel application areas, such as biology and nanotechnology. Original technical submissions on, but not limited to, the following topics are invited:

  • 2008 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

    The premier conference on for electronic design technology


More Conferences

Periodicals related to Routing

Back to Top

Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


Communications Magazine, IEEE

IEEE Communications Magazine was the number three most-cited journal in telecommunications and the number eighteen cited journal in electrical and electronics engineering in 2004, according to the annual Journal Citation Report (2004 edition) published by the Institute for Scientific Information. Read more at http://www.ieee.org/products/citations.html. This magazine covers all areas of communications such as lightwave telecommunications, high-speed data communications, personal communications ...


Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Methods, algorithms, and human-machine interfaces for physical and logical design, including: planning, synthesis, partitioning, modeling, simulation, layout, verification, testing, and documentation of integrated-circuit and systems designs of all complexities. Practical applications of aids resulting in producible analog, digital, optical, or microwave integrated circuits are emphasized.


Lightwave Technology, Journal of

All aspects of optical guided-wave science, technology, and engineering in the areas of fiber and cable technologies; active and passive guided-wave componentry (light sources, detectors, repeaters, switches, fiber sensors, etc.); integrated optics and optoelectronics; systems and subsystems; new applications; and unique field trials.


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


More Periodicals


Xplore Articles related to Routing

Back to Top

A graph-theoretical approach to transistor placement in CMOS cell layout

Y. -L. Lin; Y. -C. Hsu; C. -Y. Hwang; Y. -C. Hsieh Proceedings of the 32nd Midwest Symposium on Circuits and Systems,, 1989

A graph-theoretical approach for solving the layout problem of a CMOS functional cell is presented. After the transistor pairing, the chaining problem is modeled as an abutability graph. The chaining problem is solved by finding a maximum independent set of vertices in the graph. A method based on Boolean arithmetic is applied to find all the maximal independent sets which ...


SPHIR-a system for parallel hierarchical routing

V. K. Sagar; R. E. Massara Proceedings of the 32nd Midwest Symposium on Circuits and Systems,, 1989

The possibility of a routing accelerator for VLSI routing based on general- purpose processors and a general-purpose architecture which can be used to speed up other phases of the VLSI design cycle is investigated. Research into a novel technique for exploiting parallelism in the automatic routing process for hierarchical VLSI circuit design is presented. The routing tools are incorporated into ...


Proposal of an Evolutional Architecture for Metabolic Computing

Minoru Uehara 2011 Third International Conference on Intelligent Networking and Collaborative Systems, 2011

In our previous paper, we proposed metabolic computing model in order to realize sustainable information system. We think that metabolic computing model has high fault tolerance and sustainability. We also proposed a realistic architecture of metabolic computing model. Metaboloid is a processing unit in this architecture. A set of metaboloids is organized as mesh connected NORMA. However, in simple metabolism, ...


A distributed algorithm for traffic aware clustering in ad hoc networks

Birjodh Singh Tiwana; Arobinda Gupta 2009 IEEE Asia-Pacific Services Computing Conference (APSCC), 2009

Clustering is used commonly in ad hoc networks for hierarchical routing. Size- bounded clustering has been proposed to restrict the maximum size of a cluster so that the routing load, and hence the energy drain, on the clusterhead is bounded. However, all the existing size-bounded clustering algorithms take the size bound as the number of nodes in the cluster. This ...


Buffer allocation algorithm with consideration of routing congestion

Yuchun Ma; Xianiong Hong; Sheqin Dong; Song Chen; Yici Cai; Chung-Kuan Cheng; Jun Gu ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753), 2004

The dominating contribution of interconnect to system performance has made it critical to plan the buffers and the routes resource in the early stage of the layout. In this paper, we present a congestion estimation model which takes the buffer insertion sites into consideration. Based on the feasible region of the buffer insertion, the two-level tile structure is used to ...


More Xplore Articles

Educational Resources on Routing

Back to Top

eLearning

A graph-theoretical approach to transistor placement in CMOS cell layout

Y. -L. Lin; Y. -C. Hsu; C. -Y. Hwang; Y. -C. Hsieh Proceedings of the 32nd Midwest Symposium on Circuits and Systems,, 1989

A graph-theoretical approach for solving the layout problem of a CMOS functional cell is presented. After the transistor pairing, the chaining problem is modeled as an abutability graph. The chaining problem is solved by finding a maximum independent set of vertices in the graph. A method based on Boolean arithmetic is applied to find all the maximal independent sets which ...


SPHIR-a system for parallel hierarchical routing

V. K. Sagar; R. E. Massara Proceedings of the 32nd Midwest Symposium on Circuits and Systems,, 1989

The possibility of a routing accelerator for VLSI routing based on general- purpose processors and a general-purpose architecture which can be used to speed up other phases of the VLSI design cycle is investigated. Research into a novel technique for exploiting parallelism in the automatic routing process for hierarchical VLSI circuit design is presented. The routing tools are incorporated into ...


Proposal of an Evolutional Architecture for Metabolic Computing

Minoru Uehara 2011 Third International Conference on Intelligent Networking and Collaborative Systems, 2011

In our previous paper, we proposed metabolic computing model in order to realize sustainable information system. We think that metabolic computing model has high fault tolerance and sustainability. We also proposed a realistic architecture of metabolic computing model. Metaboloid is a processing unit in this architecture. A set of metaboloids is organized as mesh connected NORMA. However, in simple metabolism, ...


A distributed algorithm for traffic aware clustering in ad hoc networks

Birjodh Singh Tiwana; Arobinda Gupta 2009 IEEE Asia-Pacific Services Computing Conference (APSCC), 2009

Clustering is used commonly in ad hoc networks for hierarchical routing. Size- bounded clustering has been proposed to restrict the maximum size of a cluster so that the routing load, and hence the energy drain, on the clusterhead is bounded. However, all the existing size-bounded clustering algorithms take the size bound as the number of nodes in the cluster. This ...


Buffer allocation algorithm with consideration of routing congestion

Yuchun Ma; Xianiong Hong; Sheqin Dong; Song Chen; Yici Cai; Chung-Kuan Cheng; Jun Gu ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753), 2004

The dominating contribution of interconnect to system performance has made it critical to plan the buffers and the routes resource in the early stage of the layout. In this paper, we present a congestion estimation model which takes the buffer insertion sites into consideration. Based on the feasible region of the buffer insertion, the two-level tile structure is used to ...


More eLearning Resources

IEEE-USA E-Books

  • Sequential Decision Making

    Online decision making under uncertainty and time constraints represents one of the most challenging problems for robust intelligent agents. In an increasingly dynamic, interconnected, and real-time world, intelligent systems must adapt dynamically to uncertainties, update existing plans to accommodate new requests and events, and produce high-quality decisions under severe time constraints. Such online decision-making applications are becoming increasingly common: ambulance dispatching and emergency city-evacuation routing, for example, are inherently online decision-making problems; other applications include packet scheduling for Internet communications and reservation systems. This book presents a novel framework, online stochastic optimization, to address this challenge.This framework assumes that the distribution of future requests, or an approximation thereof, is available for sampling, as is the case in many applications that make either historical data or predictive models available. It assumes additionally that the distribution of future requests is independent of current decisions, which is also the case in a variety of applications and holds significant computational advantages. The book presents several online stochastic algorithms implementing the framework, provides performance guarantees, and demonstrates a variety of applications. It discusses how to relax some of the assumptions in using historical sampling and machine learning and analyzes different underlying algorithmic problems. And finally, the book discusses the framework's possible limitations and suggests directions for future research.

  • Online Stochastic Scheduling

    Online decision making under uncertainty and time constraints represents one of the most challenging problems for robust intelligent agents. In an increasingly dynamic, interconnected, and real-time world, intelligent systems must adapt dynamically to uncertainties, update existing plans to accommodate new requests and events, and produce high-quality decisions under severe time constraints. Such online decision-making applications are becoming increasingly common: ambulance dispatching and emergency city-evacuation routing, for example, are inherently online decision-making problems; other applications include packet scheduling for Internet communications and reservation systems. This book presents a novel framework, online stochastic optimization, to address this challenge.This framework assumes that the distribution of future requests, or an approximation thereof, is available for sampling, as is the case in many applications that make either historical data or predictive models available. It assumes additionally that the distribution of future requests is independent of current decisions, which is also the case in a variety of applications and holds significant computational advantages. The book presents several online stochastic algorithms implementing the framework, provides performance guarantees, and demonstrates a variety of applications. It discusses how to relax some of the assumptions in using historical sampling and machine learning and analyzes different underlying algorithmic problems. And finally, the book discusses the framework's possible limitations and suggests directions for future research.

  • References

    Online decision making under uncertainty and time constraints represents one of the most challenging problems for robust intelligent agents. In an increasingly dynamic, interconnected, and real-time world, intelligent systems must adapt dynamically to uncertainties, update existing plans to accommodate new requests and events, and produce high-quality decisions under severe time constraints. Such online decision-making applications are becoming increasingly common: ambulance dispatching and emergency city-evacuation routing, for example, are inherently online decision-making problems; other applications include packet scheduling for Internet communications and reservation systems. This book presents a novel framework, online stochastic optimization, to address this challenge.This framework assumes that the distribution of future requests, or an approximation thereof, is available for sampling, as is the case in many applications that make either historical data or predictive models available. It assumes additionally that the distribution of future requests is independent of current decisions, which is also the case in a variety of applications and holds significant computational advantages. The book presents several online stochastic algorithms implementing the framework, provides performance guarantees, and demonstrates a variety of applications. It discusses how to relax some of the assumptions in using historical sampling and machine learning and analyzes different underlying algorithmic problems. And finally, the book discusses the framework's possible limitations and suggests directions for future research.

  • Online Stochastic Routing

    Online decision making under uncertainty and time constraints represents one of the most challenging problems for robust intelligent agents. In an increasingly dynamic, interconnected, and real-time world, intelligent systems must adapt dynamically to uncertainties, update existing plans to accommodate new requests and events, and produce high-quality decisions under severe time constraints. Such online decision-making applications are becoming increasingly common: ambulance dispatching and emergency city-evacuation routing, for example, are inherently online decision-making problems; other applications include packet scheduling for Internet communications and reservation systems. This book presents a novel framework, online stochastic optimization, to address this challenge.This framework assumes that the distribution of future requests, or an approximation thereof, is available for sampling, as is the case in many applications that make either historical data or predictive models available. It assumes additionally that the distribution of future requests is independent of current decisions, which is also the case in a variety of applications and holds significant computational advantages. The book presents several online stochastic algorithms implementing the framework, provides performance guarantees, and demonstrates a variety of applications. It discusses how to relax some of the assumptions in using historical sampling and machine learning and analyzes different underlying algorithmic problems. And finally, the book discusses the framework's possible limitations and suggests directions for future research.

  • Index

    Online decision making under uncertainty and time constraints represents one of the most challenging problems for robust intelligent agents. In an increasingly dynamic, interconnected, and real-time world, intelligent systems must adapt dynamically to uncertainties, update existing plans to accommodate new requests and events, and produce high-quality decisions under severe time constraints. Such online decision-making applications are becoming increasingly common: ambulance dispatching and emergency city-evacuation routing, for example, are inherently online decision-making problems; other applications include packet scheduling for Internet communications and reservation systems. This book presents a novel framework, online stochastic optimization, to address this challenge.This framework assumes that the distribution of future requests, or an approximation thereof, is available for sampling, as is the case in many applications that make either historical data or predictive models available. It assumes additionally that the distribution of future requests is independent of current decisions, which is also the case in a variety of applications and holds significant computational advantages. The book presents several online stochastic algorithms implementing the framework, provides performance guarantees, and demonstrates a variety of applications. It discusses how to relax some of the assumptions in using historical sampling and machine learning and analyzes different underlying algorithmic problems. And finally, the book discusses the framework's possible limitations and suggests directions for future research.

  • Analysis of Mobility Protocols for Multimedia

    This chapter provides comprehensive analysis of several generations of mobility protocols (e.g., 1G, 2G, 3G, and 4G) in order to extrapolate the common abstract functions during a mobility event. It describes how discovery, configuration, authentication, security association, and media routing functions associated with a mobile's handoff are performed for each of the cellular and IP-based mobility protocols and then maps the respective network parameters for these mobility protocols to each of the common mobility functions. A comparative analysis and extrapolation of the abstract primitives can help to design an optimized mobility system with a given resource constraints and build the optimization mechanisms for each these mobility functions.

  • Vehicle Routing with Time Windows

    This chapter contains section titled: 7.1 Vehicle Dispatching and Routing, 7.2 Large Neighborhood Search, 7.3 Notes and Further Reading

  • ATM Connectivity

    This chapter contains sections titled: Connectivity Types Connection Admission Control (CAC) CAC Call Processing Routing The ATM Address This chapter contains sections titled: Exercises

  • Index

    A volume in the IEEE Telecommunications Handbook Series, this book is the one- stop source for the formulas and tables needed to design dimension switching systems and networks. It covers frequently used traffic formulas such as Erlang B (including alternate routing and Neal-Wilkinson peaked traffic tables), Erlang C, Binomial, and Engset along with practical examples to demonstrate how each is used. Computer programs are provided for those who prefer to do their traffic engineering on a computer.

  • Routing in the Manhattan Street Network

    The Manhattan Street Network is a regular, two-connected network, designed for packet communications in a local or metropolitan area. It operates as a slotted system, similar to conventional loop networks. Unlike loop networks, routing decisions must be made at every node in this network. In this paper, several distributed routing rules are investigated that take advantage of the regular structure of the network. In an operational network, irregularities occur in the structure because of the addressing mechanisms, adding single nodes, and failures. A fractional addressing scheme is described that makes it possible to add new rows or columns to the network without changing the addresses of existing nodes. A technique is described for adding one node at a time to the network, while changing only two existing links. Finally, two procedures are described that allow the network to adapt to node or link failures. The effect that irregularities have on routing mechanisms designed for a regular structure is investigated.



Standards related to Routing

Back to Top

No standards are currently tagged "Routing"