Most recent work used raw electroencephalograph (EEG) data to train deep learning (DL) models, with the assumption that DL models can learn discriminative features by itself. It is not yet clear what kind of RSVP specific features can be selected and combined with EEG raw data to improve the RSVP classification performance of DL models. In this paper, we tried to extract RSVP specific features and combined them with EEG raw data to capture more spatial and temporal correlations of target or non-target event and improve the EEG-based RSVP target detection performance. We tested on X2 Expertise RSVP dataset to show the experiment results. We conducted detailed performance evaluations among different features and feature combinations with traditional classification models and different CNN models for within-subject and cross-subject test. Compared with state-of-the-art traditional Bagging Tree (BT) and Bayesian Linear Discriminant Analysis (BLDA) classifiers, our proposed combined features with CNN models achieved 1.1% better performance in within-subject test and 2% better performance in cross-subject test. This shed light on the ability for the combined features to be an efficient tool in RSVP target detection with deep learning models and thus improved the performance of RSVP target detection.

We report the first successful experiment on Point-to-Multipoint (P2MP) VLAN path establishment on the overlay-model-based GMPLS-controlled wide area Ethernet. To support the overlay model, P2MP VLAN path signaling with egress output port indication is proposed and implemented. It is confirmed that our extended RSVP-TE software can correctly establish P2MP VLAN paths in the overlay-model network.

Connection setup on various computer networks is now achieved by GMPLS. This technology is based on the source-routing approach, which requires the source node to store metric information of the entire network prior to computing a route. Thus all metric information must be distributed to all network nodes and kept up-to-date. However, as metric information become more diverse and generalized, it is hard to update all information due to the huge update overhead. Emerging network services and applications require the network to support diverse metrics for achieving various communication qualities. Increasing the number of metrics supported by the network causes excessive processing of metric update messages. To reduce the number of metric update messages, another scheme is required. This paper proposes a connection setup scheme that uses flooding-based signaling rather than the distribution of metric information. The proposed scheme requires only flooding of signaling messages with requested metric information, no routing protocol is required. Evaluations confirm that the proposed scheme achieves connection establishment without excessive overhead. Our analysis shows that the proposed scheme greatly reduces the number of control messages compared to the conventional scheme, while their blocking probabilities are comparable.

A multi-domain GMPLS layer-2 switch capable network with VLAN tag swapping is demonstrated for the first time. In this demonstration, we verify three new features, establishing path with designating VLAN IDs, swapping VLAN ID on prototype switch, and management of VLAN IDs per domain. Using those three features, carrier-class Ethernet backbone networks which supports path route designation in multi-domain network can be established.

To guarantee strict Quality of Service (QoS) for real-time applications, we have previously proposed an output buffer control mechanism in IP routers, confirmed its effectiveness through simulations, and implemented a prototype. This mechanism can guarantee strict QoS within a single router. In this paper, we propose a control scheme of cooperation between IP routers equipped with this mechanism by using one of the signaling protocols. Our proposed scheme aims to stabilize End-to-End (E2E) flow delay within the target delay. In addition, our mechanism dynamically updates reserved resources between IP routers to improve E2E packet loss rate. We present an implemented design of our scheme and an empirical evaluation of the implementation. These results show quantitatively how our scheme improves the quality of video pictures.

This paper describes IP encapsulation technologies for the Mobile RSVP tunnel in next generation networks. Bandwidth is inherently a scarce network resource, and hence signaling overhead should be minimized as much as possible. However, because of duplicate RSVP messages, the existing RSVP tunnel-based mechanism suffers from bandwidth overhead and tunnel problems. The waste of network resources prevents low-cost network construction and the maximization of integrated network utility, which are the goals of next generation networks, and can lower the reliability of networks with the increase of service subscribers and resultant expansion of resource consumption. To solve these problems and to support end-to-end QoS efficiently, RSVP needs to be changed at a minimum degree. In this paper, a new IP encapsulation mechanism for saving of network resources in the Mobile RSVP tunnel (IPEnc-RSVP) is proposed. In order to compare the proposed mechanism and the existing RSVP tunnel-based mechanism in Mobile IP-based networks, we perform a comparative analysis of bandwidth consumption gain, throughput, mean packet delay, etc., and demonstrate the superiority of the proposed mechanism. In addition, we analyze several performance factors of RSVP protocols by applying the existing RSVP tunnel-based mechanism and the proposed mechanism, respectively.

