Real-time speech enhancement on resourceconstrained devices faces a persistent challenge: many causal systems rely on dual-branch magnitude/complex refinements or attention-heavy backbones, whereas ultra-light streaming models often lack explicit cross-band interaction and long-range temporal memory, resulting in unstable artifacts. We propose Streaming Subband State-space Graph-frequency Network (S³G-Net), a causal complex-masking architecture built around a subband state-space graph-frequency bottleneck. Specifically, S³G-Net (i) allocates frequency-dependent capacity through dynamic subband gating in the encoder with no look-ahead, (ii) restores cross-band structure via banded graph-frequency residual propagation that promotes locally coherent spectral evolution, and (iii) redesigns the temporal core into a lightweight hybrid architecture that integrates a dilated causal Temporal Convolutional Network (TCN) for long-horizon modeling with a graph-conditioned diagonal state-space module. The proposed graph-conditioned diagonal state-space model (SSM) uses per frame graph-frequency descriptors to modulate band-wise memory, enabling causal cross-band interaction with small attention while stabilizing streaming behavior. S³G-Net is implemented as a single-stream encoder-bottleneck-decoder with no auxiliary branches or post-filtering, and uses a model with only ∼30k parameters requiring ∼60M MAC/s. S³G-Net outperforms or matches substantially larger baselines in terms of perceptual quality across in-domain and out-of-domain evaluations, while maintaining competitive intelligibility at significantly lower cost.

With the increasing global mobile data traffic and daily user engagement, technologies, such as mobile crowdsensing, benefit hugely from the constant data flows from smartphone and IoT owners. However, the device users, as data owners, urgently require a secure and fair marketplace to negotiate with the data consumers. In this paper, we introduce a novel federated data acquisition market that consists of a group of local data aggregators (LDAs); a number of data owners; and, one data union to coordinate the data trade with the data consumers. Data consumers offer each data owner an individual price to stimulate participation. The mobile data owners naturally cooperate to gossip about individual prices with each other, which also leads to price fluctuation. It is challenging to analyse the interactions among the data owners and the data consumers using traditional game theory due to the complex price dynamics in a large-scale heterogeneous data acquisition scenario. Hence, we propose a data pricing strategy based on mean-field game (MFG) theory to model the data owners’ cost considering the price dynamics. We then investigate the interactions among the LDAs by using the distribution of price, namely the mean-field term. A numerical method is used to solve the proposed pricing strategy. The evaluations demonstrate that the proposed pricing strategy efficiently allows the data owners from multiple LDAs to reach an equilibrium on data quantity to sell regarding the current individual price scheme. The result further demonstrates that the influential LDAs determine the final price distribution. Last but not least, it shows that cooperation among mobile data owners leads to optimal social welfare even with the additional cost of information exchange.

Digital transformation is increasingly reliant onservice-based operations in fog networks. The latter is a geo-dispersed form of the cloud, extending resources closer to end-users for improved privacy and reduced latency. The dispersion leverages diversity of compute-network capacities and energy prices, while promotes the coexistence of multiple providers. This drives variation in operational cost, coupled with limited information sharing across providers. Consequently, there is a critical need for an orchestration solution that preserves autonomy and optimizes operational cost across domains, while meeting service requirements. This paper proposes a novel service-based fog management and network orchestrator (sbMANO), which utilizes service metadata in enabling multi-provider resource management. The sbMANO is empowered with a novel optimization algorithm for service-based joint request mapping and response routing. The algorithm acts on partial information and preserves the edge for delay-critical services. The performance of the algorithm is evaluated analytically fordelay-awareanddelay-agnosticvariants. The results show that both achieve near-optimal performance in maximizing user satisfaction with minimum operational cost. Furthermore, the delay-aware variant outperforms the agnostic counterpart, with higher user satisfaction and lower operational cost.

