By Topic

World Telecommunications Congress (WTC), 2012

Date 5-6 March 2012

Filter Results

Displaying Results 1 - 25 of 46
  • [Title page]

    Publication Year: 2012 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (52 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2012 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (90 KB)  
    Freely Available from IEEE
  • Welcome message

    Publication Year: 2012 , Page(s): i - ii
    Save to Project icon | Request Permissions | PDF file iconPDF (62 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Keynotes

    Publication Year: 2012 , Page(s): i - iv
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (181 KB)  

    Provides an abstract for each of the keynote presentations and a brief professional biography of each presenter. The complete presentations were not made available for publication as part of the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Patrons and Sponsors

    Publication Year: 2012 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (52 KB)  
    Freely Available from IEEE
  • Committees

    Publication Year: 2012 , Page(s): i - ii
    Save to Project icon | Request Permissions | PDF file iconPDF (60 KB)  
    Freely Available from IEEE
  • A Dynamic Resource Allocation Algorithm as a Green Technology for 4G Advanced Networks

    Publication Year: 2012 , Page(s): 1 - 5
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1172 KB) |  | HTML iconHTML  

    Faced with an exponential growth in data demand, the mobile wireless industry needs to control the energy consumption, to both minimize costs and become greener. The mobile industry can thus make a significant contribution in helping other sectors to reduce their overall carbon footprint. In this paper we propose a novel, dynamic resource allocation algorithm, which can reduce the interference effects in 4G wireless networks. This interference reduction can be utilized for cell edge performance improvement or for reducing the base station transmit power as a Green technology. We discuss both these options with current simulation results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Network Monitoring Tool for CCN

    Publication Year: 2012 , Page(s): 1 - 3
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (773 KB) |  | HTML iconHTML  

    Recent discussions on the revolutionary Future Internet architecture have led to Content-Centric Networking (CCN) that puts emphasis on contents for the efficient information delivery. Since CCNx has been released as an early stage prototype of CCN, many projects are being developed on CCNx. However, a network monitoring function for CCN nodes or faces has not been implemented. In this paper, we propose a simple network monitoring method based on IETF IPFIX and SNMP for CCN. From IPFIX, we could easily find the detailed information on contents delivered in interest or data packets in the format of flows, while retrieving information on the CCN node and its tables in SNMP. Through our monitoring scheme, we could clearly diagnose the current status of CCN nodes and their data such as Content Stores, Pending Interest Table (PIT), and Forwarding Information Base (FIB). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Relation between Group Order of Elliptic Curve and Extension Degree of Definition Field

    Publication Year: 2012 , Page(s): 1 - 4
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (109 KB) |  | HTML iconHTML  

    Recent innovative public key cryptographic applications such as ID-based cryptography are based on pairing cryptography. They efficiently use some torsion group structures constructed on certain elliptic curves defined over finite fields. For this purpose, this paper shows that a relation between group order of elliptic curve and extension degree of definition field especially from the viewpoint of torsion structure for pairing- based cryptographic use. In detail, it is shown that the order of elliptic curve over ri-th extension field denoted by #E(Fqri ) is divisible by r2i and it has the torsion structure denoted by Zri ⊕ Zri when the base order of elliptic curve denoted by #E(Fq) is divisible by ri and the order of the multiplicative group of the definition field is also divisible by ri, where r denotes the order of one cyclic group in the torsion structure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study on Spectrum Sharing for Heterogeneous Networks Using Full 3D Area Model

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (650 KB) |  | HTML iconHTML  

    In this paper, we propose a system level simulation method based on the full 3-dimensional area model, for heterogeneous networks wherein an Urban Macrocellular System (UMa) and Indoor Hotspot Systems (InH) share the same frequency band. To enable more realistic performance evaluations with moderate computational complexity, our method selects statistical propagation models appropriate to each pair of transmitter and receiver. It utilizes information of the obstacles on the direct path and site information such as indoor/outdoor, floor, building and city block. We evaluate the SINR distributions created when an UMa and InHs operate under exclusive-usage and spectrum-sharing conditions. The results are compared to the output of a conventional method based on the 2-dimensional area model, and a large difference between them is revealed. The results imply that the 2D model overestimates interference, while penetration losses from walls and floors are appropriately evaluated in the proposed 3D model. We also show the SINR distributions at receivers as degraded by spectrum sharing and the throughputs achieved by UMa and InHs in the exclusive-usage case and the spectrum sharing case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Network Monitoring System for Large-Volume Streaming Services in Multi-Domain Networks

    Publication Year: 2012 , Page(s): 1 - 6
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (401 KB) |  | HTML iconHTML  

    The quality of large-volume streaming services can be assured only by effective network monitoring. Of particular importance, in multi-domain networks, monitoring must be conducted across domains and layers to fully grasp the details of overall network performance. However, when conducting monitoring, it takes too long to analyze the monitoring data because the monitoring system gathers massive sets of data from multiple locations. Furthermore, it is expensive to install the monitoring equipment in multiple locations. To realize faster analysis and lower cost, we propose adaptive monitoring system which troubleshoots service troubles automatically by creating and running monitoring scenarios; it can reconfigure the monitoring equipment and program dynamically at runtime. In this paper, we describe the function, design and implementation of this system. We adopt and extend existing technology in creating our system. By this extension, the network operator can manage the monitoring program on the monitoring sets placed in different domains in an integrated fashion. Furthermore, we discover and eliminate the bottleneck of a prototype system by measuring processing components in detail. The result is much faster overall processing. After showing the basic operations of the system, we confirm its effectiveness by conducting demonstration experiments on the high-speed test-bed network of Japan. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adaptive Multipath Routing Algorithm for Maximizing Flow Throughputs

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (537 KB) |  | HTML iconHTML  

    In datacenter networks, as the communication intensive middleware such as Hadoop being popular, the traffic among servers is heavily increasing and its traffic patterns vary from time to time. Conventional tree network topologies and routing mechanisms with single path routing will cause congestion along oversubscribed links. Thus, load- balancing path selections are needed to alleviate congestion and improve application performance. Multipath routing algorithms can distribute traffic over diverse paths optimally than simple solutions like ECMP. They, however, request considerable computations, i.e. frequently updating the path cost tree and dynamically optimizing path selections, thus they do not adapt large scale datacenter networks. Multinomial Logit Based (MLB) routing, a lightweight multipath routing algorithm, has been proposed as a countermeasure. However, it is not always efficient against various network topologies and varying traffic patterns unless its control parameter is adaptively chosen. In this paper, we present an automatic parameter tuning method, which estimates the path cost of individual flows in the network and dynamically tunes the traffic dispersion parameter to reduce the total path cost of all flows. In our experiments with real OpenFlow switches, we exhibit that our method optimally tunes the parameter and maximize the total throughput of the flows. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Empirical Study of Valuation and User Behavior in Social Networking Services

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (594 KB) |  | HTML iconHTML  

    Social networking services (SNS) have emerged as an extremely popular platform for social interactions. During the past decade, the usage of SNS in the private sector has seen an exponential growth. This has not remained unnoticed by businesses, which have increased their focus on this multibillion-dollar market. SNS such as Facebook and Twitter have enjoyed huge success due to a large user base and attention from the business sector. The value of a specific SNS is dependent on a number of key characteristics, such as the number of users and the amount of content produced. In this paper we present empirical data used to estimate network value and model user behavior in SNS. The data used are from the most common SNS today, including Twitter and Youtube. We provide an overview of how the number of users and content produced influence the total valuation of a SNS. We also develop analytical models capturing the network effects in SNS. The analysis provided can be used to estimate both value and user behavior of future SNS. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimum Mathematical Programming Model for Network-Coding Based Routing with 1+1 Path Protection

    Publication Year: 2012 , Page(s): 1 - 5
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (292 KB) |  | HTML iconHTML  

    This paper presents a mathematical programming model to determine an optimum set of routes that minimizes the required network resources in 1+1 protection using network coding, which in turn accommodates more traffic to be injected into the network. The 1+1 protection technique provides quick proactive recovery from any single link failure. However, provisioning of this technique demands at least double network resources. So it is desirable to reduce the cost for 1+1 protection scheme. The network coding technique, where intermediate nodes along a path can process the incoming data, provides high throughput using less network resources. In this research work, our developed mathematical model is formulated as a Non Linear Integer Programming (NLIP) problem. The cost obtained from our developed model is compared with that of a conventional minimal-cost routing policy, where both approaches include the network coding effect. Numerical results show that our model achieves almost double resource saving effect in the examined networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Signaling in GMPLS-Based WSONs: Distributed Wavelength Assignment in Bidirectional Lightpath Provisioning

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (499 KB) |  | HTML iconHTML  

    In a large-scale wavelength switched optical network (WSON), a distributed wavelength assignment (DWA) which does not tightly rely on the frequently disseminated and centralized maintained resource information would be critical to the large-scale WSON. In this paper, we are motivated to provide insights on the DWA of different signaling schemes and find better candidates for bidirectional lightpath operation in WSON. Probabilistic analysis is conducted for the bidirectional DWA performance evaluation. Through comparisons, we find that the bidirectional DWA support in the current standard RSVP-TE per RFC 3473 is inadequate. Especially from long-term view, signaling which can offer efficient resource utilization is strongly required. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Availability Constrained Traffic Control for AMC-Enabled Wireless Mobile Backhaul Networks

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (211 KB) |  | HTML iconHTML  

    Mobile backhaul networks have been gaining importance due to the growing demand for mobile Internet. With faster wireless access speed, mobile backhaul networks need to keep up with the increasing demand. Mobile operators are adopting point-to-point wireless links with Adaptive Modulation and Coding (AMC) capability to cope with the increasing demand. However, AMC makes it hard to provide QoS guaranteed connection due to its fluctuating capacity. In this paper, we present a routing scheme for mobile backhaul networks to guarantee end-to-end communication availability in consideration of unstable capacity attributed to AMC. The routing scheme is composed of three techniques: finding highest-availability path, finding protection path, and bandwidth reallocation to optimize the bandwidth usage. Flows are admitted if searched path meets availability requirement. We have evaluated the performance of the routing scheme through simulation with various link conditions. We show that improvement of each technique is affected by link conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Centroid-Based Nearest Neighbor Feature Representation for E-Government Intrusion Detection

    Publication Year: 2012 , Page(s): 1 - 6
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (252 KB) |  | HTML iconHTML  

    Accompanied by the invention of information and communication of technologies, e-government has become a prominent feature of modern governance in every country. The aims of e-government are to promote executive efficiencies, to reduce transaction costs of citizen, and to increase the responsiveness of the public sector. However, the requirement of pursuing these goals is based on the security measures of intrusion detection systems (IDS). If technologies are not advanced enough to distinguish between normal connections and illegal attacks, citizens would be doubtful in using the access of e-government to interact with the public sector and will eventually lose the trust of government. Technically, feature representation is an important key to successful pattern classification. However, very few studies focus on extracting better representative features of normal connections and attacks for better detection. Therefore, this paper proposes a novel feature representation approach by cluster centers and nearest neighbors, namely CANN. In this approach, two distances are measured and summed. The first one is based on the distance between each data sample and its cluster center, and the second distance is between the data and its nearest neighbor in the same cluster. Then, this new and one-dimensional distance based feature is used to represent each data sample for intrusion detection The experimental results based on the KDD-Cup 99 dataset show that CANN not only can make the k-nearest neighbor classifier perform reasonably well, but also provides high computational efficiency for the time of training and testing a classifier. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classifying DNS Heavy User Traffic by Using Hierarchical Aggregate Entropy

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (565 KB) |  | HTML iconHTML  

    We introduce the notion of hierarchical aggregate entropy and apply it to identify DNS client hosts that wastefully consume server resources. Entropy of DNS query traffic can capture client query patterns, e.g., the concentration of queries to a specific domain or dispersion to a large domain name space. However, entropy cannot capture the spatial structure of the traffic. That is, even if queries disperse to various domains but concentrate in the same upper domain, entropy among domain names provides no information on the upper domain structure, which is an important characteristic of DNS clients. On the other hand, entropies of aggregated upper domains do not have detailed information on individual domains. To overcome this difficulty, we introduce the notion of hierarchical aggregate entropy, where queries are recursively aggregated into upper domains along the DNS domain tree, and calculate their entropies. Thus, this method enables us to analyze the spatial characteristics of DNS traffic in a multi-resolution manner. We calculated the hierarchical aggregate entropies for actual DNS heavy-hitters and observed that the entropies of normal heavy-hitters were concentrated in a specific range. On the basis of this observation, we adopt the support vector machine method to identify the range and to classify DNS heavy-hitters as anomalous or normal. It is shown that with hierarchical aggregate entropy, classification error was halved compared to non-hierarchical entropies. In addition, we analyzed time series variation of the component ratio of heavy-hitters and found a sudden increase of normal heavy-hitters between Mar. and Oct. 2009. We confirmed that one of the major reasons for the increase was the implementation of DNS prefetch in a popular Web browser. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cloud Computing and Telecommunications: Business Opportunities, Technologies and Experimental Setup

    Publication Year: 2012 , Page(s): 1 - 6
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (290 KB) |  | HTML iconHTML  

    Cloud computing is one of the key business and technology trends impacting every aspect of the ICT industry. In this paper we analyze the impact and opportunities of the cloud computing paradigm for the telecom industry, both as users as well as providers of cloud-based solutions. Based on the identified opportunities, we describe the key technological and operational innovations that can help streamline operations and, at the same time, generate new business through differentiating solutions. We also show how these new technologies and operational models can be realized in practice. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cost-Based CAC with Media Independent Handover for Wireless Heterogeneous Networks

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (364 KB) |  | HTML iconHTML  

    Media Independent Handover (MIH) is a key specification to achieve seamless handover in Mobile Wireless Networks (MWNs). However, Call Admission Control (CAC) and Vertical Handoff (VH) are two important mechanisms for MIH. First, an adaptive CAC is needed in base stations for maximizing high network reward while guaranteeing QoS requirements. Second, an efficient vertical handoff enables mobile stations achieving seamless, fast, QoS-aware mobility in MWNs. Many studies have proposed some approaches to address the issues of CAC and VH, but not consider both at the same time or not consider for the MIH environment. Thus, this paper proposes a MIH-based cost-based CAC for vertical handoff in a loosely-coupled MWN. First, in a base station (BS) the cost-based CAC models the resource occupancy of each wireless network in a MWN as a Markov chain model, and then forms a cost-reward CAC for maximizing network reward. Second, in MS the VH scheme adopts a predictive RSS to predict the moving trend of mobile stations to select the optimal target network. Numerical results indicate that the proposed approach outperforms other approaches in GoS, FRL and the number of vertical handoffs while yielding competitive utilization. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross-Layer-Based Real-Time Local Repair for Multicasting in Distributed Vehicular Ad-Hoc Networks

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (457 KB) |  | HTML iconHTML  

    The real-time resources sharing in multicast VANETs achieves low bandwidth waste rate because the sender only send a real-time chunk to the group receivers by using a single multicast session. Although the real-time multicasting VANET still exhibits critical issues, the Multicast Ad hoc On-Demand Distance Vector (MAODV) protocol can achieve multicast routing in self-organizing VANET. However, MAODV in VANET suffers from unreliable wireless links and high control message overhead. MAODV thus offers a broadcast-type local repair to repair broken links, but yields a large number of broadcast-type repair messages, increases extensive control overhead, and involves large power consumption. Thus, this paper proposes a cross-layer unicast-type multihop local repair approach to recover broken links in multicasting VANETs. Additionally, the cross-layer mechanism provides mobile nodes to send a cross- layer message to the TCP sender to keep current congestion window (cwnd) and slow start threshold (ssthresh) when downstream links are temporarily broken, and then increases network goodput. Finally, the time complexity of the real-time local repair approach is analyzed. Numerical results demonstrate that the proposed approach outperforms other approaches in successful repair rate, control message overhead, packet delivery ratio, and network goodput. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Implementation of a Network Management System for Service Oriented Network

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1669 KB) |  | HTML iconHTML  

    Today, with the advent of cloud computing and the growth of mobile services, a new Internet paradigm is required that is capable of providing an on-demand service by discovering and aggregating service resources for users. A Service Oriented Network (SON)[1] is focused on the services provided over a network rather than the technologies or their related components. These technologies or components are hidden from the end users and third parties so their only concern is how to get and use the services on any device, anywhere, and at anytime of the day. From a network management point of view, the task of network management for a SON will become increasingly complex since a number of services will be distributed and the required components for the services can be dynamically integrated to fulfill the service requests in a real-time manner. Therefore, an efficient network management system with a highly visualized Graphical User Interface (GUI) and an optimal network architecture must be deployed to enhance the SON. We therefore design and implement a GUI-based network management system to manage the SON. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Implementation of Load Reduction System for Mitigating Flash Crowds on Web Server

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (497 KB) |  | HTML iconHTML  

    Internet traffic at a given web server often increases sharply within a short time as the number of Internet users increases. This phenomenon is known as a flash crowd. When flash crowds occur in the web server, the response rate decreases, or the web server may crash as the load increases. We propose a load reduction system that prevents excessive accesses to the web server in order to stably deliver content without having to enhance the performance of the web server. In the proposed system, the web server detects flash crowds by monitoring the number of requests and changes its content delivery system. To limit excessive accesses, the web server redirects requests to other clients that hold the content in their cache when flash crowds occur. We implemented the proposed system and verified its efficiency through experiments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of a Scalable Non-IP/Non-Ethernet Protocol with Learning-Based Forwarding Method

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (332 KB) |  | HTML iconHTML  

    We have developed an experimental non-IP/non-Ethernet protocol called IPEC (IP Ether Chimera). IPEC switches learn IPEC addresses that are structured hierarchically, similar to IP addresses, using an algorithm that extends the learning algorithm of Ethernet switches. IPEC is a simple non-IP network-layer protocol that has features of both Ethernet and IP. Unlike IP, IPEC introduces an address group to manage multiple terminals as a group to make learning of mobile terminals more scalable and more efficient than Ethernet. Because an address group is the unit of learn-ing in IPEC, it is more scalable than Ethernet, and mobile groups can be learned more efficiently. In addition, IPEC tolerates loops in a network as long as a limited number of duplicate packets are allowed, and thus, enable an alternative route against link failures. We have implemented IPEC both on an IPEC-capable switches using LAN cards and on a virtual network using virtualization nodes (VNodes), which have been developed to experiment with non-IP protocols such as IPEC. We show evaluations that the group learning function of IPEC is viable especially for multiple terminals moving together concurrently. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Control Method of Queuing Delay with/without OEO Conversion in a Multi-Stage Access Network

    Publication Year: 2012 , Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (323 KB) |  | HTML iconHTML  

    To respond to the diverse requirements of user and services, various technologies have been researched for future access networks. In particular, the optical access system should support wider dynamic range in bandwidth and various quality of service (QoS) metrics like latency. To realize these needs, a hybrid architecture node with optical and electrical layers is very attractive. It has the advantage of enhancing the delay performance by handling traffic in the optical layer without optical-electrical -optical (OEO) conversion. As one such approach, we have been studying a multi-stage access network with/without OEO conversion based on semiconductor optical amplifiers (SOAs); it makes it easy to provide the delay performance that each service requires. In this paper, we propose a method for controlling the number of OEO conversions; it uses a token bucket technique to realize the desired queuing delay performance. With this technique, the number of OEO conversions can be dynamically and freely controlled regardless of the traffic condition. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.