2nd International Conference on Broadband Networks, 2005.最新文献

{"title":"An experimental end-node architecture and communications middleware for dynamic proximity networks","authors":"Somil Asthana, D. Kalofonos, P. Shah, C. Qiao","doi":"10.1109/ICBN.2005.1589688","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589688","url":null,"abstract":"In this paper, we present our experience in implementing an experimental end-node architecture and communications middleware that enables devices to (a) create and maintain ad-hoc connectivity in the absence of infrastructure support, (b) heal IP network partitions and resume active TCP sessions during intermittent connectivity, (c) detect network infrastructure (e.g. access points) when available and use it, and (d) discover devices and services currently attached to the network. In broader terms, our communications middleware includes a connection manager (CM) that provides and maintains the link-level and IP infrastructures and heal network partitions as they occur, arid a session manager (SM), which provides end-to-end active TCP-session support against intermittent connectivity and IP address changes. Finally, we provide some experimental results from a working implementation of our communications middleware on Linux devices and results from its support, of two example distributed applications, namely a distributed file browser and a multiplayer game","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"47 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":"123613301","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":"Geo-LANMAR routing: asymptotic analysis of a scalable routing scheme with group motion support","authors":"F. Rango, M. Gerla, Biao Zhou, Salvatore Marano","doi":"10.1109/ICBN.2005.1589649","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589649","url":null,"abstract":"This paper presents a novel routing protocol called Geo-LANMAR. This routing scheme is able to get full advantages of group motion of mobile nodes to reduce the routing overhead and offer high network scalability. This protocol inherits same advantages of LANMAR protocol regarding the group motion support and its idea is to use the long-distance gee-forwarding for the extra-scope routing such as the terminodes routing and the optimized link-state routing (OLSR) for the intra-scope routing. Together the geo-routing forwarding scheme, a global update propagation scheme based on the hazy sighted link state routing (HSLS) between landmark nodes (cluster heads) is applied. An asymptotic analysis of Geo-LANMAR protocol is proposed and a rule that binds the intra-scope and extra-scope overhead cost is found. The novel routing scheme has been compared with the standard routing protocols such as AODV, GPSR and LANMAR.","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"126 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":"129664089","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 functional taxonomy of wireless sensor network devices","authors":"Sivaram Cheekiralla, D. Engels","doi":"10.1109/ICBN.2005.1589707","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589707","url":null,"abstract":"With the availability of cheap computing technology and the standardization of different wireless communication paradigms, wireless sensor networks (WSNs) are becoming a reality. This is visible in the increasing amount of research being done in the WSN area, and the growing number of companies offering commercial WSN solutions. In this regard, we realize that there is a need for an unambiguous classification and definition of WSN devices. Such a classification scheme would benefit the WSN research and industrial community. We consider the spectrum of wireless devices ranging from passive RF devices to gateway devices for the classification. The classification scheme is based on functionality of the devices. This scheme is analogous to an object-oriented classification, where an object is classified on the basis of its functionality and is described by its attributes. Attributes of the wireless devices are grouped into five broad categories: communication, sensing, power, memory, and \"other features\". Each of these are further classified to provide sufficient details that are required for a typical WSN application","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":"129707860","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":"Differentiated QoS routing of restorable sub-lambda connections in IP-over-WDM networks using a multi-layer protection approach","authors":"K. Ratnam, G. Mohan, Luying Zhou","doi":"10.1109/ICBN.2005.1589608","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589608","url":null,"abstract":"This paper addresses the problem of quality of service (QoS) differentiation of sub-wavelength level label switched path (LSP) requests considering both differentiated survivability services and transmission quality in terms of end-to-end delay requirements of requests. We define different classes of LSP requests and propose a novel QoS differentiation scheme for IP-over-WDM networks. The scheme adopts a multi-layer protection approach consists of dedicated lightpath protection, shared lightpath protection, and shared LSP protection methods. The inter-class backup resource sharing technique is used to improve the performance of different classes of traffic. The routing strategies consider efficient resource utilization and end-to-end delay requirements of different priority requests. In this work, LSPs belonging to different classes with different protection requirements are allowed to traverse the same lightpath to use resources effectively. This grooming approach is efficient in terms of resource usage and it poses several challenges: 1) lightpath protection can be used or modified to satisfy the protection requirement of a newly traversed LSP, and 2) when and how the protection resources are released or updated when an LSP is released while preserving the other LSPs' protection needs. An effective way of distributing signaling messages for failure recovery should also be considered as different protection methods are used. We address all these issues in the proposed scheme. Through simulation experiments, we investigate the impacts of the backup sharing strategies and the routing strategies on connections acceptance rate for different classes of traffic and end-to-end delay requirements of different priority requests. Based on simulation results we demonstrate how the selection of a suitable sharing strategy and a routing strategy can be done that gives the best performance for all the classes and show the effectiveness of the scheme in satisfying both users' QoS requirements and network services providers' requirements.","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"17 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":"125370898","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":"Optimal path selection for Ethernet over SONET under inaccurate link-state information","authors":"S. Ahuja, M. Krunz, T. Korkmaz","doi":"10.1109/ICBN.2005.1589604","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589604","url":null,"abstract":"Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual concatenation (VC) for dynamic bandwidth management. The aggregate SONET bandwidth that supports a given EoS system is obtained by \"concatenating\" a number of virtual channels (VCs), which together form a virtually concatenated group (VCG). This aggregate bandwidth can be increased on demand by adding one or more VCs to the existing VCG. The new VC must be selected such that its end-to-end delay is within a certain range that reflects the delays of all existing VCs in the VCG and the available memory buffer of the EoS system. Algorithmically, the problem of selecting such a VC becomes that of finding a path in a graph network that is bounded by an upper and lower bounds. In this paper, we first prove that the TSCP problem is NP-complete. We then propose a new solution for it based on the \"backward-forward\" search approach. We show that this solution is much more efficient than the previously proposed MLW-KSP algorithm. We then consider the TSCP problem under inaccurate link information, in which the delay and available bandwidth for each link are taken as random variables. The problem is now formulated as that of finding the most probable path that satisfies the upper and lower delay constraints. We consider two cases. In the first case, we assume that the link delays are random but the link bandwidths are exact. We then consider the more general case where both the link delays and bandwidths are random. Heuristic solutions are presented for both cases. Simulations are conducted to evaluate the performance of the proposed algorithms and to demonstrate the advantages of the probabilistic path selection approach over the classic trigger-based approach.","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"83 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":"128650698","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":"Energy-efficient communication in battery-constrained portable devices","authors":"A. Markopoulou, Yan Li, N. Bambos, Carri W. Chan","doi":"10.1109/ICBN.2005.1589644","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589644","url":null,"abstract":"Portable devices (such as personal digital assistants and laptops with wireless connectivity) are becoming ubiquitous. As their functionality and capabilities increase, their energy consumption requirements also increase. Yet, these devices have to operate on limited batteries. In order to maximize the battery lifetime, it is necessary to optimize the use of energy at various components of such a device. In this paper, we consider a single portable device operating on a limited battery that transmits information over an interference-limited wireless channel. We seek to optimize the power consumption on the communication radio in this device, by controlling both the operation mode and the transmission power. We model the general problem using dynamic programming, obtain the optimal solutions for insightful special cases and explore various design tradeoffs. Our work provides an analytical framework for stochastic modeling and optimization of energy spent for communications in battery-operated portable devices.","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"24 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":"121106122","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":"Evaluation of burst retransmission in optical burst-switched networks","authors":"Qiong Zhang, V. Vokkarane, Yuke Wang, J. Jue","doi":"10.1109/ICBN.2005.1589624","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589624","url":null,"abstract":"In this paper, we evaluate the performance of a burst retransmission scheme in which the bursts lost due to contentions in an OBS network are retransmitted at the OBS layer. The retransmission scheme aims to reduce burst loss probability in OBS networks. We develop an analytical model for obtaining the burst loss probability over an OBS network that uses the retransmission scheme. We also compare the performance of the burst retransmission scheme with the deflection scheme. Simulation results also show that at a moderate traffic load, the retransmission scheme provides an improvement of up to four times the burst loss probability with the deflection scheme. Results also show that the retransmission scheme significantly improves the burst loss probability compared to an OBS network without the retransmission scheme.","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"8 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":"116161264","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 QoS routing in dynamic wavelength-routed optical networks","authors":"Tao Deng, S. Subramaniam","doi":"10.1109/ICBN.2005.1589614","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589614","url":null,"abstract":"In transparent DWDM (Dense Wavelength Division Multiplexing) networks, high blocking rate of lightpaths due to unsatisfactory BERs (Bit Error Rates) can become a major traffic bottleneck. Most of the existing routing schemes have focused on reducing the call rejection rate that is caused by wavelength exhaustion on the assigned routes, without considering the inferior network BER performance that these schemes often produce. In this paper, we propose a dynamic AQoS (Adaptive Quality of Service) routing algorithm, which assigns routes based on real-time Q factor measurements collected from devices. Not only is it BER-friendly, the incorporated CLC (Constrained Least Congested) approach in route selection makes our algorithm wavelength-efficient as well. AQoS routing can work seamlessly with variable data rates and heterogeneous device characteristics. More importantly, it handles non-uniform networks and state changes in a much more flexible way than traditional schemes. Simulation results show that our routing algorithm gives the best overall performance in all tested scenarios.","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"32 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":"116009587","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":"Synchronous stream optical burst switching","authors":"O. Yu, Ming Liao","doi":"10.1109/ICBN.2005.1589776","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589776","url":null,"abstract":"This paper presents a novel architecture of synchronous stream optical burst switching (SS-OBS), which employs a unified traffic control plane to enable a wavelength-routed optical network with integrated sub-wavelength grooming services to support sub-wavelength streaming traffic of constant bit rate (CBR) and variable bit rate (VBR) with guaranteed end-to-end delay and data loss rate. SS-OBS shapes sub-wavelength CBR streams into periodic burst trains; aggregates multiple sub-wavelength VBR streams with the same source and destination into a statistically multiplexed periodic burst train. By adopting periodic advanced scheduling of burst trains, SS-OBS substantially decreases recursive signaling processing in supporting sub-wavelength streaming traffic. SS-OBS employs burst train reservation blocking recovery by time-shifting a blocked burst train. Performance of SS-OBS is analyzed in terms of wavelength utilization and data loss. It is found that the performance of the SS-OBS under each type of traffic is compared favorably with other single-service-based OBS schemes","PeriodicalId":113201,"journal":{"name":"2nd International Conference on Broadband Networks, 2005.","volume":"7 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":"128463935","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 achieving near-capacity transmission in uplink multi-user MIMO systems: performance analysis and simulation results","authors":"N. Mysore, J. Bajcsy","doi":"10.1109/ICBN.2005.1589682","DOIUrl":"https://doi.org/10.1109/ICBN.2005.1589682","url":null,"abstract":"We consider uplink multi-user MIMO transmission over slow, frequency non-selective channels affected by uncorrelated and correlated Rayleigh fading. In this paper, we generalize our design of a low complexity MIMO signal detector from the single user case (proposed in N. Mysore et al., (2004), (2005)) to the multi-user setting. We consider turbo-coded transmission where the users employ QPSK-based DS-CDMA modulation and the base-station performs iterative multi-user MIMO decoding. For various antenna configurations and five active users, performance of the proposed system is within about 3.2 dB of the corresponding ergodic capacity limits. We also present a novel performance evaluation method that accurately predicts the bit error rate (BER) for the considered coded MIMO systems. For all presented cases, the numerically evaluated BER curves are within about 0.1 to 0.5 dB of the simulated BER results in the waterfall region.","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":"133393887","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}