Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium最新文献_第5页

A throughput deadlock-free TCP for high-speed Internet 用于高速因特网的吞吐量无死锁的TCP

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875773

R. Chang, H. Y. Chan

引用次数: 1

BGP based shortcut virtual channels for transit IP traffic over ATM networks 基于BGP的ATM网络中IP流量传输的快捷虚拟通道

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875794

Changhoon Kim, H. Choi, T. Jeong

{"title":"BGP based shortcut virtual channels for transit IP traffic over ATM networks","authors":"Changhoon Kim, H. Choi, T. Jeong","doi":"10.1109/ICON.2000.875794","DOIUrl":"https://doi.org/10.1109/ICON.2000.875794","url":null,"abstract":"This paper suggests an efficient mechanism to establish and utilize shortcut virtual channels for transit traffic over an ATM based IP network which uses BGP as an inter-domain routing protocol. Although in this case, \"MPOA\" or \"CLIP with NHRP\" might be alternative solutions, they incur not only inevitable hop-by-hop routing for the first packet, but also multiple communications between NHC and NHSs. What is worse, the NHRP based schemes can not efficiently cope with inter-domain routing instability that can result in temporal inconsistency between existing shortcut VCs and authoritative paths. BGP, de facto inter-domain routing protocol in the Internet, can directly identify an egress router for transit traffic crossing the network. Thus, when ingress routers know the ATM address of egress routers, virtual channels for transit traffic can be immediately and very easily set up. Fortunately, by the virtue of the extensible design of BGP we can extend it to transport egress router's ATM address without any distortion of the basic mechanism of the protocol. Moreover because the resulting scheme inherits several merits of BCP and ATM shortcut VCs, it can easily enforce administrative policies to the network and dynamically adapt itself to the routing instabilities, even render the existing routers and network architecture.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114263664","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

Call admission control in cellular multiservice networks using virtual partitioning with priority 基于优先级虚拟分区的蜂窝多业务网络呼叫准入控制

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875761

Shun-Ping Chung, Jin-Chang Lee

{"title":"Call admission control in cellular multiservice networks using virtual partitioning with priority","authors":"Shun-Ping Chung, Jin-Chang Lee","doi":"10.1109/ICON.2000.875761","DOIUrl":"https://doi.org/10.1109/ICON.2000.875761","url":null,"abstract":"With the tremendous growth of mobile users and the emergence of multimedia applications, an appropriate call admission control policy is expected to make efficient use of scarce wireless resource while supporting different services with diverse quality-of-service requirements. Also, the popularity of microcells makes the actual traffic load of a given cell deviates from the expected load more easily. Furthermore, handoff calls are normally given priority over new calls to reduce forced termination probability. Virtual partitioning with priority (VPP) is proposed to fulfil the aforesaid goals, whether the traffic is stationary or non-stationary. An approximation method is derived to calculate performance measures of interest. Numerical results show that VPP achieves a similar high multiplexing gain as complete sharing (CS) when all classes are behaving as expected. VPP also realizes a similar isolated effect as complete partitioning (CP) in regions of practical interest. It is also shown under non-stationary scenarios, VPP outperforms trunk reservation (TR).","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121864466","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}

引用次数: 5

An improved key distribution protocol with perfect reparability 改进的密钥分发协议，具有完美的可修复性

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875801

Hu Li, Huanghai Chen, Hongwen Zhu

引用次数: 2

QoS-based connection set-up in ATM networks ATM网络中基于qos的连接设置

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875777

Sin-Lam Tan, C. Tham, L. Ngoh

引用次数: 0

Integrated quality of service and network management 综合服务质量和网络管理

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875848

Rohit Joshi, C. Tham

引用次数: 3

Utilization of multiple block cipher hashing in authentication and digital signatures 多块密码哈希在身份验证和数字签名中的应用

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875798

K. Rahouma

{"title":"Utilization of multiple block cipher hashing in authentication and digital signatures","authors":"K. Rahouma","doi":"10.1109/ICON.2000.875798","DOIUrl":"https://doi.org/10.1109/ICON.2000.875798","url":null,"abstract":"A new algorithm for authentication and digital signature is introduced. It is based on using four different hash functions classified as very secure against all attacks except the brute force one. The hash function used is selected by computing nf/sub i/=r/sub i/ mod 4 where r/sub i/ is randomly generated and the initial hash sequence H/sub 0/ is publicized by the sender. According to nf/sub i/, he/she prepares every message block M/sub i/ for encryption by applying a special block cipher technique to obtain the cipher block C/sub i/. Then, the corresponding new hash value H/sub i/ is obtained. The value r/sub i/ is encrypted to R/sub i/ using the sender's secret RSA key d/sub s/ and then the receiver's public one e/sub r/ (this could be reversed if n/sub r/>n/sub s/ where n/sub r/ and n/sub s/ are the modulus numbers of the receiver and sender respectively). The code sent by the sender to the receiver is composed of the combination (C/sub i/, H/sub i/, R/sub i/). This could be useful in checking the integrity of the transmitted message as a whole. The receiver reads the public values H/sub 0/, e/sub s/ and n/sub s/. Then he/she decrypts the cipher C/sub i/ and uses his private RSA key d/sub r/ and the senders public one e/sub s/ to decrypt R/sub i/. Decryption of C/sub i/ yields the prepared block before encryption and decryption of R/sub i/ yields the value r/sub i/. Using r/sub i/, the receiver can compute nf/sub i/=r/sub i/ mod 4. Using nf/sub i/ and H/sub i-1/, he/she can compute the message block M/sub i/' and the hash value H/sub i/'. If H/sub i/'=H/sub i/ then M/sub i/'=M/sub i/ and this means that the message block M/sub i/' was sent by the sender. If this condition is not satisfied, then the message is either changed or sent by another sender. This algorithm is easy to implement and hard to attack.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130228713","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

Implementation and comparison of distributed caching schemes 分布式缓存方案的实现与比较

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875842

S. Selvakumar, P. Prabhakar

{"title":"Implementation and comparison of distributed caching schemes","authors":"S. Selvakumar, P. Prabhakar","doi":"10.1109/ICON.2000.875842","DOIUrl":"https://doi.org/10.1109/ICON.2000.875842","url":null,"abstract":"Shared Web caches allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shared caching to its Web clients will typically have a collection of shared caches rather than a single cache. If a collection of shared caches is used, it is required to coordinate the caches so that all cached pages in the collection are shared among the clients of the organization. In this paper, two protocol schemes for coordinating the collection of shared caches are investigated. The first scheme is based on the Internet caching protocol (ICP). In the ICP scheme, the Web caches query other caches for the Web pages and fetch the Web pages from the neighbors if they have cached the requested page. The second scheme is the hash routing scheme in which the client (browser) has to find the hash value for the URL of the requested page and send the request to the corresponding cache server. These two schemes have been implemented, and compared with respect to the page retrieval latency and the adaptability of the cache servers when a peer cache server fails. Our analysis shows that the hash routing schemes have significant performance advantages over ICP with respect to the average latency under normal conditions but when failure rate of the cache server is significant the ICP provides good adaptability. Also, we observe that the hashing function used in the hash routing scheme must have certain features such as quick calculation of the hash value and uniform distribution of the Web pages (among cache servers).","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124707214","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 general theory of constrained max-min rate allocation for multicast networks 组播网络约束最大最小速率分配的一般理论

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875809

J. Ros, W. Tsai

引用次数: 7

Effective fairness queuing algorithms 有效的公平性排队算法

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI: 10.1109/ICON.2000.875804

Wang Chonggang, L. Keping, G. Xiang-yang, Cheng Shiduan

引用次数: 5