Books » Category » Computing and Information Technology » General Theory of Computing » Systems Analysis & Design
By Dhaini, Ahmad R.
Revision with unchanged content. Research and development on optical networks generally and on Passive Optical Networks (PON) particularly have matured considerably. The exponential increase in the demand for bandwidth has exposed many challenges in the last mile that remains the... bottleneck in broadband access networks. Currently, Ethernet PON has emerged as the most inexpensive panacea, providing more bandwidth than Cable Modems and Digital Subscriber Lines. Nevertheless, providing fair and efficient Quality of Service (QoS) has always been a major issue due to the un-deterministic nature of Time Division Multiple Access (TDMA) technology and the limited 1 Gbps channel speed that EPON relies on; unlike backbone networks that uses the Wavelength Division Multiplexing (WDM) technology. This book instruments these challenges and issues and offers effective solutions. More specifically, it presents an upgrade from a TDM-PON to a Hybrid TDM/WDM-PON and proposes and validates the first framework that enables for per-stream QoS protection in EPON using a new fair QoS scheduler. The book addresses professionals in optical and access networks. It is also directed towards researchers who would like to get a novel fragrance of EPONs.Read more
School & Public Library Accounts - please log in
By Driscoll, Michael
This book is a sequel to Python 101. It will help you grow in your abilities as a Python programmer as it introduces intermediate and advanced topics such as function overloading, Unicode, caching, benchmarking, testing, concurrency and much more!
By Raitner, Marcus
Revision with unchanged content. Visual navigation of hierarchically structured graphs is a technique for interactively exploring large graphs with an additional hierarchical structure such as call graphs of telephone networks. In order to reduce the complexity of the graph, only... the interesting subgraphs are shown in detail, while the others are collapsed. As the areas of interest change over time, clusters are expanded or contracted, for which an efficient data structure is needed. In this work a new variant of this problem is introduced, which supports insertion and deletion of graph nodes. So far efficient data structures were known only for more static variants. The proposed data structure builds on a novel technique of superimposing a search tree over an ordered list main-tenance structure. For visualizing the expanding and contracting a local update scheme for the well-known algorithm of Sugiyama and Misue is presented, which has applications ranging from UML diagrams to bio-chemical pathways. Experimental results show that this update scheme is more efficient than redrawing, yet the performance gain is not at the expense of quality as regards the area of the drawing and the number of crossings.Read more
Subscribe now to be the first to hear about specials and upcoming releases.
Copyright © 2020 Wheelers Books
· All rights reserved