Recently, integration of multiple network domains, such as optical fiber domains and packet domains, has been required by network providers and users. To achieve this interdomain integration, generalized multiprotocol label switching (GMPLS) is now receiving more attention. One of the main features of a GMPLS network is its multilayered complexity, which sometimes places a large burden on source GMPLS routers to determine optimal routes to destinations in other domains and causes label switching path (LSP)-setup delays. To reduce this source-router burden, we propose hierarchically distributed path computation equipment (HDPCE) that cooperates with each other to determine interdomain routes, reduce setup delay, and conduct flexible interdomain route creation taking individual GMPLS domain routing policies into consideration. Each domain routing policy can be set independently from that of other domains, and this routing information is not revealed to other peer domains because each HDPCE is allocated to every domain, including an interdomain, which has several underlying domains under it. Each underlying domain's HDPCE flexibly chooses three types of routing policies depending on the domain's requirement, and the interdomain HDPCE conducts interdomain route creation in accordance with underlying domain policies. OSPF routing protocol is now being applied to interdomain routing on GMPLS networks. Therefore, we compare the proposed HDPCE-based interdomain route creation with OSPF-based route creation in terms of performance and applicability, and we evaluate the effects of each underlying domain policy on interdomain route creation.

Multilayered network interaction among various networks such as IP/MPLS packet networks and optical fiber networks are now achieved using generalized multiprotocol label switching (GMPLS) technology. One unique feature of GMPLS networks is that GMPLS packet-layer label switching paths (LSPs), such as IP/MPLS LSPs, sometimes tunnel through GMPLS lower layer LSPs such as optical fiber/lambda LSPs. One problem that occurs in this situation is protecting an important primary packet LSP by using a protection LSP that is physically separated from the primary LSP. The packet router has difficulty recognizing lower layer LSPs that are totally disjointed from the primary LSP. This is because, in a GMPLS's packet layer, a source router only differentiates one lower layer LSP from another, and does not check the disjointedness of segments through which the lower layer path passes. Sometimes, different lower LSPs pass through the same optical fiber, and a malfunction of one optical fiber sometimes causes many lower layer LSPs to malfunction at the same time. To solve this problem, a shared risk link group (SRLG) is introduced. Network links that belong to the same SRLG share a common physical resource. We apply this SRLG to the proposed hierarchically distributed path computation elements (HDPCEs) and achieve effective disjointed SRLG protection for important primary GMPLS packet paths.

Contents delivery services are deployed over the Internet and its technology. Contents delivery services demand high quality. Consequently, a large network capacity is required. In order to efficiently deliver such contents and to meet high quality demands, network operators are required to explicitly indicate the branch node and/or the link so that packets are efficiently sent. Fast restoration at the time of trouble has become an important issue. MPLS technology has been utilized to realize Traffic Engineering and Fast Reroute to cope with this issue. However, only a point-to-point path is allowed in the current MPLS technology. To allow an efficient high-quality contents delivery, a point-to-multipoint path called as P2MP-LSP is under discussion. However, proposed methods lack of getting information about P2MP-LSP node due to the current MPLS signaling method to establish P2MP-LSP. This paper introduces a discovery technique of the P2MP-LSP node and an establishment technique of the P2MP-LSP using BGP. In addition, a basic function of this proposal is experimented, and its practicality is evaluated.

The concept of an optical path layer has become increasingly attractive with the growth of traffic in the backbone network. The recent advances in optical switching technology support the deployment of optical cross-connect (OXC) nodes and the construction of large-scale optical path networks. This paper proposes a highly-reliable and fast pre-assigned restoration scheme for optical path networks. To achieve the pre-assigned restoration scheme, this paper investigates the extension of the Generalized Multi-Protocol Label Switching (GMPLS) protocol functionality considering the interoperability with GMPLS capable IP routers in the future. This paper also proposes a new network control architecture called the "partition model" through discussion of network architecture. We clarify that the M:N end-to-end restoration scheme achieves efficient resource usage and management of the network especially in the "partitioned model" network. With the finite design of the GMPLS protocol extension based on the M:N end-to-end restoration scheme, we successfully achieve an intelligent protocol that guarantees 100% recovery against single link failure and is capable of protection grade fast restoration of the optical path less than 50 msec. To our knowledge, this is the first demonstration of GMPLS-controlled protection grade fast optical path restoration.