With the increasing demand for digitalization and participation in Industry 4.0, new challenges have emerged concerning the market of digital services to compensate for the lack of processing, computation, and other resources within Industrial Internet of Things (IIoTs). At the same time, the complexity of interplay among stakeholders has grown in size, granularity, and variation of trust. In this paper, we consider an IIoT resource market with heterogeneous buyers such as manufacturer owners. The buyers interact with the resource supplier dynamically with specific resource demands. This work introduces a broker between the supplier and the buyers, equipped with Distributed Ledger Technologies (DLT) providing a service for market security and trustworthiness. We first model the DLT-assisted IIoT market analytically to determine an offline solution and understand the selfish interactions among different entities (buyers, supplier, broker). Considering the non-cooperative heterogeneous buyers in the dynamic market, we then follow an independent learners framework to determine an online solution. In particular, the decision-making procedures of buyers are modeled as a Partially Observable Markov Decision Process which is solved using independent Q-learning. We evaluate both the offline and online solutions with analytical simulations, and the results show that the proposed approaches successfully maximize players’ satisfaction. The results further demonstrate that independent Q-learners achieve equilibrium in a dynamic market even without the availability of complete information and communication, and reach a better solution compared to that of centralized Q-learning.

The Internet of Things (IoT) connected by software-defined networking (SDN) promises to bring great benefits to cyber-physical systems. However, the increased attack surface offered by the growing number of connected vulnerable devices and separation of SDN control and data planes could overturn the huge benefits of such a system. This article addresses the vulnerability of the trust relationship between the control and data planes. To meet this aim, we propose an edge computing-based Blockchain as a Service (BaaS), enabled by an external BaaS provider. The proposed solution provides verification of inserted flows through an efficient, edge-distributed, blockchain solution. We study two scenarios for the blockchain reward purpose: 1) information symmetry, in which the SDN operator has direct knowledge of the real effort spent by the BaaS provider and 2) information asymmetry, in which the BaaS provider controls the exposure of information regarding spent effort. The latter yields the so-called “moral hazard,” where the BaaS may claim higher than actual effort. We develop a novel mathematical model of the edge BaaS solution and propose an innovative algorithm of a fair reward scheme based on game theory that takes into account moral hazard. We evaluate the viability of our solution through analytical simulations. The results demonstrate the ability of the proposed algorithm to maximize the joint profits of the BaaS and SDN operator, i.e., maximizing the social welfare.

Many important cloud services require replicating massive data from one datacenter (DC) to multiple DCs. While the performance of pair-wise inter-DC data transfers has been much improved, prior solutions are insufficient to optimize bulk-data multicast, as they fail to explore the rich inter-DC overlay paths that exist in geo-distributed DCs, as well as the remaining bandwidth reserved for online traffic under fixed bandwidth separation scheme. To take advantage of these opportunities, we present BDS+, a near-optimal network system for large-scale inter-DC data replication. BDS+ is an application-level multicast overlay network with a fully centralized architecture, allowing a central controller to maintain an up-to-date global view of data delivery status of intermediate servers, in order to fully utilize the available overlay paths. Furthermore, in each overlay path, it leverages dynamic bandwidth separation to make use of the remaining available bandwidth reserved for online traffic. By constantly estimating online traffic demand and rescheduling bulk-data transfers accordingly, BDS+ can further speed up the massive data multicast. Through a pilot deployment in one of the largest online service providers and large-scale real-trace simulations, we show that BDS+ can achieve 3- 5× speedup over the provider's existing system and several well-known overlay routing baselines of static bandwidth separation. Moreover, dynamic bandwidth separation can further reduce the completion time of bulk data transfers by 1.2 to 1.3 times.

The Internet of Things (IoT) offers new opportunities for cities to make citizens live and work in more sustainable, healthy, and safe places. Since IoT applications in smart cities are characterized by different devices, networking standards, and data management strategies, trust becomes a fundamental issue in the IoT ecosystem. The explosion of IoT devices, along with their decentralized deployment, constraint resources, limited computational and cryptographic capabilities, brings challenges to trust management in IoT. The coexistence of multiple IoT domains also raises challenges, for example, how to evaluate and maintain trust across domain boundaries. This special issue aims at bringing the researchers from both academia and industry together to disseminate their recent advances related to the challenges and solutions in building trustful IoT for smart cities.

