Team rap

Members
Overall Objectives
Scientific Foundations
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography

Section: New Results

Algorithms: Bandwidth Allocation in Optical Networks

Participants : Nelson Antunes, Christine Fricker, Philippe Robert, James Roberts.

The development of dynamic optical switching is widely recognized as an essential requirement to meet anticipated growth in Internet traffic. Since September 2009, RAP has begun an investigation into the traffic management and performance evaluation issues that are particular to this technology. A first analysis of passive optical networks used for high speed Internet access has led to the proposal of an original dynamic bandwidth allocation algorithm and to an evaluation of its traffic capacity [10] , [11] . Our activity on optical networking is carried out in collaboration with Orange Labs with whom we have a research contract. We have also established contacts with Alcatel Bell Labs and look forward to collaborating with Iraj Saniee and his team on their proposed time-domain wavelength interleaved networking architecture (TWIN).

The study [8] analyzes the traffic capacity of wavelength division multiplexing (WDM), passive optical networks (PONs) where user stations (optical network units) are equipped with tunable transmitters. For these systems users can use any of the multiple wavelengths to transmit their data but only within the limit determined by the number of transmitters they possess. A mean field approximation is investigated to estimate the capacity of a limited-gated multiserver polling system with a limit on the number of servers a given station can use simultaneously. The approximation provides an expression for the stability limit under very general assumptions about the traffic process and system configuration.

More generally, motivated by these next generation passive optical networks, we consider in [17] a multi-server polling system where the number of servers that can attend to a queue simultaneously is limited. The stability condition is investigated for this model under quite general assumptions. The result is proved for unlimited service policies. A conjecture is given for the case of limited service policies and general service limits. A simulation study shows that the stability conditions may hold.


previous
next

Logo Inria