Entity

Time filter

Source Type

Richardson, TX, United States

Zhang Q.,Fujitsu Limited | Xie W.,University of Texas at Dallas | She Q.,Fujitsu Network Communications | Wang X.,Fujitsu Limited | And 2 more authors.
National Fiber Optic Engineers Conference, NFOEC 2013 | Year: 2013

We jointly consider problems of virtual network mapping and routing and wavelength assignment in WDM networks. Flexible virtual node mapping enabled by network virtualization achieves significant optical network resource savings compared to fixed node mapping. © 2013 OSA. Source


Yabas U.,Huawei | Cankaya H.C.,Fujitsu Network Communications
2013 IEEE Globecom Workshops, GC Wkshps 2013 | Year: 2013

Subscriber churn is a concern of customer care management for most of the mobile and wireless service providers and operators due to its associated costs. This paper explains our work on subscriber churn analysis and prediction for such services. We work on data mining techniques to accurately and efficiently predict subscribers who will change-and-turn (churn) to another provider for the same or similar service. The dataset we use is a public and real dataset compiled by Orange Telecom for the KDD 2009 Competition. Number of teams achieved high scores on this dataset requiring a significant amount of computing resources. We are aiming to find alternative methods that can match or improve the recorded high scores with more efficient and practical use of resources. In this study, we focus on ensemble of meta-classifiers which have been studied individually and chosen according to their performances. © 2013 IEEE. Source


Gao C.,University of Texas at Dallas | Cankaya H.C.,Fujitsu Network Communications | Jue J.P.,University of Texas at Dallas
Journal of Optical Communications and Networking | Year: 2014

In a network in which multiple domains are defined due to geographical and/or administrative reasons, only a limited amount of domain information is exchanged by domain service providers. Topology aggregation is a method used to facilitate this limited information exchange. The amount of information provided for each domain may vary based on the technical and management decisions taken by the service provider. For instance, some domains may choose to provide only a single shortest path between two border nodes, while another may be able to provide a pair of disjoint paths with minimum total cost. In such cases, end-to-end protected path routing needs to facilitate and use different amounts of domain information provided by domain service providers in order to find the best solution. In this work, we propose several approaches that help find a pair of disjoint end-to-end paths that may traverse multiple domains from source to destination and result in minimum total cost. These approaches include methods for inter-domain information exchange that carry costs of disjoint paths within a domain. The performance of minimizing the total cost of a pair of end-to-end paths is investigated. Finally, the blocking probabilities of these various approaches due to the existence of trap topologies in the network are also discussed. © 2014 Optical Society of America. Source


Feuer M.D.,AT&T | Woodward S.L.,AT&T | Palacharla P.,Fujitsu Limited | Wang X.,Fujitsu Limited | And 2 more authors.
Journal of Lightwave Technology | Year: 2011

Dynamic photonic networks rely on colorless, non-directional Reconfigurable Optical Add/Drop Multiplexer (ROADM) nodes to enable rapid re-routing of wavelength channels without optoelectronic conversion. We report numerical simulations of the wavelength contention that can occur in such multi-degree ROADM nodes. Intra-node blocking rates and transponder utilization are computed for node designs with and without a client-side fiber cross-connect, and both are compared to results predicted for an ideally contention-free ROADM. © 2006 IEEE. Source


Cankaya E.C.,University of Texas at Dallas | Nair S.,Southern Methodist University | Cankaya H.C.,Fujitsu Network Communications
Computer Standards and Interfaces | Year: 2013

We apply Linear Error Correction (LEC) code to a novel encoding scheme to assure two fundamental requirements for transmission channels and storage units: security and dependability. Our design has the capacity to adapt itself to different applications and their various characteristics such as availability, error rate, and vulnerabilities. Based on simple logic operations, our scheme affords fast encryption, scalability (dual or more column erasures), and flexibility (LEC encoder employed as a front end to any conventional compression scheme). Performance results are very promising: Experiments on dual erasures outperform conventional compression algorithms including Arithmetic Coding, Huffman, and LZ77. © 2012 Elsevier B.V. All rights reserved. Source

Discover hidden collaborations