Recent advances in quantum hardware and error correction have paved the way for early fault-tolerant (EFT) quantum computing. We propose iSwitch, a hybrid system architecture for trapped-ion quantum computers (TIQC) that exploits ultra-high-fidelity single-qubit gates and efficient logical CNOTs enabled by ion shuttling. iSwitch employs bare qubits for single-qubit operations and QEC-encoded logical qubits for two-qubit gates, avoiding full logical encoding, gate synthesis, and magic state distillation. To enable this selective encoding, we develop a low-noise conversion protocol between bare and logical qubits, a hybrid instruction set tailored to 2D TIQC layouts, and a compiler that minimizes conversion overhead and optimizes scheduling. Evaluations on variational quantum algorithm benchmarks show that iSwitch achieves comparable fidelity to conventional QEC methods, while reducing qubit and operation counts by roughly 33–50%, offering a practical, resource-efficient path toward EFT quantum computing on trapped-ion platforms.

Distributed Quantum Computing (DQC) provides a scalable architecture by interconnecting multiple quantum processor units (QPUs).Among various DQC implementations, quantum data centers (QDCs) -where QPUs in different racks are connected through reconfigurable optical switch networks -are becoming feasible in the near term.However, the latency of cross-rack communications and dynamic switch reconfigurations poses unique challenges to communications in QDCs, significantly increasing the overall latency, thereby also reducing the overall fidelity.In this paper, we address these challenges by introducing a novel compiler that optimizes scheduling of communications across the program and network layers.Our evaluation shows that it reduces the overall latency by 8.02× over prior approaches with a small overhead and can be integrated with quantum error correction (QEC) to facilitate fault-tolerant quantum computing (FTQC).We have open-sourced our codes at https://zenodo.org/records/15377656.

With its significant security potential, the quantum internet is poised to revolutionize technologies like cryptography and communications. Although it boasts enhanced security over traditional networks, the quantum internet still encounters unique security challenges essential for safeguarding its Confidentiality, Integrity, and Availability (CIA). This study explores these challenges by analyzing the vulnerabilities and the corresponding mitigation strategies across different layers of the quantum internet, including physical, link, network, and application layers. We assess the severity of potential attacks, evaluate the expected effectiveness of mitigation strategies, and identify vulnerabilities within diverse network configurations, integrating both classical and quantum approaches. Our research highlights the dynamic nature of these security issues and emphasizes the necessity for adaptive security measures. The findings underline the need for ongoing research into the security dimension of the quantum internet to ensure its robustness, encourage its adoption, and maximize its impact on society.

The increasing concerns of knowledge transfer and data privacy challenge the traditional gather-and-analyse paradigm in networks. Specifically, the intelligent orchestration of Virtual Network Functions (VNFs) requires understanding and profiling the resource consumption. However, profiling all kinds of VNFs is time-consuming. It is important to consider transferring the well-profiled VNF knowledge to other lack-profiled VNF types while keeping data private. To this end, this paper proposes a Federated Transfer Component Analysis (FTCA) method between the source and target VNFs. FTCA first trains Generative Adversarial Networks (GANs) based on the source VNF profiling data, and the trained GANs model is sent to the target VNF domain. Then, FTCA realizes federated domain adaptation by using the generated source VNF data and less target VNF profiling data, while keeping the raw data locally. The proposed FTCA enables efficient profiling knowledge transfer among different VNFs, while maintaining data privacy. Through FTCA, faster new VNF deployment can be expected. Experiments show that the proposed FTCA can effectively predict the required resources for the target VNF. Specifically, the RMSE index of the regression model decreases by 38.5% and the R-squared metric advances up to 68.6%.

