The 11th IEEE International Conference on Networks, 2003. ICON2003.最新文献

筛选
英文 中文
High performance optical Internet backbones with mesh topologies 具有网状拓扑结构的高性能光学互联网骨干网
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266216
Rui M. F. Coelho, J. Rodrigues, M. Freire
{"title":"High performance optical Internet backbones with mesh topologies","authors":"Rui M. F. Coelho, J. Rodrigues, M. Freire","doi":"10.1109/ICON.2003.1266216","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266216","url":null,"abstract":"In this paper, we present a performance analysis of WDM-based networks with mesh-topologies of nodal degrees ranging from two to five. It is shown that the increase of the nodal degree from two to three leads to high nodal degree gains, while the increase of the nodal degree from four to five leads to small nodal degree gains. These results make mesh topologies with nodal degrees of three and four very attractive for WDM networks.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123060069","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
Degree distribution and hopcount in wireless ad-hoc networks 无线自组网中的度分布和跳数
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266257
R. Hekmat, P. Mieghem
{"title":"Degree distribution and hopcount in wireless ad-hoc networks","authors":"R. Hekmat, P. Mieghem","doi":"10.1109/ICON.2003.1266257","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266257","url":null,"abstract":"This article is a contribution to mathematical modeling and better understanding of fundamental properties of wireless ad-hoc networks. Our focus in this article is on the degree distribution and hopcount in these networks. The results presented here are useful in the study of connectivity and estimation of the capacity in ad-hoc networks. We model a wireless ad-hoc network as an undirected geometric random graph. For the calculation of the link probability between nodes we have suggested to use a realistic radio model; the socalled log-normal shadowing model. Through a combination of mathematical modeling and simulations we have shown that the degree distribution in wireless ad-hoc networks is binomial for low values of the mean degree. Further, we have investigated the hopcount and have shown that the hopcount in wireless adhoc networks can vary between the expected values for lattice networks and random graphs, depending on radio propagation conditions.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127666342","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}
引用次数: 111
Call admission control for video phone applications 视频电话应用的呼叫准入控制
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266208
Paul Hatalsky, Hugh M. Smith, Matthew Carlton
{"title":"Call admission control for video phone applications","authors":"Paul Hatalsky, Hugh M. Smith, Matthew Carlton","doi":"10.1109/ICON.2003.1266208","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266208","url":null,"abstract":"The increase in network capacities has led to the feasibility of real-time video applications such as video telephony. Such applications can use enormous amounts of bandwidth and must be carefully managed to avoid depleting network resources. One such bandwidth management approach utilizes router support to effectively control the video bandwidth usage [Hugh M. Smith and Matt W. Mutka, November 2000]. This protocol allows real-time video applications to fairly share network links and limits the bandwidth used by these applications without causing packet loss. However, this basic control algorithm does not include a mechanism to provide call admission control (CAC). This paper proposes two statistical based CAC algorithms. These algorithms attempt to minimize the impact of the CAC on the user's video quality, network utilization and router processing while providing dynamic bandwidth control without packet loss. We provide simulation results of these two algorithms and compare their performance with respect to bandwidth utilization, number of calls rejected, and scalability. These simulations show that our algorithms effectively control the admission of new video sessions.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129437017","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
Extending REBEKAH-IP with central port allocations for un-ambiguous IPv4 address expansion 通过中心端口分配扩展REBEKAH-IP,实现无歧义的IPv4地址扩展
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266192
S. Rattananon, B. Landfeldt, A. Seneviratne
{"title":"Extending REBEKAH-IP with central port allocations for un-ambiguous IPv4 address expansion","authors":"S. Rattananon, B. Landfeldt, A. Seneviratne","doi":"10.1109/ICON.2003.1266192","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266192","url":null,"abstract":"In recent times, the imminent lack of public IPv4 addresses has attracted the attention of both the research community and the industry. The problem becomes even more pressing with the introduction of third generation (3G) cellular networks which are predicted to introduce hundred of millions of new IP capable terminals over the next few years. The cellular industry has decided to combat this problem by using IPv6 for the new terminals, but unfortunately since the vast majority of services will reside in the IPv4 address space the problem will remain for the foreseeable future. There have been many proposals on how to address the issue by extending the IPv4 address space so that the introduction of IPv6 is given more time for a smooth transition. One of these proposals, REBEKAH-IP is promising in that it is scalable and does not limit the services that can be supported. However, the scheme is limited in that there is a possibility for call blocking as the system gets loaded. In this paper, we introduce an improvement to REBEKAH-IP in which this side effect is removed, creating a robust and fully scalable system.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131635089","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}
引用次数: 3
Weighted deficit earliest departure first scheduling 加权赤字最早出发优先调度
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266230
T. Lim, Bu-Sung Lee, C. Yeo
{"title":"Weighted deficit earliest departure first scheduling","authors":"T. Lim, Bu-Sung Lee, C. Yeo","doi":"10.1109/ICON.2003.1266230","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266230","url":null,"abstract":"Deficit Round Robin (DRR) and Weighted Deficit Round Robin schedulers have shown their ability in providing fair and weighted sharing of network resources for network devices. However, they are unable to provide fairness in terms of waiting time of packets among flows. We propose a new packet scheduling discipline, Weighted Deficit Earliest Departure First scheduler. It provides fairness in terms of throughput and differentiation in average and worst-case queuing time among queues that require different rate and delay guarantees. Simulation shows that it achieves near-perfect throughput fairness that is comparable to DRR scheduler and delay differentiation that is comparable to Earliest Departure First scheduler. q 2005 Elsevier B.V. All rights reserved.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134310963","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}
引用次数: 3
IP routing table compression using ESPRESSO-MV 使用ESPRESSO-MV压缩IP路由表
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266185
Jianjian Bian, S. Khatri
{"title":"IP routing table compression using ESPRESSO-MV","authors":"Jianjian Bian, S. Khatri","doi":"10.1109/ICON.2003.1266185","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266185","url":null,"abstract":"In an attempt to slow the exhaustion of Internet protocol (IP) address space, class-less inter-domain routing (CIDR.) was adopted. However, the decision to utilize CIDR also increases the size of the routing table, since it allows an arbitrary partitioning of the routing space. In this paper, we propose a scheme to reduce the size of routing table in the CIDR context. Our approach utilizes a well-known and highly efficient technique to perform multi-valued logic minimization. This technique, implemented using ESPRESSO-MV, is extensively used in multi-valued VLSI logic function optimization. Our approach for IP routing table compression leverages the full flexibility and power of ESPRESSO-MV. By considering the IP routing table as an incompletely specified multi-valued function, we demonstrate that our technique can achieve average 77% reduction in the size of IP routing tables. Our algorithm requires exactly one espresso run, as opposed to O(MN) runs for an existing algorithm, where M is the number of unique masks and N is the number of interfaces in the routing table.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129740699","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
ARQ considerations for the new GSM/EDGE flexible layer one 新的GSM/EDGE柔性第一层的ARQ考虑
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266275
K. Pedersen, Benoist Sébire, G. Sébire, G. Platt
{"title":"ARQ considerations for the new GSM/EDGE flexible layer one","authors":"K. Pedersen, Benoist Sébire, G. Sébire, G. Platt","doi":"10.1109/ICON.2003.1266275","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266275","url":null,"abstract":"A major enhancement of the GSM/EDGE Radio Access Network (GERAN) is the Flexible Layer One (FLO) concept, due to he introduced in Release 6 nf the 3GPP standards. FLO greatly simplifies the introduction of new services to the GERAN system, allowing for “tailor-made” provision of any given Quality of Service (QnS), significantly enhancing GERAN’s flexibility, and ensuring it will evolve on par with other 3G systems. In the GERAN Iu mode, FLO supports data transfer in transparent, unacknowledged and acknowledged RLC (Radio Link Control) modes. In the latter mode, the RLC applies backward error correction (BEC) through an ARQ (Automatic Repeat reQuest) mechanism Considering ARQ mechanisms, Hybrid Type I1 ARQ (aka. incremental redundancy) is a very efficient technique that requires a close interaction between the retransmission protocol at the RLC layer and the channel encoderldecoder at the physical layer. This paper first introduces the concept of FLO, and then describes how hybrid type I1 ARQ can he implemented in the FLO physical layer. Finally, we present the performance gains possible by introducing incremental redundancy to FLO, especially when compared to the performance of Chase combining.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114481305","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}
引用次数: 3
An admission control algorithm for CDMA networks 一种CDMA网络的准入控制算法
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266264
K. Chu, F. Lin, Shin-Fu Wang
{"title":"An admission control algorithm for CDMA networks","authors":"K. Chu, F. Lin, Shin-Fu Wang","doi":"10.1109/ICON.2003.1266264","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266264","url":null,"abstract":"This paper proposes an admission control algorithm for CDMA networks, from which a revenue optimization problem is formulated as a mixed integer problem. The objective of the optimization problem is to maximizing total system revenue subject to capacity as well as QoS constraints. The approach for solving revenue optimization problem is Lagrangean relaxation in conjunction with a heuristic. The experiments consider total system revenue with respective to voice activity factor WAF) and signal-tointerference (SIR) on 500 test cases which are within 9 base stations, 50 existing mobile stations, as well as 50 new mobile stations. Computational results illustrate that the solution quality of error gap less than 5.0% is with percentile 0.99. Proposed algorithm is calculated with near-optimal solution. Index Termsadmission control algorithm, CDMA networks, Lagrangean relaxation, mathematical formulation, optimization model","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"99 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113953896","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
Finite timescale range of interest for self-similar traffic measurements, modelling and performance analysis 有限的时间尺度范围的兴趣自相似的交通测量,建模和性能分析
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266159
Guoqiang Mao
{"title":"Finite timescale range of interest for self-similar traffic measurements, modelling and performance analysis","authors":"Guoqiang Mao","doi":"10.1109/ICON.2003.1266159","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266159","url":null,"abstract":"Although the existence of self-similarity in network traffic has been widely recognized, there is considerable debate on the impact of selfsimilarity on traffic engineering and network performance, and whether or not self-similar model should be used for traffic modelling. This paper reviews some major research in the area and summarizes limitations in current theoretical performance analysis with self-similar input. It is pointed out that these performance analyses are insufficient to make a definitive conclusion on the long-range dependence effects. Furthermore, it is pointed out that in a real system, the timescale range of interest for traffic measurements, modelling and performance analysis is limited, which can be characterized by an engineering timescale range (ETR). Only traffic correlations within the ETR will affect performance and are important for traffic measurement, modelling and performance analysis. Factors contributing to the ETR are identified. Further research is proposed on quantitatively identifying the ETR, and traffic measurements and self-similar traffic modelling using Markov models.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117327288","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
Integrated network traffic measurement and billing system 综合网络流量计量计费系统
The 11th IEEE International Conference on Networks, 2003. ICON2003. Pub Date : 2003-09-28 DOI: 10.1109/ICON.2003.1266161
K. C. Yong, Z. Lai, A. Ananda
{"title":"Integrated network traffic measurement and billing system","authors":"K. C. Yong, Z. Lai, A. Ananda","doi":"10.1109/ICON.2003.1266161","DOIUrl":"https://doi.org/10.1109/ICON.2003.1266161","url":null,"abstract":"In a typical campus network different tools can be deployed to gather network statistics, but tools to gather user statistics are comparatively less common. The difficulty arises because each user may log in from different machines and from different access networks, and hence it is hard to keep track of user login profiles. This problem is further complicated if users are given dynamically allocated IPs for each login session. In this paper, we describe the implementation of a traffic measurement and billing system for our university campus network. In this system we keep track of user logins, and with information gathered from monitoring the packets in the network, we estimate the amount of bandwidth consumed by each user to access resources within the campus network and also to access resources in external networks, so as to facilitate further developments like usage billing.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126367034","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学术官方微信