32nd IEEE Conference on Local Computer Networks (LCN 2007)最新文献_第2页

Improving the Bandwidth Sharing in IEEE 802.11 改进IEEE 802.11的带宽共享

32nd IEEE Conference on Local Computer Networks (LCN 2007) Pub Date : 2007-10-15 DOI: 10.1109/LCN.2007.125

Yassine Chetoui, N. Bouabdallah, J. Ben-othman

引用次数: 14

Real-Time Communication in IEEE 802.11 Networks: Timing Analysis and a Ring Management Scheme for the VTP-CSMA Architecture IEEE 802.11网络中的实时通信:VTP-CSMA架构的时序分析和环管理方案

32nd IEEE Conference on Local Computer Networks (LCN 2007) Pub Date : 2007-10-15 DOI: 10.1109/LCN.2007.74

R. Moraes, P. Portugal, S. Vitturi, F. Vasques, P. Souto

{"title":"Real-Time Communication in IEEE 802.11 Networks: Timing Analysis and a Ring Management Scheme for the VTP-CSMA Architecture","authors":"R. Moraes, P. Portugal, S. Vitturi, F. Vasques, P. Souto","doi":"10.1109/LCN.2007.74","DOIUrl":"https://doi.org/10.1109/LCN.2007.74","url":null,"abstract":"Keeping up with the timing constraints of real-time traffic in wireless environments is a hard task. One of the reasons is that the real-time stations have to share the same communication medium with stations that are out of the sphere-of control of the real-time architecture. That is, with stations that generate timing unconstrained traffic. The VTP-CSMA architecture targets this problem in IEEE 802.11 wireless networks. It is based on a Virtual Token Passing procedure (VTP) that circulates a virtual token among real-time stations, enabling the coexistence of real-time and non realtime stations in a shared communication environment. The worst-case timing analysis of the VTP-CSMA mechanism shows that the token rotation time is upper-bounded, even when the communication medium is shared with timing unconstrained stations. Additionally, the simulation analysis shows that the token rotation mechanism behaves adequately, even in the presence of error-prone communication channels. Therefore, the VTP-CSMA architecture enables the support of real-time communication in shared communication environments, without the need to control the timing behavior of every communicating device. A ring management procedure for the VTP-CSMA architecture is also proposed, allowing real-time stations to adequately join/leave the virtual ring. This ring management procedure is mandatory for dynamic operating scenarios, such as those found in VoIP applications.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114484930","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}

引用次数: 9

Bloom Filters: One Size Fits All? 布隆滤镜:一刀切?

32nd IEEE Conference on Local Computer Networks (LCN 2007) Pub Date : 2007-10-15 DOI: 10.1109/LCN.2007.17

P. Hurley, M. Waldvogel

引用次数: 1

Managing Heterogeneous Access Networks Coordinated policy based decision engines for mobility management 异构接入网络的管理。基于策略的移动性管理决策引擎

32nd IEEE Conference on Local Computer Networks (LCN 2007) Pub Date : 2007-10-15 DOI: 10.1109/LCN.2007.115

C. Fan, M. Schläger, A. Udugama, Varaporn Pangboonyanon, A. C. Toker, Gökhan Coskun

{"title":"Managing Heterogeneous Access Networks Coordinated policy based decision engines for mobility management","authors":"C. Fan, M. Schläger, A. Udugama, Varaporn Pangboonyanon, A. C. Toker, Gökhan Coskun","doi":"10.1109/LCN.2007.115","DOIUrl":"https://doi.org/10.1109/LCN.2007.115","url":null,"abstract":"Next generation networks will consist of heterogeneous access networks and will provide a variety of services. In such an environment the question of the assignment of terminals to access networks and mobility management becomes a challenging problem. This is especially true when one takes the user goals and network operator goals into account. Users would like to be connected to their services over the best available access technology, where the users should be able to define what \"best\" means for themselves, in other terms users want to be Always-Best-Connected (ABC). The network operator has to satisfy ABC property for users who are essentially competing for resources and has to maintain the best possible utility out of its investment. This can be coined as Always-Best-Managed (ABM) networks. Taking into account that what best means for different users will be different in practice that it will not be possible to fulfill the requirements of each of the users simultaneously, and that the network itself is dynamic in nature, one can imagine the difficulty of achieving ABC and ABM continuously and simultaneously. In this paper we introduce a new approach to policy based mobility management based on two coordinated decision engines, one residing in the terminal and one in the network. We describe our architecture enabling network controlled policy based mobility management and discuss first results observed with our prototype implementation of this architecture.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122044924","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}

引用次数: 43

Discovering Network Topology of Large Multisubnet Ethernet Networks 发现大型多子网以太网的网络拓扑

32nd IEEE Conference on Local Computer Networks (LCN 2007) Pub Date : 2007-10-15 DOI: 10.1109/LCN.2007.25

Hassan Gobjuka, Y. Breitbart

引用次数: 16

A Simulation Study of Multi-Color Marking of TCP Aggregates TCP聚合体多色标记的仿真研究

32nd IEEE Conference on Local Computer Networks (LCN 2007) Pub Date : 2007-10-15 DOI: 10.1109/LCN.2007.43

M. Allalouf, Y. Shavitt

引用次数: 4

Modeling and Performance Analysis of Telephony Gateway REgistration Protocol 电话网关注册协议的建模与性能分析

32nd IEEE Conference on Local Computer Networks (LCN 2007) Pub Date : 2007-10-15 DOI: 10.1109/LCN.2007.99

K. Kumaran, A. Sahoo

{"title":"Modeling and Performance Analysis of Telephony Gateway REgistration Protocol","authors":"K. Kumaran, A. Sahoo","doi":"10.1109/LCN.2007.99","DOIUrl":"https://doi.org/10.1109/LCN.2007.99","url":null,"abstract":"Telephony gateways are devices that interface between IP telephony networks and the PSTN. A telephony proxy or location server (LS) that attempts to connect a call for an end user may need to choose between multiple candidate gateways. Gateways need to send updates of their dynamic resource information periodically to the LS which is used by LS while choosing a gateway. Telephony gateway registration protocol (TGREP) is an IETF proposed standard used by gateways for this purpose. To the best of our knowledge, there is no study done on the performance of TGREP and we believe that this is the first paper on performance modeling of TGREP system. In this paper, we propose an analytical model for TGREP system and then use the model to evaluate different gateway selection algorithms proposed by us in this paper. We validate our model using simulation results. We also present an adaptive update mechanism in which the overhead of sending dynamic resource information is reduced without significant effect on call blocking probability. We outline a few important conclusions from this study that are quite contrary to what IP telephony providers might resort to while deploying TGREP.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130617206","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}

引用次数: 9

Node Connectivity in Vehicular Ad Hoc Networks with Structured Mobility 具有结构化移动性的车辆自组织网络中的节点连接

32nd IEEE Conference on Local Computer Networks (LCN 2007) Pub Date : 2007-10-15 DOI: 10.1109/LCN.2007.22

I. W. Ho, K. Leung, J. Polak, R. Mangharam

{"title":"Node Connectivity in Vehicular Ad Hoc Networks with Structured Mobility","authors":"I. W. Ho, K. Leung, J. Polak, R. Mangharam","doi":"10.1109/LCN.2007.22","DOIUrl":"https://doi.org/10.1109/LCN.2007.22","url":null,"abstract":"Vehicular Ad hoc NETworks (VANETs) is a subclass of Mobile Ad hoc NETworks (MANETs). However, automotive ad hoc networks will behave in fundamentally different ways than the predominated models in MANET research. Driver behaviour, mobility constraints and high speeds create unique characteristics in the network. All of these constraints have implications on the VANET architecture at the physical, link, network, and application layers. To facilitate the cross-layer designs for VANETs, understanding of the relationship between mobility and network connectivity is of paramount importance. In this paper, we focus on studying transport systems with structured mobility (e.g., bus systems), which have unique characteristics on the road such as fixed routes that have never been explored in previous work. The main contributions of this paper are three-fold: 1) we provide an analytical framework including the design requirements of the mobility model for realistic vehicular network studies, and metrics for evaluating node connectivity in vehicular networks; 2) we demonstrate, through simulation, the impacts of marco- and micro-mobility models, and various transport elements on network connectivity; and 3) we show that multi-hop paths perform dramatically poorer than single-hop links in vehicular networks. Specifically, two- hop and three-hop (communication) paths can only respectively achieve less than 27% and 13% of the average duration of single-hop links. Such kind of knowledge of the performance of multi-hop transmission will be significant for the studies of routing algorithm and other networking functions in vehicular networks.","PeriodicalId":333233,"journal":{"name":"32nd IEEE Conference on Local Computer Networks (LCN 2007)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132470159","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}

引用次数: 66

Packet Filtering Based on Source Router Marking and Hop-Count 基于源路由器标记和跳数的包过滤

32nd IEEE Conference on Local Computer Networks (LCN 2007) Pub Date : 2007-10-15 DOI: 10.1109/LCN.2007.128

Kashif Ali, Mohammad Zulkernine, H. Hassanein

引用次数: 6

Towards Stateless Single-Packet IP Traceback 迈向无状态单包IP回溯

32nd IEEE Conference on Local Computer Networks (LCN 2007) Pub Date : 2007-10-15 DOI: 10.1109/LCN.2007.15

R. Laufer, P. B. Velloso, D. Cunha, I. Moraes, M. Bicudo, M. D. D. Moreira, O. Duarte

引用次数: 59