The demand for intra- and interdomain routing for multilayered networks such as those using generalized multiprotocol label switching (GMPLS) is strong. One of the features that is peculiar to GMPLS networks is that because several different domains, such as those of IP, ATM, and optical fiber, are combined with each other hierarchically, various routing policies, which are sometimes independent from underlying domains and sometimes taking the underlying domains' policies into consideration, are required. For example GMPLS's lower layer LSPs like lambda LSP are expected to be established independently before the upper-layer LSPs, like IP and MPLS LSPs, are established in the underlying domains. Another requirement for the GMPLS interdomain routing is lightening the burden for selecting the interdomain route, because there are a lot of demands to interconnect many GMPLS domains. In order to satisfy these demands, we propose a path computation server (PCS) that is special for the intra/interdomain routing of GMPLS networks. As a counterpart of the proposed interdomain routing, it is now becoming popular to apply OSPF to the GMPLS interdomain routing. Therefore, we compared the proposed interdomain routing with OSPF, and show the applicability of the routing to GMPLS networks.

To overcome the mobility impact on RSVP, many schemes have been proposed based on Mobile IP regional registration and passive reservation in advance. Although the regional registration and in advance reservation reduce the QoS interruption time, the latter may demand intolerable bandwidth. This letter introduces a novel approach to reduce the QoS interruption time by maximizing the localization of QoS re-establishment in the regional registration environment. The proposed scheme identifies the exact path segment affected by mobility. The QoS interruption time of the proposed scheme is comparable to its low bound without in advance reservation.

This letter proposes a hierarchical label-switched path (LSP) setup scheme, called ConSet, for multi-layer generalized multi-protocol label switching (GMPLS) networks. ConSet allows a Path message to be transmitted to the downstream neighbor node without waiting for the establishment of the higher-order LSP. Confirmation of the establishment of the higher-order LSP is performed at the ingress node of the higher-order LSP before a Resv message of the lower-order LSP is transmitted to the upstream neighbor node. ConSet is able to set up hierarchical LSPs faster than the sequential scheme.

Proposed CCRSVP (CandidateCasting RSVP) algorithm is a new fast handoff method for IEEE 802.11 Wireless LAN (WLAN) environments. It shows good performance in the handoff latency and the bandwidth efficiency aspect and guarantees QoS because it uses an advanced multicasting method and RSVP. CCRSVP uses L2 information (BSSID) of WLAN and starts reserving resources and multicasting packets before L2 handoff completes. Therefore, the proposed algorithm can reduce L3 handoff latency more than other methods. To show performance of CCRSVP algorithm, we calculate handoff latency and packet loss ratio of each algorithm. Also we model handoff process which uses RSVP mechanism to confirm resource efficiency. Proposed handoff model uses parameters which can distinguish each handoff algorithm. We introduce Markov chain which can analyze handoff model and analysis method which uses iteration method. In this article, the results show that the proposed algorithm shows superior bandwidth efficiency than existing L3 handoff algorithms using RSVP. To analyze bandwidth efficiency of each algorithm, we compare the blocking probability which occurs in case of absence of resource, resource usage which shows reservation quantity, the average number of ongoing session which really uses resource reserved and resource utilization. We can confirm that CCRSVP algorithm has better performance than other algorithms at each comparative item.

The cost-effective provision of IP services requires multi-layered traffic engineering to obtain dynamic cooperation between IP and photonic layers. The effective control and management of generalized multi-protocol label-switching (GMPLS) networks is an essential part of this. Huge photonic capacities and the number of IP and photonic networks make it likely that enormous amounts of GMPLS network-related data will have to be managed in the near future. At the same time, routing burdens on individual GMPLS routers are critical because of the strong need for per-path quality of service (QoS). To solve these problems, we propose a hierarchically distributed network-management system (NMS) in which we flexibly allocate a GMPLS subnetwork to each sub-NMS and at the same time conduct QoS routing. The distributed nature of our architecture reduces the burden on the NMS as a whole and also lets us remove the routing-burden from GMPLS routers with minimum effect on management processes.