The adoption of Artificial Intelligence (AI) based Virtual Network Functions (VNFs) has witnessed significant growth, posing a critical challenge in orchestrating AI models within next-generation 6G networks. Finding optimal AI model placement is significantly more challenging than placing traditional software-based VNFs, due to the introduction of numerous uncertain factors by AI models, such as varying computing resource consumption, dynamic storage requirements, and changing model performance. To address the AI model placement problem under uncertainties, this paper presents a novel approach employing a sequence-to-sequence (S2S) neural network which considers uncertainty estimations. The S2S model, characterized by its encoding-decoding architecture, is designed to take the service chain with a number of AI models as input and produce the corresponding placement of each AI model. To address the introduced uncertainties, our methodology incorporates the orthonormal certificate module for uncertainty estimation and utilizes fuzzy logic for uncertainty representation, thereby enhancing the capabilities of the S2S model. Experiments demonstrate that the proposed method achieves competitive results across diverse AI model profiles, network environments, and service chain requests.

The dis aggregated and hierarchical architecture of advanced RAN presents significant challenges in efficiently placing baseband functions and user plane functions in conjunction with Multi-Access Edge Computing (MEC) to accommodate diverse 5G services. Therefore, this paper proposes a novel approach NetMind, which leverages Deep Reinforcement Learning (DRL) to determine the function placement strategies in RANs with diverse topologies, aiming at minimizing power consumption. NetMind formulates the function placement problem as a maze-solving task, enabling a Markov Decision Process with standardized action space scales across different networks. Additionally, a Graph Convolutional Network (GCN) based encoding mechanism is introduced, allowing features from different networks to be aggregated into a single RL agent. That facilitates the RL agent's generalization capability and minimizes the negative impact of retraining on power consumption. In an example with three sub-networks, NetMind achieves comparable performance to traditional methods that require a dedicated DRL agent for each network, resulting in a 70 % reduction in training costs. Furthermore, it demonstrates a substantial 32.76% improvement in power savings and a 41.67 % increase in service stability compared to benchmarks from the existing literature.

Federated Learning (FL) enables collaborative model training across edge devices while preserving data locally. Deploying FL faces challenges due to device heterogeneity. Using cloud technologies like Kubernetes (K8s) can offer computational elasticity, yet may compromise FL privacy principles. K8s can jeopardise FL privacy by potentially allowing malicious FL clients to access other resources given its flat networking approach. This paper introduces the privacy-preserving K8s operator kubeFlower. It addresses privacy risks via isolation-by-design and differential privacy for data management. Isolation ensures secure resource sharing, while differential privacy safeguards individual data privacy. We introduce the Privacy Preserving Persistent Volume Claimer (P3-VC), which adds noise to data while managing a privacy budget. kubeFlower simplifies FL system management in K8s while ensuring privacy. We tested our approach on a network testbed composed of different geo-located cloud and edge nodes where FL clients are deployed. Our results demonstrate the approach’s efficacy in preserving privacy in K8s-based FL for cloud–edge environments.

Leveraging the potential of Virtualised Network Functions (VNFs) requires a clear understanding of the link between resource consumption and performance. The current state of the art tries to do that by utilising machine learning and specifically Supervised Learning (SL) models for given network environments and VNF types assuming single-objective optimisation targets. Taking a different approach, iOn-Profiler poses a novel VNF profiler optimising multi-resource type allocation and performance objectives using adapted Reinforcement Learning (RL). Our approach can meet key performance indicator targets while minimising multi-resource type consumption and optimising the VNF output rate compared to existing single-objective solutions. Our experimental evaluation with three real-world VNF types over a total of 39 study scenarios (13 per VNF), for three resource types (virtual CPU, memory, and network link capacity), verifies the accuracy of resource allocation predictions and corresponding successful profiling decisions via a benchmark comparison between our RL model and SL models. We also conduct a complementary exhaustive search-space study revealing that different resources impact performance in varying ways per VNF type, implying the necessity of multi-objective optimisation, individualised examination per VNF type, and adaptable online profile learning, such as with the autonomous online learning approach of iOn-Profiler.

