2004 IEEE International Workshop on IP Operations and Management最新文献_第3页

IP/MPLS OAM: challenges and directions IP/MPLS OAM:挑战与方向

2004 IEEE International Workshop on IP Operations and Management Pub Date : 2004-10-11 DOI: 10.1109/IPOM.2004.1547584

P. Dini, M. Hasan, M. Morrow, G. Parr, P. Rolin

{"title":"IP/MPLS OAM: challenges and directions","authors":"P. Dini, M. Hasan, M. Morrow, G. Parr, P. Rolin","doi":"10.1109/IPOM.2004.1547584","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547584","url":null,"abstract":"This paper reflects different understandings and positions on IP/MPLS OAM functions and management applications, as perceived by representatives from industry and academia. There is a clear effort to improve the state-of-the-art and to apply lessons learnt from the Ethernet/ATM approaches. A series of questions on the short-term, mid-term and long-term directions definitively arises, especially with regard to the separation of control and management functions. The questions mentioned below do not exhaustively cover the topic. Instead, the questions serve as a starting point for a discussion on methodologies to apply, on engineering requirements to consider, and on the technical challenges to resolve harnessing this next stage of evolution of heterogeneous networking. The panel guests present their perception on these issues. What are the lessons learnt from ATM and Ethernet OAM techniques that are oriented to a single network technology? What is equivalent of OAM appropriate for IP/[G]MPLS (it has to be more at link level rather than connection level)? What MPLS MIB information is intended to support OAM functions? What are the challenges on OAM in hybrid and multi-layer networks? How management systems of next generation networks (NGN) and GRID networks make use of the OAM functions and what else is needed to smoothen the control-management interactions? What is the impact of convergent IP networking and autonomic networking on OAM functions and their distribution? How much proactiveness can management applications achieve with and without OAM functionalities.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125326754","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}

引用次数: 6

Peer-to-peer traffic measurement, analysis and management in an institutional network 机构网络中的点对点流量测量、分析和管理

2004 IEEE International Workshop on IP Operations and Management Pub Date : 2004-10-11 DOI: 10.1109/IPOM.2004.1547612

A. M. Guirado-Puerta, J. Malgosa-Sanahuja, J. García-Haro, P. Manzanares-Lopez, J. Sánchez-Aarnoutse

引用次数: 1

The benefits of monitoring routing protocols in live networks 在实时网络中监视路由协议的好处

2004 IEEE International Workshop on IP Operations and Management Pub Date : 2004-10-11 DOI: 10.1109/IPOM.2004.1547585

N. Dubois, M. Capelle, S. Chou, B. Fondeviole

引用次数: 1

Performance optimizations for certificate revocation 证书撤销的性能优化

2004 IEEE International Workshop on IP Operations and Management Pub Date : 2004-10-11 DOI: 10.1109/IPOM.2004.1547598

Bao-Hong Li, Yinliang Zhao, Yi-Bin Hou

引用次数: 0

Novel disjoint-LSP selection scheme with SRLG in GMPLS-based networks 基于gmpls网络的SRLG分离lsp选择新方案

2004 IEEE International Workshop on IP Operations and Management Pub Date : 2004-10-11 DOI: 10.1109/IPOM.2004.1547610

Qing Huang, G. Kuo

引用次数: 2

The analysis of algorithm for efficient network flow monitoring 高效网络流量监控算法分析

2004 IEEE International Workshop on IP Operations and Management Pub Date : 2004-10-11 DOI: 10.1109/IPOM.2004.1547588

Liu Xianghui, Yin Jianping

引用次数: 6

Streamlining traceroute by estimating path lengths 通过估计路径长度简化跟踪路线

2004 IEEE International Workshop on IP Operations and Management Pub Date : 2004-10-11 DOI: 10.1109/IPOM.2004.1547603

T. Moors

{"title":"Streamlining traceroute by estimating path lengths","authors":"T. Moors","doi":"10.1109/IPOM.2004.1547603","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547603","url":null,"abstract":"Traditional traceroute determines the path through a network by sending probe packets with progressively increasing TTL/hop count values so that routers that are progressively further from the inquirer send ICMP time exceeded messages and so reveal their identity. This process can be slow (because traceroute must wait for a timeout or response to one probe before sending the next) and inefficient (through repeated probing of routers near the inquirer that lie on the intersection of paths leading to multiple targets). This paper shows how this process can be streamlined by the inquirer sending a scout packet to the (reachable) target before sending route tracing probes. The inquirer uses the TTL of the response to this scout packet to estimate the length of the path to the target (with tolerance for path asymmetry), and can then either expedite the route tracing process (by sending probes to each of the estimated number of routers on the path in quick succession) or reduce the number of probes needed (by inverting the direction of traditional traceroute, tracing the path from the target towards the inquirer, and terminating the process when it reaches a router on a known path from the inquirer).","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134271732","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}

引用次数: 16

Enhanced MAC architecture for differentiated services in IEEE 802.11 WLAN 增强MAC架构，支持IEEE 802.11 WLAN的差异化业务

2004 IEEE International Workshop on IP Operations and Management Pub Date : 2004-10-11 DOI: 10.1109/IPOM.2004.1547619

Yanlei Shang, W. Guo, Shiduan Cheng, Biao Ren, Fei Wang

引用次数: 0

Mapping sub-flows to p2mp LSPs 将子流映射到p2mp lsp

2004 IEEE International Workshop on IP Operations and Management Pub Date : 2004-10-11 DOI: 10.1109/IPOM.2004.1547594

F. Solano, R. Fabregat, Y. Donoso, J. Marzo

引用次数: 1

Multicommodity flow optimization in support for packet-switched network traffic engineering 支持分组交换网络流量工程的多商品流优化

2004 IEEE International Workshop on IP Operations and Management Pub Date : 2004-10-11 DOI: 10.1109/IPOM.2004.1547587

Tze-Ven Poh, Jing Jiang, M. Reed

{"title":"Multicommodity flow optimization in support for packet-switched network traffic engineering","authors":"Tze-Ven Poh, Jing Jiang, M. Reed","doi":"10.1109/IPOM.2004.1547587","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547587","url":null,"abstract":"Many contemporary IP routing protocols are based on algorithms that are non-traffic-aware. The chief problem is that very often many comparable traffic flows are misled to converge on bottleneck links since these algorithms are oblivious to traffic characteristics and link loading. One possible remedy to this is to reconstitute them with a better algorithm. We recommend the maximum concurrent multicommodity flow (MCMF) algorithm. It considers traffic demands, network topology and resources in its computation to generate an optimal solution that satisfies all traffic demands as much and as fairly as possible while not overusing the resources. It does this by spreading traffic load across all feasible links in the network. In simpler terms it means placing traffic where the capacity exists. We develop a basic traffic engineering framework that shows how the MCMF algorithm can be applied. There exists numerous algorithms for solving this kind of problem. But this paper focuses particularly on a fully polynomial time approximation scheme (FPTAS), namely, the Garg-Konemann (1997) algorithm. However, its convergence rate is inconsistent due to its dependency on initial guess of a crucial parameter. We extend this algorithm in order to eliminate this issue and include empirical results that demonstrate its superiority over the original version. We conclude our paper with our opinion whether if the algorithm is fast enough to qualify as an on-line IP routing engine.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114395463","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}

引用次数: 4