Pub Date : 2005-04-04DOI: 10.1109/ISADS.2005.1452038
I. Luque, Xiaodong Lu, M. Kanda, K. Moriyama, Yasushi Kuba, Ryuji Takanuki
To distinguish itself in today's competitive market, the service provider can offer the customer a service level agreement. User differentiation is required, appearing a need of a system able to assure the heterogeneous requirements of the users in such a mission-critical environment. In this paper, we propose an autonomous decentralized information service architecture; where he cooperation between the autonomous subsystems - mobile agents and nodes - helps the routing of the Pull-MA requests, leading to accomplish the heterogeneous service level objectives for real-time of each user in an ever-changing environment. The effectiveness of the proposed technology has been proved through simulation. The results show that the system is able to satisfy the different requirements of real-time required by each user.
{"title":"Autonomous decentralized service level management for real-time assurance","authors":"I. Luque, Xiaodong Lu, M. Kanda, K. Moriyama, Yasushi Kuba, Ryuji Takanuki","doi":"10.1109/ISADS.2005.1452038","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452038","url":null,"abstract":"To distinguish itself in today's competitive market, the service provider can offer the customer a service level agreement. User differentiation is required, appearing a need of a system able to assure the heterogeneous requirements of the users in such a mission-critical environment. In this paper, we propose an autonomous decentralized information service architecture; where he cooperation between the autonomous subsystems - mobile agents and nodes - helps the routing of the Pull-MA requests, leading to accomplish the heterogeneous service level objectives for real-time of each user in an ever-changing environment. The effectiveness of the proposed technology has been proved through simulation. The results show that the system is able to satisfy the different requirements of real-time required by each user.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131892183","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}
Pub Date : 2005-04-04DOI: 10.1109/ISADS.2005.1452043
Z. Khan, S. Shahid, H. F. Ahmad, Arshad Ali, H. Suguri
Multi agent systems (MAS) are expected to be involved in futuristic technologies. Agents require some execution environment in which they can publish their service interfaces and can provide services to other agent. Such execution environment is called agent platform (AP). From a technical point of view any abnormal behavior of platform can distress agents residing on that platform. That's why it is necessary to provide a suitable architecture for the AP which should not only provide fault tolerance but also scalability features. There also exist some management components within the platform, which provide services to application agents. All the agents within MAS are managed by agent management system (AMS) which is the mandatory supervisory authority of any AP. To be more scalable, a single agent platform can be distributed over several machines which not only provides load balancing but also fault tolerance depending upon the distributed architecture of the AP. In existing systems, AMS is centralized i.e. it exists on one machine. With centralized AMS, this infrastructure lacks fault tolerance, which is a key feature of high assurance. Absence of fault tolerance is the main reason for the small number of deployments of MAS. Failure of AMS leads towards abnormal behavior in the distributed platform. This paper proposes virtual agent cluster (VAC) paradigm which strongly supports decentralized AMS to achieve fault tolerance in distributed AP. VAC provides fault tolerance by using separate communication layers among different machines. Experiments show that it improves performance, brings autonomy and supports fault recovery along with load balancing in distributed AP.
{"title":"Decentralized architecture for fault tolerant multi agent system","authors":"Z. Khan, S. Shahid, H. F. Ahmad, Arshad Ali, H. Suguri","doi":"10.1109/ISADS.2005.1452043","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452043","url":null,"abstract":"Multi agent systems (MAS) are expected to be involved in futuristic technologies. Agents require some execution environment in which they can publish their service interfaces and can provide services to other agent. Such execution environment is called agent platform (AP). From a technical point of view any abnormal behavior of platform can distress agents residing on that platform. That's why it is necessary to provide a suitable architecture for the AP which should not only provide fault tolerance but also scalability features. There also exist some management components within the platform, which provide services to application agents. All the agents within MAS are managed by agent management system (AMS) which is the mandatory supervisory authority of any AP. To be more scalable, a single agent platform can be distributed over several machines which not only provides load balancing but also fault tolerance depending upon the distributed architecture of the AP. In existing systems, AMS is centralized i.e. it exists on one machine. With centralized AMS, this infrastructure lacks fault tolerance, which is a key feature of high assurance. Absence of fault tolerance is the main reason for the small number of deployments of MAS. Failure of AMS leads towards abnormal behavior in the distributed platform. This paper proposes virtual agent cluster (VAC) paradigm which strongly supports decentralized AMS to achieve fault tolerance in distributed AP. VAC provides fault tolerance by using separate communication layers among different machines. Experiments show that it improves performance, brings autonomy and supports fault recovery along with load balancing in distributed AP.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134477816","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}
Pub Date : 2005-04-04DOI: 10.1109/ISADS.2005.1452183
S. Magrath, F. Chiang, S. Markovits, R. Braun, F. Cuervo
The motivation for this paper is to extend the state of the art in distributed autonomics praxis as applied to telecommunications network management. We describe how the task assignment problem, common in telecommunications service activation workflow processes, can be effectively solved through the use of distributed autonomic auction agents. In doing so, we present our telecommunications service architecture that locates autonomic mechanisms. We describe a formal framework for the autonomic mechanism based on Holland's adaptation theory. We then present the results of an experimental simulation study that shows that the autonomic mechanism provides near optimal performance for the problem, whilst conferring significant advantages over other common implementations in terms of robustness, scalability and disaster recovery. We conclude that autonomic mechanisms confer significant advantages to TMN, but it does so by hiding complexity rather than simplifying the system operations as has sometimes been reported.
{"title":"Autonomics in telecommunications service activation","authors":"S. Magrath, F. Chiang, S. Markovits, R. Braun, F. Cuervo","doi":"10.1109/ISADS.2005.1452183","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452183","url":null,"abstract":"The motivation for this paper is to extend the state of the art in distributed autonomics praxis as applied to telecommunications network management. We describe how the task assignment problem, common in telecommunications service activation workflow processes, can be effectively solved through the use of distributed autonomic auction agents. In doing so, we present our telecommunications service architecture that locates autonomic mechanisms. We describe a formal framework for the autonomic mechanism based on Holland's adaptation theory. We then present the results of an experimental simulation study that shows that the autonomic mechanism provides near optimal performance for the problem, whilst conferring significant advantages over other common implementations in terms of robustness, scalability and disaster recovery. We conclude that autonomic mechanisms confer significant advantages to TMN, but it does so by hiding complexity rather than simplifying the system operations as has sometimes been reported.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133474419","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}
Pub Date : 2005-04-04DOI: 10.1109/ISADS.2005.1452134
W. Tsai, Z. Cao, Yinong Chen, R. Paul
This paper presents an integrated development process for Web services. The key differences with the traditional software development are that this new process involves collaboration and cooperation among all parties involved: developers, brokers, and clients. The process defines a new way of developing trustworthy Web services based on the existing Internet infrastructure. The paper serves as a roadmap to research on Web services specification, discovery, ontology, composition, re-composition, testing, reliability assessing, ranking, and collaboration and cooperation among all parities involved in Web services research, development, and application.
{"title":"Web services-based collaborative and cooperative computing","authors":"W. Tsai, Z. Cao, Yinong Chen, R. Paul","doi":"10.1109/ISADS.2005.1452134","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452134","url":null,"abstract":"This paper presents an integrated development process for Web services. The key differences with the traditional software development are that this new process involves collaboration and cooperation among all parties involved: developers, brokers, and clients. The process defines a new way of developing trustworthy Web services based on the existing Internet infrastructure. The paper serves as a roadmap to research on Web services specification, discovery, ontology, composition, re-composition, testing, reliability assessing, ranking, and collaboration and cooperation among all parities involved in Web services research, development, and application.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121470839","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}
Pub Date : 2005-04-04DOI: 10.1109/ISADS.2005.1452059
Qigang Zhao, X. Fang, Qunzhan Li, Zhengyou He
In this paper we introduce a methodology to predict IP traffic in IP-based next generation network (NGN). By using Netflow traffic collecting technology, we've collected some traffic data for the analysis from an NGN operator. To build wavelet basis neural network (NN), we replace Sigmoid function with the wavelet in NN, and use wavelet multiresolution analysis method to decompose the traffic signal and then employ the decomposed component sequences to train the NN. By using the methods, we build a NGN traffic prediction model by which to predict one day's traffic. The experimental results show that the traffic prediction method of wavelet NN (WNN) is more accurate than that without using wavelet in the NGN traffic forecasting.
{"title":"WNN-based NGN traffic prediction","authors":"Qigang Zhao, X. Fang, Qunzhan Li, Zhengyou He","doi":"10.1109/ISADS.2005.1452059","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452059","url":null,"abstract":"In this paper we introduce a methodology to predict IP traffic in IP-based next generation network (NGN). By using Netflow traffic collecting technology, we've collected some traffic data for the analysis from an NGN operator. To build wavelet basis neural network (NN), we replace Sigmoid function with the wavelet in NN, and use wavelet multiresolution analysis method to decompose the traffic signal and then employ the decomposed component sequences to train the NN. By using the methods, we build a NGN traffic prediction model by which to predict one day's traffic. The experimental results show that the traffic prediction method of wavelet NN (WNN) is more accurate than that without using wavelet in the NGN traffic forecasting.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122969190","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}
Pub Date : 2005-04-04DOI: 10.1109/ISADS.2005.1452114
M. Funabashi, K. Homma, Toshiro Sasaki
The Yaoyorozu project has been conducted in order to design ubiquitous information society in 2010. This design problem calls for collaboration of humanity and engineering sciences. In order to foster collaboration among researchers in diversified disciplines, development of scenarios is emphasized that facilitates communications and discussions among the participants. The present paper describes background and the research organization as well as summary of the research accomplishments so far.
{"title":"The Yaoyorozu project designing ubiquitous information society in 2010","authors":"M. Funabashi, K. Homma, Toshiro Sasaki","doi":"10.1109/ISADS.2005.1452114","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452114","url":null,"abstract":"The Yaoyorozu project has been conducted in order to design ubiquitous information society in 2010. This design problem calls for collaboration of humanity and engineering sciences. In order to foster collaboration among researchers in diversified disciplines, development of scenarios is emphasized that facilitates communications and discussions among the participants. The present paper describes background and the research organization as well as summary of the research accomplishments so far.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114814428","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}
Pub Date : 2005-04-04DOI: 10.1109/ISADS.2005.1452149
Wang Cong, Guo Yahui, L. Jianyi
This paper proposes an architecture of autonomous question answering system, which is based on intelligent information push-pull (IIPP) technology, comprehensive information (CI) theory and intelligent autonomous decentralized systems (IADS). In this system, topic-based association rules mining is applied for finding all association rules and a new criterion, IIPP for acquiring the required knowledge from large information source. The effectiveness of this system is demonstrated in the rural information system, which has not only autonomous controllability and coordinability, but also some activity, mobility, sensibility, reactivity and sociality.
{"title":"IIPP and CIT based intelligent autonomous QA system","authors":"Wang Cong, Guo Yahui, L. Jianyi","doi":"10.1109/ISADS.2005.1452149","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452149","url":null,"abstract":"This paper proposes an architecture of autonomous question answering system, which is based on intelligent information push-pull (IIPP) technology, comprehensive information (CI) theory and intelligent autonomous decentralized systems (IADS). In this system, topic-based association rules mining is applied for finding all association rules and a new criterion, IIPP for acquiring the required knowledge from large information source. The effectiveness of this system is demonstrated in the rural information system, which has not only autonomous controllability and coordinability, but also some activity, mobility, sensibility, reactivity and sociality.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121854760","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}
Pub Date : 2005-04-04DOI: 10.1109/ISADS.2005.1452068
Zhixing Huang, Yuhui Qiu
Grid computing is a newly emerging technology that enables users to share a large number of computing resources distributed over a network. Due to that grid, computational resources are not storable, the advance reservation of these resources is necessary for users to request resources from multiple scheduling systems at a specific time. Meanwhile, auction is an appropriate mechanism to reach an economically efficient allocation of goods, services, resources, etc. In this paper, we use auction-based scheduling method for resource reservation. We propose a variant version of traditional ascending auction for automatic resource reservation. And we introduce a novel heuristic strategy to guide agents on participating actions, we also compare our bidding strategies with several other different bidding strategies for the computational resource reservation in homogenous and heterogeneous scenarios. The experimental results show that our heuristic bidding strategy outperforms those methods in both cases.
{"title":"A bidding strategy for advance resource reservation in sequential ascending auctions","authors":"Zhixing Huang, Yuhui Qiu","doi":"10.1109/ISADS.2005.1452068","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452068","url":null,"abstract":"Grid computing is a newly emerging technology that enables users to share a large number of computing resources distributed over a network. Due to that grid, computational resources are not storable, the advance reservation of these resources is necessary for users to request resources from multiple scheduling systems at a specific time. Meanwhile, auction is an appropriate mechanism to reach an economically efficient allocation of goods, services, resources, etc. In this paper, we use auction-based scheduling method for resource reservation. We propose a variant version of traditional ascending auction for automatic resource reservation. And we introduce a novel heuristic strategy to guide agents on participating actions, we also compare our bidding strategies with several other different bidding strategies for the computational resource reservation in homogenous and heterogeneous scenarios. The experimental results show that our heuristic bidding strategy outperforms those methods in both cases.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130411953","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}
Pub Date : 2005-04-04DOI: 10.1109/ISADS.2005.1452133
Wang Feng, Xuwei Li, Zhu Hong
This paper presents an immune-based model for Web data mining, in which the rule library and statistic dictionary are used to build search schemas, and data from different sources are wrapped to XML. By using Web content mining and Web structure mining, data are abstracted to mediated schemas and then compared with search schemas. As the information about Web page content and its links are optimized, the traditional search strategy based on keyword matching can be improved. At the same time, many ideas of immune system are introduced to increase the search efficiency. Now many Web data mining system using immune approaches by Andrew Seeker, Alex A. Freitas, and Jon Timmis, (2003), H.A. Abbass, R.A. Sarker, and C.S. Newton (2001) are concerned with data clustering, while immunity is mainly used for data processing after clustering in this model.
本文提出了一种基于免疫的Web数据挖掘模型，该模型利用规则库和统计字典构建搜索模式，并将不同来源的数据包装成XML。通过Web内容挖掘和Web结构挖掘，将数据抽象为中介模式，然后与搜索模式进行比较。随着网页内容及其链接信息的优化，传统的基于关键词匹配的搜索策略得到了改进。同时，为了提高搜索效率，引入了许多免疫系统的思想。目前，Andrew Seeker、Alex A. Freitas和Jon Timmis(2003)、H.A. Abbass、R.A. Sarker和C.S. Newton(2001)等使用免疫方法的Web数据挖掘系统主要关注数据聚类，而免疫主要用于该模型中聚类后的数据处理。
{"title":"An immune-based model for Web data mining","authors":"Wang Feng, Xuwei Li, Zhu Hong","doi":"10.1109/ISADS.2005.1452133","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452133","url":null,"abstract":"This paper presents an immune-based model for Web data mining, in which the rule library and statistic dictionary are used to build search schemas, and data from different sources are wrapped to XML. By using Web content mining and Web structure mining, data are abstracted to mediated schemas and then compared with search schemas. As the information about Web page content and its links are optimized, the traditional search strategy based on keyword matching can be improved. At the same time, many ideas of immune system are introduced to increase the search efficiency. Now many Web data mining system using immune approaches by Andrew Seeker, Alex A. Freitas, and Jon Timmis, (2003), H.A. Abbass, R.A. Sarker, and C.S. Newton (2001) are concerned with data clustering, while immunity is mainly used for data processing after clustering in this model.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115791031","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}
Pub Date : 2005-04-04DOI: 10.1109/ISADS.2005.1452136
S. Inoue, Naoki Ueno, M. Amamiya, Y. Kakuda
The constraint-based routed label distribution protocol (CR-LDP) is a well-known traffic engineering technologies in MPLS networks. CR-LDP is a signaling protocol for establishing a label switching path (LSP) and has a function such that CR-LDP coordinates LSPs that conflict (for example, the LSPs share a link). However CR-LDP coordinates such LSPs only. Therefore such coordination (i.e. rerouting a LSP) would result in other conflicts (i.e. the rerouted LSP would share a link with other LSPs). This paper proposes a new traffic engineering method which is called the "multiagent-based path rerouting method (MPRM)". When a conflict occurs, MPRM coordinates all LSPs without concerning the conflict in order to avoid new conflicts caused by dissolving the conflict. For avoidance of new conflicts, MPRM performs not only rerouting of LSPs that make the conflict but also rerouting some LSPs that result in no conflicts. This paper also evaluates basic performance of CR-LDP and MPRM.
基于约束的路由标签分发协议CR-LDP (routing label distribution protocol)是一种著名的MPLS网络流量工程技术。CR-LDP是一种建立LSP (label switching path)的信令协议，具有协调冲突LSP(如共享一条链路)的功能。但是CR-LDP只协调这样的lsp。因此，这种协调(即重路由)会导致其他冲突(即重路由的LSP会与其他LSP共享一条链路)。本文提出了一种新的流量工程方法——“基于多智能体的路径重路由方法(MPRM)”。当冲突发生时，MPRM在不考虑冲突的情况下协调所有lsp，避免冲突解除后产生新的冲突。为了避免新的冲突，MPRM不仅对产生冲突的lsp进行重路由，而且对不产生冲突的lsp进行重路由。本文还对CR-LDP和MPRM的基本性能进行了评价。
{"title":"A multiagent-based path rerouting method in MPLS networks","authors":"S. Inoue, Naoki Ueno, M. Amamiya, Y. Kakuda","doi":"10.1109/ISADS.2005.1452136","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452136","url":null,"abstract":"The constraint-based routed label distribution protocol (CR-LDP) is a well-known traffic engineering technologies in MPLS networks. CR-LDP is a signaling protocol for establishing a label switching path (LSP) and has a function such that CR-LDP coordinates LSPs that conflict (for example, the LSPs share a link). However CR-LDP coordinates such LSPs only. Therefore such coordination (i.e. rerouting a LSP) would result in other conflicts (i.e. the rerouted LSP would share a link with other LSPs). This paper proposes a new traffic engineering method which is called the \"multiagent-based path rerouting method (MPRM)\". When a conflict occurs, MPRM coordinates all LSPs without concerning the conflict in order to avoid new conflicts caused by dissolving the conflict. For avoidance of new conflicts, MPRM performs not only rerouting of LSPs that make the conflict but also rerouting some LSPs that result in no conflicts. This paper also evaluates basic performance of CR-LDP and MPRM.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116493865","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：