2026-09-19T01:25:07Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/848672022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Lizhong Zheng. Kozynski Waserman, Fabián Ariel Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2014-02-10T16:56:23Z 2014-02-10T16:56:23Z 2013 http://hdl.handle.net/1721.1/84867 868328480 Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013. Cataloged from PDF version of thesis. Includes bibliographical references (pages 39-40). Given a switched network, e.g. a city grid with semaphores in its intersections or a packet network, each unit (car or packet) accumulates some delay while traversing the network. This delay is undesirable but unavoidable, which makes minimizing the total average delay of the network given certain constraints, a desirable objective. In this work, we consider the case of periodic networks, meaning that in every traffic cycle inputs to the system are the same and we try to arrive to an allocation of phases in every intersection that minimizes the total delay per cycle. We propose a model for such networks in which the delay is given as a function of external parameters (arrivals to the system) as well as internal parameters (switching decisions). Additionally, we present a distributed algorithm which makes use of messages passed between adjacent nodes to arrive at a solution with low delay, when compared with what is obtained when nodes take decisions independently. Furthermore, dealing with large networks proves difficult to arrive to theoretical results. This distributed algorithm gives an insight on how one can analyze big networks by taking a local approach and determining bounds in smaller networks that are part of the big picture. by Fabián Ariel Kozynski Waserman. S.M. 40 pages eng Massachusetts Institute of Technology M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Distributed optimization of traffic delay on a periodic switched grid network Thesis application/pdf Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="5d5010e3-3da8-4965-8551-c235f7771e8d"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Distributed optimization of traffic delay on a periodic switched grid network</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2013</PublicationDate> <Authors> <Author> <DisplayName>Kozynski Waserman, Fabián Ariel</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <Abstract>Given a switched network, e.g. a city grid with semaphores in its intersections or a packet network, each unit (car or packet) accumulates some delay while traversing the network. This delay is undesirable but unavoidable, which makes minimizing the total average delay of the network given certain constraints, a desirable objective. In this work, we consider the case of periodic networks, meaning that in every traffic cycle inputs to the system are the same and we try to arrive to an allocation of phases in every intersection that minimizes the total delay per cycle. We propose a model for such networks in which the delay is given as a function of external parameters (arrivals to the system) as well as internal parameters (switching decisions). Additionally, we present a distributed algorithm which makes use of messages passed between adjacent nodes to arrive at a solution with low delay, when compared with what is obtained when nodes take decisions independently. Furthermore, dealing with large networks proves difficult to arrive to theoretical results. This distributed algorithm gives an insight on how one can analyze big networks by taking a local approach and determining bounds in smaller networks that are part of the big picture.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>