Proceedings 15th International Conference on Information Networking最新文献

筛选
英文 中文
SOM: spiral-fat-tree-based on-demand multicast protocol in a wireless ad-hoc network SOM:无线自组网中基于螺旋脂肪树的按需多播协议
Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905261
Yuh-Shyan Chen, Tzung-Shi Chen, Ching-Jang Huang
{"title":"SOM: spiral-fat-tree-based on-demand multicast protocol in a wireless ad-hoc network","authors":"Yuh-Shyan Chen, Tzung-Shi Chen, Ching-Jang Huang","doi":"10.1109/ICOIN.2001.905261","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905261","url":null,"abstract":"A mobile ad-hoc network (MANET) is a characterised by multi-hop wireless links, in the absence of any cellular infrastructure, as well as frequent host mobility. Existing on-demand multicasting protocols are categorized into tree-based and mesh-based strategies. In this paper, we propose a new on-demand multicast routing protocol named spiral-fat-tree-based on-demand multicast protocol (SOM), for multi-hop mobile ad hoc wireless networks. We build a spiral-fat-tree as our multicasting tree. The main advantage of spiral-fat-tree is to keep the stability of multicast tree. The performance study shows that our proposed scheme outperforms the reactive tree-based and mesh-based multicast protocols existing in the ad-hoc network.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124679913","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}
引用次数: 23
MRED: a new approach to random early detection MRED:随机早期检测的新方法
Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905450
Jahon Koo, Byunghun Song, K. Chung, Hyukjoon Lee, H. Kahng
{"title":"MRED: a new approach to random early detection","authors":"Jahon Koo, Byunghun Song, K. Chung, Hyukjoon Lee, H. Kahng","doi":"10.1109/ICOIN.2001.905450","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905450","url":null,"abstract":"In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF (Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED (random early detection). While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use queue lengths as the indicator of the severity of congestion. In order to solve this problem, a new active queue management algorithm called MRED is proposed. MRED computes the packet drop probability based on our heuristic method rather than the simple method used in RED. Using simulation, MRED is shown to perform better than existing queue management schemes.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127118704","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}
引用次数: 42
Object-causally ordered group protocol for distributed multimedia systems 分布式多媒体系统的对象因果顺序组协议
Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905635
K. Shimamura, Katsuya Tanaka, M. Takizawa
{"title":"Object-causally ordered group protocol for distributed multimedia systems","authors":"K. Shimamura, Katsuya Tanaka, M. Takizawa","doi":"10.1109/ICOIN.2001.905635","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905635","url":null,"abstract":"In distributed applications like teleconferences, a group of multiple processes are cooperating, where messages exchanged among the processes are required to be causally delivered. The processes are exchanging different kinds of multimedia objects in addition to traditional text data. The multimedia objects are longer than traditional messages and are structured. We discuss new types of causally precedent relations among multimedia objects transmitted in the network. We discuss a protocol to causally deliver multimedia objects in a group of processes. We also show the evaluation of the protocol.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129964882","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
Self-similar and fractal nature of Internet traffic data 互联网流量数据的自相似和分形特性
Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905432
G. Keeni, T. Roy, Norio Shiratori
{"title":"Self-similar and fractal nature of Internet traffic data","authors":"G. Keeni, T. Roy, Norio Shiratori","doi":"10.1109/ICOIN.2001.905432","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905432","url":null,"abstract":"The Internet traffic being extremely variable and bursty in a wide range of time scales is usually characterised by a self-similarity parameter (/spl beta/), which describes its statistics depending on the scales of resolution. We study the characteristics on some previous data and observe that it can have another parameter which is its fractal dimension (D).","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130574080","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
Evaluating the performance of a DSM cluster with improved communication subsystem 基于改进通信子系统的DSM集群性能评估
Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905511
Yasushi Shimono, B. Apduhan, I. Arita, Yoshimasa Ohnishi
{"title":"Evaluating the performance of a DSM cluster with improved communication subsystem","authors":"Yasushi Shimono, B. Apduhan, I. Arita, Yoshimasa Ohnishi","doi":"10.1109/ICOIN.2001.905511","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905511","url":null,"abstract":"Parallel applications on network-based computing are most sensitive to communication overhead. The performance of a cluster computing system largely depends on the bandwidth, latency, and communication software processing overhead of the communication subsystem. The currently available fiber optics and opto-electronic device technologies offers solution to the bandwidth problem. However, achieving low latency remains a challenge and is considered by the research community as one critical issue to attain high-performance cluster computing. Different approaches to solve the problem have been proposed which deals with latency reduction and latency hiding. In this paper, we report on the new implementation of a DSM cluster computing system using the low-level application programming interface (LAPI) provided as part of IBM SP2 software. We discuss and evaluate the new (DSE-LAPI) and previous (DSE-TCP) implementations using application benchmarks with SPLASH-2 programs, i.e., FFT, radix, and LU. Likewise, we evaluate the scalability performance of the new implementation. Experimental results show promising performance of the new implementation and it further demonstrate the relative merit of adapting LAPI on a DSM cluster.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126455850","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
Characteristics of successive loss process 连续损失过程的特征
Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905536
T. Miyata, H. Fukuda, S. Ono
{"title":"Characteristics of successive loss process","authors":"T. Miyata, H. Fukuda, S. Ono","doi":"10.1109/ICOIN.2001.905536","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905536","url":null,"abstract":"We discuss two characteristics of successive packet loss. Firstly, we show a method of providing a search range of the order for a given Markov chain from investigations of successive packet loss. The process of packet loss is generally modeled as low ordered Markov chains. However, we have to set a proper range to evaluate which orders is better as an optimal order of a given Markov chain. Our method can reduce exceeding the calculation or states of Markov chain and we can find an optimal order in the search range applying our experimental data. Next, we also find one model for the process of successive packet loss. This model consisted of three timed-transitional states of an m-th order Markov chain (m=0, 1, 2). Accordingly, modeling the process for successive packet loss, two long-lived durations such as \"quiescent\" and \"burst\" on time scales of hours exist. We propose another new model that categorizes the part of the \"burst\" more precisely as two parts of low ordered Markov chains.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126323003","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
Distributed routing for dynamic multicasting with advance resource reservation information 具有预先资源预留信息的动态多播分布式路由
Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905519
D. Chakraborty, C. Pornavalai, G. Chakraborty, N. Shiratori
{"title":"Distributed routing for dynamic multicasting with advance resource reservation information","authors":"D. Chakraborty, C. Pornavalai, G. Chakraborty, N. Shiratori","doi":"10.1109/ICOIN.2001.905519","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905519","url":null,"abstract":"One important requirement in many multimedia applications is optimal network cost, which is defined as the sum of the cost of all links in the tree. Total or partial re-routing of the multicast tree for dynamic multicast groups can optimize the tree cost to some extent. But they are complex as cell-ordering at ATM switches has to be preserved. Furthermore, optimal multicast routing (also known as Steiner tree) has been proved to be an NP-complete problem. In this paper, we propose a heuristic distributed dynamic multicast routing algorithm, which optimize the total cost of the Steiner tree over the whole session period in an advance resource reservation environment, where information about the resource reservation (i.e. joining and leaving times of participants) are available at the time of joining. The efficiency of our algorithm and comparison with other existing algorithms is shown by various simulation results.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133936948","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
Implementation and evaluation of active internetwork system using Stream Code based active network 基于流码的有源网络主动互联系统的实现与评价
Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905433
F. Kubota, S. Ano, T. Hasegawa, Toshihiko Kato, Takashi Egawa, K. Hino
{"title":"Implementation and evaluation of active internetwork system using Stream Code based active network","authors":"F. Kubota, S. Ano, T. Hasegawa, Toshihiko Kato, Takashi Egawa, K. Hino","doi":"10.1109/ICOIN.2001.905433","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905433","url":null,"abstract":"The Internet has become an infrastructure for the global communication, and the reason of the success is the simplicity of the underlying technologies, i.e., a simple connectionless data transfer mechanism. However, this simple mechanism does no extend the functionality of the network, and does not satisfy various new user requirements. In order to realize a flexible and simple internetwork, the active network, which makes network nodes programmable, is very promising. We propose an active internetwork system using the Stream Code based active network. Here, every packet contains a program written in assembly based Stream Code specifying how the packet is handled, and a network node only has the mechanism to execute Stream Code. We have developed the execution environment of Stream Code called the SC Engine. As a result, we have realized a flexible active internetwork system consisting of multiple network nodes supporting SC Engines and measured its performance. Furthermore, in order to demonstrate that this active internetwork system can work as a real network, we also developed a complicated mechanism of dynamic routing protocol that is similar to Open Shortest Path First (OSPF). In the implementation of the routing protocol, we especially focused on how a routing protocol similar to OSPF is realized using Stream Code. This paper describes those results.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131847648","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
Replica management in object-based systems 基于对象系统中的副本管理
Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905453
Katsuya Tanaka, M. Takizawa
{"title":"Replica management in object-based systems","authors":"Katsuya Tanaka, M. Takizawa","doi":"10.1109/ICOIN.2001.905453","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905453","url":null,"abstract":"In object-based systems, objects are encapsulations of data and procedures named methods and methods are invoked in a nested manner. We discuss how to lock replicated objects by using the quorum-based scheme. If a pair of methods op/sub 1/ and op/sub 2/ are compatible each method is surely performed on some replica, but both of them may not be performed on the same replica. Compatible methods are exchanged between the replicas if both the methods are not performed on any of the replicas in our protocol. If a method op/sub 1/ is invoked on multiple replicas and each instance of the method op/sub 1/ invokes a method op/sub 2/, op/sub 2/ is performed multiple times on an object, i.e. redundant invocation. In addition since each instance of op/sub 1/ issues a request op/sub 2/ to its quorum, more number of the replicas are locked than the quorum number of op/sub 1/. This is quorum explosion. We discuss how to resolve these redundant invocations and quorum explosion.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133096522","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
Consumer communications and mass market information networking at the edge of the new millennium 新千年来临之际的消费者通讯和大众市场信息网络
Proceedings 15th International Conference on Information Networking Pub Date : 2001-01-31 DOI: 10.1109/ICOIN.2001.905260
A. Gelman
{"title":"Consumer communications and mass market information networking at the edge of the new millennium","authors":"A. Gelman","doi":"10.1109/ICOIN.2001.905260","DOIUrl":"https://doi.org/10.1109/ICOIN.2001.905260","url":null,"abstract":"Summary form only given. The rapid growth of the Internet and the World Wide Web, and proliferation of personal computers increased our productivity, brought to life new business models, created armies of virtual millionaires and real losers, and reduced the World to a size of the global village. Today a person in Central Africa is capable of accessing the same information, use the same e-commerce vendors, and trade on-line as a person in the United States. This enormous progress still leaves most people on Earth including most of the populations of developed countries deprived of access to information that could greatly improve their lives. It is the well known today \"Digital Divide\" phenomenon. To include most of the mankind into the new economy we must address the specificity of consumer, mass market information networking. We present examples of mass market information access services as well as home networking applications and home information infrastructure management schemes. We offer a view on the consumer communications value chain composition that insures user-friendly mechanism for provisioning, service creation, and support of the home networking environments as well as their integration into the information infrastructure.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115042740","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学术官方微信