Cart (Loading....) | Create Account
Close category search window
 

Surmounting Data Overflow Problems in the Collection of Information for High Speed Communications Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hershey, P. ; Intell. & Inf. Syst. Div., Raytheon, Falls Church, VA ; Silio, C.B., Jr.

High speed communications systems using optical media are capable of transporting and delivering data at faster rates than electronic components can economically process them. The result is data overflow in which performance information that is critical for effective enterprise system monitoring and management may be lost, thereby leaving the communications system vulnerable to quality of service degradation and the service provider unable to meet customer service level agreements. Service providers seek a solution to this problem that minimizes the amount of high-speed, high-cost electronics required to comprehensively recognize such information. This paper addresses the challenge of surmounting data overflow problems in the collection of information for high speed communications systems by introducing a new procedure to transform finite state recognizers into new machines that can recognize bit-level information as it passes a monitoring point while operating slower than bit-rate for implementation in reconfigurable hardware, such as RAM and field programmable gate arrays. This is accomplished by mapping N-bit sets from the input stream into new symbols that can be processed at rate I/N while also generating N-bit output symbols. The process is illustrated by an implementation example, and a time versus space tradeoff analysis is presented.

Published in:

Systems Conference, 2008 2nd Annual IEEE

Date of Conference:

7-10 April 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.