The search functionality is under construction.

Keyword Search Result

[Keyword] MPLS(82hit)

1-20hit(82hit)

  • Performance Evaluation of Virtualized LTE-EPC Data Plane with MPLS Core Using PPBP Machine-to-Machine Traffic

    Hussien M. HUSSIEN  Hussein A. ELSAYED  

     
    PAPER

      Vol:
    E99-B No:2
      Page(s):
    326-336

    3GPP Long Term Evolution (LTE) is one of the most advanced technologies in the wireless and mobility field because it provides high speed data and sophisticated applications. LTE was originally deployed by service providers on various platforms using separate dedicated hardware in Access radio layer and the Evolved Packet Core network layer (EPC), thereby limiting the system's flexibility and capacity provisioning. Thus, the concept of virtualization was introduced in the EPC hardware to solve the dedicated hardware platform limitations. It was also introduced in the IP Multimedia Subsystem (IMS) and Machine to Machine applications (M2M) for the same reason. This paper provides a simulation model of a virtualized EPC and virtualized M2M transport application server connected via an external IP network, which has significant importance in the future of mobile networks. This model studies the virtualized server connectivity problem, where two separate virtual machines communicate via the existing external legacy IP network. The simulation results show moderate performance, indicating that the selection of IP technology is much more critical than before. The paper also models MPLS technology as a replacement for the external IP routing mechanism to provide traffic engineering and achieve more efficient network performance. Furthermore, to provide a real network environment, Poisson Pareto Burst Process (PPBP) traffic source is carried over the UDP transport layer which matches the statistical properties of real-life M2M traffic. Furthermore, the paper proves End-to-End interoperability of LTE and MPLS running GTP and MPLS Label Forwarding information Base (LFIB) and MPLS traffic engineering respectively. Finally, it looks at the simulation of several scenarios using Network Simulator 3 (NS-3) to evaluate the performance improvement over the traditional LTE IP architecture under M2M traffic load.

  • New Directions for a Japanese Academic Backbone Network Open Access

    Shigeo URUSHIDANI  Shunji ABE  Kenjiro YAMANAKA  Kento AIDA  Shigetoshi YOKOYAMA  Hiroshi YAMADA  Motonori NAKAMURA  Kensuke FUKUDA  Michihiro KOIBUCHI  Shigeki YAMADA  

     
    INVITED PAPER

      Pubricized:
    2014/12/11
      Vol:
    E98-D No:3
      Page(s):
    546-556

    This paper describes an architectural design and related services of a new Japanese academic backbone network, called SINET5, which will be launched in April 2016. The network will cover all 47 prefectures with 100-Gigabit Ethernet technology and connect each pair of prefectures with a minimized latency. This will enable users to leverage evolving cloud-computing powers as well as draw on a high-performance platform for data-intensive applications. The transmission layer will form a fully meshed, SDN-friendly, and reliable network. The services will evolve to be more dynamic and cloud-oriented in response to user demands. Cyber-security measures for the backbone network and tools for performance acceleration and visualization are also discussed.

  • Experiment on Point-to-Multipoint VLAN Path Establishment on the Overlay-Model-Based GMPLS-Controlled Wide Area Ethernet

    Kou KIKUTA  Daisuke ISHII  Satoru OKAMOTO  Naoaki YAMANAKA  

     
    LETTER-Network System

      Vol:
    E95-B No:10
      Page(s):
    3302-3306

    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 Signaling Scheme with Flooding-Based Path Searching for Diverse-Metric Network

    Ko KIKUTA  Daisuke ISHII  Satoru OKAMOTO  Eiji OKI  Naoaki YAMANAKA  

     
    PAPER-Network

      Vol:
    E95-B No:8
      Page(s):
    2600-2609

    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.

  • An Experiment of GMPLS-Based Dispersion Compensation Control over In-Field Fibers

    Shoichiro SENO  Eiichi HORIUCHI  Sota YOSHIDA  Takashi SUGIHARA  Kiyoshi ONOHARA  Misato KAMEI  Yoshimasa BABA  Kazuo KUBO  Takashi MIZUOCHI  

     
    PAPER-Fiber-Optic Transmission for Communications

      Vol:
    E95-B No:6
      Page(s):
    1997-2004

    As ROADMs (Reconfigurable Optical Add/Drop Multiplexers) are becoming widely used in metro/core networks, distributed control of wavelength paths by extended GMPLS (Generalized MultiProtocol Label Switching) protocols has attracted much attention. For the automatic establishment of an arbitrary wavelength path satisfying dynamic traffic demands over a ROADM or WXC (Wavelength Cross Connect)-based network, precise determination of chromatic dispersion over the path and optimized assignment of dispersion compensation capabilities at related nodes are essential. This paper reports an experiment over in-field fibers where GMPLS-based control was applied for the automatic discovery of chromatic dispersion, path computation, and wavelength path establishment with dynamic adjustment of variable dispersion compensation. The GMPLS-based control scheme, which the authors called GMPLS-Plus, extended GMPLS's distributed control architecture with attributes for automatic discovery, advertisement, and signaling of chromatic dispersion. In this experiment, wavelength paths with distances of 24 km and 360 km were successfully established and error-free data transmission was verified. The experiment also confirmed path restoration with dynamic compensation adjustment upon fiber failure.

  • Toward Distributed Translucent Wavelength Switched Optical Networks under GMPLS/PCE Architecture

    Xin WANG  Tithra CHAP  Sugang XU  Yoshiaki TANAKA  

     
    PAPER

      Vol:
    E95-B No:3
      Page(s):
    740-751

    Recently, the GMPLS controlled WSON has emerged as a promising optical transport network. In order to guarantee the optical signal transmission feature without deformation, the optoelectronic 3R regenerators still need to be sparsely placed in the network, termed as translucent networks. The growing size and complexity of the translucent network requires a transition of control plane to move from the traditional centralized model to a fully distributed architecture in the future. However, centrally designed routing, wavelength assignment, and 3R regenerator allocation approaches become unfeasible under the distributed paradigm due to the outdated and inconsistent network state information. A common solution is to accelerate the update frequency of network state, but the fundamental problem remains that the inaccurate state information is still inevitable. Furthermore, it adds a significant increase to the control traffic volume which adversely degrades the performance and scalability of the network control system. In order to mitigate the impact of having inaccurate state information on network performance in the distributed systems, a novel RWA approach is proposed in this paper, termed as routing and distributed wavelength assignment with top ranked probing wavelength set computation. In our proposal, the wavelength assignment is performed by signalling process with a set of carefully preselected probing wavelengths. This set is dynamically computed based on the resource utilization each time the network state is refreshed. The PCE module is adopted in WSON control plane to be responsible for the computation of RWA and 3R allocation. The performance of the proposed approach is studied by extensive simulations. The experiment results reveal that by employing the proposed scheme, without loss on the blocking performance the inaccuracy of the wavelength availability information can be well tolerated, and the set-up delay in lightpath provisioning can be kept at a low level.

  • Service-Transport Separated Network Architecture Using MPLS-TP Technologies

    Kenichi SAKAMOTO  Yoshihiro ASHI  Akihiko TAKASE  

     
    LETTER

      Vol:
    E95-B No:3
      Page(s):
    752-754

    We propose a next-generation service-transport separated network architecture that uses packet technology. The transport network is responsible for the high speed and reliable bit transfer, and the service network is responsible for many types of network services. This separation makes it possible for the next-generation network to achieve both rapid bandwidth spreading and the speedy installation of new services. We also propose a next-generation transport network using the multi-protocol label switching transport profile (MPLS-TP) and optical networking technologies.

  • Experimental Assessment of a Resilient PCE/GMPLS Controlled Translucent Wavelength Switched Optical Network

    Lei LIU  Takehiro TSURITANI  Ramon CASELLAS  Ricardo MARTÍNEZ  Raül MUÑOZ  Munefumi TSURUSAWA  Itsuro MORITA  

     
    PAPER

      Vol:
    E94-B No:7
      Page(s):
    1831-1844

    A translucent wavelength switched optical network (WSON) is a cost-efficient infrastructure between opaque networks and transparent optical networks, which aims at seeking a graceful balance between network cost and service provisioning performance. In this paper, we experimentally present a resilient translucent WSON with the control of an enhanced path computation element (PCE) and extended generalized multi-protocol label switching (GMPLS) controllers. An adaptive routing and wavelength assignment scheme with the consideration of accumulated physical impairments, wavelength availabilities and regenerator allocation is experimentally demonstrated and evaluated for dynamic provisioning of lightpaths. By using two different network scenarios, we experimentally verify the feasibility of the proposed solutions in support of translucent WSON, and quantitatively evaluate the path computation latency, network blocking probability and service disruption time during end-to-end lightpath restoration. We also deeply analyze the experimental results and discuss the synchronization between the PCE and the network status. To the best of our knowledge, the most significant progress and contribution of this paper is that, for the first time, all the proposed methodologies in support of PCE/GMPLS controlled translucent WSON, including protocol extensions and related algorithms, are implemented in a network testbed and experimentally evaluated in detail, which allows verifying their feasibility and effectiveness when being potentially deployed into real translucent WSON.

  • Optical Plug and Play Technique for Automatic GMPLS Network Construction Open Access

    Rie HAYASHI  Kaori SHIMIZU  Kohei SHIOMOTO  

     
    PAPER-Network

      Vol:
    E94-B No:7
      Page(s):
    1933-1943

    We propose a mechanism called “optical plug and play” for constructing GMPLS networks automatically. It offers lower operation effort and fast network construction, and avoids misconfiguration. Optical plug and play architecture has its procedure, a link-up search mechanism for OXCs, network and node architectures to realize optical plug and play, and an LMP extension to exchange the information between nodes necessary for identifying adjacent nodes. We implement prototypes of both OXCs and routers that support the optical plug and play proposal. Simulations and experiments confirm its performance and feasibility.

  • Interoperability Experiment of VLAN Tag Swapped Ethernet and Transmitting High Definition Video through the Layer-2 LSP between Japan and Belgium Open Access

    Sho SHIMIZU  Wouter TAVERNIER  Kou KIKUTA  Masahiro NISHIDA  Daisuke ISHII  Satoru OKAMOTO  Didier COLLE  Mario PICKAVET  Piet DEMEESTER  Naoaki YAMANAKA  

     
    LETTER-Network

      Vol:
    E93-B No:3
      Page(s):
    736-740

    The first global interoperability experiment of GMPLS controlled Ethernet with VLAN tag swapping between two different implementations is successfully demonstrated. High definition video streaming is realized through a newly established Layer 2 Label Switched Path (L2-LSP). The results of this experiment can be applied to designing reliable Layer 2 networks.

  • Seamless Mobility Mechanisms for Micro Mobile MPLS

    Tubtim SANGUANWONGTHONG  Poompat SAENGUDOMLERT  Arnon TUBTIANG  

     
    PAPER-Network

      Vol:
    E92-B No:10
      Page(s):
    3143-3155

    Efficient mobility management is one of the most important challenges in mobile networks. Since roaming between wireless cells can cause long handoff latency and high packet loss, it can result in poor quality of services for delay-sensitive applications and for applications requiring reliable transmission. In this paper, we propose a new seamless micro-mobility management framework for Micro Mobile MPLS (called MiM-MPLS) to overcome the packet loss problem while maintaining low handoff latency. In addition, we propose a combination of MiM-MPLS and the existing MFC-Micro Mobile MPLS [3],[4](called MiM-MFC-MPLS) to further enhance the handoff performance. MiM-MPLS and MiM-MFC-MPLS provide efficient handoff mechanisms through the use of pre-established Label Switched Paths (LSPs), the L2 trigger, and local registration. The handoff mechanisms for (L2 and L3) intra handoffs and for an inter handoff in these frameworks are described in detail. The performance is analyzed in terms of the signaling cost of registration updates, handoff latency, packet loss, buffer size requirement, and delay jitter. Compared to existing handoff frameworks, the results show that the proposed MiM-MPLS and MiM-MFC-MPLS can provide no packet loss while maintaining low signaling cost of registration updates, handoff latency, and delay jitter at the cost of some buffer space. In particular, MiM-MFC-MPLS has the best handoff performance (i.e., the lowest signaling cost of registration updates, handoff latency, and delay jitter) among all the frameworks that we considered at the cost of some buffer space.

  • P2MP MPLS-Based Hierarchical Service Management System

    Kenji KUMAKI  Ikuo NAKAGAWA  Kenichi NAGAMI  Tomohiko OGISHI  Shigehiro ANO  

     
    PAPER

      Vol:
    E92-B No:4
      Page(s):
    1094-1103

    This paper proposes a point-to-multipoint (P2MP) Multi-Protocol Label Switching (MPLS) based hierarchical service management system. Traditionally, general management systems deployed in some service providers control MPLS Label Switched Paths (LSPs) (e.g., RSVP-TE and LDP) and services (e.g., L2VPN, L3VPN and IP) separately. In order for dedicated management systems for MPLS LSPs and services to cooperate with each other automatically, a hierarchical service management system has been proposed with the main focus on point-to-point (P2P) TE LSPs in MPLS path management. In the case where P2MP TE LSPs and services are deployed in MPLS networks, the dedicated management systems for P2MP TE LSPs and services must work together automatically. Therefore, this paper proposes a new algorithm that uses a correlation between P2MP TE LSPs and multicast VPN services based on a P2MP MPLS-based hierarchical service management architecture. Also, the capacity and performance of the proposed algorithm are evaluated by simulations, which are actually based on certain real MPLS production networks, and are compared to that of the algorithm for P2P TE LSPs. Results show this system is very scalable within real MPLS production networks. This system, with the automatic correlation, appears to be deployable in real MPLS production networks.

  • Multi-Domain VLAN Path Signaling Method Having Tag Swapping Function for GMPLS Controlled Wide Area Layer-2 Network

    Kou KIKUTA  Masahiro NISHIDA  Daisuke ISHII  Satoru OKAMOTO  Naoaki YAMANAKA  

     
    LETTER-Switching for Communications

      Vol:
    E92-B No:4
      Page(s):
    1353-1356

    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.

  • GMPLS-Based Multiple Failure Recovery Employing Restoration Scheme Escalation in Optical Path Networks

    Yoshiaki SONE  Wataru IMAJUKU  Naohide NAGATSU  Masahiko JINNO  

     
    PAPER

      Vol:
    E92-B No:1
      Page(s):
    46-58

    Bolstering survivable backbone networks against multiple failures is becoming a common concern among telecom companies that need to continue services even when disasters occur. This paper presents a multiple-failure recovery scheme that considers the operation and management of optical paths. The presented scheme employs scheme escalation from pre-planned restoration to full rerouting. First, the survivability of this scheme against multiple failures is evaluated considering operational constraints such as route selection, resource allocation, and the recovery order of failed paths. The evaluation results show that scheme escalation provides a high level of survivability even under operational constraints, and this paper quantitatively clarifies the impact of these various operational constraints. In addition, the fundamental functions of the scheme escalation are implemented in the Generalized Multi-Protocol Label Switching control plane and verified in an optical-cross-connect-based network.

  • Analysis of Two-Phase Path Management Scheme for MPLS Traffic Engineering

    Hitomi TAMURA  Kenji KAWAHARA  Yuji OIE  

     
    PAPER

      Vol:
    E92-B No:1
      Page(s):
    59-67

    Traffic Engineering (TE) is important for improving QoS in forwarding paths by efficient use of network resources. In fact, MPLS allows several detour paths to be (pre-)established for some source-destination pair as well as its primary path of minimum hops. Thus, we focus on a two-phase path management scheme using these two kinds of paths. In the first phase, each primary path is allocated to a flow on a specific source-destination pair if the path is not congested, i.e., if its utilization is less than some predetermined threshold; otherwise, as the second phase, one of the detour paths is allocated randomly if the path is available. Therefore, in this paper, we analytically evaluate this path management scheme by extending the M/M/c/c queueing system, and through some numerical results we investigate the impact of a threshold on the flow-blocking probability. Through some numerical results, we discuss the adequacy of the path management scheme for MPLS-TE.

  • Implementation and Experiments of Path Computation Element Based Backbone Network Architecture

    Tomonori TAKEDA  Eiji OKI  Ichiro INOUE  Kohei SHIOMOTO  Kazuhiro FUJIHARA  Shin-Ichi KATO  

     
    LETTER-Fiber-Optic Transmission for Communications

      Vol:
    E91-B No:8
      Page(s):
    2704-2706

    This paper proposes the Path Computation Element (PCE)-based backbone network architecture and verifies its feasibility through implementation and experiments. PCE communication Protocol (PCEP) is implemented for communication between the PCE and the management system to control and manage Generalized Multi-Protocol Label Switching (GMPLS)-based backbone networks.

  • A New Mechanism for Seamless Mobility Based on MPLS LSP in BcN

    Myoungju YU  Jongmin LEE  Tai-Won UM  Won RYU  Byung Sun LEE  Seong Gon CHOI  

     
    LETTER-Switching for Mobile Communications

      Vol:
    E91-B No:2
      Page(s):
    593-596

    We propose a new mobility management scheme using Label Switched Path (LSP) of Multi Protocol Label Switching (MPLS) for seamless service in Broadband Convergence Network (BcN) in Korea, and verify that the proposed scheme has lower latency time than the existing ones through the separation of control plane from data plane for handover signaling.

  • Proposal for Adaptive Bandwidth Allocation Using One-Way Feedback Control for MPLS Networks

    Teruaki YOKOYAMA  Katsuyoshi IIDA  Hiroyuki KOGA  Suguru YAMAGUCHI  

     
    PAPER-Switching for Communications

      Vol:
    E90-B No:12
      Page(s):
    3530-3540

    In this research, we focused on fair bandwidth allocation on the Internet. The Internet provides communication services based on exchanged packets. The bandwidth available for each customer is often fluctuated. Fair bandwidth allocation is an important issue for ISPs to gain customer satisfaction. Static bandwidth allocation allows an exclusive bandwidth for specific traffic. Although it gives communications a QoS guarantee, it requires muany bandwidth resources as known as over-provisioning. In contrast with static control, dynamic control allocates bandwidth resources dynamically. It therefore utilizes bandwidth use more effectively. However, it needs control overhead in monitoring traffic and estimating the optimum allocation. The Transmission Control Protocol, or TCP is the dominant protocol on the Internet. It is also equipped with a traffic-rate-control mechanism. An adaptive bandwidth-allocation mechanism must control traffic that is under TCP control. Rapid feedback makes it possible to gain an advantage over TCP control. In this paper, we propose an Adaptive Bandwidth Allocation (ABA) mechanism as a feedback system for MPLS. Our proposal allows traffic to be regulated adaptively as its own weight value which can be assigned by administrators. The feedback bandwidth allocation in the previous work needs round-trip control delay in collecting network status along the communication path. We call this "round-trip feedback control." Our proposal, called "one-way feedback control," collects network status in half the time of roundtrip delay. We compare the performance of our one-way feedback-based mechanism and traditional round-trip feedback control under a simulation environment. We demonstrate the advantages of our rapid feedback control has using experimental results.

  • Hierarchically Distributed PCE for End-to-End Bandwidth-Assured VPN Service

    Hiroshi MATSUURA  Kazumasa TAKAMI  

     
    PAPER

      Vol:
    E90-B No:11
      Page(s):
    3042-3051

    In the Next-Generation Network (NGN), accommodating a wide variety of customer networks through virtual private network (VPN) technologies is one of the key issues. In particular, a core network provider has to provide bandwidth-assured and secured data transmission for individual private networks while performing optimal and flexible path selection. We present hierarchically distributed path computation elements (HDPCEs) that enable a virtual private network (VPN) provider to guarantee end-to-end required bandwidth and to maintain the secrecy of the link-state information of each customer from other customers. In previous studies, a VPN provider only considered link states in the provider network and did not consider customer domains connected by the provider network. HDPCEs, which are distributed to customer domains, communicate with an HDPCE for the provider network, and these HDPCEs enable the guarantee of necessary bandwidth for a data transmission from one customer domain to another via a provider network. We propose a new path-selection algorithm in each HDPCE and cooperation scheme to interwork HDPCEs, which are suitable for VPN requirements. In the evaluation, the superiority of HDPCE-based VPN path selection over legacy OSPF-TE-based VPN path selection is demonstrated in two typical VPN models: the dedicated model and shared model.

  • A Hierarchical Service Management System for MPLS Network Services

    Kenji KUMAKI  Ikuo NAKAGAWA  Kenichi NAGAMI  Tomohiko OGISHI  Shigehiro ANO  

     
    PAPER

      Vol:
    E90-B No:10
      Page(s):
    2764-2771

    This paper proposes a hierarchical service management system for MPLS network services. Traditionally, general management systems which have been deployed in some service providers control MPLS LSPs (e.g. RSVP-TE, LDP) and services (e.g. L2VPN, L3VPN and IP) separately. If a fault occurs in an MPLS network, the dedicated management system for MPLS LSPs can detect the fault and recognize the state of MPLS LSPs. However, it cannot detect the extent of the impact due to the fault in each service. Furthermore, its own inability to identify the affected customer means it takes some time to identify the affected customers, cooperating manually with the dedicated management system for services. Therefore, this paper proposes a new automatic correlation between MPLS LSPs and each service. In particular, this paper proposes a new algorithm for a correlation between RSVP-TE LSPs and L3VPN services. Simulations are conducted to evaluate the capacity on a correlation table and the performance searching on a correlation table, and results show this system is very scalable within real MPLS production networks. This system, with the automatic correlation, could be sufficiently deployed in real MPLS production networks.

1-20hit(82hit)