发布求助
文献互助 智能选刊 最新文献

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium最新文献

筛选
英文 中文
A client-driven Mobility Frame System - mobility management from a new point of view 一个客户驱动的移动框架系统——从一个新的角度来看移动管理
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763674
P. Fulop, Benedek Kovács, S. Imre
{"title":"A client-driven Mobility Frame System - mobility management from a new point of view","authors":"P. Fulop, Benedek Kovács, S. Imre","doi":"10.1109/NETWKS.2008.4763674","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763674","url":null,"abstract":"In this paper a new mobility management approach is introduced. The main idea in this approach that not the network but the mobil node should manage the mobility for itself (similarly to the IP concept). The network nodes provides just basic services for mobile entities: connectivity and administration. We construct a protocol called the Client-based Mobility Frame System (CMFS) for this mobility environment. We propose some basic mobility management solutions that should be implemented into the mobile clients and give detail about a working simulation of a complete Mobility Management System. Example mobility management approaches such as the centralized- and hierarchical-or cellular-like ones are also defined and hints are given what kind of algorithms might be implemented upon the Client-based Mobility Frame System. After the theoretical analysis a simulation shows us the applicability of the newly introduced protocol framework.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127818870","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}
引用次数: 2
Distributed fault localization for multi-domain all-optical networks without power monitoring 无电源监测的多域全光网络分布式故障定位
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 2008-09-01 DOI: 10.1109/NETWKS.2008.4763710
M. Khair, Jun Zheng, H. Mouftah
{"title":"Distributed fault localization for multi-domain all-optical networks without power monitoring","authors":"M. Khair, Jun Zheng, H. Mouftah","doi":"10.1109/NETWKS.2008.4763710","DOIUrl":"https://doi.org/10.1109/NETWKS.2008.4763710","url":null,"abstract":"In this paper, we propose a distributed fault localization protocol for localizing single-link failures in all-optical multi-domain networks. The protocol is based on a limited-perimeter vector matching (LVM) mechanism, which restricts fault localization within a smaller perimeter area and can thus significantly reduce fault localization time. By performing a fault localization process sequentially in the optical domains that an affected lightpath passes through, the protocol can localize both inter-domain and intra-domain link failures that affect inter-domain traffic without exchanging any internal confidential domain-specific information between different domains. We show through analytical results that it can not only fast localize an inter-domain link failure between different domains but also localize an intra-domain link failure that affects inter-domain traffic faster than the Open-Shortest-Path-First (OSPF) protocol in a large network.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129240899","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}
引用次数: 2
Hasslinger 2nd part 哈斯林格第二部分
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 1900-01-01 DOI: 10.1109/netwks.2008.6231390
G. Haßlinger
{"title":"Hasslinger 2nd part","authors":"G. Haßlinger","doi":"10.1109/netwks.2008.6231390","DOIUrl":"https://doi.org/10.1109/netwks.2008.6231390","url":null,"abstract":"","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"20 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":"132961624","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}
引用次数: 0
Method for rapid recovery path computation on mesh IP network 网状IP网络快速恢复路径计算方法
Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium Pub Date : 1900-01-01 DOI: 10.1109/netwks.2008.6231350
Masayuki Tsujino, R. Matsumura, M. Inoue, M. Iwashita
{"title":"Method for rapid recovery path computation on mesh IP network","authors":"Masayuki Tsujino, R. Matsumura, M. Inoue, M. Iwashita","doi":"10.1109/netwks.2008.6231350","DOIUrl":"https://doi.org/10.1109/netwks.2008.6231350","url":null,"abstract":"We focus on a method of computing recovery path routes in a mesh IP network, which is expected to be used when unforeseen massive failure or disaster occurs. We introduce the concept of “path-group” to differentiate recovered paths according to their priority. We assign a priority to a path-group in the concept. The routes for path-groups are computed for recovery in the order of their priority. The heuristic path-group computation algorithm based on the column-generation approach is applied to a nationwide network in the field that has a typical scale. We evaluate the algorithm in terms of the time taken to compute recovery path routes. In this paper, we provide experimental simulation results under various network conditions to show the feasibility of the heuristic algorithm.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"394 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":"133895897","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}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信