The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We explore the impact of mode coupling on the capacity of MDM networks under limited DSP computational complexities. Results show that a 34-fold increase in network throughput can be achieved by introducing strong mode coupling.
We improve the C-RAN architecture for supporting high-speed railway communication. Results show that the improved architecture significantly reduces the bandwidth consumption brought by base station coordination and achieves higher system capacity.
Shared backup path protection in MCF networks is studied considering inter-core crosstalk and MIMO-based crosstalk suppression. Results show that inter-core crosstalk seriously affects network throughput and backup path sharing ratio under high traffic load.
We establish an analytical model to analyze the impact of “information distortion” caused by concurrent rerouting after a network failure. The estimate values derived from the analytical model agree well with the experimental results.
The rise of big data and cloud computing applications is driving an explosion in the growth of data centers (DCs), and is already resulting in networking bottlenecks and performance degradation. The size and capacity of DCs are being constrained by the traditional packet-based switching architectures due to high energy consumption.
In this letter, we propose a novel SDN-based fast lightpath hopping (LPH) mechanism enabled by time synchronization to protect optical networks from eavesdropping and jamming. In order to realize fast LPH in optical networks, we establish an SDN-based LPH routing and signalling architecture, and set up an integer linear programming (ILP) model for fewest-shared-link multipath computation. We also...
CapEx minimization for few-mode fiber networks is studied for different traffic patterns for the first time. FMF networks can have significant CapEx advantages for bulk data transfer and for fine-granularity switching by deploying MDM-compatible WSSs.
RWCA planning problem for MCF networks with MIMO-based crosstalk suppression is studied and its ILP model is established. Numerical results show that by using MIMO technology, number of accepted traffics and resource utilization in MCF networks can be increased.
In this article, we investigate the costs of optical network Capital Expenditure (CapEx) components which include fiber, optical amplifier (OA), cable and conduit. The CapEx of high-capacity optical network under given traffic requests is optimized, and results are analyzed to evaluate the influences of Multi-core Fiber (MCF) communication system on the components of optical network CapEx. To solve...
Geographically distributed data centers for the rapid growth of worldwide cloud service bring the demand of massive inter-data center information exchange. Considering the capacity and costs, existing optical networks show their advantages to carry the non-interactive, delay tolerated and bulk inter-data center data. In order not to affect the real-time traffic, these bulk data is usually transferred...
Polarization-dependent RF delay and amplitude due to PMD in OBFNs are investigated. Delay deviation and amplitude fluctuations in each delay line cause a major degradation of the OBFNs radiation pattern.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.