Generalized Multi-Protocol Label Switching (GMPLS) is being developed in the Internet Engineering Task Force (IETF). In GMPLS-based wavelength-division-multiplexing (WDM) optical networks, a wavelength in a fiber is used as a label. In the existing GMPLS signaling protocol for bidirectional paths in WDM networks with the wavelength continuity constraint, bidirectional path setup fails with high probability because the upstream label allocated by the previous hop node may not be accepted at the transit node. To solve this problem, this paper proposes an efficient bidirectional label switched path (LSP) setup scheme based on an upstream label set. Called the Upstream Label Set (ULS) scheme, it is an extension of the existing GMPLS signaling protocol. The ULS scheme is consistent with the existing GMPLS signaling procedure and so offers backward compatibility. The numerical results suggest that when the number of the LSP setup retries is limited, the ULS scheme offers lower blocking probability than the existing GMPLS signaling scheme which uses only with the upstream label (UL). In addition, under the condition that the constraint of the number of LSP setup retries is relaxed, the LSP setup time of the ULS scheme is faster than that of the existing scheme. Furthermore, by using our developed prototype of the GMPLS control system, in which the ULS scheme was installed, we demonstrated that the ULS scheme successfully setup bidirectional LSPs.

We evaluate resolution models for resource allocation in a GMPLS distributed control plane for heterogeneous all-optical networks. In a practical regional-to-backbone network environment, the local resolution model is advantageous in resource utilization, protocol compatibility and scalability. We demonstrate a lookup procedure, which inter-works with OSPF-TE and RSVP-TE protocols and allocates resources in the local resolution model.

This letter addresses the QoS issue of a RSVP flow during handoff events. For the QoS guarantee of real-time applications with RSVP reservation in All-IP wireless networks, mechanisms are required to minimize the resource reservation path changes and the packet loss resulting from handoff events. If the new RSVP reservation is made along the path via a new base station (BS) in advance for soft handoff, on-going RSVP flow session can be kept with the guaranteed QoS. Therefore, we propose a seamless switching scheme of RSVP branch path for soft handoff. We also show that this scheme could provide the QoS guarantee by adaptively adjusting the pilot signal threshold values for soft handoff.

This letter addresses the issue of RSVP path management in IP micro-mobility networks. We describe efficient RSVP QoS paths with a minimal impact to the existing protocol and underlying routing infrastructure. The goal of this letter is to reduce RSVP path reservation restoration latency and unnecessary control traffic caused by mobility events. We thus propose a RSVP branch-path rerouting scheme at a crossover router (CR) under IP micro-mobility networks. We show that this scheme could give a good tradeoff between the resource reservation cost and the link usage during the lifetime of a RSVP connection.

Existing research related to RSVP with mobility support has mainly focused on maintaining reservation state along the routing path, which changes continuously with the movements of mobile host (MH), without much overhead and delay. However, problems such as deepening RSVP's inherent scalability problem and requiring significant changes in the existing network infrastructure have not been adequately addressed. In this paper, we propose a new approach, known as Concatenation and Optimization for Reservation Path (CORP), which addresses these issues. In CORP, each BS pre-establishes pseudo reservations to its neighboring BSs in anticipation of the MH's movement. When the MH moves into another wireless cell, the associated pseudo reservation is activated and concatenated to the existing RSVP session to guarantee continuous QoS support. Because a pseudo reservation is recognized as a normal RSVP session by intermediate routers, little change is required in the current Internet environment to support both movements within a single routing domain and between two different routing domains. CORP also dynamically optimizes the extended reservation path to avoid the infinite path extension problem. Multicast addressing is used to further reduce resource consumption in the optimization process. The experimental results of the CORP implementation demonstrate that it significantly reduces the delay and overhead caused by handoffs compared to the case of establishing a new RSVP session. The improvement increases as the distance between the MH and its correspondent host (CH) grows.