Integrating mobile networks with Non-3GPP networks provides a promising solution to mitigate the wireless RF spectrum scarcity. Despite the maturity of integration technologies, a comprehensive approach for radio resource allocation in highly dynamic and complex multiple Radio Access Technologies (multi-RAT) networks is still lacking. To tackle this challenge, this paper proposes an Access Traffic Management (ATM) system that enhances radio resource allocation during access, transmission, and handover processes. The system features a scalable and concise ATM-supported multi-RAT network architecture, supported by a Deep Deterministic Policy Gradient (DDPG) based Intelligent ATM (IATM) algorithm. To evaluate the proposed system, a Network Simulator 3 (NS3) based network simulation is built with realistic 5G and WiFi modules, interacting with the IATM algorithm in real time for decision making and policy improvement. Numerical improvements of our solution demonstrate its superiority over conventional steering modes. Our solution achieves an increase in resource utilization efficiency by 45% and 70% compared to the Active-Standby and Load-Balance steering modes, respectively. Moreover, it enhances link quality by a factor of three and doubles throughput without incurring any additional costs. Additionally, our solution significantly enhances session stability under conditions involving network size dynamics and UE mobility.

Under horizontal federated learning (HFL) in the Internet of Things (IoT) scenarios, different user data sets have significant similarities on the feature spaces, the final goal is to build a high-performance global model. However, not all features are great contributors when training the global HFL model, some features even impair the HFL. Besides, the curse of dimension will delay the training time and cause more energy consumption (EC). In this case, it is critical to remove irrelevant features from the local and select the useful overlapping features from a federated global perspective. In addition, the uncertainty of data being labeled and the nonindependent and identically distributed (non-IID) client data should also consider. This article introduces an unsupervised federated feature selection approach (named FSHFL) for HFL in IoT networks. First, a feature relevance outlier detection method is applied to the HFL participants to remove the useless features, which combines with the improved one-class support vector machine. Besides, a feature relevance hierarchical clustering (FRHC) algorithm is proposed for HFL overlapping feature selection. Experiment results on four IoT data sets show that the proposed methods can select better-federated feature sets among HFL participants, thus improving the performance of the HFL system. Specifically, the global model accuracy improves up to 1.68% since fewer irrelevant features. Moreover, FSHFL can lower the average training time as high as 6.9%. Finally, when the global model gets the same test accuracy, FSHFL can decrease the average EC of training the model by approximately 2.85% compared to federated average and roughly 68.39% compared to Fed-SGD.

HELICON is a novel hierarchical Reinforcement Learning (RL) approach for orchestrating the dynamic placement of Virtual Network Functions (VNFs) in Cloud and Edge 5G environments. It proves capable of addressing an NP-Hard decision-making problem with adopted RL while augmenting the current state of the art in orchestrators with a previously unexplored lightweight distributed and hierarchical RL approach. HELICON can run as a fully autonomous solution or complement orchestrators, thus bridging a significant gap in existing orchestrators, which generally lack intelligent and dynamic adaptation capabilities. Finally, our performance evaluation results over an actual 5G city testbed and use case validate that HELICON outperforms traditional policy-based Open Source MANO and other heuristic policies concerning single or multi-objective optimisation goals. What is more, HELICON’s performance meets with that of node-specific custom supervised learning models, whereas it clearly outperforms supervised learning under dynamic conditions.

Ultra-reliable low-latency communication (URLLC) services are intrinsically challenging to deliver, with many 5G and future services, including mobile game streaming, adding further complexity by demanding zero service downtime in high-mobility scenarios. Solving these challenges is essential and must be addressed beyond mobile gaming to realise a multitude of current and future services like eX-tended/Virtual Reality(XR/VR) or holoportation in mobile scenarios. Multi-access Edge Computing (MEC) brings services “closer” to user consumption with evident advantages yet at the cost of maintaining a zero downtime guarantee when user handovers (HOs) are prevalent due to the decentralisation of services towards the network edge. In this work, we design and evaluate intelligent HO prediction models between radio 5G Base Stations. The motivation for timely user HO prediction lies in being a vital presupposition for path steering and other MANO control actions in contemporary programmable 5G networks to deliver a zero downtime perception during HO events. Our detailed simulation and actual testbed evaluation results show that effective HO prediction can be achieved using a combination of Long Short-Term Memory (LSTM) or gradient boost regression with classification models, with the latter filtering out any Reference Signal Received Power (RSRP) prediction input outliers for predicting the serving cell.

