Booming　applications　in　wireless　networks　have　imposed　a　great　growth　in　data　transmission　together　with　stricter　requirements　of　bandwidth　and　load　balancing.　In　order　to　capture　and　meet　the　requirements,　we　consider　a　new　problem　of　computing　maximum　disjoint　paths　with　different　colors　(MDPDC)　in　networks.　In　MDPDC,　transmission　frequencies　are　modeled　as　different　colors　and　the　aim　is　to　find　a　maximum　number　of　constrained　node-disjoint　paths　where　nodes　in　any　disjoint　path　share　the　same　color,　while　colors　are　different　among　paths.　Observing　the　-completeness　of　MDPDC,　the　paper　proposes　two　linear　programming　based　algorithms　as　generic　solutions.　©　2020,　Springer　Nature　Switzerland　AG.