{"title":"QoS provisioning to mobile Internet users","authors":"S. Lepaja, R. Fleck, R. Donner, Nguyen Nam Hoang","doi":"10.1109/ECUMN.2002.1002110","DOIUrl":"https://doi.org/10.1109/ECUMN.2002.1002110","url":null,"abstract":"Issues of QoS provisioning to mobile Internet users are discussed. Particularly, QoS signaling for seamless handover is investigated. In order to meet mobile user's QoS requirements for real-time applications, a new protocol is proposed. The proposed protocol is based on an existing flow transparent Mobile IP and RSVP (resource reservation protocol) interworking scheme and can be considered as its extension for meshed access network topologies. The basic idea of our proposal is to use the previous access router(s) as a nearest common router (NCR) for the old and the new added flow path. Performance evaluations, in terms of RSVP signaling delay and the maximum allowed delay for QoS provisioning, show that the proposed protocol leads to improvements for meshed access networks.","PeriodicalId":398555,"journal":{"name":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127529774","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 routing and wavelength assignment algorithms for multifiber WDM networks with many wavelengths","authors":"Jong-Seon Kim, Daniel C. Lee","doi":"10.1109/ECUMN.2002.1002104","DOIUrl":"https://doi.org/10.1109/ECUMN.2002.1002104","url":null,"abstract":"We propose two dynamic RWA algorithms, the maximum-channel-path routing (MCPR) and the least utilized path routing (LUPR), which are suitable for multifiber WDM networks with many wavelengths available. Through our simulations on two network topologies, we compare the blocking probability of our proposed algorithms with the least-loaded routing (LLR) and the SPREAD, which has lower blocking probability than their predecessors. The proposed MCPR and the LUPR algorithms show lower blocking probability compared to the LLR algorithm. Our algorithms have higher blocking probability than SPREAD when the number of wavelengths per fiber is small, but they achieve more rapid improvement in blocking probability as the number of wavelengths per fiber increases. For sufficiently large number of wavelengths per fiber, MCPR yields blocking probability lower than SPREAD, and LUPR performs better than or similar to SPREAD, depending on the network topology. We believe that the reason is because MCPR and LUPR give preference to a path with more wavelengths available. Moreover, while the SPREAD algorithm considers all paths in the network to find the shortest path for an source-destination pair, our proposed algorithms search only the pre-determined paths, so their computational complexity is much less than that of SPREAD.","PeriodicalId":398555,"journal":{"name":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128330056","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":"Charging and accounting system design for the multi-service Internet","authors":"H. Kim","doi":"10.1109/ECUMN.2002.1002090","DOIUrl":"https://doi.org/10.1109/ECUMN.2002.1002090","url":null,"abstract":"This paper is a tutorial about Internet accounting and charging and discusses current works for designing and implementing a next-generation accounting and charging system in the multi-service Internet. We recognize that the multi-service Internet is becoming practical and available, and the currently deployed accounting and charging system in the network is not appropriate in the multi-service Internet environment, such as E-commerce and multimedia services. So, further research for multi-service Internet accounting and charging will lead us to develop the accounting and charging in the next-generation network.","PeriodicalId":398555,"journal":{"name":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125542498","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":"An access protocol for use with a wide range of network environments","authors":"E. Foudriat, K. Maly, S. Olariu, Ying Li","doi":"10.1109/ECUMN.2002.1002113","DOIUrl":"https://doi.org/10.1109/ECUMN.2002.1002113","url":null,"abstract":"This paper describes a versatile media access network protocol - H3M. The H3M (Heterogeneous, Hierarchical, Highly Mobile) architecture incorporates within its structure both synchronous and asynchronous message handling; two mechanisms of effective capacity utilization and recovery (1) dynamic subframe switching and variable frequency, and (2) variable bandwidth software radio transceivers; the ability to operate with minimal routing protocols; and minimal control signaling and switching. Interconnection and interfacing with other protocols such as ATM and Ethernet is almost transparent and can be done with minimal repacketing. Further, H3M can be used in wired local area networks, can use WAN to interconnect effectively to distributed H3M network clusters, and can be adapted with minor modifications to be used in aircraft and near-Earth satellite communication networks. In this paper, we discuss H3M's versatility and present simulator performance information which demonstrates that it can deliver needed QoS for both synchronous and asynchronous messages over a wide range of load conditions.","PeriodicalId":398555,"journal":{"name":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","volume":"481 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122186126","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":"Label space reduction in multipoint-to-point LSPs for traffic engineering","authors":"S. Bhatnagar, S. Ganguly, B. Nath","doi":"10.1109/ECUMN.2002.1002086","DOIUrl":"https://doi.org/10.1109/ECUMN.2002.1002086","url":null,"abstract":"Many ISPs use MPLS for traffic engineering to account for and utilize their resources properly. A fundamental problem in MPLS is to reduce the label space usage by label switched paths (LSPs), while meeting the flow requirements. While routing mechanisms have been proposed in the context of minimizing point-to-point LSPs, the problem has not gained sufficient attention with respect to multipoint-to-point LSP trees. We propose two mechanisms to reduce the label space usage of multipoint-to-point LSPs. First, given a set of LSPs to meet flow demands, we propose a simple algorithm to merge these LSPs into a minimal number of egress rooted multipoint-to-point trees. Then we show a mechanism where we try to fit a maximal number of flows in a single egress rooted multipoint-to-point LSP. We evaluate our methods on real world topologies and traffic patterns and show their effectiveness.","PeriodicalId":398555,"journal":{"name":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124001990","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":"An introduction to IP multicast traffic engineering","authors":"C. Jacquenet, C. Proust","doi":"10.1109/ECUMN.2002.1002114","DOIUrl":"https://doi.org/10.1109/ECUMN.2002.1002114","url":null,"abstract":"In this paper, we discuss the use of IP traffic engineering (TE) capabilities for the deployment and the maintenance of multicast distribution trees along paths that will comply with specific quality of service (QoS) requirements, expressed by parameters like the loss rate or the interpacket delay variation. Such parameters aim at reflecting the level of quality associated to the. provisioning of services that can naturally benefit from the IP multicast transmission scheme, such as TV/radio broadcasting or videoconferencing. The deployment of these services over the Internet is therefore conditioned by the provider's capacity to allocate the appropriate resources accordingly. We propose a generic framework for the enforcement of QoS-based multicast traffic engineering policies, within the context of services that rely upon a \"one-to-many\" group communication scheme. This approach includes the use of enhanced multicast-enabled routers currently under development. We also introduce a discussion on the dynamic provisioning of the QoS requirements that will depict the expected level of quality associated with the deployment of IP multicast-based services.","PeriodicalId":398555,"journal":{"name":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132240156","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":"Ecomobile: a mobile agent ecosystem for distributed network management","authors":"D. Rossier, R. Scheurer","doi":"10.1109/ECUMN.2002.1002099","DOIUrl":"https://doi.org/10.1109/ECUMN.2002.1002099","url":null,"abstract":"The growing demand for Internet services and the future multi-layer telecommunication networks makes network management tasks more and more difficult to handle. Mobile software agents constitute an emerging and promising technology which is particularly well-suited to inherently distributed tasks. Several open issues regarding agent behavior, population size, task design, etc. however remain to be studied before a powerful mobile multi-agent system can be widely deployed. This paper presents Ecomobile, a mobile agent middleware, which is self-regulated and dynamically controlled with respect to real network conditions. Network management tasks, such as path allocation, monitoring or routing, can be implemented by means of a new computing and mobility model.","PeriodicalId":398555,"journal":{"name":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128262469","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":"The mille feuilles: a routing algorithm for packet networks and circuit switched networks","authors":"M. Rombaut, G. Hébuterne, M. Priem","doi":"10.1109/ECUMN.2002.1002083","DOIUrl":"https://doi.org/10.1109/ECUMN.2002.1002083","url":null,"abstract":"We present an heuristic method to compute a centralized routing scheme, that permits decreasing the maximal link load and improving the network reliability, when the flow matrix changes and when a link failure occurs on the network. The complexity of this algorithm can be compared to the complexity of the usual disjoint routing methods. The tests seem to show that the improvement is good whatever is the number of nodes of the network; it remains to confirm this improvement by analyzing larger graphs (1000 or 2000 nodes).","PeriodicalId":398555,"journal":{"name":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126280961","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":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","authors":"A. Matrawy, I. Lambadaris, C. Huang","doi":"10.1109/ECUMN.2002.1002082","DOIUrl":"https://doi.org/10.1109/ECUMN.2002.1002082","url":null,"abstract":"The following topics are dealt with: routing; multimedia; network performance; differentiated services; active networks; network design; mobile networks; multicast; next generation networks.","PeriodicalId":398555,"journal":{"name":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122661323","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}