In this paper, we present a zero-touch network orchestrator to autonomously provide an end-to-end orchestration platform to orchestrate, monitor, and profile network services. Subsequently, we describe a new method to autonomously generate performance profiles of these network services and compute optimum resources required to meet the given KPIs and performance targets.

The study of Service Function Chains (SFCs) placement problem is crucial to support services flexibly and use resources efficiently. Solutions should satisfy various Quality of Service requirements, avoid edge resource congestion, and improve service acceptance ratio (SAR). This work presents a novel approach to address these challenges by solving amulti-objective SFCs placementproblem based on the Pointer Network in multi-layer edge and cloud networks. We design a Deep Reinforcement Learning algorithm, calledChebyshev-assisted Actor-Critic SFCs Placement Algorithm, to overcome the limitations of traditional heuristic and evolutionary algorithms. Then, we run this algorithm iteratively with a set of weights to obtain non-dominated fronts, which have much higher hypervolume values than those obtained from other state-of-the-art algorithms. Moreover, running our algorithm individually with selected weights from non-dominated fronts can avoid edge resource congestion and achieve 98% SARs of low-latency services during high-workload periods. Finally, based on both simulation and real testbed experimental results, it is validated that the proposed algorithm fits for pragmatic service deployment while achieving 100% of SARs in the use cases deployed on the testbed.

Currently, telecommunication research communities are striving towards the adoption of Zero-touch network and Service Management (ZSM) in Network Function Virtualisation (NFV) orchestration. Contemporary efforts on adopting Machine Learning (ML) and Artificial Intelligence (AI) have caused an upsurge of ZSM application in the VNF space. While ML and AI complement the ZSM goals for building the intelligent NFV orchestration, a deep knowledge about the resource consumption by Network Services (NSs) and its constituent Virtual Network Functions (VNFs) is required, which would enable AI and ML models to manage the available resources better and enhance user experience. In this article, we propose a Novel Autonomous Profiling (NAP) method that not only predicts the optimum network load a VNF can support but also estimates the required resources in terms of CPU, Memory, and Network, to meet the performance targets and workload by utilising ML techniques. Our performance evaluation results on real datasets show that the output of NAP can be used in the next generation of NFV orchestration.

Current infrastructures are reaching the point where existing networking methods are unable to cope with the exponential growth of traffic and Quality of Service (QoS) requirements. New techniques are necessary to keep pace. One such technique, Software-Defined Networking (SDN) uses a central controller to program many individual network devices. However, SDN uses heuristic algorithms that do not always select the optimal path. This paper looked at creating three Q-Routing algorithms leveraging SDN and Mesh network topologies. Two algorithms used one network metric each (Latency and Bandwidth) and the third used multiple metrics. Results showed that the single metric Q-Routing algorithms on average performed as well as the K-Shortest Path versions while Q-Routing with multiple network metrics failed to match K-Shortest Path (different combination of metrics means these algorithms are not comparable). Results also showed that Q-Routing was able to calculate paths faster than K-Shortest Path in both static and dynamic networks.

