Proceedings. Eleventh International Conference on Computer Communications and Networks最新文献_第7页

Design and reconfiguration of virtual private networks (VPNs) over all-optical WDM networks 全光WDM网络上虚拟专用网(vpn)的设计与重构

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043133

Jun Zheng, Bin Zhou, H. Mouftah

引用次数: 6

A design and implementation of active network socket programming 一个主动网络套接字编程的设计与实现

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043049

K. Law, R. Leung

{"title":"A design and implementation of active network socket programming","authors":"K. Law, R. Leung","doi":"10.1109/ICCCN.2002.1043049","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043049","url":null,"abstract":"The concept of programmable nodes and active networks introduces programmability into communication networks. Code and data can be sent and modified on their routes to the destinations. Various research groups have designed and implemented their own design platforms. Each design has its own benefits and drawbacks. Moreover, there exists an interoperability problem among platforms. As a result, we introduce a concept that is similar to network socket programming. We intentionally establish a set of simple interfaces for programming active applications. This set of interfaces, known as active network socket programming (ANSP), will be working on top of all other execution environments in the future. Therefore, the ANSP offers a concept that is similar to \"write once, run everywhere\". It is an open programming model that active applications can work on all execution environments. It solves the heterogeneity within active networks. This is especially useful when active applications need to access all regions within a heterogeneous network to deploy a special service at critical points or to monitor the performance of the entire networks. Instead of introducing a new platform, our approach provides a thin, transparent layer on top of existing environments that can be easily installed for all active applications.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116734988","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}

引用次数: 14

Resource allocation for quality of service provision in buffered crossbar switches 在缓冲交叉交换器中为服务质量提供资源分配

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043115

Qiang Duan, John N. Daigle

引用次数: 4

Routing metrics for best-effort traffic 最佳流量的路由指标

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043132

S. Gokhale, S. Tripathi

{"title":"Routing metrics for best-effort traffic","authors":"S. Gokhale, S. Tripathi","doi":"10.1109/ICCCN.2002.1043132","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043132","url":null,"abstract":"Most of the QoS routing research in the literature attempts to increase the performance of QoS traffic without explicitly considering the performance of the best-effort traffic in the network. However, although the trend in the development and use of real-time multimedia applications is on the rise, traditional data applications are still expected to be a dominant percentage of the Internet traffic. Developing routing schemes for best-effort traffic when it coexists with QoS traffic to provide an acceptable performance to the best-effort traffic is thus critical. In this paper we study the effectiveness of the link utilization metric for routing best-effort traffic in a network that supports both QoS as well as best-effort traffic. The main contribution of this paper lies in demonstrating the feasibility of using the link utilization metric and quantifying the improvement in performance so obtained under various distributions of network load. Our results indicate that utilization based routing of best-effort traffic dynamically adapts to the distribution of the QoS traffic in the network, and demonstrates a significant improvement in the performance of best-effort traffic, when compared to the performance obtained by routing best-effort traffic using the static hop count metric.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"1943 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129144103","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}

引用次数: 7

Traffic grooming for minimizing wavelength usage in WDM networks 在WDM网络中减少波长使用的流量疏导

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043106

Deying Li, Zhenqiang Sun, X. Jia, S. Makki

引用次数: 25

Power-aware routing based on the energy drain rate for mobile ad hoc networks 基于能量损耗率的移动自组织网络的功率感知路由

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043126

Dongkyun Kim, J. Garcia-Luna-Aceves, K. Obraczka, Juan-Carlos Cano, P. Manzoni

引用次数: 149

On the transient behavior of TCP Vegas TCP Vegas的瞬态行为研究

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043114

Sarut Vanichpun, Wu-chun Feng

引用次数: 12

Forward-only uni-directional routing 单向正向路由

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043093

J. Cobb

引用次数: 3

R and D priorities and challenges for optical networking 光网络的研发重点和挑战

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043134

B. Mukherjee

{"title":"R and D priorities and challenges for optical networking","authors":"B. Mukherjee","doi":"10.1109/ICCCN.2002.1043134","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043134","url":null,"abstract":"Summary form only given. Today, the telecommunication industry is experiencing \"a nuclear winter\". It is a challenging proposition right now to debate research and development (R and D) priorities for optical networking. However, even though the telecommunication market is unsettled today, we need to be ready with appropriate technological solutions to meet the growing bandwidth needs of our information society. Optical networking - using wavelength-division multiplexing (WDM) - is the technology for meeting these demands. While there is a glut of dark fiber and WDM transmission capacity today, we believe that there will be a tremendous need for optical switching equipment for managing high-capacity optical signals. This talk first makes the case for the important role software plays in bringing cost-effective and intelligent optical networking to the marketplace. After providing an overview of telecommunication networks, we discuss promising R and D challenges for optical networking in access and metropolitan areas. Then, we examine the near-term R and D challenges for backbone optical networks: namely, dynamic provisioning of high-capacity connections of different bandwidths, fault management, and topology engineering. Finally, we state R and D priorities over a longer-term horizon.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"34 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131501604","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}

引用次数: 1

COPAS: dynamic contention-balancing to enhance the performance of TCP over multi-hop wireless networks COPAS:动态竞争平衡，提高TCP在多跳无线网络上的性能

Proceedings. Eleventh International Conference on Computer Communications and Networks Pub Date : 2002-12-10 DOI: 10.1109/ICCCN.2002.1043095

C. Cordeiro, Samir R Das, D. Agrawal

{"title":"COPAS: dynamic contention-balancing to enhance the performance of TCP over multi-hop wireless networks","authors":"C. Cordeiro, Samir R Das, D. Agrawal","doi":"10.1109/ICCCN.2002.1043095","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043095","url":null,"abstract":"Most studies on TCP over multi-hop wireless ad hoc networks have only addressed the issue of performance degradation due to temporarily broken routes, which results in TCP inability to distinguish between losses due to link failures or congestion. This problem tends to become more serious as network mobility increases. We tackle the equally important capture problem to which there has been little or no solution, and is present mostly in static and low mobility multihop wireless networks. This is a result of the interplay between the MAC layer and TCP backoff policies, which causes nodes to unfairly capture the wireless shared medium, hence preventing neighboring nodes to access the channel. This has been shown to have major negative effects on TCP performance comparable to the impact of mobility. We propose a novel algorithm, called COPAS (COntention-based PAth Selection), which incorporates two mechanisms to enhance TCP performance by avoiding capture conditions. First, it uses disjoint forward (sender to receiver for TCP data) and reverse (receiver to sender for TCP ACKs) paths in order to minimize the conflicts of TCP data and ACK packets. Second, COPAS employs a dynamic contention-balancing scheme where it continuously monitors and changes forward and reverse paths according to the level of MAC layer contention, hence minimizing the likelihood of capture. Through extensive simulation, COPAS is shown to improve TCP throughput by up to 90% while keeping routing overhead low.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133708759","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}

引用次数: 71