205 research outputs found

    Role of Optical Network in Cloud/Fog Computing

    Get PDF
    This chapter is a study of exploring the role of the optical network in the cloud/fog computing environment. With the growing network issues, unified and cost-effective computing services and efficient utilization of optical resources are required for building smart applications. Fog computing provides the foundation platform for implementing cyber-physical system (CPS) applications which require ultra-low latency. Also, the digital revolution of fog/cloud computing using optical resources has upgraded the education system by intertwined VR using the fog nodes. Presently, the current technologies face many challenges such as ultra-low delay, optimum bandwidth, and minimum energy consumption to promote virtual reality (VR)-based and electroencephalogram (EEG)-based gaming applications. Ultra-low delay, optimum bandwidth, and minimum energy consumption. Therefore, an Optical-Fog layer is introduced to provide a novel, secure, highly distributed, and ultra-dense fog computing infrastructure. Also, for optimum utilization of optical resources, a novel concept of OpticalFogNode is introduced that provides computation and storage capabilities at the Optical-Fog layer in the software defined networking (SDN)-based optical network. It efficiently facilitates the dynamic deployment of new distributed SDN-based OpticalFogNode which supports low-latency services with minimum energy as well as bandwidth usage. Therefore, an EEG-based VR framework is also introduced that uses the resources of the optical network in the cloud/fog computing environment

    A low-complexity parallel-friendly rate control algorithm for ultra-low delay high definition video coding

    Get PDF
    Ultra-low delay high definition (HD) video coding applications such as video conferencing demand, first, low-complexity video encoders able to support multi-core framework for parallel processing and, second, rate control algorithms (RCAs) for successful video content delivering under delay constraints. In this paper a low-complexity parallel-friendly RCA is proposed for HD video conferencing. Specifically, it has been implemented on an optimized H.264/Scalable Video Coding (SVC) encoder, providing excellent performance in terms of buffer control, while achieving acceptable quality of compressed video under the imposed delay constraints

    Waveform Design for 5G and beyond Systems

    Get PDF
    5G traffic has very diverse requirements with respect to data rate, delay, and reliability. The concept of using multiple OFDM numerologies adopted in the 5G NR standard will likely meet these multiple requirements to some extent. However, the traffic is radically accruing different characteristics and requirements when compared with the initial stage of 5G, which focused mainly on high-speed multimedia data applications. For instance, applications such as vehicular communications and robotics control require a highly reliable and ultra-low delay. In addition, various emerging M2M applications have sparse traffic with a small amount of data to be delivered. The state-of-the-art OFDM technique has some limitations when addressing the aforementioned requirements at the same time. Meanwhile, numerous waveform alternatives, such as FBMC, GFDM, and UFMC, have been explored. They also have their own pros and cons due to their intrinsic waveform properties. Hence, it is the opportune moment to come up with modification/variations/combinations to the aforementioned techniques or a new waveform design for 5G systems and beyond. The aim of this Special Issue is to provide the latest research and advances in the field of waveform design for 5G systems and beyond

    Multicast With Prioritized Delivery: How Fresh is Your Data?

    Full text link
    We consider a multicast network in which real-time status updates generated by a source are replicated and sent to multiple interested receiving nodes through independent links. The receiving nodes are divided into two groups: one priority group consists of kk nodes that require the reception of every update packet, the other non-priority group consists of all other nodes without the delivery requirement. Using age of information as a freshness metric, we analyze the time-averaged age at both priority and non-priority nodes. For shifted-exponential link delay distributions, the average age at a priority node is lower than that at a non-priority node due to the delivery guarantee. However, this advantage for priority nodes disappears if the link delay is exponential distributed. Both groups of nodes have the same time-averaged age, which implies that the guaranteed delivery of updates has no effect the time-averaged freshness.Comment: IEEE SPAWC 201
    corecore