In this article, we present the design and implementation of the software-defined IoT management (SDIM) framework based on software-defined networking (SDN)-enabled architecture that is purposely built for the edge computing multidomain wireless sensor networks (WSNs). This framework can dynamically provision the IoT devices to enable machine-to-machine (M2M) communication as well as continuous operational fault detection for WSNs. Unlike the existing approaches in the literature, SDIM is mainly deployed at multiaccess edge computing (MEC) nodes and is integrated with the cloud by aggregating multidomain topology information. Backed by the experimental results over the University of Bristol 5G test network, we demonstrate in practice that our framework outperforms the implementations of the lightweight M2M (LWM2M) and NETCONF Light IoT device management protocols when deployed autonomously at the network edge and/or the cloud. Specifically, SDIM edge deployments can lower the average device provisioning time as high as 46% compared to LWM2M and 60.3% compared to NETCONF Light. Moreover, it can decrease the average operational fault detection time by approximately 33% compared to LWM2M and roughly 40% compared to NETCONF Light. Also, SDIM reduces control operations time up to 27%, posing a powerful feature for use cases with time-critical control requirements. Last, SDIM manages to both reduce CPU consumption and to have important energy consumption gains at the network edge, which can reach as high as 20% during device provisioning and 4.5%-4.9% during fault detection compared to the benchmark framework deployments.

To meet the challenge of flexible and dynamic resource provisioning for massive and various network services, we investigate the network function virtualization-resource allocation problem in the 5G network. For the first time, this problem is modelled as the congestion game to capture the effects of resource congestion on packet processing latency, optical-to-electronic and electronic-to-optical conversion latency. All the network service requests received at the same time are players trying to minimise their own end-to-end latency and resource consumption cost. A distributed online algorithm is designed and simulation results show that it can achieve 100% service acceptance ratio while the baseline algorithm cannot. If lower weighted resource consumption cost is set for 1ms and 5ms services, more such services will be routed to edge nodes and network operators will earn more. An experiment for network services with different packet sizes is carried out, and results prove that the proposed algorithm converges to Nash Equilibrium in 40 seconds and the latency requirements are all satisfied if the packet size is small.

To support ultra-low latency 5G services flexibly and use limited resources in Multi-access Edge Computing (MEC) servers efficiently, the study of latency-aware optimal hierarchical resource allocation for Service Function Chains in 5G becomes essential. In this regard, we address this resource allocation problem, for the first time, by designing a Mixed Integer Linear Programming (MILP) model based on a hierarchical 5G network interconnecting multiple MEC nodes. The objective is to minimize the total latency from five sources: processing, queueing, transmission, propagation, and optical-electronic-optical conversion. Experimental results prove that ultra-low latency requirements can be guaranteed and maximum usage of MEC node resources can be obtained. Then, a data rate-based heuristic algorithm is proposed, which can get ≤1.5 approximation ratio under different workload scenarios and achieve at least 1.7 times as much service acceptance ratio as the baseline approach.

Rate or link adaptation is the determination of the optimal modulation and coding scheme (MCS) that will maximize the performance under the current wireless channel conditions. A Software-Defined Networking (SDN) agent is a software element bridging an SDN controller and any legacy wireless network elements by providing the abstraction of these elements. In this paper, we present the work of an SDN approach for designing and implementing a Rate/Link Adaptation (RA) framework for wireless local area networks (WLAN). The framework provides support for real-time RA applications and flexibility to satisfy various degrees of Quality of Service (QoS) or Quality of Experience (QoE) requirements. We implement the proposed framework as an extension to the Wireless Open-Access Research Platform (WARP), an FPGA based Software-Defined Radio (SDR) platform, with evaluation results indicating the feasibility of using SDN-RA under the stringent time constraints posed by the WLAN. To demonstrate the effectiveness of decoupling rate decision functions from the underlying wireless interface card and to highlight its applicability for a diverse set of scenarios, we present a use case deployed over the framework focusing on rate adaptation for individual traffic, and display optimization in different aspects, such as the reduction transmission errors.

Recently, a lot of research is focused on applying Software-Defined Networking (SDN) concepts on wireless networks. However, the current wireless systems are lack of SDN support and remain closed and (mostly) proprietary, which makes it difficult to integrate with SDN systems. The SDN agent is introduced to solve the above issues. An SDN agent is a software element bridging the SDN controller and any legacy wireless network elements (NEs) by providing the abstraction of these elements. The main advantage of this approach is that there is no modification to either the existing SDN elements or the 802.11 protocols, while the SDN controller is enabled to control and manage legacy wireless NEs. In this paper, we present an SDN agent framework for WLANs and describe an implementation of the proposed agent on the Wireless Open-Access Research Platform (WARP), an FPGA based open source Software-Defined Radio (SDR) platform. With the support from such an agent, innovative applications and functionalities can be developed for the WLAN access points (APs), such as dynamically slicing AP bandwidth among users and adapting the transmit power in flexible granularity, i.e. at per frame/per flow level.