Wireless secret key generation (W-SKG) from shared randomness (e.g., from the wireless channel fading realizations), is a well established scheme that can be used for session key agreement. W-SKG approaches can be of particular interest in delay constrained wireless networks and notably in the context of ultra reliable low latency communications (URLLC) in beyond fifth generation (B5G) systems. However W- SKG schemes are known to be malleable over the so called "advantage distillation" phase, during which observations of the shared randomness are obtained at the legitimate parties. As an example, an active attacker can act as a man-in- the-middle (MiM) by injecting pilot signals and/or can mount denial of service attacks (DoS) in the form of jamming. This paper investigates the impact of injection and reactive jamming attacks in W-SKG. First, it is demonstrated that injection attacks can be reduced to - potentially less harmful - jamming attacks by pilot randomization; a novel system design with randomized QPSK pilots is presented. Subsequently, the optimal jamming strategy is identified in a block fading additive white Gaussian noise (BF-AWGN) channel in the presence of a reactive jammer, using a game theoretic formulation. It is shown that the impact of a reactive jammer is far more severe than that of a simple proactive jammer.

In computational complexity and latency con- strained emerging 5G applications, e.g., autonomous vehicles, haptic communications and enhanced reality, secret key generation (SKG) at the physical layer could be considered as an alternative to currently used key agreement schemes. In this framework, we study the optimal subcarrier scheduling in multicarrier systems when a subset of the subcarriers are used for SKG and the rest for data transmission, under both security and power constraints. The amount of data that can be transmitted with a single key is determined by the cryptographic suites used, so that realistic key rate constraints can be identified. This allows us to formulate the subcarrier allocation as a subset-sum 0-1 knapsack optimization problem that we solve using i) the standard dynamic programming approach and ii) a greedy heuristic approach of linear complexity. We show that the proposed heuristic induces virtually no loss in performance. Furthermore, a comparison with a baseline scheme in which SKG and data transfer are performed sequentially, shows that the proposed parallel approach offers gains in terms of efficiency.

Due to computational complexity and latency constraints in the nodes of many IoT systems, alternatives to public key encryption are sought for session key generation schemes. In this work we investigate novel cross-layer security protocols in which session keys are generated at the physical layer using standard techniques of secret key generation (SKG) from shared randomness. In this framework, we study the optimal power allocation in block-fading additive white Gaussian noise (BF-AWGN) channels, with short-term power constraints, when a subset of the subcarriers are used for SKG and the rest for data transmission. Fixing the amount of data that can be transmitted with a single key, allows us to first identify the optimal subset of subcarriers that should be devoted to SKG and the respective power allocation policy which, depending on the available overall power, might not be unique. Subsequently, a further step is taken in our analysis to account for the impact of the proposed power allocation with long-term power-constraints.

Efficient mobility management techniques are critical in providing seamless connectivity and session continuity between a mobile node and the network during its movement. However, current mobility management solutions generally require a central entity in the network core, tracking IP address movement, and anchoring traffic from source to destination through point-to-point tunnels. Intuitively, this approach suffers from scalability limitations as it creates bottlenecks in the network, due to sub-optimal routing via the anchor point. This is often termed “dog-leg” routing. Meanwhile, alternative anchorless, solutions are not feasible due to the current limitations of the IP semantics, which strongly tie addressing information to location. In contrast, this paper introduces a novel anchorless mobility solution that overcomes these limitations by exploiting a new path-based forwarding fabric together with emerging mechanisms from information-centric networking. These mechanisms decouple the end-system IP address from the path based data forwarding to eliminate the need for anchoring traffic through the network core; thereby, allowing flexible path calculation and service provisioning. Furthermore, by eliminating the limitation of routing via the anchor point, our approach reduces the network cost compared to anchored solutions through bandwidth saving while maintaining comparable handover delay. The proposed solution is applicable to both cellular and large-scale wireless LAN networks that aim to support seamless handover in a single operator domain scenario. The solution is modeled as a Markov-chain which applies a topological basis to describe mobility. The validity of the proposed Markovian model was verified through simulation of both random walk mobility on random geometric networks and trace information from a large-scale, city wide data set. Evaluation results illustrate a significant reduction in the total network traffic cost by 45 percent or more when using the proposed solution, compared to Proxy Mobile IPv6.

