Maxmin is a flow control mechanism based on fairness criteria. In this paper we consider the problem of routing and maxmin rate allocation over a communication network. We present two contributions in this paper. The first contribution is to provide a new relative maxmin definition and to extend the concepts of advertised rate from single-path to multi-path networks. The second contribution is to propose a novel multi- path maxmin routing scheme based on new advertised rate algorithm. We prove that this new scheme will converge to relative maxmin solution.
{"title":"Using Advertised Rate for Multi-Path Relative Maxmin Routing","authors":"D. Tsai, W. Tsai, Pohao Huang","doi":"10.1109/CCNC.2007.100","DOIUrl":"https://doi.org/10.1109/CCNC.2007.100","url":null,"abstract":"Maxmin is a flow control mechanism based on fairness criteria. In this paper we consider the problem of routing and maxmin rate allocation over a communication network. We present two contributions in this paper. The first contribution is to provide a new relative maxmin definition and to extend the concepts of advertised rate from single-path to multi-path networks. The second contribution is to propose a novel multi- path maxmin routing scheme based on new advertised rate algorithm. We prove that this new scheme will converge to relative maxmin solution.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116700386","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}
Nowadays, the growing demand on the implantation of onboard services for road vehicles encourages its development as a part of the current and future vehicles. In this sense, the implementation of new facilities cannot lead to an increase of hardware devices in the driver compartment, because space limitations and the need of an easy non-distracting interface with the user must be considered. For these reasons, it is advisable to have a service architecture suitable for further developments, considering the requirements of extensibility. New services should be created using modules shareable with the rest of applications in the vehicle. For this purpose, this work shows an extensible architecture useful in the software development of road services for vehicles. The solution presented is based on the division of services in different levels of abstraction, according to the underlying hardware. This structure is placed over a general purpose computer. A wide range of sensors has been installed in our test vehicle, allowing the implementation of several context aware services, and proving the feasibility of the proposed solution. A set of examples of location based services (LBS), multimedia services, and advanced driver assistance systems (ADAS) has been developed as described in this paper. Index Terms—Embedded Platforms, Service Composition, OS- Gi, Location-based Services.
{"title":"A Multiplatform OSGi Based Architecture for Developing Road Vehicle Services","authors":"J. Santa, Benito Úbeda Miñaro, A. Gómez-Skarmeta","doi":"10.1109/CCNC.2007.144","DOIUrl":"https://doi.org/10.1109/CCNC.2007.144","url":null,"abstract":"Nowadays, the growing demand on the implantation of onboard services for road vehicles encourages its development as a part of the current and future vehicles. In this sense, the implementation of new facilities cannot lead to an increase of hardware devices in the driver compartment, because space limitations and the need of an easy non-distracting interface with the user must be considered. For these reasons, it is advisable to have a service architecture suitable for further developments, considering the requirements of extensibility. New services should be created using modules shareable with the rest of applications in the vehicle. For this purpose, this work shows an extensible architecture useful in the software development of road services for vehicles. The solution presented is based on the division of services in different levels of abstraction, according to the underlying hardware. This structure is placed over a general purpose computer. A wide range of sensors has been installed in our test vehicle, allowing the implementation of several context aware services, and proving the feasibility of the proposed solution. A set of examples of location based services (LBS), multimedia services, and advanced driver assistance systems (ADAS) has been developed as described in this paper. Index Terms—Embedded Platforms, Service Composition, OS- Gi, Location-based Services.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122461020","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}
Intra prediction is an effective tool for coding still images and intra pictures in video. The H.264/AVC video compression standard uses extrapolation of the reconstructed pixels surrounding the target block to be coded to form the sample predictor block. Our previous paper augmented this conventional intra prediction method with sample predictor blocks generated using pixel based texture synthesis by template matching methods. This paper describes further improvements and refinements of the sample predictor block creation method. Multiple candidate sample predictor blocks were created using template matching. A weighted average of the multiple candidates then formed the final sample predictor block. Improvements in coding efficiency by more than 15% in bitrates were achieved by this refined method compared to the conventional intra prediction. The impact of the search window and the different template shapes used in the template matching method was also studied and presented.
{"title":"Intra Prediction by Averaged Template Matching Predictors","authors":"T. K. Tan, C. Boon, Yoshinori Suzuki","doi":"10.1109/CCNC.2007.86","DOIUrl":"https://doi.org/10.1109/CCNC.2007.86","url":null,"abstract":"Intra prediction is an effective tool for coding still images and intra pictures in video. The H.264/AVC video compression standard uses extrapolation of the reconstructed pixels surrounding the target block to be coded to form the sample predictor block. Our previous paper augmented this conventional intra prediction method with sample predictor blocks generated using pixel based texture synthesis by template matching methods. This paper describes further improvements and refinements of the sample predictor block creation method. Multiple candidate sample predictor blocks were created using template matching. A weighted average of the multiple candidates then formed the final sample predictor block. Improvements in coding efficiency by more than 15% in bitrates were achieved by this refined method compared to the conventional intra prediction. The impact of the search window and the different template shapes used in the template matching method was also studied and presented.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131453926","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}
Ambient networks is a new networking concept for beyond 3G. An ambient network is defined as one or more network nodes or devices that share a common network control plane. Network composition is a core concept of ambient networks. It requires the composition of the different registries hosted by the composing ambient networks. These registries may be heterogeneous. Entities in a given network may also need to access information hosted by a registry in another network. This makes the problem of information discovery and publication after composition very challenging. This paper proposes a solution based on an overlay architecture. We introduce the functional entities of the overlay architecture; present the procedures and messages related to the publication and discovery of information and describe the implementation of a proof-of-concept prototype based on JXTA, a middleware commonly used in peer-to-peer settings.
{"title":"An Overlay Architecture for Information Publication and Discovery After the Composition of Registries in Ambient Networks","authors":"F. Belqasmi, R. Glitho, R. Dssouli","doi":"10.1109/CCNC.2007.28","DOIUrl":"https://doi.org/10.1109/CCNC.2007.28","url":null,"abstract":"Ambient networks is a new networking concept for beyond 3G. An ambient network is defined as one or more network nodes or devices that share a common network control plane. Network composition is a core concept of ambient networks. It requires the composition of the different registries hosted by the composing ambient networks. These registries may be heterogeneous. Entities in a given network may also need to access information hosted by a registry in another network. This makes the problem of information discovery and publication after composition very challenging. This paper proposes a solution based on an overlay architecture. We introduce the functional entities of the overlay architecture; present the procedures and messages related to the publication and discovery of information and describe the implementation of a proof-of-concept prototype based on JXTA, a middleware commonly used in peer-to-peer settings.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121793260","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}
The area of cryptography called broad- cast encryption has been used very successfully in content protection systems, especially protecting physical media. Today, however, a basic symmetric- key broadcast encryption system would depend on message authentication codes, not digital signatures, to "sign" data items. Message authentication codes are very efficient, but have other significant limi- tations. As commercial content protection systems based on broadcast encryption have continued to be introduced, each with more complexity than the previous one, the limitations have become apparent. The systems' designers have had to consider adding a public-key infrastructure on top of their broadcast encryption mechanism, with redundent credentials and revocation, just to add a digital signature feature. This paper presents a new broadcast-encryption- based attestation scheme that mimicks a digital sig- nature scheme, without the computational overhead inherent in public-key calculations. Although the scheme has limitations compared to public-key sig- natures, they do not reduce its effectiveness, because they are the same limitations that are present in any broadcast encryption system.
{"title":"A Signature-Like Primitive for Broadcast-Encryption-Based Systems","authors":"J. Lotspiech","doi":"10.1109/CCNC.2007.210","DOIUrl":"https://doi.org/10.1109/CCNC.2007.210","url":null,"abstract":"The area of cryptography called broad- cast encryption has been used very successfully in content protection systems, especially protecting physical media. Today, however, a basic symmetric- key broadcast encryption system would depend on message authentication codes, not digital signatures, to \"sign\" data items. Message authentication codes are very efficient, but have other significant limi- tations. As commercial content protection systems based on broadcast encryption have continued to be introduced, each with more complexity than the previous one, the limitations have become apparent. The systems' designers have had to consider adding a public-key infrastructure on top of their broadcast encryption mechanism, with redundent credentials and revocation, just to add a digital signature feature. This paper presents a new broadcast-encryption- based attestation scheme that mimicks a digital sig- nature scheme, without the computational overhead inherent in public-key calculations. Although the scheme has limitations compared to public-key sig- natures, they do not reduce its effectiveness, because they are the same limitations that are present in any broadcast encryption system.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133276499","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}
Y. P. Fallah, Darrell Koskinen, Avideh Shahabi, Faizal Karim, P. Nasiopoulos
Supporting video applications over 802.11 wireless local area networks is a challenging task due to the constant fluctuations in channel error rates and the inefficiency of the MAC layer. New video compression technologies, such as H.264, provide a network adaptation layer for adapting the output of the video encoder to the characteristics of the underlying transport network. In this article we demonstrate that it is possible to improve the performance of H.264 video applications over 802.11 WLANs through a cross-layer design that optimizes the encoded H.264 packet sizes. We propose the use of aggregation and fragmentation mechanisms to create the optimal frame lengths. We also investigate several application layer error
{"title":"A Cross Layer Optimization Mechanism to Improve H.264 Video Transmission over WLANs","authors":"Y. P. Fallah, Darrell Koskinen, Avideh Shahabi, Faizal Karim, P. Nasiopoulos","doi":"10.1109/CCNC.2007.177","DOIUrl":"https://doi.org/10.1109/CCNC.2007.177","url":null,"abstract":"Supporting video applications over 802.11 wireless local area networks is a challenging task due to the constant fluctuations in channel error rates and the inefficiency of the MAC layer. New video compression technologies, such as H.264, provide a network adaptation layer for adapting the output of the video encoder to the characteristics of the underlying transport network. In this article we demonstrate that it is possible to improve the performance of H.264 video applications over 802.11 WLANs through a cross-layer design that optimizes the encoded H.264 packet sizes. We propose the use of aggregation and fragmentation mechanisms to create the optimal frame lengths. We also investigate several application layer error","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133451951","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}
This paper proposes a content-sharing mechanism, which is both secure and usable for wireless guest devices. It is very difficult for average users to allow a guest device to share its content with the users’ devices supporting the principle of least privilege in the current Wi-Fi infrastructure home network environment. As a result, most people do not configure the security feature of their devices. The proposed mechanism frees users from security and tedious operations, thus enabling secure content sharing by a simple and intuitive user interaction via just one touch. Our evaluation shows that the proposed mechanism is secure and usable. Keywords-
{"title":"Content-Sharing for Dummies: A Secure and Usable Mechanism in Wi-Fi Infrastructure Home Networks","authors":"Sung-Min Lee, Se-Hee Han, K. Shin","doi":"10.1109/CCNC.2007.61","DOIUrl":"https://doi.org/10.1109/CCNC.2007.61","url":null,"abstract":"This paper proposes a content-sharing mechanism, which is both secure and usable for wireless guest devices. It is very difficult for average users to allow a guest device to share its content with the users’ devices supporting the principle of least privilege in the current Wi-Fi infrastructure home network environment. As a result, most people do not configure the security feature of their devices. The proposed mechanism frees users from security and tedious operations, thus enabling secure content sharing by a simple and intuitive user interaction via just one touch. Our evaluation shows that the proposed mechanism is secure and usable. Keywords-","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134204139","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}
Large-scale network applications are expected to be more autonomous and adaptive to dynamic changes in the net- work to improve user experience, expand applications' opera- tional longevity and reduce maintenance cost. Based on the ob- servation that various biological systems have already met the requirements (i.e., autonomy and adaptability), this paper de- scribes a biologically-inspired framework, called iNet, to design autonomous and adaptive network applications. iNet is designed after the mechanisms behind how the immune system works. iNet models a set of environment conditions (e.g., network traffic and resource availability) as an antigen and a behavior of network applications (e.g., migration and reproduction) as an antibody. iNet allows network applications to autonomously sense its sur- rounding environment conditions (i.e., antigens) and adaptively invoke a behavior (i.e., antibody) suitable for the conditions. The configuration of antibodies evolves via genetic operations (e.g., mutation and crossover). Simulation results show that iNet allows agents to autonomously adapt to changing environment condi- tions by invoking their behaviors suitable for the current envi- ronment condition and evolving their antibody configurations.
{"title":"An Immunologically-Inspired Adaptation Mechanism for Evolvable Network Applications","authors":"Chonho Lee, J. Suzuki","doi":"10.1109/CCNC.2007.91","DOIUrl":"https://doi.org/10.1109/CCNC.2007.91","url":null,"abstract":"Large-scale network applications are expected to be more autonomous and adaptive to dynamic changes in the net- work to improve user experience, expand applications' opera- tional longevity and reduce maintenance cost. Based on the ob- servation that various biological systems have already met the requirements (i.e., autonomy and adaptability), this paper de- scribes a biologically-inspired framework, called iNet, to design autonomous and adaptive network applications. iNet is designed after the mechanisms behind how the immune system works. iNet models a set of environment conditions (e.g., network traffic and resource availability) as an antigen and a behavior of network applications (e.g., migration and reproduction) as an antibody. iNet allows network applications to autonomously sense its sur- rounding environment conditions (i.e., antigens) and adaptively invoke a behavior (i.e., antibody) suitable for the conditions. The configuration of antibodies evolves via genetic operations (e.g., mutation and crossover). Simulation results show that iNet allows agents to autonomously adapt to changing environment condi- tions by invoking their behaviors suitable for the current envi- ronment condition and evolving their antibody configurations.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"21 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114028059","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}
In the standard Mobile IPv6 (MIPv6), the bidirectional tunnelling through the home agent or the route optimization show inefficiency in per-packet routing, especially when both communicating endpoints are mobile. To be scalable and compatible, mobile devices’ packets should be routed efficiently with minimal changes to the network infrastructure. However, the current solutions do not provide any means for the end systems to perform optimized packet routing during the operation of the mobile devices. In this paper, we present an end-to-end tunnelling extension to MIPv6 (E 2 T) for mobile routing packets, which reduces the per-packet routing cost for the communications of mobile devices through the lower packet routing overhead. Besides, our approach requires little change to MIPv6, but allows the more efficient routing behavior with the shorter end-to-end transmission latency between communicating endpoints. The simulation results show our approach is suitable for real-time multimedia applications.
{"title":"E²T: End-to-End Tunneling Extension to Mobile IPv6","authors":"Deguang Le, Xiaoming Fu, X. Gu, D. Hogrefe","doi":"10.1109/CCNC.2007.24","DOIUrl":"https://doi.org/10.1109/CCNC.2007.24","url":null,"abstract":"In the standard Mobile IPv6 (MIPv6), the bidirectional tunnelling through the home agent or the route optimization show inefficiency in per-packet routing, especially when both communicating endpoints are mobile. To be scalable and compatible, mobile devices’ packets should be routed efficiently with minimal changes to the network infrastructure. However, the current solutions do not provide any means for the end systems to perform optimized packet routing during the operation of the mobile devices. In this paper, we present an end-to-end tunnelling extension to MIPv6 (E 2 T) for mobile routing packets, which reduces the per-packet routing cost for the communications of mobile devices through the lower packet routing overhead. Besides, our approach requires little change to MIPv6, but allows the more efficient routing behavior with the shorter end-to-end transmission latency between communicating endpoints. The simulation results show our approach is suitable for real-time multimedia applications.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115593449","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}
-Disjoint Multipath QoS (quality of service) Routing algorithm is aimed at selecting multiple paths for a flow in a peer to peer network, which are mutually disjoint w.r.t. bottleneck links. The Widest Disjoint Paths (WDP) algorithm [3][4] assumes a static set of available paths for each source-destination pair a priori, from which disjoint paths w.r.t. bottleneck links are selected. The Shortest Widest Path (SWP) algorithm [9] dynamically determines one path for each source-destination pair, which is shortest among widest ones. The proposed Disjoint Multipath QoS Routing algorithm dynamically finds paths mutually disjoint w.r.t. bottleneck links, which are shortest among widest ones. Thus, the algorithm generalizes both WDP and SWP algorithms. In many important multimedia applications such as video over IP in telehealth application, the applicationand network-layer must collaborate in order to provide some necessary QoS guarantee. The network-layer should provide certain level of QoS measures, based on which the application-layer is able to compensate for deficiency of achieved QoS level. Those QoS measures may include end-to-end bandwidth, delay and packet loss rate, etc. The Disjoint Multipath QoS Routing algorithm is designed to achieve certain QoS level the application-layer can easily work with. In this paper, we only deal with the network-layer part and will focus on a scenario of one source and one destination. Simulation results and performance analysis demonstrate that the algorithm converges, offers lower end-to-end packet loss rate and higher throughput in comparison with SWP and Dijkstra Shortest Path algorithm as network traffic grows. Keywords--Disjoint path; Multipath routing; Bottleneck link; Bandwidth; Delay; Packet Loss Rate
{"title":"Disjoint Multipath QoS Routing","authors":"X. Zhuang, Shangming Zhu","doi":"10.1109/CCNC.2007.115","DOIUrl":"https://doi.org/10.1109/CCNC.2007.115","url":null,"abstract":"-Disjoint Multipath QoS (quality of service) Routing algorithm is aimed at selecting multiple paths for a flow in a peer to peer network, which are mutually disjoint w.r.t. bottleneck links. The Widest Disjoint Paths (WDP) algorithm [3][4] assumes a static set of available paths for each source-destination pair a priori, from which disjoint paths w.r.t. bottleneck links are selected. The Shortest Widest Path (SWP) algorithm [9] dynamically determines one path for each source-destination pair, which is shortest among widest ones. The proposed Disjoint Multipath QoS Routing algorithm dynamically finds paths mutually disjoint w.r.t. bottleneck links, which are shortest among widest ones. Thus, the algorithm generalizes both WDP and SWP algorithms. In many important multimedia applications such as video over IP in telehealth application, the applicationand network-layer must collaborate in order to provide some necessary QoS guarantee. The network-layer should provide certain level of QoS measures, based on which the application-layer is able to compensate for deficiency of achieved QoS level. Those QoS measures may include end-to-end bandwidth, delay and packet loss rate, etc. The Disjoint Multipath QoS Routing algorithm is designed to achieve certain QoS level the application-layer can easily work with. In this paper, we only deal with the network-layer part and will focus on a scenario of one source and one destination. Simulation results and performance analysis demonstrate that the algorithm converges, offers lower end-to-end packet loss rate and higher throughput in comparison with SWP and Dijkstra Shortest Path algorithm as network traffic grows. Keywords--Disjoint path; Multipath routing; Bottleneck link; Bandwidth; Delay; Packet Loss Rate","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"319 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116232200","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
扫码关注我们
求助内容：
应助结果提醒方式：