Data analytics and scientific computing are two modern applications that in recent years have substantially changed their computation and communication needs, requiring additional processing capability and bandwidth to be able to keep pace with current demands. These applications are commonly processed within data centers, exchanging enormous volumes of data, rapidly stressing existing network infrastructures. Thus, it is crucial for data center operations and management to be able to understand and classify the communication demands of these applications. The traditional approaches for classifying application traffic are port-based and Deep Packet Inspection, both presenting issues with current network technology. Some recent works propose using machine learning plus statistical information collected from application flows to classify traffic. Applications running in data centers present communication patterns which can be recognized through their traffic matrices. So, the main contribution of this paper is a method that explores the textural information extracted from these matrices to classify the data center traffic using machine learning techniques. As a proof-of-concept, we implemented this method in a system named DCTraCS. The experimental dataset was gathered from two real data centers, collecting the traffic matrices of MapReduce and a set of scientific applications every second for a period of 30 minutes. For assessing our proposal, we compared it with other machine learning techniques for classifying application traffic found in current literature. Results show that our approach achieved the highest accuracy, classifying correctly over 99% of our data center applications.

Datacenter (DC) design has been moved toward the edge computing paradigm motivated by the need of bringing cloud resources closer to end users. However, the software defined networking (SDN) architecture offers no clue to the design of micro DCs (MDCs) for meeting complex and stringent requirements from next generation 5G networks. This is because canonical SDN lacks a clear distinction between functional network parts, such as core and edge elements. Besides, there is no decoupling between the routing and the network policy. In this paper, we introduce residue defined networking architecture (RDNA) as a new approach for enabling key features like ultra-reliable and low-latency communication in MDC networks. RDNA explores the programmability of residues number system as a fundamental concept to define a minimalist forwarding model for core nodes. Instead of forwarding packets based on classical table lookup operations, core nodes are tableless switches that forward packets using merely remainder of the division (modulo) operations. By solving a residue congruence system representing a network topology, we found out the algorithms and their mathematical properties to design RDNA's routing system that: 1) supports unicast and multicast communication; 2) provides resilient routes with protection for the entire route; and 3) is scalable for 2-tier Clos topologies. Experimental implementations on Mininet and NetFPGA SUME show that RDNA achieves 600 ns switching latency per hop with virtually no jitter at core nodes and sub-millisecond failure recovery time.

Scientific applications demand huge computational power connected through fast networks. They are developed using parallel kernel methods, usually implemented with the Message Passing Interface (MPI), presenting well-behaved communication patterns across computing nodes. The current network technologies do not allow defining traffic forwarding policies considering the different application traffic, resulting in an unbalanced load on the network links. Moreover, the devices are not concerned if the traffic is latency-sensitive or bandwidth-intensive. To handle this, we present NetSA, a framework exploiting the communication patterns of scientific applications, considering latency and bandwidth constraints, as the key logic for evenly placing the application flows on the network available paths. Through NetSA, the scientific application developer can easily modify the network behavior to best fit the application communication requirements. We have performed experiments for optimizing the MPI communication primitives and applied our solution to speed up scientific applications, obtaining an execution time reduction up to 27%.

Disaggregation of IT resources has been proposed as an alternative configuration for data centres. Comparing to the monolithic server approach that data centres are being built now, in a disaggregated data centre, CPU, memory and storage are separate resource blades and they are interconnected via a network fabric. That brings greater flexibility and improvements to the future data centres in terms of utilization efficiency and energy consumption. The key enabler for the disaggregated data centre is the network, which should support the bandwidth and latency requirements of the communication that is currently inside the server. In addition, a management software is required to create the logical connection of the resources needed by an application. In this paper, we propose a disaggregated data centre network architecture, we present the first scheduling algorithm specifically designed for disaggregated computing and we demonstrate the benefits that disaggregation will bring to operators.

