By Topic

Finding Time and Buffer Preserving Routes in Gaussian Intermittent Networks

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
$33 $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)
Omar Y. Tahboub ; Software Eng. Applic., PayPal, San Jose, CA, USA ; Javed I. Khan

Intermittent networks (IntNET) are networks where all the links in a path may not be available concurrently. Finding routes on such a network is hard. No trivial extension of classical routing protocols is known to provide a correct solution. In this paper, we present a constraint resource planning (CRP) based advanced route computation and scheduling algorithm for IntNET. The algorithm computes routes achieving near minimum delay and also achieve the bound on minimum intermediate buffer requirements. It was difficult previously to deploy such advanced routing. However, this design is suitable for the new IETF traffic engineering extensions that now enable such advanced externally computed route to be injected into a MPLS infrastructure.

Published in:

Information Technology: New Generations (ITNG), 2012 Ninth International Conference on

Date of Conference:

16-18 April 2012