This paper presents a burst aggregation method for an Agile All-Photonic Network (AAPN) operating under an asynchronous burst switched mode. The model combines both the timer-based and threshold-based approaches into a single composite burst assembly mechanism. This is evaluated semi-analytically for fixed length packets and Poisson arrivals and used as a special case to verify a more general OPNET Modeler simulation. The dependence of the blocking probability on different burst aggregation parameters is observed as well. The same procedure is extended to 'encapsulate' (aggregate) variable packet length traffic into 'envelopes' (bursts) matched to the time slots in an AAPN operating in a synchronous time-slotted mode. Results are presented for an emulation of this process using real IP network traffic from the local LAN using two encapsulation methods that differ depending upon whether 'envelope' boundaries are allowed to cross constituent packets or otherwise. Bandwidth utilization was measured for different encapsulation parameters and it is confirmed that the model with the boundaries allowed to cross packets (i.e., the model with packet segmentation) is more bandwidth-efficient even if the processing delay is slightly larger. The successful operation of the emulation system suggests as well that a simple, low-cost software implementation would be suitable to perform the burst/slot aggregation process in AAPN.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.