Software defined networking (SDN) and OpenFlow as the outcome of recent research and development efforts provided unprecedented access into the forwarding plane of networking elements. This is achieved by decoupling the network control out of the forwarding devices. This separation paves the way for a more flexible and innovative networking. While SDN concept and OpenFlow find their ways into commercial deployments, performance evaluation of the SDN concept and its scalability, delay bounds, buffer sizing and similar performance metrics are not investigated in recent researches. In spite of usage of benchmark tools (like OFlops and Cbench), simulation studies and very few analytical models, there is a lack of analytical models to express the boundary condition of SDN deployment. In this work we present a model based on network calculus theory to describe the functionality of an SDN switch and controller. To the best of our knowledge, this is for the first time that network calculus framework is utilized to model the behavior of an SDN switch in terms of delay and queue length boundaries and the analysis of the buffer length of SDN controller and SDN switch. The presented model can be used for network designers and architects to get a quick view of the overall SDN network deployment performance and buffer sizing of SDN switches and controllers.

Cloud computing is a new model of consuming and delivering IT and infrastructure resources. It enables users to obtain what they need, as they need it, from advanced applications to IT infrastructure and platform services, including virtual infrastructure, servers and storage. It can provide significant economies of scale and greater business agility, while accelerating the pace of innovation. Network virtualization, as a key enabling technology in resource provisioning for cloud, has attracted extensive attention from both academia and industry. It takes cloud services to the next level by delivering optimised resources, on-demand utilisation, flexibility and scalability. This paper proposes a novel architectural solution for future cloud service providers based on the concept of Infrastructure as a Service (IaaS) framework and IP network virtualization. A number of associated schemes have also been designed as building blocks for the proposed framework, including resource description and abstraction mechanisms, virtual network request method and a resource broker mechanism named Marketplace. The proposed framework is able to respond quickly to the infrastructure needs for those cloud services with dynamic resizing of the infrastructure by aggregation or partition to meet capacity requirements of services. At the same time, it improves the utilisation of providers' resources with the creation of an infrastructure incorporating the heterogeneous resources in the data centre. In addition, the proposed marketplace, which also allows the trading of IP network resources between infrastructure providers and cloud service providers, is an important and complementary innovation within the cloud landscape.

The future Internet evolution is driven by applications that require simultaneous real-time access to multiple heterogeneous IT resources interconnected by high-speed optical networks. In this paper, we propose a novel service-oriented resource orchestration model based on the optimization of heterogeneous IT and network resources owned by different Infrastructure Providers (InPs). The proposed model aims to achieve a global optimum from both the end-users' and InPs' point of view across different administrative domains. An integer linear program (ILP) is formulated to obtain optimal results that maximizes the number of accepted requests while minimizing resource usage. It is compared against a co-scheduling ILP model, whose objective is to maximize the number of accepted requests only. Finally, we propose a heuristic solution for scalability. Its performance is compared against (i) our proposed ILP (ii) a co-scheduling heuristic that aim to maximize number of accepted requests only and (iii) an algorithm that does not take into account cross-domain optimizations.

This paper focuses on next generation ubiquitous networks supporting the Future Internet. In this context, it proposes an architecture and an integration framework of wireless and wired network technologies supporting a variety of services with differing service requirements. More specifically the i

This paper presents a programmable multi-granular optical cross connect (MG-OXC) and network architecture deployable in multi-service and multi-provider networks. The concept of programmable MG-OXC is introduced to provide a way of utilizing multiple switching/transport granularities to efficiently

