{"title":"Strategy-based path selection for traffic engineering over MPLS","authors":"Lei Li, Yangchun Li, H. Yamada","doi":"10.1109/IPOM.2004.1547592","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547592","url":null,"abstract":"The advantage of multi-protocol label switching (MPLS) is its capability to route the packets through explicit paths. And for traffic engineering over MPLS, the key is to select suitable paths to balance the network load to optimize network resource utilization and traffic performance. And from network carriers' point of view, such optimization should be based on their individual networks, service requirements as well as their own administrative policies. In this paper, we present a method to provide the capability to control traffic engineering so that the carriers can define their own strategies for optimizations and apply them to path selection for both QoS routing and dynamic load balancing.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125389029","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}
{"title":"Fixed-length switching vs. variable-length switching in input-queued IP switches","authors":"Chengchen Hu, Xuefei Chen, Wenjie Li, B. Liu","doi":"10.1109/IPOM.2004.1547602","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547602","url":null,"abstract":"Many large-scale, high speed routers adopt input-queued switches with virtual output queuing (VOQ) for preventing head of line (HOL) blocking. Switching based on cell-by-cell scheduling algorithms (fixed-length switching) have been widely studied for years, while a new idea of transferring IP packet based on a packet-by-packet scheduling algorithm (variable-length switching) has been proposed recently. Fixed-length and variable-length switching can be significantly different in performance and implementation complexity. This paper establishes experiments at the aim of evaluating one design issue: whether it should be fixed-length switching or variable-length switching. We investigate various performance measures of interest: bandwidth utilization, packet loss, segmentation and reassembling overhead, as well as average packet latency. The focus of the paper is on identifying key parameters that influence the outcome of this comparison, and on quantifying the potential benefits of each switching mode.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124768645","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}
{"title":"Extended DWRR scheduling algorithm in PFTS","authors":"Dengyuan Xu, Xinyou Zhang, Jun Zhao","doi":"10.1109/IPOM.2004.1547616","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547616","url":null,"abstract":"The novel concept of physical frame time-slot switching (PFTS) over DWDM (Huaxin Zeng, et al., 2003) has been around for some time. It differs from existing switching techniques over DWDM by its superior QoS mechanisms embedded in and its capability to simplify Internet into a single physical-layer user-data transfer platform architecture (SUPA). This paper proposed the extended deficit weighted round robin (EDWRR) algorithm of output scheduling in a multiple-priority queue environment in PFTS nodes. In such nodes, there are multi-ports in a DWDM-based PFTS node and each port contains multi-lambdas. EDWRR guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is an improvement and extension of deficit weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a frame transmission procedure based on delay priority. Simulations show that EDWRR has better performance than DWRR in QoS provision of real-time traffic.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122276351","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}
{"title":"Semantic scheme to extract attack strategies for Web service network security","authors":"W. Yan, Fang Liu","doi":"10.1109/IPOM.2004.1547600","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547600","url":null,"abstract":"In the recent years, Web technologies have been used to provide an interface to the distributed services. The advent of the computer networks has accelerated this development, and has sparked the emergence of the numerous environments that enable Web services. However, the computer network security against the distributed denial of service attacks (DDoS) attacks attracts more attentions. The overwhelming alerts generated by the intrusion detection systems make it hard for the security administrator to analyze and extract the attack strategies, which hampers the performance of the attack detection. One method to resolve the problem is the attack scenarios extraction. In this paper, we propose a novel way to correlate the alerts and extract the attack scenarios. The modified case grammar, principal-subordinate consequence tagging case grammar and the alert semantic network, are used to generate the attack classes. Alerts mutual information is also applied to calculate the alert semantic context window size. Afterwards, based on the alert context, the attack instances are extracted.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130919275","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}
C. Aoun, M. Stiemerling, E. Davies, Hannes Tschofenig
{"title":"Path-directed signaling usage in the Internet","authors":"C. Aoun, M. Stiemerling, E. Davies, Hannes Tschofenig","doi":"10.1109/IPOM.2004.1547618","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547618","url":null,"abstract":"The real-time nature and complexity of multimedia applications, the availability of Internet connectivity from everywhere in the globe and deployments of heterogeneous application hosts, increases the challenges for widespread deployments of multimedia applications. These applications need to receive the appropriate quality of service (QoS), without topology awareness, through firewalls and network address translators (NATs). This document analyses how path-directed network signaling protocols can be used to meet the challenges imposed on multimedia application deployments. It demonstrates how standards organizations can minimize the proliferation of signaling protocols intended to control network services, especially the ones requiring network topology knowledge.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130961136","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}
{"title":"An energy-aware probability routing in MANETs","authors":"Xiaomei Wang, Lin Li, Chongsen Ran","doi":"10.1109/IPOM.2004.1547607","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547607","url":null,"abstract":"To provide portability, nodes in mobile ad hoc networks (MANETs) usually use battery as power. Thus the lifetime of the node is limited by its residual battery energy. Energy efficiency becomes a key issue to be considered in the network self-operating and self-managing process for MANETs. In order to maximize the node lifetime and further to maximize the network lifetime, the energy consumption of the nodes has not only to be minimized but also to be balanced. This paper proposes a new simple and efficient routing, called energy-aware probability routing (EAPR). EAPR introduces a probability model in the DSR (dynamic source routing) route discovery procedure, implicitly balances the communication traffic and further achieves balanced energy consumption among all the nodes in MANETs. We analyze the coefficient /spl alpha/ in the probability model and illustrate its effect on EAPR through simulations. Also simulations illustrate that EAPR outperforms DSR in terms of the balanced energy consumption distribution among the nodes in the network.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133289862","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}
{"title":"CoS based resource allocation (CBRA) in VPNs over MPLS","authors":"P. Kumar, N. Dhanakoti, S. Gopalan, V. Sridhar","doi":"10.1109/IPOM.2004.1547606","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547606","url":null,"abstract":"A virtual private network (VPN) is provisioned over public network infrastructure to provide dedicated connectivity to a closed group of users. Resource guaranteed VPNs are static and require complex service level agreements (SLAs), whereas tunnelled VPNs, such as those in use over the Internet, are more lightweight but do not assure quality of service (QoS). In this paper, we propose a programmable tempest framework for class of service (CoS) based resource allocation (CBRA) in multi protocol label switching (MPLS) tunnelled VPNs. Switchlet based resource partitioning concept is used to create, build and provision multiple VPNs on demand. The proposed approach provides overlay control architecture for both intra-and inter-VPN resource allocations. The intra-VPN resource allocation is based on class of service (CoS) arbitration using derived labels and derived switchlets and inter-VPN resource allocation is through bandwidth brokering (BB). We have evaluated the intra-VPN resource allocation and management by enhancing the MPLS label space with CoS based derived labels and initial results are encouraging.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122368153","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}
Zongkai Yang, Yan Liu, Guanxiang Zhang, Jianhua He
{"title":"On loss rate measurement at receivers over wireless access links","authors":"Zongkai Yang, Yan Liu, Guanxiang Zhang, Jianhua He","doi":"10.1109/IPOM.2004.1547613","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547613","url":null,"abstract":"In hybrid wired/wireless networks, high bit error rate on wireless link brings problem of over-estimation of loss rate to those protocols requiring loss rate measurement. To eliminate this problem, this paper proposes a scheme to distinguish the bit error induced random loss from congestion loss at receivers over wireless links. A new metric of \"variation on forward-path delay\" is introduced to track the change on the network congestion level and be the criterion for the distinguishing between the random loss and congestion loss. Extensive simulation results show that our scheme distinguishes random loss from congestion loss effectively, and thus helps the receiver measure the loss rate accurately.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125375310","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}
{"title":"IP traceback marking scheme based packets filtering mechanism","authors":"Sharon Yan Ping, Lee Moonchuen","doi":"10.1109/IPOM.2004.1547625","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547625","url":null,"abstract":"Denial of service attacks have become one of the most serious threats to the Internet community. One effective means to defend against such attacks is to locate the attack source(s) and to filter out the attack traffic. To locate the attack source(s), this paper proposes an adaptive packet marking scheme for IP traceback, which supports two types of marking. A participating border router would perform deterministic router id marking when a packet enters the network for the first time, and probabilistic domain id marking when it receives a packet from another domain. After collecting sufficient packets, the victim would reconstruct the attack graph incorporating attack paths and the source router(s) identified, with each node on the paths viewed as a domain. Based on the attack graph traced back we propose to let the filtering agent(s) inspect the markings inscribed in the received packets and filter the packets with a marking matching with the attack signatures. Simulation results show that the proposed marking scheme outperforms other IP traceback methods as it requires fewer packets for attack paths reconstruction, and can handle large number of attack sources effectively with relatively low false positives produced. Meanwhile, with the attack packets filtering mechanism, around 80% attack traffic would be removed and the normal traffic can be efficiently preserved in order to restore the victim's service.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133765548","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}
{"title":"Application of QoS assembly algorithm in OBS networks using network processor","authors":"Wu Haishan, Jiao Shuo, Xu Kun, Lin Jin-tong","doi":"10.1109/IPOM.2004.1547608","DOIUrl":"https://doi.org/10.1109/IPOM.2004.1547608","url":null,"abstract":"Network processor (NP) is a kind of programmable processor performing network computing, usually used to build a router. It is a new challenge that NP is used to build not only a router but also a data stream shaper. In this paper, the combination of routing algorithm and QoS assembly algorithm for OBS network is implemented using NP, besides, some key design issues such as the fast packet forwarding, the implementation of assembly algorithm and queuing discipline are also discussed in detail. The result shows that the edge router designed is capable of forwarding data streams coming from Ethernet at the average speed of about 880 Mbps.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130368157","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}