Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)最新文献_第7页

IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks WDM网状网络中SRLG不同路由的迭代启发式算法

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401627

A. Todimala, B. Ramamurthy

{"title":"IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks","authors":"A. Todimala, B. Ramamurthy","doi":"10.1109/ICCCN.2004.1401627","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401627","url":null,"abstract":"Survivable routing of a connection involves computation of a pair of diverse routes such that at most one route fails when failures occur in the network topology. A subset of links in the network that share the risk of failure at the same time are said to belong to a shared risk link group (SRLG) [J. Strand et al., Feb 2001]. A network with shared risk link groups defined over its links is an SRLG network. A failure of an SRLG is equivalent to the failure of all the links in the SRLG. For a connection to be survivable in an SRLG network, its working and protection paths must be routed on SRLG diverse paths. SRLG diverse routing problem has been proved to be NP-complete in J.Q. Hu (2003). According to the quality of service requirement of a survivable connection request, dedicated protection or shared protection can be used to establish the connection request. With dedicated protection, the connection is established on both the SRLG diverse working and protection paths. The simplest heuristic for computing SRLG diverse path pair is the two-step approach, but it suffers from the trap topology problem. In the previous study by Pin-Han Ho, an iterative heuristic (ITSH) using the two-step approach was proposed to compute the least cost SRLG diverse path pair. Suurballe's algorithm computes a pair of least cost link-disjoint paths between a node pair. In this work, we present a modified Suurballe's heuristic for computing the SRLG diverse routes between a node pair. We then propose an iterative heuristic (IMSH) which uses the modified Suurballe's heuristic for computing the least cost SRLG diverse routes. We also present an 1/2-cost-improvement optimality check criterion for dedicated protection","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"52 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":"124218203","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}

引用次数: 47

Optical network design with optical constraints in multi-hop WDM mesh networks 多跳WDM网状网络中具有光约束的光网络设计

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401694

Kwangil Lee, M. Shayman

引用次数: 8

Network adaptive packet scheduling for streaming video over error-prone networks 网络自适应分组调度的流视频在易出错的网络

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401637

Jong-ok Kim, H. Tode, K. Murakami

{"title":"Network adaptive packet scheduling for streaming video over error-prone networks","authors":"Jong-ok Kim, H. Tode, K. Murakami","doi":"10.1109/ICCCN.2004.1401637","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401637","url":null,"abstract":"In packet networks including the Internet and commercial 3G wireless bearers, network conditions that a streaming application experiences are not known a priori and exhibit time-varying characteristics. For such environments, network-adaptive techniques are important to efficiently stream video. In this paper, we propose an adaptive packet scheduling algorithm for streaming video over error-prone networks. A MAP (maximum a posteriori) framework is incorporated for adapting to time-varying network loss rate. By MAP-based dynamic network estimation, the proposed scheduler adaptively performs video packet transmissions over time-varying networks. Also, packet transmission schedules are optimally determined in a distortion-optimized way. For low computational complexity, the proposed packet scheduling algorithm is based on a new and simple distortion measure which is referred to the EFS (expected frame-rate reduction). Simulation results for standard video sequence show that the proposed scheduling outperforms conventional ARQ-based schemes from a view point of frame loss rate and reconstructed video quality. In particular, the proposed scheduling algorithm shows significant improvement over highly lossy channel","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"23 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":"125654433","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

An accounting management system building on network processor 基于网络处理器的会计管理系统

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401730

Jiang Liu, Tao He, Xing Li

引用次数: 0

Topology based packet marking 基于拓扑的分组标记

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401609

Basheer Al-Duwairi, Thomas E. Daniels

引用次数: 30

Multiobjective multicast routing algorithm for traffic engineering 交通工程中的多目标组播路由算法

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401652

J. Crichigno, B. Barán

引用次数: 63

A systematic approach for providing end-to-end probabilistic QoS guarantees 提供端到端概率QoS保证的系统方法

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401602

S. Ayyorgun, Wu-chun Feng

引用次数: 15

A mobility model for cost analysis in integrated cellular/WLANs 集成蜂窝/无线局域网成本分析的移动模型

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401646

N. Shenoy, Bruce Hartpence, R. Mantilla

{"title":"A mobility model for cost analysis in integrated cellular/WLANs","authors":"N. Shenoy, Bruce Hartpence, R. Mantilla","doi":"10.1109/ICCCN.2004.1401646","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401646","url":null,"abstract":"In this article, we propose a model that can be used to study the costs and benefits of integrating cellular and wireless LANs, from a vendor and a user perspective. We explain the model and the approach to calculate the costs for a simple handoff topology that supports a voice call across a cellular and a WLAN. The mobility model, which can be used to estimate the probability of a cellular user entering a WLAN while moving within the \"location area\" of the cellular network, is the main contribution of this work. The mobility model takes into account a normal user movement and a biased user movement based on a 2D random walk model. We show how this model could be used to study the costs and benefits to the vendor and the user, especially if a user were to be supported with call continuity across the two networks and the vendor had to bear the extra costs of handing over an active call. We have restricted our analysis to a scenario where the user with an active voice call moves from the cellular network to the WLAN. Graphs and discussions are provided to demonstrate the use of the model to study the integration benefits, from a vendor and a user perspective","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"5 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":"115448247","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}

引用次数: 19

CBRBrain: provide content based routing service over Internet backbone CBRBrain:在互联网主干上提供基于内容的路由服务

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401598

Wenzhan Song, Xiangyang Li

{"title":"CBRBrain: provide content based routing service over Internet backbone","authors":"Wenzhan Song, Xiangyang Li","doi":"10.1109/ICCCN.2004.1401598","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401598","url":null,"abstract":"Peer-to-peer (P2P) networking came from a family of technologies and techniques for organizing distributed applications that takes advantage of the resources available at the Internet edges. In this paper, we propose an innovative P2P system architecture, called CBRBrain, to implement the content based routing (CBR) service over the backbone routers instead of at the terminal hosts. Hence CBRBrain avoids some drawbacks in previous P2P systems and significantly improves the efficiency and security. Data locating process is easily implemented on CBRBrain by associating a hashed key with each data item and storing the (key, address) pair in routers. The cost for topology update is neglectful since the routers is almost static in the Internet and is not affected by the frequent joining and leaving of hosts at all. The traffic generated by CBRBrain system over the Internet is also expected to be significantly smaller as compared with the other P2P systems. The logical topology of CBRBrain backbone can be any self-routing structure to enable the content based routing service. In the paper, we recommend to construct the underlying logical topology based on the pseudo-balanced de Bruijn graph, since it has many nice properties such as bounded degrees, low diameters and fault tolerance. As an illustration, we describe the mechanism of P2P file sharing application under CBRBrain architecture. Our work is a first step in building an intelligent backbone of the next generation Internet and facilitates the emergence of various intelligent applications over the Internet besides P2P file sharing","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"4 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":"123482589","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

A comparison of TCP-friendly congestion control protocols tcp友好型拥塞控制协议的比较

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401641

Surekha Biyani, James J. Martin

引用次数: 4