Ultra high performance digital media applications are now creating the need for new network architectures instead of shared IP links to provide them with dedicated, on-demand high capacity. These demands will be more critical in the future, as applications employing a real time environment become more common. Dynamic optical services at lambda and sub-lambda granularities are proposed because they guarantee the appropriate QoS in terms of bandwidth, jitter and latency. The technologies presented in this paper are merely initial considerations for use when providing the network services under investigation. Initial studies have shown that there is a lot of interest, and there are many advantages, in setting up network services to distribute high-performance media streams via optical networks to one or more locations.

This paper presents a novel solution for realization of service oriented optical networking. The solution is based on advanced optical burst switched network scenario utilizing novel service oriented optical burst switched core and edge router technologies. We demonstrate service-aware bandwidth reservation in a multi-granular OBS test-bed. We also demonstrate non-network services and data layer connections over OBS control plane by extending the JIT OBS protocol.

Grid-GMPLS (G2MPLS) is conceived as a powerful network control plane solution that enhances the standard ASON/GMPLS architecture providing single-step resource reservation, co-allocation and maintenance of both network and Grid resources. This paper identifies and discusses the main issues and considerations that arise by network research and educational networks and network operators in order to facilitate the dissemination of G2MPLS control plane. Interoperability issues and backwards compatibility with existing network control planes centre the scope of this study, which intends to demonstrate the feasibility of adopting the proposed architectures.

This paper presents a novel application-aware network architecture for evolving and emerging IT services and applications. It proposes and analyses network architectures that integrate Session Initiation Protocol (SIP) with Optical Burst Switched (OBS) protocols on a unified manner. We suggest various SIP-OBS layering architectures for possible deployment as well as a number of end-to-end resource discovery protocols (both for network and non-network resources). Finally the paper reports of a SIP-enpowered OBS Testbed where this approach was experimentally validated.

This paper presents hybrid optical router architectures (both edge and core) to support user-defined bandwidth reservations for emerging and evolving applications over wavelength channels (circuit), optical bursts or even optical packets. The edge router is based on the deployment of application-aware IP packet classification and burst/packet aggregation algorithms as well as agile and intelligent optical resource allocation. The mechanism is responsible for per application switching (OCS/OBS/OPS) service selection and Differentiated Service (DiffServ) provisioning. The optical core router can support all the abovementioned switching technologies. Both are generic and able to support any type of current or future application.

This paper presents a novel hybrid optical burst/circuit switched (OBCS) ingress edge router solution towards ubiquitous photonic Grid networking. It is based on the deployment of Grid application-aware packet classification and burst aggregation algorithms as well as agile and intelligent optical resource allocation. The proposed solution utilises a generic and highly scalable multi-dimension classification mechanism able to provide wire-speed classification at high bit rates up to 40 Gbps. The mechanism is responsible for per application switching (OBS/OCS) service selection and Grid Differentiated Service (GridDiffServ) provisioning. A CoS-Traffic-Time-LEngth-Service-oriented aSembly (COST2LESS) algorithm has been proposed to smooth the incoming Grid traffic and provide some CoS differentiation and initial results are presented. An agile optical data transmission mechanism has been also implemented to map Grid traffic asynchronously into optical bursts or wavelength channels (data plane) based on user/application-specific requirements. Furthermore an optical burst Ethernet switched (OBES) transport mechanism has been implemented to transport out-of- band control plane signalling information.

This paper presents a novel solution towards ubiquitous photonic grid networking. It is based on the deployment of long-reached and high-bandwidth optical infrastructure while taking advantage of recent developments in optical networking technologies such as optical burst switching. The proposed solution utilises optical burst switching and active router technologies. It aims to provide a physical infrastructure able to fulfil grid application requirements and make efficient use of network resources.

This work presents a novel solution towards a long-reach intelligent infrastructure for Grid networking. The proposed solution is based on the deployment of high capacity optical infrastructure whilst taking advantage of recent developments in optical networking technologies. Optical burst switching and a user network interface utilizing fast tunable optical technologies provide a physical infrastructure able to fulfill the Grid application requirements and make efficient use of network resources. Furthermore a control and management plane based on extensions of existing artifacts offers peer-to-peer distributed networking to enable Grid services.