{"title":"Assessing transaction-based Internet applications performance through a passive network traffic monitoring approach","authors":"L. Gaspary, Ederson Canterle","doi":"10.1109/GLOCOM.2004.1378379","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378379","url":null,"abstract":"The paper proposes an approach to monitor the response time of transaction-based Internet applications and protocols that uses a passive network traffic monitoring technique and stores the resulting statistics in a management information base compatible with the SNMP architecture. The work is within the scope of the Trace platform, which provides support for high-layer protocols, services and networked applications management. The implementation of the proposed approach comprises the extension of the monitoring agent, a key component of the platform, so that it stores information related to response time and generates performance-related reports.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122112288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"XML-based semantic multicast routing: an overlay network architecture for future information services","authors":"M. Ott, L. J. French, Rajeev Mago, D. Makwana","doi":"10.1109/GLOCOM.2004.1378261","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378261","url":null,"abstract":"The paper proposes an overlay network architecture for future content delivery services over the Internet. The proposed network is based on a dynamic semantic multicast model where overlay routers forward packets on one or more ports based on hierarchical content descriptors instead of an IP address. Information providers \"publish\" their content by sending out packets with XML schema-based content headers, and end-users subscribe to the network with an XML \"interest-profile\". The paper describes the protocol design, discusses its scaling properties, and reports on the performance of the implemented system.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116912322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Experimental demonstration of two new GMPLS lightpath setup protocols for soft-permanent connections over Metro-DWDM DPRing implemented on EMPIRICO ASON testbed","authors":"R. Muñoz, R. Martínez, J. Sorribes, G. Junyent","doi":"10.1109/GLOCOM.2004.1378293","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378293","url":null,"abstract":"Currently, GMPLS is being developed as a standard in order to introduce intelligence for next-generation ASON (automatically switched optical network) by means of a distributed optical control plane, allowing, among other functionalities, dynamic and real-time provisioning of high-bandwidth optical connections. The provisioning of bidirectional optical connections over unidirectional OADM (optical add drop multiplexer) rings using a distributed GMPLS-based control plane has not yet been considered in the existing literature. We present two enhancements to GMPLS signaling which allow a dynamically bidirectional lightpath setup to be requested over a unidirectional ring. These new distributed signaling schemes introduce a new concept of the label contention problem applied at wavelength sets. The paper presents and compares new strategies of label contention policies for wavelength sets, providing a significant improvement in performance evaluated in the GMPLS control plane of the EMPIRICO project testbed.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124132125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Turbo equalization using probabilistic data association","authors":"Yufang Yin, Yufei Huang, Jianqiu Zhang","doi":"10.1109/glocom.2004.1378463","DOIUrl":"https://doi.org/10.1109/glocom.2004.1378463","url":null,"abstract":"We investigate turbo equalization using an algorithm called probabilistic data association (PDA). We first propose a general structure for PDA, which consists of a linear interference cancellation step followed by a probabilistic data association step in every iteration. Based on the general structure, we show that the original PDA belongs to one variation and it is computationally inefficient. We then unveil that the popular soft linear MMSE (SLMMSE) equalizer can be considered as one sweep within a generalized PDA. Such a connection implies that further performance improvement over the SLMMSE equalizer is possible if the PDA is applied instead in turbo equalization. We also provide a way for the PDA equalizer to incorporate the a priori probability, which makes the PDA readily applicable to turbo equalization.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125870104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
T. Sexton, M. Heikkilä, J. Lilleberg, K. Majonen, K. Rounioja, P. Ivanov
{"title":"CDMA equalizer quantization","authors":"T. Sexton, M. Heikkilä, J. Lilleberg, K. Majonen, K. Rounioja, P. Ivanov","doi":"10.1109/GLOCOM.2004.1378422","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378422","url":null,"abstract":"Our topic is channel equalizer quantization for a cellular handset. We answer questions regarding quantization of variables internal to the equalizer using some estimated bounds and simulation. This includes the catastrophic event of breakdown due to a roundoff-induced singularity in Cholesky factorization. Realistic modeling of the received waveform and channel estimation includes quantization effects, as well as quantization of the taps used in the operation of the equalizer. Modem results are given in terms of frame error rate and throughput for various quantization scenarios.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129699367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Shankar Balasubramanian, B. Farhang-Boroujeny, V. J. Mathews
{"title":"Pilot embedding for channel estimation and tracking in OFDM systems","authors":"Shankar Balasubramanian, B. Farhang-Boroujeny, V. J. Mathews","doi":"10.1109/GLOCOM.2004.1378155","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378155","url":null,"abstract":"We consider the problem of channel estimation and tracking in OFDM systems and explore the idea of adding pilot symbols to the data symbols as a means of conserving bandwidth. The term pilot embedding (PE) is used to refer to this scheme. Compared to the pilot insertion (PI) scheme, i.e., the conventional pilot symbol assisted modulation (PSAM), PE is more bandwidth efficient since no separate subcarriers/timeslots are allocated to pilots. We formalize this by evaluating the capacity of the two schemes and showing that PE indeed has the potential to transmit at a higher rate. The problem of channel tracking using a decision directed approach is reviewed and found to be unreliable, in the sense that the channel estimator fails to track the channel variations after some iterations because of unavoidable decision errors. We propose an ad hoc channel estimation algorithm that uses the embedded pilots along with the past decisions of data for reliable tracking of the channel.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129726884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Quantitative QoS guarantees in labeled optical burst switching networks","authors":"Ayman Kaheel, H. Alnuweiri","doi":"10.1109/GLOCOM.2004.1378282","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378282","url":null,"abstract":"This paper presents a detailed architecture for providing quantitative QoS guarantees in labeled optical burst switching (LOBS) networks. Packets are assembled into data bursts based on their respective forwarding equivalence class (FEC) at ingress nodes. The burst assembly algorithm employs two parameters to control the burst blocking probability and burst assembly delay. We deploy a fair packet queueing (FPQ) algorithm in each edge node to regulate access to a wavelength scheduler. For LOBS core nodes, we present a novel approach that applies FPQ scheduling algorithms to the control plane of these nodes to guarantee fair bandwidth allocation. Based on the information provided by the queued control bursts, the core FPQ algorithm creates a virtual queue of data bursts in core nodes, then it selects the eligible control burst to be processed by the wavelength scheduler. In addition, we present analytical expressions for the worst case delay and the blocking probability in the proposed architecture. Simulation results demonstrate that the proposed architecture provides accurate and controllable service differentiation in LOBS networks.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"71 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129911123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
T. Vermeiren, Eric Borghs, M. Pelt, S. Miclea, Bart Haagdorens
{"title":"Introducing security services in DSL access and edge networks","authors":"T. Vermeiren, Eric Borghs, M. Pelt, S. Miclea, Bart Haagdorens","doi":"10.1109/GLOCOM.2004.1378390","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378390","url":null,"abstract":"Current DSL access and edge networks are typically deployed to offer best-effort high speed Internet access to small office and home environments. Future DSL access and edge networks will offer an evolution to higher bandwidth in the last mile. They will also be used by telecom operators to increase their average revenue per user by offering new services (such as security services) to the end users. In the brand range of advanced security services, we selected a service mix formed by a firewall and a network intrusion detection system for a feasibility study of their introduction in the future access and edge network. The study focuses on the relation between the complexity of the service and available computational technologies in the access and edge network. The evaluation results indicate that moderate complexity security services can be considered for integration. High complexity security services are unlikely to be deployed in the access and edge network.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128324918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance of joint reduced-state multiuser detection and group decoding","authors":"G. Corral-Briones, M. Hueda, C. Rodríguez","doi":"10.1109/GLOCOM.2004.1377956","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1377956","url":null,"abstract":"Joint reduced-state detection and group decoding (RSD-GD) is a promising approach to increase the spectral efficiency of multiple-access systems. Performance of RSD-GD receivers improves as coding information of more users is taken into account in the detection algorithm. For asynchronous channels, however, there is another approach to improve performance: use of more states of the multiple-access channel (MAC). Performance of RSD-GD receivers for asynchronous channels has been investigated using computer simulations; however, analytical studies of the performance of RSD-GD have not been reported so far. In this paper we derive upper bounds for the performance of RSD-GD over asynchronous MAC. The new results are based on an improved upper bound on the error event probability, which is significantly tighter than the traditional bound based on pairwise error events. Comparisons with values obtained from computer simulations show the excellent accuracy of the proposed bound.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128609581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Theoretical performance of space-time block coded systems with channel estimation","authors":"Cheng Shan, P. Kam, A. Nallanathan","doi":"10.1109/GLOCOM.2004.1379053","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1379053","url":null,"abstract":"Orthogonal space-time block codes utilize transmit diversity and allow the receiver to have a simple maximum-likelihood decoder. Normally, channel state information is not readily available at the receiver. Hence, channel estimation is necessary for coherent detection. We present analytical bit error rate (BER) expressions as well as the tight Chernoff bound for orthogonal space-time block coded systems employing M-PSK modulation. The results show directly the BER dependence on the transmit diversity and the mean square error of the channel estimator. Simulation results show the accuracy of our BER predictions.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128673354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}