Dragos Andrei - Academia.edu (original) (raw)
Papers by Dragos Andrei
Founded in 1991, the Mineta Transportation Institute (MTI), an organized research and training un... more Founded in 1991, the Mineta Transportation Institute (MTI), an organized research and training unit in partnership with the Lucas College and Graduate School of Business at San José State University (SJSU), increases mobility for all by improving the safety, efficiency, accessibility, and convenience of our nation's transportation system. Through research, education, workforce development, and technology transfer, we help create a connected world. MTI leads the four-university. MTI leads the four-university California State University Transportation Consortium funded by the State of California through Senate Bill 1. MTI's transportation policy work is centered on three primary responsibilities: MINETA TRANSPORTATION INSTITUTE Research MTI works to provide policy-oriented research for all levels of government and the private sector to foster the development of optimum surface transportation systems. Research areas include: bicycle and pedestrian issues; financing public and private sector transportation improvements; intermodal connectivity and integration; safety and security of transportation systems; sustainability of transportation systems; transportation / land use / environment; and transportation planning and policy development. Certified Research Associates conduct the research. Certification requires an advanced degree, generally a Ph.D., a record of academic publications, and professional references. Research projects culminate in a peer-reviewed publication, available on TransWeb, the MTI website (http://transweb.sjsu.edu). Education The Institute supports education programs for students seeking a career in the development and operation of surface transportation systems. MTI, through San José State University, offers an AACSBaccredited Master of Science in Transportation Management and graduate certificates in Transportation Management, Transportation Security, and High-Speed Rail Management that serve to prepare the nation's transportation managers for the 21st century. With the active assistance of the California Department of Transportation (Caltrans), MTI delivers its classes over a state-of-the-art videoconference network throughout the state of California and via webcasting beyond, allowing working transportation professionals to pursue an advanced degree regardless of their location. To meet the needs of employers seeking a diverse workforce, MTI's education program promotes enrollment to under-represented groups. Information and Technology Transfer MTI utilizes a diverse array of dissemination methods and media to ensure research results reach those responsible for managing change. These methods include publication, seminars, workshops, websites, social media, webinars, and other technology transfer mechanisms. Additionally, MTI promotes the availability of completed research to professional organizations and journals and works to PEER REVIEW San José State University, of the California State University system, and the Mineta Transportation Institute (MTI) Board of Trustees have agreed upon a peer review process required for all research published by MTI. The purpose of the review process is to ensure that the results presented are based upon a professionally acceptable research protocol.
2008 IEEE International Conference on Communications, 2008
OFC/NFOEC 2008 - 2008 Conference on Optical Fiber Communication/National Fiber Optic Engineers Conference, 2008
Abstract We investigate the problem of provisioning deadline-driven requests with flexible transm... more Abstract We investigate the problem of provisioning deadline-driven requests with flexible transmission rates in WDM mesh networks. We analyze the network's performance and cost for different node architectures and for different traffic distributions.
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, 2009
Abstract Many networking applications require distribution of data from a central point to multip... more Abstract Many networking applications require distribution of data from a central point to multiple destinations; this distribution can be efficiently achieved by the means of multicasting. Traditionally, multicasting has been considered for on-demand applications ...
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference, 2008
Abstract Many large-scale scientific applications need to aggregate large amounts of data from mu... more Abstract Many large-scale scientific applications need to aggregate large amounts of data from multiple distributed sites to a centralized facility. We call such a request as a data-aggregation request (DAR). In this study, we investigate the novel problem of on-demand ...
Journal of Optical Communications and Networking, 2010
The distribution of large data sets from a centralized node to several destination sites is frequ... more The distribution of large data sets from a centralized node to several destination sites is frequently required by many data-intensive networking applications; this distribution can be efficiently achieved by the means of multicasting. Multicasting has been typically considered for on-demand applications and services, e.g., video-on-demand, IPTV, etc., which usually require start of data transmission immediately. We consider that multicast sessions can be provisioned starting with flexible times and that the multicast client can specify a maximum allowed time by which all data needs to be delivered to destinations. This is true for e-Science and high-performance applications, in which data distribution is not necessarily immediate. In this paper, we study the problem of provisioning dynamic multicast data-distribution requests (MDDRs) with flexible scheduling over optical WDM networks. We consider the practical case of fractional-capacity multicast sessions that require less than the entire wavelength capacity (nodes are equipped with multicast-capable opaque switches). We devise provisioning methods based on the multicast tree (or light-tree) distribution model. In our first approach (named Rand), we generate multiple randomized alternate trees on which we try to provision the multicast session and then assign wavelengths and schedule the session. In our second approach (named AllSlots), we dynamically generate light-trees depending on the network state. In our next approach (named Break), when provisioning an entire tree fails, we try to "break" the tree into timeindependent subtrees. We also study the impact of allowing data to be buffered at intermediary nodes and then transmitted toward destinations (method named Buffer) and consider an approach that partitions the data sets. Finally, we study the impact of the switch architecture on our provisioning by restricting our approaches to full-wavelength MDDRs.
Optical Fiber Communication Conference and National Fiber Optic Engineers Conference, 2009
Abstract Network design for sliding scheduled traffic is a highly-complex task that has been deal... more Abstract Network design for sliding scheduled traffic is a highly-complex task that has been dealt by multistep approaches. We propose a scalable method, based on Lagrangean relaxation, which can perform integrated scheduling, routing and wavelength assignment.
Optical Switching and Networking, 2008
IP-over-WDM networks are starting to replace legacy telecommunications infrastructure and they fo... more IP-over-WDM networks are starting to replace legacy telecommunications infrastructure and they form a promising solution for next-generation networks (NGNs). Survivability of an IP-over-WDM network is gaining increasing interest from both the Internet research community and service providers (SPs). We consider a novel static bandwidth-provisioning algorithm to support differentiated services in a survivable IP-over-WDM network. We propose and investigate the characteristics of both integer linear program (ILP) and heuristic approaches to solve this problem. In the heuristic method, we propose backup reprovisioning to ensure network resilience against single-node or multiple-link failures. Illustrative examples compare and evaluate the performance of the two methods in terms of capacity-usage efficiency and computation time.
Journal of Lightwave Technology, 2009
We consider efficient network provisioning algorithms for applications that aggregate large data ... more We consider efficient network provisioning algorithms for applications that aggregate large data files from multiple remote sites to a central facility (where the aggregated data is further processed). Many important bandwidth-hungry scientific applications use such data aggregation, and it is important to efficiently use network resources to meet their requirements. We term an entire large-scale data-aggregation session as a data-aggregation request (DAR). In this paper, we investigate the problem of on-demand provisioning of DARs over a wavelength-division multiplexing (WDM) backbone network infrastructure. Our DAR provisioning problem is challenging, as for each DAR we need to jointly identify lightpaths (route, assign wavelengths, and groom) for each of the to-be-transferred files, and schedule DAR's file transfers in time. We first model our DAR provisioning problem mathematically as a mixed integer linear program (MILP); to solve our problem in practice, we propose a DAR provisioning algorithm (named DARP). From our numerical results, we find DARP to be efficient when compared with other benchmark algorithms. We study DARP's performance for a varying number of aggregating sites deployed in the network (i.e., sites with supercomputer facilities) and perform a detailed sensitivity analysis on several parameters of our problem. We also investigate the effect of partitioning the data to be transferred into pieces and conclude that, if the partitioning method is carefully designed, slight improvement over the approach that transfers the whole file (DARP) is possible.
IEEE/ACM Transactions on Networking, 2010
With the increasing diversity of applications supported over optical networks, new service guaran... more With the increasing diversity of applications supported over optical networks, new service guarantees must be offered to network customers. Among the emerging data-intensive applications are those which require their data to be transferred before a predefined deadline. We call these deadline-driven requests (DDRs). In such applications, data-transfer finish time (which must be accomplished before the deadline) is the key service guarantee that the customer wants. In fact, the amount of bandwidth allocated to transfer a request is not a concern for the customer as long as its service deadline is met. Hence, the service provider can choose the bandwidth (transmission rate) to provision the request. In this case, even though DDRs impose a deadline constraint, they provide scheduling flexibility for the service provider since it can choose the transmission rate while achieving two objectives: 1) satisfying the guaranteed deadline; and 2) optimizing the network's resource utilization. We investigate the problem of provisioning DDRs with flexible transmission rates in wavelength-division multiplexing (WDM) mesh networks, although this approach is generalizable to other networks also. We investigate several (fixed and adaptive to network state) bandwidth-allocation policies and study the benefit of allowing dynamic bandwidth adjustment, which is found to generally improve network performance. We show that the performance of the bandwidth-allocation algorithms depends on the DDR traffic distribution and on the node architecture and its parameters. In addition, we develop a mathematical formulation for our problem as a mixed integer linear program (MILP), which allows choosing flexible transmission rates and provides a lower bound for our provisioning algorithms.
A lambda grid is characterized by nodes connected by high speed optical infrastructure in which l... more A lambda grid is characterized by nodes connected by high speed optical infrastructure in which lightpaths can be set dynamically between end nodes. In this paper, we investigate the problem of downloading very large files requested by end nodes from data repositories connected to the lambda grid. To optimize the download time we propose to exploit a cooperative data-transfer mechanism
Numerous large-scale applications need to aggregate at a central facility large quantities of dat... more Numerous large-scale applications need to aggregate at a central facility large quantities of data from distributed sites connected by a lambda grid (which is an optical backbone network with mesh connectivity); thus this is a many- to-one problem. In a lambda grid, dedicated wavelength channels are used to set up end-to-end lightpaths between end nodes. The objective of our problem
Journal of Optical Communications and Networking, 2009
Many future Internet applications supported over optical networks may require large amounts of gu... more Many future Internet applications supported over optical networks may require large amounts of guaranteed bandwidth between two remote end hosts, but this bandwidth may not necessarily be needed immediately. To ensure a deterministic service, Internet customers may prefer to reserve network resources, e.g., lightpaths, in advance and may indicate an approximate time window in the future during which the bandwidth should be reserved for a certain period of time; however, the exact start time of the reservation is not specified, but can slide in the predefined time window. This type of user traffic is called "sliding scheduled traffic." Optical network design for provisioning sliding scheduled traffic is a highly complex task that has been dealt with in the literature by two-step approaches, which first schedule user demands in time and then perform their routing and wavelength assignment (RWA). We propose a scalable integrated design for the sliding scheduling provisioning problem (SSPP), based on the Lagrangean relaxation (LR) approach, which can jointly perform the scheduling and RWA of the demands. We first develop a new mathematical model for SSPP, to which it is suitable to apply the relaxation of some of the model's constraints. We use an integrated heuristic called IPSR (integrated provisioning of sliding requests), which is next enhanced with a cost assignment based on Lagrangean multiplier information, to serve as the primal algorithm for our LR approach (named IPSR-LR). We compare our approaches with an existing two-step heuristic algorithm for SSPP and show that both IPSR and IPSR-LR are able to outperform it. In addition, our numerical results show that IPSR-LR improves over IPSR under all typical experimental cases that we considered. Furthermore, we compare our approaches with the solutions provided by an integer linear program for the SSPP, which is, however, less scalable for large problem sizes compared with our algorithms.
Contemporary Topics in Ground Modification, Problem Soils, and Geo-Support, 2009
Data from 96 resilient modulus laboratory tests on four base materials and four subgrade soils wa... more Data from 96 resilient modulus laboratory tests on four base materials and four subgrade soils was used to develop a predictive model capable of estimating changes in resilient modulus as a function of changes in the state of stress, moisture and density. Test specimens were compacted at optimum moisture/density conditions and then dried or soaked to various moisture conditions. Both standard and modified compactive efforts were used. Plastic, subgrade-type soils were especially affected by moisture. Non-plastic, base-type materials were more sensitive to changes in the state of stress.
Transportation Research Record: Journal of the Transportation Research Board, 2004
A new laboratory test protocol for the measurement of resilient modulus of unbound pavement mater... more A new laboratory test protocol for the measurement of resilient modulus of unbound pavement materials is described. This harmonized protocol combines the best features from four state-of-the-art resilient modulus test procedures in current use. The harmonized procedure most closely follows the recommended protocol proposed in NCHRP Project 1-28, Appendix E, with some exceptions. The main modifications deal with revised and more rational stress sequences and a more accurate stress-dependent resilient modulus predictive equation. Thirteen different predictive models and 25 sets of resilient modulus test data were evaluated as the basis for the recommended predictive equation.
Road Materials and Pavement Design, 2007
Environmental conditions have a significant effect on the performance of both flexible and rigid ... more Environmental conditions have a significant effect on the performance of both flexible and rigid pavements. External factors such as precipitation, temperature, freeze-thaw cycles, and depth to water table play a key role in defining the bounds of the impact the environment can have on the pavement performance. As part of the new US Mechanistic-Empirical Pavement Design Guide (MEPDG) being developed under the overall project sponsored by the National Cooperative Highway Research Program (NCHRP project 1-37A), a climatic modelling tool called the Enhanced Integrated Climatic Model (EICM) was implemented to incorporate the changes in temperature and moisture of unbound materials into the design process. Currently a new independent review project (NCHRP 1-40) is reviewing this model to correct errors and to develop further enhancements to produce a final methodology ready for approval/disapproval vote by AASHTO in 2006. This paper reflects the methodology used for the MEPDG and present the models incorporated by Arizona State University into the EICM, the input needed and the outputs generated by the program. A discussion on how EICM determines the temperature and moisture distribution within the pavement system is also presented.
... iv Page 5. Mohammad Al-Baijat, Marilet Andrade, Dr. Amitabha Banerjee, Cicek Cavdar, Joonho ... more ... iv Page 5. Mohammad Al-Baijat, Marilet Andrade, Dr. Amitabha Banerjee, Cicek Cavdar, Joonho Choi, Pulak Chowdhury, Frederick Clarke, Dr. Davide Cuda, Ananya Das, Dr. Chris Develder, Elli Georgieva, Shruthi Harve, Dr. Anpeng Huang, Sheng Huang, Dr. Yurong ...
Founded in 1991, the Mineta Transportation Institute (MTI), an organized research and training un... more Founded in 1991, the Mineta Transportation Institute (MTI), an organized research and training unit in partnership with the Lucas College and Graduate School of Business at San José State University (SJSU), increases mobility for all by improving the safety, efficiency, accessibility, and convenience of our nation's transportation system. Through research, education, workforce development, and technology transfer, we help create a connected world. MTI leads the four-university. MTI leads the four-university California State University Transportation Consortium funded by the State of California through Senate Bill 1. MTI's transportation policy work is centered on three primary responsibilities: MINETA TRANSPORTATION INSTITUTE Research MTI works to provide policy-oriented research for all levels of government and the private sector to foster the development of optimum surface transportation systems. Research areas include: bicycle and pedestrian issues; financing public and private sector transportation improvements; intermodal connectivity and integration; safety and security of transportation systems; sustainability of transportation systems; transportation / land use / environment; and transportation planning and policy development. Certified Research Associates conduct the research. Certification requires an advanced degree, generally a Ph.D., a record of academic publications, and professional references. Research projects culminate in a peer-reviewed publication, available on TransWeb, the MTI website (http://transweb.sjsu.edu). Education The Institute supports education programs for students seeking a career in the development and operation of surface transportation systems. MTI, through San José State University, offers an AACSBaccredited Master of Science in Transportation Management and graduate certificates in Transportation Management, Transportation Security, and High-Speed Rail Management that serve to prepare the nation's transportation managers for the 21st century. With the active assistance of the California Department of Transportation (Caltrans), MTI delivers its classes over a state-of-the-art videoconference network throughout the state of California and via webcasting beyond, allowing working transportation professionals to pursue an advanced degree regardless of their location. To meet the needs of employers seeking a diverse workforce, MTI's education program promotes enrollment to under-represented groups. Information and Technology Transfer MTI utilizes a diverse array of dissemination methods and media to ensure research results reach those responsible for managing change. These methods include publication, seminars, workshops, websites, social media, webinars, and other technology transfer mechanisms. Additionally, MTI promotes the availability of completed research to professional organizations and journals and works to PEER REVIEW San José State University, of the California State University system, and the Mineta Transportation Institute (MTI) Board of Trustees have agreed upon a peer review process required for all research published by MTI. The purpose of the review process is to ensure that the results presented are based upon a professionally acceptable research protocol.
2008 IEEE International Conference on Communications, 2008
OFC/NFOEC 2008 - 2008 Conference on Optical Fiber Communication/National Fiber Optic Engineers Conference, 2008
Abstract We investigate the problem of provisioning deadline-driven requests with flexible transm... more Abstract We investigate the problem of provisioning deadline-driven requests with flexible transmission rates in WDM mesh networks. We analyze the network's performance and cost for different node architectures and for different traffic distributions.
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, 2009
Abstract Many networking applications require distribution of data from a central point to multip... more Abstract Many networking applications require distribution of data from a central point to multiple destinations; this distribution can be efficiently achieved by the means of multicasting. Traditionally, multicasting has been considered for on-demand applications ...
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference, 2008
Abstract Many large-scale scientific applications need to aggregate large amounts of data from mu... more Abstract Many large-scale scientific applications need to aggregate large amounts of data from multiple distributed sites to a centralized facility. We call such a request as a data-aggregation request (DAR). In this study, we investigate the novel problem of on-demand ...
Journal of Optical Communications and Networking, 2010
The distribution of large data sets from a centralized node to several destination sites is frequ... more The distribution of large data sets from a centralized node to several destination sites is frequently required by many data-intensive networking applications; this distribution can be efficiently achieved by the means of multicasting. Multicasting has been typically considered for on-demand applications and services, e.g., video-on-demand, IPTV, etc., which usually require start of data transmission immediately. We consider that multicast sessions can be provisioned starting with flexible times and that the multicast client can specify a maximum allowed time by which all data needs to be delivered to destinations. This is true for e-Science and high-performance applications, in which data distribution is not necessarily immediate. In this paper, we study the problem of provisioning dynamic multicast data-distribution requests (MDDRs) with flexible scheduling over optical WDM networks. We consider the practical case of fractional-capacity multicast sessions that require less than the entire wavelength capacity (nodes are equipped with multicast-capable opaque switches). We devise provisioning methods based on the multicast tree (or light-tree) distribution model. In our first approach (named Rand), we generate multiple randomized alternate trees on which we try to provision the multicast session and then assign wavelengths and schedule the session. In our second approach (named AllSlots), we dynamically generate light-trees depending on the network state. In our next approach (named Break), when provisioning an entire tree fails, we try to "break" the tree into timeindependent subtrees. We also study the impact of allowing data to be buffered at intermediary nodes and then transmitted toward destinations (method named Buffer) and consider an approach that partitions the data sets. Finally, we study the impact of the switch architecture on our provisioning by restricting our approaches to full-wavelength MDDRs.
Optical Fiber Communication Conference and National Fiber Optic Engineers Conference, 2009
Abstract Network design for sliding scheduled traffic is a highly-complex task that has been deal... more Abstract Network design for sliding scheduled traffic is a highly-complex task that has been dealt by multistep approaches. We propose a scalable method, based on Lagrangean relaxation, which can perform integrated scheduling, routing and wavelength assignment.
Optical Switching and Networking, 2008
IP-over-WDM networks are starting to replace legacy telecommunications infrastructure and they fo... more IP-over-WDM networks are starting to replace legacy telecommunications infrastructure and they form a promising solution for next-generation networks (NGNs). Survivability of an IP-over-WDM network is gaining increasing interest from both the Internet research community and service providers (SPs). We consider a novel static bandwidth-provisioning algorithm to support differentiated services in a survivable IP-over-WDM network. We propose and investigate the characteristics of both integer linear program (ILP) and heuristic approaches to solve this problem. In the heuristic method, we propose backup reprovisioning to ensure network resilience against single-node or multiple-link failures. Illustrative examples compare and evaluate the performance of the two methods in terms of capacity-usage efficiency and computation time.
Journal of Lightwave Technology, 2009
We consider efficient network provisioning algorithms for applications that aggregate large data ... more We consider efficient network provisioning algorithms for applications that aggregate large data files from multiple remote sites to a central facility (where the aggregated data is further processed). Many important bandwidth-hungry scientific applications use such data aggregation, and it is important to efficiently use network resources to meet their requirements. We term an entire large-scale data-aggregation session as a data-aggregation request (DAR). In this paper, we investigate the problem of on-demand provisioning of DARs over a wavelength-division multiplexing (WDM) backbone network infrastructure. Our DAR provisioning problem is challenging, as for each DAR we need to jointly identify lightpaths (route, assign wavelengths, and groom) for each of the to-be-transferred files, and schedule DAR's file transfers in time. We first model our DAR provisioning problem mathematically as a mixed integer linear program (MILP); to solve our problem in practice, we propose a DAR provisioning algorithm (named DARP). From our numerical results, we find DARP to be efficient when compared with other benchmark algorithms. We study DARP's performance for a varying number of aggregating sites deployed in the network (i.e., sites with supercomputer facilities) and perform a detailed sensitivity analysis on several parameters of our problem. We also investigate the effect of partitioning the data to be transferred into pieces and conclude that, if the partitioning method is carefully designed, slight improvement over the approach that transfers the whole file (DARP) is possible.
IEEE/ACM Transactions on Networking, 2010
With the increasing diversity of applications supported over optical networks, new service guaran... more With the increasing diversity of applications supported over optical networks, new service guarantees must be offered to network customers. Among the emerging data-intensive applications are those which require their data to be transferred before a predefined deadline. We call these deadline-driven requests (DDRs). In such applications, data-transfer finish time (which must be accomplished before the deadline) is the key service guarantee that the customer wants. In fact, the amount of bandwidth allocated to transfer a request is not a concern for the customer as long as its service deadline is met. Hence, the service provider can choose the bandwidth (transmission rate) to provision the request. In this case, even though DDRs impose a deadline constraint, they provide scheduling flexibility for the service provider since it can choose the transmission rate while achieving two objectives: 1) satisfying the guaranteed deadline; and 2) optimizing the network's resource utilization. We investigate the problem of provisioning DDRs with flexible transmission rates in wavelength-division multiplexing (WDM) mesh networks, although this approach is generalizable to other networks also. We investigate several (fixed and adaptive to network state) bandwidth-allocation policies and study the benefit of allowing dynamic bandwidth adjustment, which is found to generally improve network performance. We show that the performance of the bandwidth-allocation algorithms depends on the DDR traffic distribution and on the node architecture and its parameters. In addition, we develop a mathematical formulation for our problem as a mixed integer linear program (MILP), which allows choosing flexible transmission rates and provides a lower bound for our provisioning algorithms.
A lambda grid is characterized by nodes connected by high speed optical infrastructure in which l... more A lambda grid is characterized by nodes connected by high speed optical infrastructure in which lightpaths can be set dynamically between end nodes. In this paper, we investigate the problem of downloading very large files requested by end nodes from data repositories connected to the lambda grid. To optimize the download time we propose to exploit a cooperative data-transfer mechanism
Numerous large-scale applications need to aggregate at a central facility large quantities of dat... more Numerous large-scale applications need to aggregate at a central facility large quantities of data from distributed sites connected by a lambda grid (which is an optical backbone network with mesh connectivity); thus this is a many- to-one problem. In a lambda grid, dedicated wavelength channels are used to set up end-to-end lightpaths between end nodes. The objective of our problem
Journal of Optical Communications and Networking, 2009
Many future Internet applications supported over optical networks may require large amounts of gu... more Many future Internet applications supported over optical networks may require large amounts of guaranteed bandwidth between two remote end hosts, but this bandwidth may not necessarily be needed immediately. To ensure a deterministic service, Internet customers may prefer to reserve network resources, e.g., lightpaths, in advance and may indicate an approximate time window in the future during which the bandwidth should be reserved for a certain period of time; however, the exact start time of the reservation is not specified, but can slide in the predefined time window. This type of user traffic is called "sliding scheduled traffic." Optical network design for provisioning sliding scheduled traffic is a highly complex task that has been dealt with in the literature by two-step approaches, which first schedule user demands in time and then perform their routing and wavelength assignment (RWA). We propose a scalable integrated design for the sliding scheduling provisioning problem (SSPP), based on the Lagrangean relaxation (LR) approach, which can jointly perform the scheduling and RWA of the demands. We first develop a new mathematical model for SSPP, to which it is suitable to apply the relaxation of some of the model's constraints. We use an integrated heuristic called IPSR (integrated provisioning of sliding requests), which is next enhanced with a cost assignment based on Lagrangean multiplier information, to serve as the primal algorithm for our LR approach (named IPSR-LR). We compare our approaches with an existing two-step heuristic algorithm for SSPP and show that both IPSR and IPSR-LR are able to outperform it. In addition, our numerical results show that IPSR-LR improves over IPSR under all typical experimental cases that we considered. Furthermore, we compare our approaches with the solutions provided by an integer linear program for the SSPP, which is, however, less scalable for large problem sizes compared with our algorithms.
Contemporary Topics in Ground Modification, Problem Soils, and Geo-Support, 2009
Data from 96 resilient modulus laboratory tests on four base materials and four subgrade soils wa... more Data from 96 resilient modulus laboratory tests on four base materials and four subgrade soils was used to develop a predictive model capable of estimating changes in resilient modulus as a function of changes in the state of stress, moisture and density. Test specimens were compacted at optimum moisture/density conditions and then dried or soaked to various moisture conditions. Both standard and modified compactive efforts were used. Plastic, subgrade-type soils were especially affected by moisture. Non-plastic, base-type materials were more sensitive to changes in the state of stress.
Transportation Research Record: Journal of the Transportation Research Board, 2004
A new laboratory test protocol for the measurement of resilient modulus of unbound pavement mater... more A new laboratory test protocol for the measurement of resilient modulus of unbound pavement materials is described. This harmonized protocol combines the best features from four state-of-the-art resilient modulus test procedures in current use. The harmonized procedure most closely follows the recommended protocol proposed in NCHRP Project 1-28, Appendix E, with some exceptions. The main modifications deal with revised and more rational stress sequences and a more accurate stress-dependent resilient modulus predictive equation. Thirteen different predictive models and 25 sets of resilient modulus test data were evaluated as the basis for the recommended predictive equation.
Road Materials and Pavement Design, 2007
Environmental conditions have a significant effect on the performance of both flexible and rigid ... more Environmental conditions have a significant effect on the performance of both flexible and rigid pavements. External factors such as precipitation, temperature, freeze-thaw cycles, and depth to water table play a key role in defining the bounds of the impact the environment can have on the pavement performance. As part of the new US Mechanistic-Empirical Pavement Design Guide (MEPDG) being developed under the overall project sponsored by the National Cooperative Highway Research Program (NCHRP project 1-37A), a climatic modelling tool called the Enhanced Integrated Climatic Model (EICM) was implemented to incorporate the changes in temperature and moisture of unbound materials into the design process. Currently a new independent review project (NCHRP 1-40) is reviewing this model to correct errors and to develop further enhancements to produce a final methodology ready for approval/disapproval vote by AASHTO in 2006. This paper reflects the methodology used for the MEPDG and present the models incorporated by Arizona State University into the EICM, the input needed and the outputs generated by the program. A discussion on how EICM determines the temperature and moisture distribution within the pavement system is also presented.
... iv Page 5. Mohammad Al-Baijat, Marilet Andrade, Dr. Amitabha Banerjee, Cicek Cavdar, Joonho ... more ... iv Page 5. Mohammad Al-Baijat, Marilet Andrade, Dr. Amitabha Banerjee, Cicek Cavdar, Joonho Choi, Pulak Chowdhury, Frederick Clarke, Dr. Davide Cuda, Ananya Das, Dr. Chris Develder, Elli Georgieva, Shruthi Harve, Dr. Anpeng Huang, Sheng Huang, Dr. Yurong ...