{"title":"Modeling TCP over Ad hoc Wireless Networks using Multi-dimensional Markov Chains","authors":"Shyamnath Gollakota, B. Ramana, C. Murthy","doi":"10.1109/BROADNETS.2006.4374400","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374400","url":null,"abstract":"The performance of transmission control protocol (TCP) over ad hoc wireless networks (or simply ad hoc networks) has been extensively studied through simulations by the research community. Although many theoretical models, such as [1], have been proposed for estimating the performance of TCP over wired networks, researchers have faced many difficulties in modeling TCP over ad hoc networks. These difficulties are mainly due to the behavior of the underlying physical and MAC layers. Recently, [2] attempted to solve this problem by simplifying the behavior of TCP, besides assuming that no packet losses occur. In this work, we attempt to provide a theoretical model for TCP by considering the main phases of TCP, namely the slow start phase and the congestion avoidance phase, thus providing a more accurate model that captures all of its main features. To the best of our knowledge, ours is the first model that considers the slow start phase while analyzing TCP's performance in ad hoc networks. We make use of multi-dimensional Markovian chains to model each of these phases. We then use the resulting steady state probabilities to estimate the goodput. Furthermore, the analysis is validated by comparing the theoretical and simulation results using various error models.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117017968","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}
P. Castoldi, L. Valcarenghi, F. Paolucci, V. Martini, F. Baroncelli, F. Cugini, B. Martini
{"title":"Network Resource Management in High-Quality Networks","authors":"P. Castoldi, L. Valcarenghi, F. Paolucci, V. Martini, F. Baroncelli, F. Cugini, B. Martini","doi":"10.1109/BROADNETS.2006.4374345","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374345","url":null,"abstract":"This paper presents the architecture, some specific supporting functions and an experimental validation of a new functional plane, namely the service plane, for realizing an added-value service provisioning (e.g., grid connectivity) for telecommunication operators. First, it is shown as the service plane can be a viable solution for decoupling service and transport development, by masking the transport-related implementation details from the abstract request of a service by a customer or by a qualified application. To this purpose, the service plane exports a high-level interface for supporting application-initiated invocation of QoS-enabled virtual private networks (VPN) or connection-less services. As a significant use case for a grid user, a VPN set-up through the service plane is experimentally demonstrated. Second, some of the main functions that the service plane should support are presented in detail and experimentally assessed, namely a centralized topology discovery service (C-TDS) and path computation service (PCS). As an example, from a grid user perspective, the C-TDS can provide up-to-date information on the grid topology according to various levels of abstraction (physical topology, MPLS topology, and logical topology). Several techniques for the grid topology discovery and various update policies are investigated. PCS elaborates upon the logical topology obtained by TDS and runs linear programming (LP) formulations to identify optimal traffic engineering solutions according to specific objective functions. The combination of C-TDS and PCS represents an an enhanced level of network- awareness in the (network) middleware supporting global grid computing (i.e., grid computing in wide area networks). Experiments performed on IP/MPLS metropolitan network based on commercial routers exhibit a topology delivery performance within a time span in the order of a few seconds and a PCS operation in the order of ten seconds.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123102780","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}
Wei-tao Shaw, Shing-Wa Wong, Y. Hsueh, L. Kazovsky, A. Agata, Shu Yamamoto
{"title":"End-to-End QoS of Video Streaming Service on Joint SUCCESS DWA PON and Modified RPR Network","authors":"Wei-tao Shaw, Shing-Wa Wong, Y. Hsueh, L. Kazovsky, A. Agata, Shu Yamamoto","doi":"10.1109/BROADNETS.2006.4374415","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374415","url":null,"abstract":"The end-to-end QoS of streaming video on a joint metro and access network is investigated. SUCCESS DWA PON is a highly scalable broadband access network, which can bridge current TDM PON and future WDM PON smoothly and cost-effectively. The IEEE 802.17 Resilient Packet Ring is an emerging MAN standard that designs for efficient packet-based traffic transmission over rings. A realistic video service model is constructed on this joint network, where one of the RPR nodes is dedicated to feed VBR video streams to the end-users in the presence of self- similar Internet traffic. Two improvements are proposed to improve the observed shortcomings in the video streaming performance. To improve the QoS of the streaming video, an additional transit queue is added in the RPR mode to reduce end-to-end delay. In addition, the RPR fairness algorithm is modified to improve the class-C traffic throughput. Simulation results show combined video QoS and total throughput enhancement with the proposed modifications.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129472556","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":"Next-Generation Packet Network Architectures with Decoupled Service Plane and Transport Plane","authors":"I. Widjaja","doi":"10.1109/BROADNETS.2006.4374337","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374337","url":null,"abstract":"The emerging packet network architectures with decoupled service plane and transport plane may play a prominent role in the future. Traditional packet network architectures are primarily concerned with providing quality \"pipes\" (better QoS, high bandwidth, more efficient and reliable transport, etc.). The emerging architectures shift the focus towards networks that readily enable new advanced services and allow operators to have deep control over their networks. We describe related architectures with decoupled service and transport planes that are currently being addressed by various standards development organizations such as 3GPP, 3GPP2, ETSI TISPAN, ITU-T NGN, Packet Cable and MSF. We explore various issues that need to be considered with these network architectures with a focus on resource management.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126778668","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":"Graded Channel Reservation with Path Switching in Ultra High Capacity Networks","authors":"R. Cohen, N. Fazlollahi, D. Starobinski","doi":"10.1109/BROADNETS.2006.4374422","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374422","url":null,"abstract":"We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify minimum bandwidth and duration requirements for their connections. GCR returns the highest graded path, selected according to a general, multi-criteria optimization objective. In particular, if the optimization criterion is delay, we prove that GCR returns the earliest time available to establish the connection. The computational complexity is polynomial in the size of the graph and the number of pending requests. We introduce a number of variants to GCR, including one that that provides the capability to switch between different paths during a connection. We present practical methods for minimizing or limiting the number of path switches. Through extensive simulations, we evaluate the performance of GCR and its variants under various topological settings and applications workload. Our results show that, for certain traffic parameters, optimized path selection combined with path switching can reduce the average delay of requests by an order of magnitude and increase the saturation throughput by as much as 50%. I.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125763627","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":"Multipath Selection in Multi-radio Mesh Networks","authors":"I. Sheriff, E. Belding-Royer","doi":"10.1109/BROADNETS.2006.4374421","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374421","url":null,"abstract":"Research has shown that multi-radio multi-channel mesh networks provide significant capacity gains over single-radio mesh networks. Traditional single path routing can lead to poor utilization of the available channels in these networks. Opportunistic multipath routing can better exploit the available channel diversity in a multi-radio network. The goal of this paper is to select multiple paths that, when used concurrently, provide high end-to-end throughput. To this end, we present a metric for multipath selection in multi-radio networks. We evaluate the metric through simulations in Qualnet and show that intelligent multipath routing significantly outperforms single path routing in multi-radio mesh networks.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125494566","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 Interference on the Throughput of a Multihop Path in a Wireless Network","authors":"A. K. Vyas, F. Tobagi","doi":"10.1109/BROADNETS.2006.4374386","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374386","url":null,"abstract":"The impact of interference on the throughput of a multihop path in a wireless network is studied in this paper. Interference is caused due to packets of the same end-to-end flow (intra-path), as well as packets of different flows (inter-path), as packets are transmitted over multiple hops in the network. We show how much throughput is lost due to such interference, and how much is lost due to other factors like the media access scheme, maximum transmission power limit, or overhead at various networking layers. The MAC is considered to be that of IEEE 802.11, while the physical layer is chosen to be that specified in IEEE 802.11a. The simulations are performed with careful representation of wireless channel characteristics, receiver performance, and IEEE 802.11 MAC layer parameters, such as the signal level that causes a device to be blocked (energy detect (ED) threshold). Sensitivity of the throughput of a multihop path, to parameters like transmission power, data rate and ED threshold is studied, and the throughput achievable by optimizing these parameters is evaluated for environments with different propagation characteristics. The limiting factors are identified in different cases, by contrasting the throughput of a multihop path with that of a single hop path and an optimally scheduled multihop path. The results are revealing in terms of the amount of throughput lost due to various factors. The paper also provides a good understanding with regards to the tuning of various parameters to improve the throughput of multihop paths in a wireless network.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132078131","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":"Dynamic Lightpath Allocation in Survivable Multifiber WDM Netwoks","authors":"A. Jaekel, Ying Chen","doi":"10.1109/BROADNETS.2006.4374413","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374413","url":null,"abstract":"The deployment of multifiber, wavelength division multiplexing (WDM) networks can offer significant economic benefits over single fiber networks, because of their ability to relax the restrictions due to the wavelength continuity constraint and the potential to handle future growth. In this paper we introduce a new integer linear program (ILP) formulation for dynamic wavelength allocation in survivable, multifiber WDM networks. Single fiber networks, both with and without wavelength conversion, can be treated as a special case of our formulation. We have tested our formulations on several well- known WDM networks and compared the results to single fiber networks. We have also proposed a simple heuristic for dynamic lightpath allocation. Experimental results demonstrate our ILP formulation is feasible for current networks under low to medium traffic. For very large or highly congested networks, the heuristic can be used.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132591136","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":"Coverage with Connectivity in Wireless Sensor Networks","authors":"Xin Liu","doi":"10.1109/BROADNETS.2006.4374311","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374311","url":null,"abstract":"In this paper, we study coverage with connectivity properties in large wireless sensor networks. We consider three classes: full coverage with connectivity, partial coverage with connectivity, and constrained coverage with connectivity. We outline two simple network topologies to satisfy the constrained coverage with connectivity criterion. We compare the surveillance performance and deployment cost for networks with different coverage with connectivity criteria. Together, they cover a whole spectrum of surveillance quality in wireless sensor networks at different cost. We outline potential research topics in the area.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133291336","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":"Securing Sensor Networks Using A Novel Multi-Channel Architecture","authors":"Chao Gui, Ashima Gupta, P. Mohapatra","doi":"10.1109/BROADNETS.2006.4374384","DOIUrl":"https://doi.org/10.1109/BROADNETS.2006.4374384","url":null,"abstract":"In many applications of sensor networks, security is a very important issue. To be resistant against the various attacks, nodes in a sensor network can establish pairwise secret keys, authenticate all communications with cryptographic functions, and also apply secure information aggregation schemes or hop-by-hop filtering methods. However, these security measures can take considerable overhead in terms of storage, communication and computation, which are scarce resources in sensor nodes. Previously proposed security measures can only resist against a limited number of compromised nodes, which we define as the resistance level. In this paper, we propose a separate solution to any security measure. This technique either significantly reduces the overhead, or increases the resistance level without increasing overhead. The solution is based on a new \"mixed multi-channel\" (MMC) architecture. In this design, each node can only use one fixed channel. The whole network is thus divided into multiple \"planes\" by the different planes. Exploiting the characteristics of multi-channel communication, a series of methods are proposed, such as MMC-1, MMC-k and MMC-r. We then present designs to integrate the methods with current security measures, and analyze their resistance level and energy conservation.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133673897","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}