Stanley Liu, H. Rutagemwa, Xuemin Shen, J. Mark, P. Ho
{"title":"Efficiency and throughput analysis of delayed-acknowledgement in WPANs","authors":"Stanley Liu, H. Rutagemwa, Xuemin Shen, J. Mark, P. Ho","doi":"10.1109/ICBN.2005.1589657","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589657","url":null,"abstract":"An analytical model for studying the performance of the delayed acknowledgement (Dly-ACK) mechanism in IEEE 802.15.3 over a fading channel is developed. A three-state Markov channel model is used to approximate both correlated and uncorrelated error processes. Explicit mathematical expressions for the goodput and efficiency of Dly-ACK are derived. It is found that the Dly-ACK mechanism yields higher goodput in a burst error environment than in a random error environment. The goodput tends to increase as the size of the burst increases; however, the amount of increase depends on the underlying delay. Simulations results are given to validate the analytical results.","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130608815","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":"Network selection using fuzzy logic","authors":"S. Kher, Arun Kumar Somani, Rohit Gupta","doi":"10.1109/ICBN.2005.1589698","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589698","url":null,"abstract":"The peer-to-peer technology offers many advantages, but at the same time, it poses many novel challenges for the research community. Modern peer-to-peer systems are characterized by large scale, poor reliability, and extreme dynamism of the participating nodes, with a continuous flow of nodes joining and leaving the systems. Selection of an optimal network requires estimation of its rank using attributes such as storage, average load, cost, reliability etc. There are multiple networks, each vying for users business by providing them novel services. The user in turn has to decide which network best meets its service requirements and accordingly join a network. In this paper, we propose a model with two ranking schemes, one being network-specific and the other user-specific. The schemes use fuzzy logic to rank different networks based on their attributes. The difference between the two ranking schemes lie in the dynamism offered by them. The user-specific ranking criteria is flexible while the network-specific scheme uses a fixed criteria. The network-specific scheme helps in providing a structure to visualize the overall performance index of the networks. The user-specific scheme is adaptive in the sense that it caters to the specific needs of the users. The simulations performed by us show that the two schemes are light-weight, highly accurate and easily implementable","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116925211","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":"On parameter tuning of data transfer protocol GridFTP for wide-area grid computing","authors":"T. Ito, H. Ohsaki, M. Imase","doi":"10.1109/ICBN.2005.1589763","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589763","url":null,"abstract":"In wide-area grid computing, geographically distributed computational resources are connected for enabling efficient and large-scale scientific/engineering computations. In the wide-area grid computing, a data transfer protocol called GridFTP has been commonly used for large file transfers. GridFTP has the following features for solving problems of the existing TCP. First, for accelerating the start-up in TCP's slow start phase and achieving high throughput in TCP's congestion avoidance phase, multiple TCP connections can be established in parallel. Second, according to the bandwidth-delay product of a network, the TCP socket buffer size can be negotiated between GridFTP server and client. However, in the literature, sufficient investigation has not been performed either on the optimal number of TCP connections or the optimal TCP socket buffer size. In this paper, we therefore quantitatively investigate the optimal parameter configuration of GridFTP in terms of the number of TCP connections and the TCP socket buffer size. We first derive performance metrics of GridFTP in steady state (i.e., goodput and packet loss probability). We then derive the optimal parameter configuration for GridFTP and quantitatively show performance limitations of GridFTP through several numerical examples. We also demonstrate validity of our approximate analysis by comparing simulation results with analytic ones","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117189946","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":"Analysis of wavelength-routed WDM networks under heterogeneous environments","authors":"Han-You Jeong, S. Seo","doi":"10.1109/ICBN.2005.1589595","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589595","url":null,"abstract":"Blocking probability is the most widely used performance metric for the design and the dimensioning of wavelength-routed WDM networks. In this paper, we study the blocking performance of such networks under two heterogeneities: traffic heterogeneity and configuration heterogeneity. The former means that different sessions may have different kinds of traffic, and the latter that different nodes and links may have different wavelength conversion capabilities and different number of optical fibers in use, respectively. We also investigate how these heterogeneities impact on the blocking performance of such networks. To achieve these goals, we present a dedicated analytical model for each heterogeneity. First, we present two single-link models for estimating the arrival-point wavelength occupancy distribution on a link with heterogeneous traffic: the FP model and the RP model. Both models are based on the BPP/M/C/C model in which the first two moments of an arbitrary session are matched by those of a birth-death process whose arrival rate linearly varies with the average number of busy wavelengths occupied by its own calls. Next, we derive two recurrence formulas to estimate the number of free wavelengths on a multi-fiber link and the number of free wavelengths after limited-range wavelength conversion. We also present a comprehensive analytical framework for estimating the blocking performance of WDM networks in the presence of both heterogeneities. From the numerical results, we demonstrate that our model is highly accurate in evaluating the blocking probability for a wide range of the heterogeneities discussed above.","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117346649","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":"Using location information for scheduling in 802.15.3 MAC","authors":"S. B. Kodeswaran, A. Joshi","doi":"10.1109/ICBN.2005.1589672","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589672","url":null,"abstract":"In recent years, UWB has received much attention as a suitable physical layer (PHY) for wireless personal area networks (WPANS). UWB allows for low cost, low power, high bandwidth, short reach communication well suited for personal operating spaces. One of the key features offered by UWB is very accurate ranging between a transmitter/receiver pair. The IEEE 802.15.3 is a MAC protocol that has been proposed for WPANs. In this MAC, a combination of CSMA/CA and TDMA is used to achieve channel scheduling. The TDMA component ensures only one transmitter/receiver pair within a piconet is active at any given time thereby ensuring an exclusion region that covers the whole piconet. In this paper, we propose a less stringent scheduling mechanism that allows for concurrent communication between UWB transmitter/receiver pairs within a piconet. Exclusion is necessary only when the communicating entities are close enough such that interference between them would adversely affect successful reception of data at the receivers. The piconet coordinator (PNC) uses the ranging information provided by UWB to accurately position transmitters and receivers. The PNC schedules parallel transmissions between distinct transmit/receive pairs as long as they do not interfere. We present the results of our simulations of our proposed modifications and show that the network throughput can be significantly increased with very little change to the 802.15.3 MAC.","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124919826","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 analysis of the IEEE 802.11e block ACK scheme in a noisy channel","authors":"Tianji Li, Q. Ni, T. Turletti, Yang Xiao","doi":"10.1109/ICBN.2005.1589655","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589655","url":null,"abstract":"A block ACK (BTA) scheme has been proposed in IEEE 802.11e to improve medium access control (MAC) layer performance. It is also a promising technique for next-generation high-speed wireless LANs (WLANs) such as IEEE 802.11n. We present a theoretical model to evaluate MAC saturation throughput of this scheme. This model takes into account the effects of both collisions and transmission errors in a noisy channel. The accuracy of this model is validated by NS-2 simulations.","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115989969","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":"A subspace approach for DOA estimation of uniform linear arrays with increased element spacing applicable to wideband transmission","authors":"A. Shapoury","doi":"10.1109/ICBN.2005.1589743","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589743","url":null,"abstract":"In this paper, the problem of joint direction of arrival (DOA) and signal estimation is addressed with a uniform linear array (ULA) when the array has an increased element spacing (i.e., an array with crossed manifold) under wideband scenario. Similar to the temporal aliasing, spatial aliasing can occur when the array's interelement spacing exceeds lambda/2, (where lambda is the wavelength of the transmission at a certain frequency.) A subspace-based algorithm is proposed which uses the inherent spectral diversity in the wideband transmission to resolve the aliasing ambiguity in joint DOA and data signal estimation. The auxiliary constraints to ensure identifiability have been investigated and it is shown that by an appropriate choice of frequency bins, the aperture size of the antenna can be arbitrarily increased. The performance of the proposed algorithm is studied through confirmatory simulation and Monte Carlo analysis","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128770451","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":"Enhancements to CAN for the application as distributed data storage system in grids","authors":"H. Ristau, D. Versick, D. Tavangarian","doi":"10.1109/ICBN.2005.1589765","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589765","url":null,"abstract":"Currently, there is no distributed data management system for computational grids that provides transparent data distribution and replication. This paper introduces three methods to enhance an algorithm for data distribution and replication from the field of peer-to-peer computing named \"content-addressable network\". They enable this algorithm to being a basis for a fully transparent distributed data management system for grids. The first enhancement provides multiple dataset queries which allow the user to search for all datasets matching a given combination of key and mask. Another optimization reduces existing query latencies by introducing a system of specifically selected short cuts. The third enhancement enables the algorithm to keep the amount of data stored on a certain node more equally balanced and as a result optimizes the algorithms stability while working with high data fill-levels","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128570300","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":"Reliable optical burst switching for next-generation grid networks","authors":"V. Vokkarane, Qiong Zhang","doi":"10.1109/ICBN.2005.1589774","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589774","url":null,"abstract":"Grid computing provides a flexible, secure, sharing of resources among dynamic collections of individuals, institutions, and resources. Optical burst switching (OBS) is one of the most promising new optical transport paradigms for efficiently transporting data over an all-optical network. In this paper, we discuss several mechanisms for deploying a reliable OBS network using a range of loss minimization and loss recovery mechanisms. We also propose two new loss recovery mechanisms for deploying a reliable OBS network, namely, forward error correction and composite burst assembly. Our simulation shows that the two proposed mechanisms significantly reduce the loss experienced by loss-sensitive connection-oriented traffic through an OBS network. We have also shown how the reduction of loss leads to increased throughput of TCP-over-OBS network. We also propose a comprehensive OBS service architecture, and provide guidelines for implementing a reliable connection-oriented photonic transmission control protocol (PTCP) over OBS-based grid networks","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125107973","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":"Imager based sensor networks for understanding and creating behaviors","authors":"A. Savvides, Eugenio Culurciello","doi":"10.1109/ICBN.2005.1589710","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589710","url":null,"abstract":"In this vision paper we propose the creation of sensor networks based on custom designed multifunction imagers that can directly pick out events of interest from a scene. We argue that with a suitable learning framework such sensors have great potential for realizing sensor networks that can interpret and subsequently orchestrate behaviors in physical space. This paper provides an overview of the research challenges followed by a brief description of our current research efforts towards creating a functional experimental system for investigating these intelligent networks","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129438295","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}