Pub Date : 2003-03-27DOI: 10.1109/AINA.2003.1192908
Chung-Ming Huang, Yuan-Tse Yu, Yi-Wei Lin
Real time video streaming over wireless networks is not trivial because of the two characteristics of the wireless networks - (1) smaller bandwidth and (2) unreliable transmission media. An adaptive real-time video streaming scheme that uses the layered video technique is proposed. Two attributes that are used to determine the network situation and then adjust the sending rate accordingly are loss rate and round trip time (RTT). Since the unreliable media cause of packet loss in the wireless environment is rate-independent, a method that can separate the rate-independent loss from the congestion loss is needed. We use inter-arrival time between two received packets to identify if an out of order packet was received in time to do the packet loss separating. When a congestion situation is determined, the sending rate of the sender is dropped down one layer; when an unloaded situation is determined, the sending rate of the sender is raised up one layer. In this way, the adaptive real-time video streaming can be achieved for wireless networks.
{"title":"An adaptive control scheme for real-time media streaming over wireless networks","authors":"Chung-Ming Huang, Yuan-Tse Yu, Yi-Wei Lin","doi":"10.1109/AINA.2003.1192908","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192908","url":null,"abstract":"Real time video streaming over wireless networks is not trivial because of the two characteristics of the wireless networks - (1) smaller bandwidth and (2) unreliable transmission media. An adaptive real-time video streaming scheme that uses the layered video technique is proposed. Two attributes that are used to determine the network situation and then adjust the sending rate accordingly are loss rate and round trip time (RTT). Since the unreliable media cause of packet loss in the wireless environment is rate-independent, a method that can separate the rate-independent loss from the congestion loss is needed. We use inter-arrival time between two received packets to identify if an out of order packet was received in time to do the packet loss separating. When a congestion situation is determined, the sending rate of the sender is dropped down one layer; when an unloaded situation is determined, the sending rate of the sender is raised up one layer. In this way, the adaptive real-time video streaming can be achieved for wireless networks.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121852133","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192939
M. Indrawan, S. Krishnaswamy, Tharmakulasingam Ranjan
One major drawback in using a client server system in the mobile environment is the redundancy of data transmission in the event of connection failure. In this paper, we present a novel mobile agent architecture which allows minimum redundancy of data transmission in a client server database connection in a frequent disconnections environment. The system supports disconnection events caused by network failure or client power failure. Unlike current approaches, our model uses agent messaging to transfer the data. The messaging reduces the amount of migrations that the mobile agents performed. The architecture was implemented and tested in the Aglets platform.
{"title":"Using mobile agents to support unreliable database retrieval operations","authors":"M. Indrawan, S. Krishnaswamy, Tharmakulasingam Ranjan","doi":"10.1109/AINA.2003.1192939","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192939","url":null,"abstract":"One major drawback in using a client server system in the mobile environment is the redundancy of data transmission in the event of connection failure. In this paper, we present a novel mobile agent architecture which allows minimum redundancy of data transmission in a client server database connection in a frequent disconnections environment. The system supports disconnection events caused by network failure or client power failure. Unlike current approaches, our model uses agent messaging to transfer the data. The messaging reduces the amount of migrations that the mobile agents performed. The architecture was implemented and tested in the Aglets platform.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132575887","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192836
Kenny Ka Ho Kan, S. Chan, J. Ng
A dual channel system, which is based on the GPS and the GSM network, is being developed to compensate the problem of the loss of GPS signals in providing location services to mobile users in urban areas. In this design, when GPS signals are being blocked in blind spot areas, GSM positioning algorithms would be used as an alterative method to provide location estimations. This research is an investigation in search of a set of location estimation algorithms based on signal attenuation to work with GPS, so as to develop a dual channel positioning system. With the technical support from a local mobile operator we have constructed and conducted several real world experiments for our investigation and results are promising.
{"title":"A dual-channel location estimation system for providing location services based on the GPS and GSM networks","authors":"Kenny Ka Ho Kan, S. Chan, J. Ng","doi":"10.1109/AINA.2003.1192836","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192836","url":null,"abstract":"A dual channel system, which is based on the GPS and the GSM network, is being developed to compensate the problem of the loss of GPS signals in providing location services to mobile users in urban areas. In this design, when GPS signals are being blocked in blind spot areas, GSM positioning algorithms would be used as an alterative method to provide location estimations. This research is an investigation in search of a set of location estimation algorithms based on signal attenuation to work with GPS, so as to develop a dual channel positioning system. With the technical support from a local mobile operator we have constructed and conducted several real world experiments for our investigation and results are promising.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133658212","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 : 2003-03-27DOI: 10.1109/AINA.2003.1193002
An-Tai Lin, Shie-Jue Lee
The Distributed Coordination Function (DCF) which uses Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) and binary slotted exponential backoff scheme is the basis of the IEEE 802.11 Medium Access Control (MAC) protocol. However the DCF is not suitable for real-time traffic control since the backoff scheme may cause huge packet delay and jitter. We propose a modified DCF which uses a forward backoff scheme to remedy this disadvantage. In addition, a call admission control (CAC) is also proposed. Our protocols can guarantee service qualities such as the network throughput, packet delay, and jitter for real-time traffic. Besides, the modified DCF is still compliant with the IEEE 802.11 standard. Simulation results have shown that our method performs better than other DCF disciplines.
{"title":"A modified Distributed Coordination Function for real-time traffic in IEEE 802.11 wireless LAN","authors":"An-Tai Lin, Shie-Jue Lee","doi":"10.1109/AINA.2003.1193002","DOIUrl":"https://doi.org/10.1109/AINA.2003.1193002","url":null,"abstract":"The Distributed Coordination Function (DCF) which uses Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) and binary slotted exponential backoff scheme is the basis of the IEEE 802.11 Medium Access Control (MAC) protocol. However the DCF is not suitable for real-time traffic control since the backoff scheme may cause huge packet delay and jitter. We propose a modified DCF which uses a forward backoff scheme to remedy this disadvantage. In addition, a call admission control (CAC) is also proposed. Our protocols can guarantee service qualities such as the network throughput, packet delay, and jitter for real-time traffic. Besides, the modified DCF is still compliant with the IEEE 802.11 standard. Simulation results have shown that our method performs better than other DCF disciplines.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131789275","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192844
K. Hashimoto, Y. Shibata
Using a distributed multimedia system that can integrate various real-time and nonreal-time media data, when the system users communicate with each other by real-time audio video data, the system must guarantee end-to-end QoS (quality of service) according to requirements from the system users and available resources. If the system can dynamically use translator or mixer functions defined by RTP, more flexible peer-to-peer communication is realized. In this paper, we design a new middleware system with transcoding functions for a flexible intercommunication environment by relocatable decision.
{"title":"Design of a middleware system for flexible intercommunication environment","authors":"K. Hashimoto, Y. Shibata","doi":"10.1109/AINA.2003.1192844","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192844","url":null,"abstract":"Using a distributed multimedia system that can integrate various real-time and nonreal-time media data, when the system users communicate with each other by real-time audio video data, the system must guarantee end-to-end QoS (quality of service) according to requirements from the system users and available resources. If the system can dynamically use translator or mixer functions defined by RTP, more flexible peer-to-peer communication is realized. In this paper, we design a new middleware system with transcoding functions for a flexible intercommunication environment by relocatable decision.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133047017","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192870
Yuebin Bai, Hidetsune Kobayashi
String matching is a comprehensive applicable key technology beyond intrusion detection systems (IDS), and many areas can benefit from faster string matching algorithm. Which can be used in IDS, firewall et al network security applications. These applications are usually deployed at choke points of a network where there is heavily traffic. Using lower efficient string matching algorithm may make these applications to become a performance bottleneck in network. So it is very necessary to develop faster and more efficient string matching algorithms in order to overcome the troubles on performance. On a basis of Boyer-Moore-Horspool algorithm, a new string matching algorithm is presented in this paper. The algorithm is described in detail. The new algorithm has been greatly improved. The algorithm is one simplification of Boyer-Moore-Horspool algorithm. Array NEXT in Preprocessing stage is redesigned. A novel generated rules are presented. Using these rules, a simple NEXT is generated. And based on the concept of reference point, all make the algorithm to have better performance and more efficient. These characteristics will be useful in all these applications. Main features of the algorithm are presented, then explained its work processes. The algorithm also passed test and is validated. The test results show that the algorithm has better performance than Boyer-Moore algorithm and Boyer-Moore-Horspool algorithm, and more simple and efficient.
{"title":"New string matching technology for network security","authors":"Yuebin Bai, Hidetsune Kobayashi","doi":"10.1109/AINA.2003.1192870","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192870","url":null,"abstract":"String matching is a comprehensive applicable key technology beyond intrusion detection systems (IDS), and many areas can benefit from faster string matching algorithm. Which can be used in IDS, firewall et al network security applications. These applications are usually deployed at choke points of a network where there is heavily traffic. Using lower efficient string matching algorithm may make these applications to become a performance bottleneck in network. So it is very necessary to develop faster and more efficient string matching algorithms in order to overcome the troubles on performance. On a basis of Boyer-Moore-Horspool algorithm, a new string matching algorithm is presented in this paper. The algorithm is described in detail. The new algorithm has been greatly improved. The algorithm is one simplification of Boyer-Moore-Horspool algorithm. Array NEXT in Preprocessing stage is redesigned. A novel generated rules are presented. Using these rules, a simple NEXT is generated. And based on the concept of reference point, all make the algorithm to have better performance and more efficient. These characteristics will be useful in all these applications. Main features of the algorithm are presented, then explained its work processes. The algorithm also passed test and is validated. The test results show that the algorithm has better performance than Boyer-Moore algorithm and Boyer-Moore-Horspool algorithm, and more simple and efficient.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133103249","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192996
Wenjie Li, Yiping Gong, B. Liu
Many researchers have pointed out that using complex scheduling algorithms in input queuing switches with VOQ (Virtual Output Queuing) can achieve 100% throughput. But these algorithms are too complex to be implemented in hardware. In this paper, based on combined input/output queuing (CIOQ) switch fabrics, we propose a simple scheduling algorithm named OPRR (Outlet Priority Round Robin). For the synthetic workloads we consider, including uniform and bursty traffic models, the performance of OPRR in VOQ and single queue mode is evaluated respectively. Through the simulation results we show that 1) OPRR algorithm, coupled with a speedup of 2, can lead to performance very close to output queuing switches, and 2) under the same condition the single queue mode behaves almost identically to VOQ mode. These results are very useful to direct the design and implementation of switch fabrics in core routers.
{"title":"Performance evaluation of crossbar switch fabrics in core routers","authors":"Wenjie Li, Yiping Gong, B. Liu","doi":"10.1109/AINA.2003.1192996","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192996","url":null,"abstract":"Many researchers have pointed out that using complex scheduling algorithms in input queuing switches with VOQ (Virtual Output Queuing) can achieve 100% throughput. But these algorithms are too complex to be implemented in hardware. In this paper, based on combined input/output queuing (CIOQ) switch fabrics, we propose a simple scheduling algorithm named OPRR (Outlet Priority Round Robin). For the synthetic workloads we consider, including uniform and bursty traffic models, the performance of OPRR in VOQ and single queue mode is evaluated respectively. Through the simulation results we show that 1) OPRR algorithm, coupled with a speedup of 2, can lead to performance very close to output queuing switches, and 2) under the same condition the single queue mode behaves almost identically to VOQ mode. These results are very useful to direct the design and implementation of switch fabrics in core routers.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"66 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133614650","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192852
Mikito Nakamura, Jianhua Ma, K. Chiba, M. Shizuka, Yoichiro Miyoshi
The most shared applications use the client/server model in which, however a server is usually very complex and heavy since all of group managements are done by the server and sometimes becomes a communication bottleneck as all of date exchange among group members are mediated via it. To solve the above problems, our shared browser adopted a pure peer-to-peer (P2P) architecture without using any server A group member or a device called a peer dynamically finds other peers via distributed searching, and directly exchange data with other peers. It supports not only sharing a Web document in a peer group but also synchronously viewing the document and manipulating the browser with further support of some group users' awareness information like a user's moving a cursor, entering a new URL and clicking a hyperlink. It is implemented using JXTA protocols and Java programming language. To make the system applicable over the Internet across firewalls and NATs, the HTTP protocol can be used to transfer data via a pipe, a communication mechanism in JXTA.
大多数共享的应用程序使用客户机/服务器模型，但是在这种模型中，服务器通常非常复杂和沉重，因为所有的组管理都由服务器完成，并且有时会成为通信瓶颈，因为组成员之间的所有数据交换都通过它进行调解。为了解决上述问题，我们的共享浏览器采用了一种纯P2P (peer- To -peer)架构，不使用任何服务器。组成员或称为peer的设备通过分布式搜索动态地找到其他peer，并直接与其他peer交换数据。它不仅支持在对等组中共享Web文档，还支持同步查看文档和操作浏览器，并进一步支持某些组用户的感知信息，如用户移动光标、输入新URL和单击超链接。它使用JXTA协议和Java编程语言实现。为了使系统能够在Internet上跨防火墙和nat应用，可以使用HTTP协议通过管道(JXTA中的一种通信机制)传输数据。
{"title":"Design and implementation of a P2P shared Web browser using JXTA","authors":"Mikito Nakamura, Jianhua Ma, K. Chiba, M. Shizuka, Yoichiro Miyoshi","doi":"10.1109/AINA.2003.1192852","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192852","url":null,"abstract":"The most shared applications use the client/server model in which, however a server is usually very complex and heavy since all of group managements are done by the server and sometimes becomes a communication bottleneck as all of date exchange among group members are mediated via it. To solve the above problems, our shared browser adopted a pure peer-to-peer (P2P) architecture without using any server A group member or a device called a peer dynamically finds other peers via distributed searching, and directly exchange data with other peers. It supports not only sharing a Web document in a peer group but also synchronously viewing the document and manipulating the browser with further support of some group users' awareness information like a user's moving a cursor, entering a new URL and clicking a hyperlink. It is implemented using JXTA protocols and Java programming language. To make the system applicable over the Internet across firewalls and NATs, the HTTP protocol can be used to transfer data via a pipe, a communication mechanism in JXTA.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117216839","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192915
M. Raynal
A concurrent object is an object that can be concurrently accessed by several processes. Sequential consistency is a consistency criterion for such objects. It informally states that a multiprocess program executes correctly if its results could have been produced by executing that program on a single processor system. (Sequential consistency is weaker than atomic consistency-the usual consistency criterion-as it does not refer to real-time.) The paper proposes a new, surprisingly simple protocol that ensures sequential consistency when the shared memory abstraction is supported by the local memories of nodes that can communicate only by exchanging messages through reliable channels. The protocol nicely combines, in a simple way, the use a of token with cached values. It has the noteworthy property to never invalidate cached values, thereby providing fast read operations (i.e., a process has never to wait to get a correct value of a shared object). Additionally, The paper presents a simple token navigation protocol.
{"title":"Token-based sequential consistency in asynchronous distributed systems","authors":"M. Raynal","doi":"10.1109/AINA.2003.1192915","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192915","url":null,"abstract":"A concurrent object is an object that can be concurrently accessed by several processes. Sequential consistency is a consistency criterion for such objects. It informally states that a multiprocess program executes correctly if its results could have been produced by executing that program on a single processor system. (Sequential consistency is weaker than atomic consistency-the usual consistency criterion-as it does not refer to real-time.) The paper proposes a new, surprisingly simple protocol that ensures sequential consistency when the shared memory abstraction is supported by the local memories of nodes that can communicate only by exchanging messages through reliable channels. The protocol nicely combines, in a simple way, the use a of token with cached values. It has the noteworthy property to never invalidate cached values, thereby providing fast read operations (i.e., a process has never to wait to get a correct value of a shared object). Additionally, The paper presents a simple token navigation protocol.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114982366","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192957
Xiaoming Fu, C. Kappler
RSVP is a reservation setup protocol designed specifically to support QoS signaling in the Internet. However, RSVP end-to-end signaled QoS for the Internet has not become a reality. Moreover, there are many other applications demanding different signaling services. The paper analyses the features of RSVP version 1 we believe to be essential, and its complexity due to QoS-oriented design and multicast support as an indispensable component in a signaling protocol, deriving the design principles to be covered in a more generic signaling protocol. Based on this analysis, we present a light-weight version of RSVP, RSVP Lite, which clearly separates the signaled data from signaling messages and removes the multicast capability from the mandatory components of RSVP. RSVP Lite is intended to be applicable to a wide range of networking environments, while providing the flexibility to serve for generic signaling purposes and incremental deployment in the Internet.
{"title":"Towards RSVP Lite: light-weight RSVP for generic signaling","authors":"Xiaoming Fu, C. Kappler","doi":"10.1109/AINA.2003.1192957","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192957","url":null,"abstract":"RSVP is a reservation setup protocol designed specifically to support QoS signaling in the Internet. However, RSVP end-to-end signaled QoS for the Internet has not become a reality. Moreover, there are many other applications demanding different signaling services. The paper analyses the features of RSVP version 1 we believe to be essential, and its complexity due to QoS-oriented design and multicast support as an indispensable component in a signaling protocol, deriving the design principles to be covered in a more generic signaling protocol. Based on this analysis, we present a light-weight version of RSVP, RSVP Lite, which clearly separates the signaled data from signaling messages and removes the multicast capability from the mandatory components of RSVP. RSVP Lite is intended to be applicable to a wide range of networking environments, while providing the flexibility to serve for generic signaling purposes and incremental deployment in the Internet.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115043350","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
扫码关注我们
求助内容：
应助结果提醒方式：