{"title":"Index-server optimization for P2P file sharing in mobile ad hoc networks","authors":"C. Ohta, Zihui Ge, Yang Guo, J. Kurose","doi":"10.1109/GLOCOM.2004.1378102","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378102","url":null,"abstract":"In this paper, we compare two basic approaches towards providing peer-to-peer file-sharing (or more generally, information search) in mobile ad-hoc networks (MANET). The flooding approach broadcasts a query (e.g., to locate a node holding a given file) to all network nodes. The index-server approach adds additional servers (known as index servers) that cache directory information about which nodes have which files. With index servers, a node wishing to locate a file first queries its local index server, which then queries other index servers, as needed. The use of index servers presents the possibility of locating a file index quickly in an index server cache, but requires additional overhead to maintain cache consistency. We compare the performance of the flooding approach to two index-server caching approaches: consistent caching and local caching. We quantify the reduction in search overhead using the index-server scheme rather than flooding in MANET, and study how the optimal number of index servers varies according to network size, query rate, and index generation rate. We compare the flooding scheme and the consistent caching and local caching schemes, for two types of queries: history queries and latest queries. Numerical results show how one can choose between the alternatives of consistent caching and local caching depending on network size, index generation rate and query rate.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"22 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113942820","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":"Jointly optimum power and bandwidth allocation for multi-rate FDM and FDMA over overloaded channels","authors":"Joon Ho Cho, Q. Zhang","doi":"10.1109/GLOCOM.2004.1377947","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1377947","url":null,"abstract":"An optimal power and bandwidth allocation problem is considered for multi-rate frequency-division multiplexing (FDM) and frequency-division multiple-access (FDMA) over overloaded channels. We have derived the optimum frequency-division system that minimizes the total transmitted power subject to the QoS of users defined in terms of the transmission rates and the SINR requirements. The necessary and sufficient condition is found for the admissibility of the users, and the optimum power, bandwidth, transmit waveform, and receive waveform are found for each user. It is shown that the optimum frequency-division system performs exactly the same as the optimum CDMA system when all the users have the same transmission rate and channel gain. It is also shown that the optimum frequency-division system always outperforms the ETSC-minimizing code-division system when all the overloading users have the same transmission rate.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"22 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":"126481130","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}
K. Medepalli, P. Gopalakrishnan, D. Famolari, T. Kodama
{"title":"Voice capacity of IEEE 802.11b, 802.11a and 802.11g wireless LANs","authors":"K. Medepalli, P. Gopalakrishnan, D. Famolari, T. Kodama","doi":"10.1109/GLOCOM.2004.1378242","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378242","url":null,"abstract":"IEEE 802.11 based wireless local area networks (WLANs) are becoming popular in home, enterprise and public access areas primarily due to their low cost, simplicity of installation and high data rates. While WLANs continue to be predominantly data centric, there is growing interest in using WLANs for voice, especially in enterprise markets. This paper presents new analytical and simulation results for the conversational speech capacity of WLANs and compares the different WLAN technologies in that regard. Specifically, we consider IEEE 802.11b, 802.11a and 802.11g systems in the infrastructure mode and find that voice capacity is a strong function of the channel bandwidth, codec packetization interval, data traffic and the packet size used by data. For the IEEE 802.11g system, we find that capacity depends on the CTS-to-self and RTS-CTS legacy protection mechanisms, with the RTS-CTS mechanism achieving lower capacity. We show that the analytical results are in close agreement with those from simulations and conclude the paper by highlighting some key factors that dictate the capacity of WLANs.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"23 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":"126409744","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":"Impact of peer-to-peer applications on wide area network traffic: an experimental approach","authors":"Nadia Ben Azzouna, F. Guillemin","doi":"10.1109/GLOCOM.2004.1378241","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378241","url":null,"abstract":"To evaluate the impact of peer-to-peer applications on traffic in wide area IP networks, we analyze measurements from a high speed backbone link carrying TCP traffic towards several ADSL areas. The first observations are that the prevalent part of traffic is due to peer-to-peer applications (almost 80% of total traffic) and that the usage of network becomes symmetric in the sense that customers are not only clients but also servers. This latter point is observed by the significant proportion of long flows mainly composed of ACK segments. When analyzing the bit rate created by long flows, it turns out that those TCP connections due to peer-to-peer applications have a rather small bit rate and that there is no evidence for long range dependence. These facts are intimately related to the way peer-to-peer protocols are running.","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":"128009821","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":"State correction after re-routing with reduced state resource reservation protocols","authors":"A. Császár, Attila Takács, R. Szabó, T. Henk","doi":"10.1109/GLOCOM.2004.1378082","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378082","url":null,"abstract":"Recently, a new working group - Next Steps In Signalling (NSIS) - was established within the IETF to develop a general signalling protocol primarily to support QoS resource reservation. Two main operation modes have been clarified: stateful and reduced state. The first mode relies on per flow-state information in all interior nodes while the other uses aggregated states. Stateful operation is based on the resource reservation protocol (RSVP), while reduced state operation will be similar to the resource management in a Diffserv (RMD) framework. With the use of aggregated states instead of per-flow granularity, one looses fine control over resources but derives a scalable and more efficient protocol. However, some problems need new handling mechanisms. In this paper, we discuss the problem of re-routing from the aspect of reduced state resource reservation. We show how quickly and easily RSVP handles such situations but reduced state solutions like RMD require new mechanisms for a quick reaction. We propose and analyse several solutions.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"34 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":"121629670","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":"Multiple hypothesis channel estimation for the MIMO-OFDM system","authors":"Kyeong Jin Kim, T. Reid","doi":"10.1109/GLOCOM.2004.1378490","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378490","url":null,"abstract":"This paper proposes a time-varying, Doppler channel estimation approach using multiple hypothesis channel modeling for OFDM-MIMO systems. A non-linear estimation structure is derived using this problem formulation which is composed of a parallel bank of extended Kalman filters whose individual outputs are weighted and summed to form channel estimates. By using this approach, we can reduce the model-mismatch errors associated with fixed-parameter channel models which can be a significant source of channel estimation error. For time-varying, Doppler channels, the channel models (e.g. ITU models) are characterized by a small set of parameters such as Doppler frequency and spectral shape.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"55 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":"132115537","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":"Adaptive selection of surviving symbol replica candidates based on maximum reliability in QRM-MLD for OFCDM MIMO multiplexing","authors":"K. Higuchi, H. Kawai, N. Maeda, M. Sawahashi","doi":"10.1109/GLOCOM.2004.1378453","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378453","url":null,"abstract":"The paper proposes an adaptive selection algorithm for surviving symbol replica candidates based on the maximum reliability in ML detection with QR decomposition and M-algorithm (QRM-MLD) for OFCDM MIMO multiplexing. In the proposed algorithm, symbol replica candidates newly-added at each stage are ranked for each surviving symbol replica from the previous stage using multiple quadrant detection. Then, branch metrics are calculated only for the limited number of symbol replica candidates with high reliability based on an iterative loop in increasing order of the accumulated branch metrics from the candidate with the minimum one. Simulation results show that the computational complexity of the proposed algorithm from the viewpoint of the number of real multiplications is reduced to approximately 1/6 and 1/1900, respectively, compared to that of the original QRM-MLD and that of the conventional MLD with squared Euclidian distance calculations for all symbol replica candidates, assuming the identical achievable average block error rate (BLER) performance in 4-by-4 MIMO multiplexing with 16QAM data modulation. The results also show that 1-Gbps throughput is achieved at the E/sub b//N/sub 0/ per receiver antenna of approximately 9 dB using the adaptive selection algorithm in QRM-MLD associated with 16QAM modulation and turbo coding with coding rate of 8/9, assuming a 100-MHz bandwidth for a twelve-path Rayleigh fading channel (rms delay spread, 0.26 /spl mu/sec; maximum Doppler frequency, 20 Hz).","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"3 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":"132419861","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":"Low-density generator matrix codes for indoor and Markov channels","authors":"H. Lou, J. Garcia-Frías","doi":"10.1109/GLOCOM.2004.1377997","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1377997","url":null,"abstract":"We propose a modified algorithm for the decoding of linear codes with low-density generator matrix (LDGM) codes (a class of LDPC codes) over indoor and finite-state binary Markov channels. In order to avoid error floors, a concatenation of two LDGM codes is utilized. The hidden Markov model representing the channel is incorporated into the graph corresponding to the LDGM codes, and the message passing algorithm is modified accordingly. The proposed scheme clearly outperforms systems in which the channel statistics are not exploited in the decoding process, allowing reliable communication at rates which are above the capacity of a memoryless channel with the same stationary bit error probability as the Markov channel. Moreover, the proposed method can be successfully applied for real wireless channels that can be modeled with hidden Markov models, such as indoor channels.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"51 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":"130006860","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":"Delay analysis of application level multicast on content addressable networks","authors":"Sugata Hazarika, D. Towsley","doi":"10.1109/GLOCOM.2004.1378160","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378160","url":null,"abstract":"Two approaches have been proposed for application level multicast on content addressable networks (CANs), implemented through tree-based and flooding-based methods. In this paper, we present simple analytical models for studying these two approaches. Using these models, we study the performance achieved by multicast groups as a function of their size, the variability in delays between neighbor nodes and the dimensionality of the underlying CAN. We see that at lower dimensions and lower group sizes the CAN flooding scheme performs better than the tree-based scheme. However as the dimensionality or the CAN increases and the group sizes increase the tree-based scheme performs better. We also propose and study a scheme for reducing delays in the tree based multicast scheme.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"297 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":"134180053","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}
B. V. Houdt, K. Laevens, J. Lambert, C. Blondia, H. Bruneel
{"title":"Channel utilization and loss rate in a single-wavelength fibre delay line (FDL) buffer","authors":"B. V. Houdt, K. Laevens, J. Lambert, C. Blondia, H. Bruneel","doi":"10.1109/GLOCOM.2004.1378323","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378323","url":null,"abstract":"We present a detailed analysis of the maximum channel utilization and loss performance in an optical buffer having access to a single outgoing channel. Such a system, consisting of a number of fiber delay lines, can only realize a discrete set of delays to resolve output port contention. This leads to an underutilization of the channel capacity, which reduces overall performance. The framework considered in this paper greatly simplifies the assumptions made in previous work, which allows us to study the impact of a variety of new parameters on the performance, e.g., the burstiness of the arrival process and the correlation of consecutive burst lengths. Moreover, we present exact results for both the channel utilization and loss rate in such a system using matrix analytic methods. We show that carefully choosing the granularity parameter can, in some cases, make a substantial difference when trying to realize lower buffer losses or a high channel utilization. Optimal values of the granularity parameter are shown to be closely related to the optical burst length distribution.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"67 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":"131650499","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}