Many important cloud services require replicating massive data from one datacenter (DC) to multiple DCs. While the performance of pair-wise inter-DC data transfers has been much improved, prior solutions are insufficient to optimize bulk-data multicast, as they fail to explore the capability of servers to store-and-forward data, as well as the rich inter-DC overlay paths that exist in geo-distributed DCs. To take advantage of these opportunities, we present BDS, an application-level multicast overlay network for large-scale inter-DC data replication. At the core of BDS is a fully centralized architecture, allowing a central controller to maintain an up-to-date global view of data delivery status of intermediate servers, in order to fully utilize the available overlay paths. To quickly react to network dynamics and workload churns, BDS speeds up the control algorithm by decoupling it into selection of overlay paths and scheduling of data transfers, each can be optimized efficiently. This enables BDS to update overlay routing decisions in near realtime (e.g., every other second) at the scale of multicasting hundreds of TB data over tens of thousands of overlay paths. A pilot deployment in one of the largest online service providers shows that BDS can achieve 3-5 x speedup over the provider's existing system and several well-known overlay routing baselines.

The Internet lacks verification of source authenticity and path compliance between the planned packet delivery paths and the real delivery paths, which allows attackers to construct attacks like source spoofing and traffic hijacking attacks. Thus, it is essential to enable source and path verification in networks to detect forwarding anomalies and ensure correct packet delivery. However, most of the existing security mechanisms can only capture anomalies but are unable to locate the detected anomalies. Besides, they incur significant computation and communication overhead, which exacerbates the packet delivery performance. In this paper, we propose a high-efficient packet forwarding verification mechanism called PPV for networks, which verifies packet source and their forwarding paths in real time. PPV enables probabilistic packet marking in routers instead of verifying all packets. Thus, it can efficiently identify forwarding anomalies by verifying markings. Moreover, it localizes packet forwarding anomalies, e.g., malicious routers, by reconstructing packet forwarding paths based on the packet markings. We implement PPV prototype in Click routers and commodity servers, and conducts real experiments in a real testbed built upon the prototype. The experimental results demonstrate the efficiency and performance of PPV. In particular, PPV significantly improves the throughput and the goodput of forwarding verification, and achieves around 2 times and 3 times improvement compared with the-state-of-art OPT scheme, respectively.

Seamless connectivity plays a key role in realizing QoS-based delivery in mobile networks. However, current handover mechanisms hinder the ability to meet this target, due to the high ratio of handover failures, packet loss and service interruption. These challenges are further magnified in Heterogeneous Cellular Networks (HCN) such as Advanced Long Term Evolution (LTE-Advanced) and LTE in unlicensed spectrum (LTE-LAA), due to the variation in handover requirements. Although mechanisms, such as Fast Handover for Proxy Mobile IPv6 (PFMIPv6), attempt to tackle these issues; they come at a high cost with sub-optimal outcomes. This primarily stems from various limitations of existing IP core networks. In this paper we propose a novel handover solution for mobile networks, exploiting the advantages of a revolutionary IP over Information-Centric Networking (IP-over-ICN) architecture in supporting flexible service provisioning through anycast and multicast, combined with the advantages of random linear coding techniques in eliminating the need for retransmissions. Our solution allows coded traffic to be disseminated in a multicast fashion during handover phase from source directly to the destination(s), without the need for an intermediate anchor as in exiting solutions; thereby, overcoming packet loss and handover failures, while reducing overall delivery cost. We evaluate our approach with an analytical and simulation model showing significant cost reduction compared to PFMIPv6.

Information-centric networking (ICN) facilitates content identification in networks and offers parametric representation of content semantics. This paper proposes an ICN/WDM network architecture that uses these features to offer superior network utilization, in terms of performance and power consumption. The architecture introduces an ICN publish/subscribe communication approach to the wavelength layer, whereby content is aggregated according to its popularity rank into wavelength-size groups that can be published and subscribed to by multiple nodes. Consequently, routing and wavelength assignment (RWA) algorithms benefit from anycast to identify multiple sources of aggregate content and allow optimization of the source selection of light paths. A power-aware algorithm, maximum degree of connectivity, has been developed with the objective of exploiting this flexibility to address the tradeoff between power consumption and network performance. The algorithm is also applicable to IP architectures, albeit with less flexibility. Evaluation results indicate the superiority of the proposed ICN architecture, even when utilizing conventional routing methods, compared with its IP counterpart. The results further highlight the performance improvement achieved by the proposed algorithm, compared with the conventional RWA methods, such as shortest-path first fit.

