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 propose an inter-core crosstalk-aware routing, spectrum and core allocation scheme with spectrum bands and spatial Sp-Chs in multi-dimensional optical networks to get higher SE and lower XT. 15% reduction in XT is achieved.
We develop an innovative PC2PC (personal computer to pervasive computing) system to enable the secure, robust and pervasive mobile workstyle. PC2PC server compresses the desktop screens of any virtualized system, and delivers the stream through any popular networks to PC2PC client remotely for stream decoding, rendering and end-user interaction (such as keyboard/mouse commands). We have implemented...
In this paper, we study the problem of survivable virtual optical network (VON) mapping against single link failure with shared backup path protection (SBPP) in elastic optical networks. We formulate this problem with an integer linear programming (ILP) model to minimize the resource consumption of both working and backup paths. A different dynamic cost model (DDCM) for each sharable frequency slot...
Heterogeneous wireless technologies are widely used in the Mobile Internet and Internet of Things (IoT). When data traverse heterogeneous wireless network, packet loss is mainly caused by error rate of the unstable channel. However, TCP is unable to distinguish the true reason. It would still reduce the congestion window that will lead to severe communication performance degradation. This paper proposed...
We define k-content connectivity as the reachability of at least one content from any point of a data center network under concurrent k-1 failures. A flexible content placement algorithm is proposed to achieve k-content connectivity.
With the growth of cloud computing and other high-bitrate disaster recovery center (DRC) support service, DRC networks play an important role in the future networks. But the nature or man-made disaster is the main threaten of survivability. In this paper, we focus on the protection of DRC node based on contentconnectivity against disaster in disaster recovery center networks. An integer linear programming...
This paper presents a new call admission control (CAC) algorithm that takes into account the effect of mobility of users and adaptive modulation and coding (AMC) scheme, which can be used in orthogonal frequency division multiple access (OFDMA) systems with link adaptation. When the cell is decomposed into several concentric circles, time-frequency resources required for various traffics can be determined...
For the congestion problems in high-speed networks, a Q-learning model-independent flow controller is proposed. Because of the uncertainties and highly time-varying, it is not easy to accurately obtain the complete information for high-speed networks. In this case, the Q-learning, which is independent of mathematic model and prior-knowledge, has good performance. In this paper, the flow with higher...
An optimal bandwidth allocation scheme for cluster video on command (VOD) servers system is introduced in the paper. An analytic model of video distortion and server nodepsilas bandwidth limitation is proposed. The bandwidth allocation is considered as an optimization problem with the constraints of video quality and link capacity. The bandwidth occupation is dynamically adjusted according to observed...
Peer-to-peer file sharing applications, which enable peers to establish multiple TCP connections between other peers to transfer data, pose new challenge to congestion control. Since conventional congestion control only aims to make each of those connections TCP-friendly, self users can increase the number of connections to grab a large share of the bandwidth, introducing more congestion and degrading...
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.