A method for routing data packets within a communication network , said network comprising several nodes , each node capable of being connected at least temporarily to one or more other nodes of the network, said method being characterised in that it is adapted for a communication network using a constellation of satellites in non-geostationary orbit around the Earth, and in that it includes: - a determination , by an orchestration entity , of a plurality of temporary paths between at least one source node and at least one destination node for a plurality of determined successive time periods (P i ), each temporary path being guaranteed for one of the time periods (P i ) and determined as a function of a variable and predictable topology of the network so as to connect said source node and said destination node via one or more intermediate nodes during said time period (P i ), - a generation , by said orchestration entity , of at least one table (T) of label stacks (LS i ), each label stack (LSi) of the table (T) corresponding to one of the temporary paths defined for one of said determined successive time periods (P i ) between said source node and said destination node , each label (L j,i ) corresponding to one of said intermediate nodes of the temporary path , said table (T) of label stacks (LSi) being provided to said source node , - an encapsulation , by said source node , in each data packet transmitted during a time period (P i ), of the label stack (LSi) corresponding to said time period (P i ) in the table (T), - a transmission of the data packet to the intermediate node corresponding to the label present at the top of the label stack (LSi), - upon reception of each data packet by the intermediate node corresponding to the label present at the top of the label stack (LSi) encapsulated in the data packet: an extraction of said label from the label stack (LSi) and a transmission of the data packet to another node corresponding to the label newly placed at the top of the label stack, until the label stack is empty. - a determination , by an orchestration entity , of a plurality of temporary paths between at least one source node and at least one destination node for a plurality of determined successive time periods (P i ), each temporary path being guaranteed for one of the time periods (P i ) and determined as a function of a variable and predictable topology of the network so as to connect said source node and said destination node via one or more intermediate nodes during said time period (P i ), - a generation , by said orchestration entity , of at least one table (T) of label stacks (LS i ), each label stack (LSi) of the table (T) corresponding to one of the temporary paths defined for one of said determined successive time periods (P i ) between said source node and said destination node , each label (L j,i ) corresponding to one of said intermediate nodes of the temporary path , said table (T) of label stacks (LSi) being provided to said source node , - an encapsulation , by said source node , in each data packet transmitted during a time period (P i ), of the label stack (LSi) corresponding to said time period (P i ) in the table (T), - a transmission of the data packet to the intermediate node corresponding to the label present at the top of the label stack (LSi), - upon reception of each data packet by the intermediate node corresponding to the label present at the top of the label stack (LSi) encapsulated in the data packet: an extraction of said label from the label stack (LSi) and a transmission of the data packet to another node corresponding to the label newly placed at the top of the label stack, until the label stack is empty. <EOS>