Multicast data delivery can significantly reduce traffic in operators' networks, but has been limited in deployment due to concerns such as the scalability of state management. This paper shows how multicast can be implemented in contemporary software defined networking (SDN) switches, with less state than existing unicast switching strategies, by utilising a Bloom Filter (BF) based switching technique. Furthermore, the proposed mechanism uses only proactive rule insertion, and thus, is not limited by congestion or delay incurred by reactive controller-aided rule insertion. We compare our solution against common switching mechanisms such as layer-2 switching and MPLS in realistic network topologies by modelling the TCAM state sizes in SDN switches. The results demonstrate that our approach has significantly smaller state size compared to existing mechanisms and thus is a multicast switching solution for next generation networks.

Line Speed Publish/Subscribe Inter-networking (LIPSIN) is one of the proposed forwarding mechanisms in Information Centric Networking (ICN). It is a stateless source-routing approach based on Bloom filters. However, it has been shown that LIPSIN is vulnerable to brute-force attacks which may lead to distributed denial-of-service (DDoS) attacks and unsolicited messages. In this work, we propose a new forwarding approach that maintains the advantages of Bloom filter based forwarding while allowing forwarding nodes to statelessly verify if packets have been previously authorized, thus preventing attacks on the forwarding mechanism. Analysis of the probability of attack, derived analytically, demonstrates that the technique is highly-resistant to brute-force attacks.

QoS provisioning is one of the key challenges facing current as well as future Internet architectures. Its dependency on content recognition does not allow a straightforward support of QoS in the IP, host-centric, model. In contrast, Information-Centric Networking (ICN) offers native content identification in the network, which can be exploited to develop a common, elegant, framework for supporting QoS-based delivery. Therefore, ICN may naturally overcome many of the cumbersome fixes and limitations of today's solutions. In this work, we exploit the flexibility in semantic representation offered by ICN to present a flexible and scalable ICN-based QoS model. Our model defines QoS requirements as information items that can be linked to the content at various aggregation levels, independent of the communication approach. Therefore, it can be applied uniformly to various network types and hierarchies. Furthermore, our model offers enhanced traffic treatment as well as resource utilization while significantly reducing the overhead on the network.

Security attack path analysis has become attractive as a security risk assessment technique that represents vulnerabilities in a network. This paper presents a genetic algorithm approach to find the most likely attack paths in attack graphs. We provide an effective approach to network administrators by showing the paths and steps that attackers will most probably exploit to achieve a specific target. The use of a genetic algorithm is particularly appropriate as it offers a straight-forward approach and, most importantly, a range of solutions. This latter point differs from other approaches which concentrate on a singly most likely path and may ignore other important attack vectors. The paper shows how a genetic algorithm can be developed such that feasible individuals are maintained at each stage by selecting certain attack graph vertices to be the crossover and mutation sites.

Denial of service (DoS) is a significant security threat in open networks such as the Internet. IP traceback is one important tool proposed as part of DoS mitigation. Many techniques have been proposed to traceback the attacker locally, within a single domain. Fewer techniques have been proposed to traceback the origin of attack through a number of autonomous systems (AS). Here a technique that selectively performs traceback utilizing the IP record route feature is proposed. This selective record route traceback involves a limited number of routers on the whole path, namely the first autonomous system border router and the initial ingress router. The technique also includes an additional procedure that detects malicious marking from compromised routers and the point of origination.

Information-centric networking (ICN) proposes a networking architecture that uses methodologies such as publish-subscribe to achieve a data-oriented approach as opposed to a destination based approach found in the current Internet. This new architecture brings both new problems to be solved and also natural solutions to existing problems. This paper investigates an intra-domain traffic engineering (TE) problem for an information-centric networking (ICN) architecture where a form of source routing is used as the forwarding mechanism. The TE goal is to maximise the residual capacity in the network so that the load is spread evenly. A network flow approach is used and it is shown that the source routing mechanism allows the traffic to be split across multiple paths in a manner that is difficult to achieve using existing IP or IP/MPLS networks. Allowing splittable flows means that a fully polynomial-time approximation scheme can be used that has superior results when compared to existing constraint based routing schemes for flows that cannot be split. Consequently, this work demonstrates that the ICN architecture can simplify the given TE problem in a natural manner.

Future Internet and more specifically Information-Centric Networks (ICNs), based on the Publish-Subscribe paradigm, is an area that has attracted a big interest lately. Especially topology management issues and network path calculations, whether inter or intra domain, are a major issue. In this paper, a simulation environment developed in OMNET++ is presented, that can be used to provide insight on how Future Internet architectures will cope with congestion and high demand. This environment follows the publish-subscribe approach introduced by PSIRP, but is mainly focused on the topology manager design and intends to enable the development of new improved network path calculation techniques.

