{"title":"Variable bit rate packet data over the WCDMA uplink","authors":"P. Das, J. Khan","doi":"10.1109/ICON.2003.1266258","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266258","url":null,"abstract":"This paper presents a comprehensive packet data transmission strategy for the WCDMA uplink with quality of service control for multimedia traffic. A centralised admission controller with a noise rise target is used to admit new users into the uplink. A state-based rate scheduler determines the transmission rate to be employed for each schedule period depending on the input buffer size and the channel condition. In addition, the use of a transmission rate variability profile for each user is proposed with a dual purpose. The profile ensures that a user adheres to the carrier to total interference target negotiated during admission though the transmission rate is adapted to match input data rates. Secondly, the profile is used to estimate the spare capacity that would be necessary to provide limited throughput variability to variable bit rate users (VBR). All VBR users share the spare capacity in the system to improve channel utilisation efficiency.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122308918","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":"Paging extension for hierarchical mobile IPv6: P-HMIPv6","authors":"Jun-seob Lee, J. Min, Ki-Shik Park, Sang-Ha Kim","doi":"10.1109/ICON.2003.1266197","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266197","url":null,"abstract":"IP-based mobility management is considered as core technology in the next generation network environment since the core network is moving toward all IP network and IP-based wireless LANs are blooming. Mobile IPv6 is developed to support mobility in global network, and hierarchical mobile IPv6 is being considered as a local mobility management protocol to reduce signaling overhead for mobility management in the global network. However, they seem to be designed without paging technology, which allows reducing signaling overhead within the access network for mobility management. In this paper, we propose the P-HMIPv6 which enables IP paging service in the hierarchical mobile IPv6 to reduce signaling overhead for local mobility management in the MAP domain of the hierarchical mobile IPv6.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126610895","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}
Yusheng Ji, T. Fujino, S. Abe, J. Matsukata, S. Asano
{"title":"On the impact of time scales on tail behavior of long-range dependent Internet traffic","authors":"Yusheng Ji, T. Fujino, S. Abe, J. Matsukata, S. Asano","doi":"10.1109/ICON.2003.1266160","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266160","url":null,"abstract":"Conventionally, Internet traffic has been modeled using classical Poisson-based models. More recent studies have proposed fractal models such as fractional Brownian motion. However, due to its simplicity, fractional Brownian motion is only efficient for approximating the performance of a class of exactly self-similar traffic, whose correlation property can be described by a single Hurst parameter. In this paper, we examine the tail behavior of long-range dependent Internet traffic, which has a more general correlation property. We propose an analytical method by focusing on the impact of time scales on queueing performance. The properties of traffic data are extracted from traffic traces of real networks, such as a wide area backbone network and a LAN. Results produced by simulation using real traffic data are compared with analytical results obtained by our method.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116584814","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}
T. Kitani, Masataka Yonedu, N. Funabiki, Tom Nakanishi, K. Okayama, T. Higashino
{"title":"A two-stage hierarchical algorithm for wavelength assignment in WDM-based Bidirectional Manhattan Street Networks","authors":"T. Kitani, Masataka Yonedu, N. Funabiki, Tom Nakanishi, K. Okayama, T. Higashino","doi":"10.1109/ICON.2003.1266227","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266227","url":null,"abstract":"Wavelength Division Multiplexing (WDM) technology provides a wideband communication networks by realizing multiple communication channels with different wavelengths on a single optical fiber. In this technology, each node (wavelength router) has a finite number of transmitters/receivers dealing with different wavelengths, where each wavelength is exclusively used for the communication channel between a specific pair of nodes. Thus, some transmission request may require multiple wavelengths going through several nodes before reaching its destination. As a result, the wavelength assignment to nodes is very important for efficient transmission in WDM-based networks. Among regular wavelength assignment topologies, Bidirectional Manhattan Street Network (BMSN) gives high performance to WDM-based networks. In this paper, we present a two-stage heuristic algorithm for the wavelength assignment in BMSN, called a HIWAS (HIerarchical Wavelength ASsignment algorithm for BMSN). The first stage of HIWAS finds an initial wavelength assignment hierarchically, not only to avoid a local minimum as best as possible but also to reduce the time complexity. The second stage improves the wavelength assignment by adopting the simulated annealing. The performance of HIWAS is verified through solving two types of random instances, where HIWAS provides a better solution with a shorter time than the bestknown existing algorithm.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134156022","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":"Connection admission control - closing the loop","authors":"Guoqiang Mao, D. Habibi","doi":"10.1109/ICON.2003.1266219","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266219","url":null,"abstract":"To date, many connection admission control (CAC) schemes have been proposed. These schemes can be generally classified into two categories: measurement-based CAC and traffic descriptor-based CAC. Both categories adopt an open-loop architecture where traffic parameters are obtained from either on-line measurements or user-specifications and then input into a chosen traffic and network model to make connection admission decisions. No performance feedback is provided to the CAC scheme. However, no traffic model can be claimed to be accurate for all traffic sources (e.g. voice traffic, data traffic, video traffic) under all network scenarios (e.g. heavy traffic scenario or light traffic scenario). Modelling errors and traffic parameter errors are inevitable. An open-loop CAC scheme lacks the ability to account for modelling errors and adapt to changing network conditions to achieve an optimum performance. In this paper, we proposed a closed-loop architecture for connection admission control. The implementation of the closed-loop architecture in designing a closed-loop CAC scheme is illustrated. Simulation results indicate that the closed-loop architecture is able to overcome the inherent drawbacks of an open-loop CAC scheme to achieve better performance.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128445322","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 new model for network traffic based on alpha-stable self-similar processes","authors":"Ge Xiaohu, Zhu Guangxi, Zhu Yaoting","doi":"10.1109/ICON.2003.1266158","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266158","url":null,"abstract":"This paper proposes a new network traffic model based on alpha-stable processes. Then the traces of three different self-similar models are simulated. Comparing the traces of the simulation data and the trace of the actual data, it is shown that the new model is better than the other models in fitting with the actual data.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129394397","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":"MIP3S: algorithms for power-conserving multicasting in static wireless ad hoc networks","authors":"P. Mavinkurve, H. Ngo, Himanshu Mehra","doi":"10.1109/ICON.2003.1266181","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266181","url":null,"abstract":"In a static ad hoc wireless network, given a distinguished source node, and a subset of nodes called multicast group members, the minimum-energy multicast problem is to assign appropriate power levels to nodes in the network so that all group members are reachable from the source, and that the total power usage is as small as possible. In the centralized version of the problem, one finds such power assignment given the entire network topology. In the distributed version, a power assignment is found by exchanging information between neighboring nodes. In this paper, we proposed new algorithms based on the idea of multicast incremental power with potential power saving (MIP3S). Simulations show that the new algorithms work better than all known algorithms. Different versions of this idea, when made distributive, are of different time and message complexities, imposing an interesting trade-off in total saving in power and other complexity measures.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127929598","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":"Peer-to-peer protocol evaluation in topologies resembling wireless networks. An experiment with Gnutella query engine","authors":"B. Bakos, Gergely Csúcs, L. Farkas, J. Nurminen","doi":"10.1109/ICON.2003.1266268","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266268","url":null,"abstract":"Peer-tepeer (P2P) protocols implemented in wireless networks and mixed scenarios would generate new applications and value added services. In order to analyze the performance of such protocols the specific topologies of current and future wireless networks should be taken into account. In our paper we analyze the performance of a Gnutella-type protocol query engine on random mesh (Random), semi-random mesh (Semi), connected stars (ConStan) and connected mesh (ConMesh) application layer network topologies. In addition we discuss and simulate for the considered topologies the effect of adaptive time-twlive (TTL) techniques. We take into account in our analysis the document replication phenomenon. Within this paper we limit ourselves to the simulation of static network topologies. The results of this study show that Semi and ConStan are the most useful topologies. Semi is the hest topology for heterogeneous devices, e.g. all of the nodes are mobile phones. ConStars is useful when the network consists of devices with dilferent capabilities, e.g. mobile phones and PC-s. If the node degrees are chosen appropriately the bandwidth needs can reasonably small making content sharing peer-twpeer applications feasible in pure wireless networks and mixed scenarios.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127509478","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 content-access QoS for various dissemination strategies in peer to peer networks","authors":"L. Lancérica, L. Dairaine, J. Lacan","doi":"10.1109/ICON.2003.1266213","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266213","url":null,"abstract":"Peer to peer (P2P) Network is a high level logical network architecture build over end-user nodes interconnected by a physical network infrastructure. The main interest of their distributed structure is to avoid any centralized point. However, this structure makes difficult the evaluation of the global properties of the network. In the present effort, we propose a method to evaluate quality of service (QoS) for the content access in P2P networks. This method, based on bandwidth distribution evaluation, allows determining statistical content-access QoS guarantees in function of both the level of content replication in the network and the strategies of file dissemination. An implementation of this model, based on real bandwidth measurements on the Gnutella network, is proposed. Three dissemination strategies are evaluated: simple file replication, block file replication, and erasure-encoded (often called forward error correction (FEC) code) block replication. The results shows that statistical QoS guarantees can be provided by controlling the various dissemination parameters, and illustrates the interest of the FEC-based strategy. A simple application in the context of media streaming is finally proposed.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125009257","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":"Enabling location-based services on wireless LANs","authors":"Yen-Cheng Chen, Yao-Jung Chan, Cheung-Wo She","doi":"10.1109/ICON.2003.1266251","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266251","url":null,"abstract":"The wide deployment of IEEE 802.11 Wireless Local Area Networks (WLANs) has made possible the development of application services on WLANs. Due to the small cell size in WLANs, it is practical to develop location dependent services based upon the awareness of the WLAN access points (AP) that mobile devices currently access. In this paper, we propose a location determination technique using the inherent SNMP support in WLAN APs. It is shown that the location of a mobile device can be determined effectively from the SNMP traps sent by APs. Our SNMP-based approach doesn’t need any particular software or hardware in mobile devices. This paper also considers how to determine the location of a mobile device by its IP address. In general, only the IP address of a mobile device can be seen by location-based services. However, APs identify each mobile device by its MAC address. Hence, we propose effective techniques for the mappings between IP addresses and MAC addresses. Through the address mappings, the location of a mobile device can be determined by its current IP address. We further propose a web service framework to enable WLAN location-based services in WWW environments. To verify our approach, we also develop a location-based campus map service based on the web service framework.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124631697","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}