The distribution of copyrighted scalable video content to differing digital devices should be protected during rendering and transmission. The proposed scheme is applied to H.264 Scalable Video Coding (SVC) CABAC bin-strings in a compression-friendly and decoder format compliant manner. It achieves this by careful selection of the entropy coder syntax elements for selective encryption (SE) with respect to SVC. Tests show that: decoding delay is small, replacement and key substitution attacks are fruitless; there is no increase in bitrate; and the stream remains format compliant. The proposed SE scheme is extremely suitable for video distribution to users who have subscribed to differing video qualities on medium- to high-computationally capable digital devices.

Multi-layered scalable bit-stream distribution requires protection for the rendering and transmission of its individual layers. This paper presents a sufficient encryption (SE) scheme for SVC layers which maintains the compression efficiency and the format compliancy of scalable bit-streams, without compromising the security. The purpose of SE is achieved by applying the partial encryption on carefully selected codewords and bin-strings of the CAVLC and CABAC of H.264/SVC respectively. The performance of the scheme is tested on various resolution sequences, which demonstrate the advantages of the scheme when compared to alternative techniques. These advantages include: minimal computational delay by encrypting partial data; no bit-rate escalation by keeping the compression ratio unchanged; and, format compliancy of the bit-stream at the decoder. A comparative security analysis of the scheme confirms that it is suitable for commercial, real-time applications. The minimal increase in processing requirements ensures that the scheme is highly suitable for video distribution to users who have subscribed to differing video qualities on end systems ranging from small handheld devices to those with high computational capability.

This paper describes a novel media distribution model for headphone based spatialized audio conferences. In contrast to existing models, our approach permits high quality spatialized audio conferencing across low power terminals, without the requirement for centralized spatial processing functionality. The model is flexible in terms of the spatial processing techniques, though we focus upon one particular implementation which employs accurate binaural room impulse response (BRIR) filtering. Our model operates by performing a single binaural filter operation upon each user's audio at source, before encoding and transmitting the binaural signal to a centralized mixing location. Since only centralized mixing is required, this model can easily be implemented within the IP multimedia subsystem (IMS) using existing IMS components. A discussion on codec selection for this model is also offered. Finally, the impact upon network load for our proposed approach is analysed, using a traffic model based upon a hypothetical core network partition.

Standardized in 2001, ITU-T Rec. P.862 (PESQ) is the current "in-force" ITU-T standard for intrusive listening speech quality assessment and is widely used in the speech communication industry. It has proved to be reliable in the assessment of the quality of signals transmitted through traditional communication networks (landline, mobile and first generation of voice over IP systems). However, with the development of internet telephony, like Skype or MSN, advanced techniques for packet concealment and jitter buffer adaptation maybe used, introducing continuously varying delay and making PESQ unreliable. This paper finds that the alignment resolution required by the next generation PESQ-like algorithms to accurately predict subjective tests that evaluate systems that incorporate time-warping would be plusmn 5 ms.

New technologies such as the IP multimedia subsystem (IMS) provide components to support enhanced audio conferencing services, requiring media distribution models designed for traditional monophonic VoIP audio conferences to be revised and extended. We propose a new media distribution model, for headphone based spatialized audio conferences where spatial cues are provided by head related transfer function (HRTF) filtering. Under our proposal, the HRTF filtering and mixing processes may be partially distributed across conferees terminals and a dedicated audio processing server. This results in a high level of spatial manipulation per terminal, whilst server processing load is minimized. We also provide analysis of two network load reduction techniques for our model; application layer routing (ALR) and optimized mix selection (OMS), demonstrating significant load reduction when using ALR for conferences ranging in both size, and terminal processing capabilities.

Generalised multiprotocol label switching (GMPLS) has been proposed as a control plane for optical packet switching (OPS). However, the label stack construct of GMPLS is problematic for envisage OPS architectures as it requires an arbitrary length header structure and (relatively) complex header manipulation. This paper proposes a new label stack encoding that allows arbitrary depth aggregation but that maintains a constant header length and removes the need for complex header processing. Most notably, given a requirement of an L length label space for uniqueness of label switching it achieves arbitrary depth aggregation through a 2L length header label.